Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716239788237

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-090
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 21:16:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 21:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 21:16:31] [INFO ] Load time of PNML (sax parser for PT used): 1122 ms
[2024-05-20 21:16:33] [INFO ] Transformed 17284 places.
[2024-05-20 21:16:33] [INFO ] Transformed 49140 transitions.
[2024-05-20 21:16:33] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 2662 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 17284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17283 transition count 49140
Applied a total of 1 rules in 8582 ms. Remains 17283 /17284 variables (removed 1) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:17:01] [INFO ] Computed 92 invariants in 18719 ms
[2024-05-20 21:17:05] [INFO ] Implicit Places using invariants in 22547 ms returned []
Implicit Place search using SMT only with invariants took 22577 ms to find 0 implicit places.
[2024-05-20 21:17:05] [INFO ] Invariant cache hit.
[2024-05-20 21:17:06] [INFO ] Dead Transitions using invariants and state equation in 1815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17283/17284 places, 49140/49140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32990 ms. Remains : 17283/17284 places, 49140/49140 transitions.
Support contains 47 out of 17283 places after structural reductions.
[2024-05-20 21:17:08] [INFO ] Flatten gal took : 1362 ms
[2024-05-20 21:17:09] [INFO ] Flatten gal took : 999 ms
[2024-05-20 21:17:11] [INFO ] Input system was already deterministic with 49140 transitions.
Support contains 46 out of 17283 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 857 ms. (steps per millisecond=11 ) properties (out of 34) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Running SMT prover for 29 properties.
[2024-05-20 21:17:13] [INFO ] Invariant cache hit.
[2024-05-20 21:17:21] [INFO ] [Real]Absence check using 90 positive place invariants in 197 ms returned sat
[2024-05-20 21:17:21] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 397 ms returned sat
[2024-05-20 21:17:38] [INFO ] After 10387ms SMT Verify possible using state equation in real domain returned unsat :0 sat :28
[2024-05-20 21:17:38] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:17:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:17:38] [INFO ] After 25266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 38 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 620 transitions
Trivial Post-agglo rules discarded 620 transitions
Performed 620 trivial Post agglomeration. Transition count delta: 620
Iterating post reduction 0 with 620 rules applied. Total rules applied 620 place count 17283 transition count 48520
Reduce places removed 620 places and 0 transitions.
Iterating post reduction 1 with 620 rules applied. Total rules applied 1240 place count 16663 transition count 48520
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1240 place count 16663 transition count 48519
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1242 place count 16662 transition count 48519
Performed 7992 Post agglomeration using F-continuation condition.Transition count delta: 7992
Deduced a syphon composed of 7992 places in 25 ms
Reduce places removed 7992 places and 0 transitions.
Iterating global reduction 2 with 15984 rules applied. Total rules applied 17226 place count 8670 transition count 40527
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17236 place count 8670 transition count 40517
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 17246 place count 8660 transition count 40517
Partial Free-agglomeration rule applied 8181 times.
Drop transitions removed 8181 transitions
Iterating global reduction 3 with 8181 rules applied. Total rules applied 25427 place count 8660 transition count 40517
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 3 with 90 rules applied. Total rules applied 25517 place count 8660 transition count 40517
Applied a total of 25517 rules in 29918 ms. Remains 8660 /17283 variables (removed 8623) and now considering 40517/49140 (removed 8623) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29922 ms. Remains : 8660/17283 places, 40517/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2024-05-20 21:18:09] [INFO ] Flow matrix only has 40506 transitions (discarded 11 similar events)
// Phase 1: matrix 40506 rows 8660 cols
[2024-05-20 21:18:13] [INFO ] Computed 92 invariants in 4468 ms
[2024-05-20 21:18:17] [INFO ] [Real]Absence check using 90 positive place invariants in 98 ms returned sat
[2024-05-20 21:18:17] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 143 ms returned sat
[2024-05-20 21:18:38] [INFO ] After 18865ms SMT Verify possible using state equation in real domain returned unsat :0 sat :23
[2024-05-20 21:18:39] [INFO ] State equation strengthened by 40174 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:18:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:18:39] [INFO ] After 25463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 8660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8660/8660 places, 40517/40517 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 8657 transition count 40514
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 8657 transition count 40514
Applied a total of 8 rules in 13003 ms. Remains 8657 /8660 variables (removed 3) and now considering 40514/40517 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13005 ms. Remains : 8657/8660 places, 40514/40517 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7976 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:19:21] [INFO ] Computed 92 invariants in 20613 ms
[2024-05-20 21:19:22] [INFO ] Implicit Places using invariants in 22188 ms returned []
Implicit Place search using SMT only with invariants took 22190 ms to find 0 implicit places.
[2024-05-20 21:19:22] [INFO ] Invariant cache hit.
[2024-05-20 21:19:24] [INFO ] Dead Transitions using invariants and state equation in 1598 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31771 ms. Remains : 17283/17283 places, 49140/49140 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 315 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s35 1) (GEQ s1048 1)), p0:(GEQ s13957 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-00 finished in 32281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p0))))))'
Support contains 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7920 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:19:32] [INFO ] Invariant cache hit.
[2024-05-20 21:19:34] [INFO ] Implicit Places using invariants in 1612 ms returned []
Implicit Place search using SMT only with invariants took 1614 ms to find 0 implicit places.
[2024-05-20 21:19:34] [INFO ] Invariant cache hit.
[2024-05-20 21:19:36] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11143 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s3039 1)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 2079 steps with 0 reset in 104 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-02 finished in 11472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 7105 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:19:43] [INFO ] Invariant cache hit.
[2024-05-20 21:19:44] [INFO ] Implicit Places using invariants in 1391 ms returned []
Implicit Place search using SMT only with invariants took 1397 ms to find 0 implicit places.
[2024-05-20 21:19:44] [INFO ] Invariant cache hit.
[2024-05-20 21:19:46] [INFO ] Dead Transitions using invariants and state equation in 1429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9942 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s4076 1), p0:(OR (GEQ s2102 1) (AND (GEQ s189 1) (GEQ s5917 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-03 finished in 10309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X((X(X(!p1)) U (F(p3)&&p2)))))'
Support contains 6 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6498 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:19:53] [INFO ] Invariant cache hit.
[2024-05-20 21:19:54] [INFO ] Implicit Places using invariants in 1598 ms returned []
Implicit Place search using SMT only with invariants took 1625 ms to find 0 implicit places.
[2024-05-20 21:19:54] [INFO ] Invariant cache hit.
[2024-05-20 21:19:56] [INFO ] Dead Transitions using invariants and state equation in 1584 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9713 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 547 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true, false, (AND (NOT p3) (NOT p1)), false, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p3)), acceptance={} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 11}], [{ cond=(NOT p1), acceptance={} source=11 dest: 7}, { cond=p1, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(GEQ s8112 1), p1:(AND (GEQ s791 1) (GEQ s1090 1)), p2:(AND (GEQ s455 1) (GEQ s14321 1)), p3:(GEQ s1607 1)], 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19934 reset in 6206 ms.
Product exploration explored 100000 steps with 20033 reset in 5837 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 119 ms. Reduced automaton from 12 states, 27 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 21:20:10] [INFO ] Invariant cache hit.
[2024-05-20 21:20:12] [INFO ] [Real]Absence check using 90 positive place invariants in 164 ms returned sat
[2024-05-20 21:20:13] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 380 ms returned sat
[2024-05-20 21:20:35] [INFO ] After 21305ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 21:20:35] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:20:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:20:35] [INFO ] After 25196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 17283 transition count 48511
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8010 Post agglomeration using F-continuation condition.Transition count delta: 8010
Deduced a syphon composed of 8010 places in 26 ms
Reduce places removed 8010 places and 0 transitions.
Iterating global reduction 2 with 16020 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17280 place count 8644 transition count 40499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17282 place count 8642 transition count 40499
Partial Free-agglomeration rule applied 8189 times.
Drop transitions removed 8189 transitions
Iterating global reduction 3 with 8189 rules applied. Total rules applied 25471 place count 8642 transition count 40499
Applied a total of 25471 rules in 20976 ms. Remains 8642 /17283 variables (removed 8641) and now considering 40499/49140 (removed 8641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20977 ms. Remains : 8642/17283 places, 40499/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 3) 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 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:20:57] [INFO ] Flow matrix only has 40497 transitions (discarded 2 similar events)
// Phase 1: matrix 40497 rows 8642 cols
[2024-05-20 21:21:01] [INFO ] Computed 92 invariants in 4376 ms
[2024-05-20 21:21:02] [INFO ] [Real]Absence check using 90 positive place invariants in 89 ms returned sat
[2024-05-20 21:21:02] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 152 ms returned sat
[2024-05-20 21:21:26] [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 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 40499/40499 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8642 transition count 40499
Applied a total of 1 rules in 6990 ms. Remains 8642 /8642 variables (removed 0) and now considering 40499/40499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6990 ms. Remains : 8642/8642 places, 40499/40499 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84683 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84683 steps, saw 77640 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:21:37] [INFO ] Flow matrix only has 40498 transitions (discarded 1 similar events)
// Phase 1: matrix 40498 rows 8642 cols
[2024-05-20 21:21:40] [INFO ] Computed 92 invariants in 3787 ms
[2024-05-20 21:21:41] [INFO ] [Real]Absence check using 90 positive place invariants in 82 ms returned sat
[2024-05-20 21:21:42] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 142 ms returned sat
[2024-05-20 21:22:05] [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 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 40499/40499 transitions.
Applied a total of 0 rules in 3570 ms. Remains 8642 /8642 variables (removed 0) and now considering 40499/40499 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3570 ms. Remains : 8642/8642 places, 40499/40499 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 40499/40499 transitions.
Applied a total of 0 rules in 3681 ms. Remains 8642 /8642 variables (removed 0) and now considering 40499/40499 (removed 0) transitions.
[2024-05-20 21:22:13] [INFO ] Flow matrix only has 40498 transitions (discarded 1 similar events)
[2024-05-20 21:22:13] [INFO ] Invariant cache hit.
[2024-05-20 21:22:13] [INFO ] Implicit Places using invariants in 837 ms returned []
Implicit Place search using SMT only with invariants took 841 ms to find 0 implicit places.
[2024-05-20 21:22:13] [INFO ] Flow matrix only has 40498 transitions (discarded 1 similar events)
[2024-05-20 21:22:13] [INFO ] Invariant cache hit.
[2024-05-20 21:22:14] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5335 ms. Remains : 8642/8642 places, 40499/40499 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), true, (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p1), (F p2), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 22 factoid took 203 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:22:30] [INFO ] Computed 92 invariants in 14948 ms
Could not prove EG (NOT p2)
[2024-05-20 21:22:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p3)
Support contains 5 out of 17283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6001 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:23:06] [INFO ] Invariant cache hit.
[2024-05-20 21:23:08] [INFO ] Implicit Places using invariants in 1490 ms returned []
Implicit Place search using SMT only with invariants took 1491 ms to find 0 implicit places.
[2024-05-20 21:23:08] [INFO ] Invariant cache hit.
[2024-05-20 21:23:09] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8825 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 96 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 21:23:10] [INFO ] Invariant cache hit.
[2024-05-20 21:23:12] [INFO ] [Real]Absence check using 90 positive place invariants in 155 ms returned sat
[2024-05-20 21:23:13] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 373 ms returned sat
[2024-05-20 21:23:35] [INFO ] After 21998ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:23:35] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:23:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:23:35] [INFO ] After 25159ms SMT Verify possible using all constraints in real 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 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 16 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17278 place count 8645 transition count 40500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17280 place count 8643 transition count 40500
Partial Free-agglomeration rule applied 8191 times.
Drop transitions removed 8191 transitions
Iterating global reduction 3 with 8191 rules applied. Total rules applied 25471 place count 8643 transition count 40500
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 3 with 90 rules applied. Total rules applied 25561 place count 8643 transition count 40500
Applied a total of 25561 rules in 22790 ms. Remains 8643 /17283 variables (removed 8640) and now considering 40500/49140 (removed 8640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22792 ms. Remains : 8643/17283 places, 40500/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-20 21:23:59] [INFO ] Flow matrix only has 40499 transitions (discarded 1 similar events)
// Phase 1: matrix 40499 rows 8643 cols
[2024-05-20 21:24:02] [INFO ] Computed 92 invariants in 3582 ms
[2024-05-20 21:24:03] [INFO ] [Real]Absence check using 90 positive place invariants in 75 ms returned sat
[2024-05-20 21:24:03] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 136 ms returned sat
[2024-05-20 21:24:26] [INFO ] After 22959ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-20 21:24:27] [INFO ] State equation strengthened by 40228 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:24:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:24:27] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 8643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8643/8643 places, 40500/40500 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8642 transition count 40499
Applied a total of 2 rules in 7033 ms. Remains 8642 /8643 variables (removed 1) and now considering 40499/40500 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7035 ms. Remains : 8642/8643 places, 40499/40500 transitions.
Finished random walk after 4766 steps, including 8 resets, run visited all 1 properties in 194 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3)))]
False Knowledge obtained : [(F p1), (F p2), (F p3), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:24:51] [INFO ] Computed 92 invariants in 15471 ms
Could not prove EG (NOT p2)
[2024-05-20 21:25:06] [INFO ] Invariant cache hit.
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Product exploration explored 100000 steps with 19966 reset in 5196 ms.
Product exploration explored 100000 steps with 19971 reset in 5113 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 17283 transition count 49140
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 447 place count 17283 transition count 49140
Deduced a syphon composed of 540 places in 13 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 540 place count 17283 transition count 49140
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 17103 transition count 48960
Deduced a syphon composed of 360 places in 12 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 17103 transition count 48960
Performed 8097 Post agglomeration using F-continuation condition.Transition count delta: -15840
Deduced a syphon composed of 8457 places in 16 ms
Iterating global reduction 1 with 8097 rules applied. Total rules applied 8997 place count 17103 transition count 64800
Discarding 354 places :
Symmetric choice reduction at 1 with 354 rule applications. Total rules 9351 place count 16749 transition count 64446
Deduced a syphon composed of 8103 places in 9 ms
Iterating global reduction 1 with 354 rules applied. Total rules applied 9705 place count 16749 transition count 64446
Deduced a syphon composed of 8103 places in 10 ms
Applied a total of 9705 rules in 37746 ms. Remains 16749 /17283 variables (removed 534) and now considering 64446/49140 (removed -15306) transitions.
[2024-05-20 21:26:10] [INFO ] Flow matrix only has 56614 transitions (discarded 7832 similar events)
// Phase 1: matrix 56614 rows 16749 cols
[2024-05-20 21:26:28] [INFO ] Computed 92 invariants in 18811 ms
[2024-05-20 21:26:30] [INFO ] Dead Transitions using invariants and state equation in 20258 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16749/17283 places, 64446/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58007 ms. Remains : 16749/17283 places, 64446/49140 transitions.
Built C files in :
/tmp/ltsmin10437464451751172389
[2024-05-20 21:26:30] [INFO ] Built C files in 402ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10437464451751172389
Running compilation step : cd /tmp/ltsmin10437464451751172389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10437464451751172389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10437464451751172389;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9900 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:26:59] [INFO ] Computed 92 invariants in 15407 ms
[2024-05-20 21:27:00] [INFO ] Implicit Places using invariants in 16908 ms returned []
Implicit Place search using SMT only with invariants took 16909 ms to find 0 implicit places.
[2024-05-20 21:27:00] [INFO ] Invariant cache hit.
[2024-05-20 21:27:02] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28259 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Built C files in :
/tmp/ltsmin5697021053029833838
[2024-05-20 21:27:02] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5697021053029833838
Running compilation step : cd /tmp/ltsmin5697021053029833838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5697021053029833838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5697021053029833838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 21:27:07] [INFO ] Flatten gal took : 921 ms
[2024-05-20 21:27:08] [INFO ] Flatten gal took : 917 ms
[2024-05-20 21:27:08] [INFO ] Time to serialize gal into /tmp/LTL12930812954012733146.gal : 182 ms
[2024-05-20 21:27:08] [INFO ] Time to serialize properties into /tmp/LTL7114974565581252118.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12930812954012733146.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3765561310619481771.hoa' '-atoms' '/tmp/LTL7114974565581252118.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7114974565581252118.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3765561310619481771.hoa
Detected timeout of ITS tools.
[2024-05-20 21:27:25] [INFO ] Flatten gal took : 850 ms
[2024-05-20 21:27:26] [INFO ] Flatten gal took : 913 ms
[2024-05-20 21:27:26] [INFO ] Time to serialize gal into /tmp/LTL7323126118176503073.gal : 144 ms
[2024-05-20 21:27:26] [INFO ] Time to serialize properties into /tmp/LTL7554626588249062779.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7323126118176503073.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7554626588249062779.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(Node38GiveAnswer43>=1)")&&(G("((Node56IsInserted>=1)&&(Node77Request>=1))")))U(X((X(X(!("((Node56IsInserted>=1)&&(Node77Request...257
Formula 0 simplified : (!"(Node38GiveAnswer43>=1)" | F!"((Node56IsInserted>=1)&&(Node77Request>=1))") R X(XX"((Node56IsInserted>=1)&&(Node77Request>=1))" R...241
Detected timeout of ITS tools.
[2024-05-20 21:27:42] [INFO ] Flatten gal took : 852 ms
[2024-05-20 21:27:42] [INFO ] Applying decomposition
[2024-05-20 21:27:42] [INFO ] Flatten gal took : 795 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11289237589955368952.txt' '-o' '/tmp/graph11289237589955368952.bin' '-w' '/tmp/graph11289237589955368952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11289237589955368952.bin' '-l' '-1' '-v' '-w' '/tmp/graph11289237589955368952.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:27:45] [INFO ] Decomposing Gal with order
[2024-05-20 21:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:27:51] [INFO ] Removed a total of 24347 redundant transitions.
[2024-05-20 21:27:52] [INFO ] Flatten gal took : 3980 ms
[2024-05-20 21:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 32684 labels/synchronizations in 5470 ms.
[2024-05-20 21:27:59] [INFO ] Time to serialize gal into /tmp/LTL8578348848617192654.gal : 248 ms
[2024-05-20 21:27:59] [INFO ] Time to serialize properties into /tmp/LTL4172290136109112524.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8578348848617192654.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4172290136109112524.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((("(i44.u175.Node38GiveAnswer43>=1)")&&(G("((i59.u224.Node56IsInserted>=1)&&(i78.u310.Node77Request>=1))")))U(X((X(X(!("((i59.u224....329
Formula 0 simplified : (!"(i44.u175.Node38GiveAnswer43>=1)" | F!"((i59.u224.Node56IsInserted>=1)&&(i78.u310.Node77Request>=1))") R X(XX"((i59.u224.Node56Is...313
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17777078219961301068
[2024-05-20 21:28:14] [INFO ] Built C files in 321ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17777078219961301068
Running compilation step : cd /tmp/ltsmin17777078219961301068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17777078219961301068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17777078219961301068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-04 finished in 510697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||G(p1))))&&F(p2)))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9532 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:28:26] [INFO ] Invariant cache hit.
[2024-05-20 21:28:28] [INFO ] Implicit Places using invariants in 1396 ms returned []
Implicit Place search using SMT only with invariants took 1398 ms to find 0 implicit places.
[2024-05-20 21:28:28] [INFO ] Invariant cache hit.
[2024-05-20 21:28:29] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12411 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s82 1) (GEQ s1253 1)) (GEQ s11402 1)), p0:(GEQ s11402 1), p1:(LT s14260 1)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2282 steps with 0 reset in 55 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-05 finished in 12736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(p2))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9308 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:28:39] [INFO ] Invariant cache hit.
[2024-05-20 21:28:41] [INFO ] Implicit Places using invariants in 1520 ms returned []
Implicit Place search using SMT only with invariants took 1522 ms to find 0 implicit places.
[2024-05-20 21:28:41] [INFO ] Invariant cache hit.
[2024-05-20 21:28:42] [INFO ] Dead Transitions using invariants and state equation in 1469 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12304 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s91 1) (GEQ s13913 1)), p1:(GEQ s8444 1), p0:(GEQ s14388 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-06 finished in 12546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 17283 transition count 48513
Reduce places removed 627 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 628 rules applied. Total rules applied 1255 place count 16656 transition count 48512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 8010 Post agglomeration using F-continuation condition.Transition count delta: 8010
Deduced a syphon composed of 8010 places in 18 ms
Reduce places removed 8010 places and 0 transitions.
Iterating global reduction 3 with 16020 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Applied a total of 17276 rules in 19381 ms. Remains 8645 /17283 variables (removed 8638) and now considering 40502/49140 (removed 8638) transitions.
[2024-05-20 21:29:02] [INFO ] Flow matrix only has 32670 transitions (discarded 7832 similar events)
// Phase 1: matrix 32670 rows 8645 cols
[2024-05-20 21:29:08] [INFO ] Computed 92 invariants in 6860 ms
[2024-05-20 21:29:09] [INFO ] Implicit Places using invariants in 7651 ms returned []
Implicit Place search using SMT only with invariants took 7652 ms to find 0 implicit places.
[2024-05-20 21:29:09] [INFO ] Flow matrix only has 32670 transitions (discarded 7832 similar events)
[2024-05-20 21:29:09] [INFO ] Invariant cache hit.
[2024-05-20 21:29:10] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/17283 places, 40502/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27852 ms. Remains : 8645/17283 places, 40502/49140 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s515 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 457 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-07 finished in 27969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 17283 transition count 48511
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8010 Post agglomeration using F-continuation condition.Transition count delta: 8010
Deduced a syphon composed of 8010 places in 20 ms
Reduce places removed 8010 places and 0 transitions.
Iterating global reduction 2 with 16020 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Applied a total of 17278 rules in 19002 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
[2024-05-20 21:29:29] [INFO ] Flow matrix only has 32669 transitions (discarded 7832 similar events)
// Phase 1: matrix 32669 rows 8644 cols
[2024-05-20 21:29:36] [INFO ] Computed 92 invariants in 6868 ms
[2024-05-20 21:29:37] [INFO ] Implicit Places using invariants in 7693 ms returned []
Implicit Place search using SMT only with invariants took 7697 ms to find 0 implicit places.
[2024-05-20 21:29:37] [INFO ] Flow matrix only has 32669 transitions (discarded 7832 similar events)
[2024-05-20 21:29:37] [INFO ] Invariant cache hit.
[2024-05-20 21:29:38] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/17283 places, 40501/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27582 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s359 1) (GEQ s1232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 462 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-08 finished in 27777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p2)&&p1)))))'
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9122 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:30:03] [INFO ] Computed 92 invariants in 15815 ms
[2024-05-20 21:30:04] [INFO ] Implicit Places using invariants in 17234 ms returned []
Implicit Place search using SMT only with invariants took 17235 ms to find 0 implicit places.
[2024-05-20 21:30:04] [INFO ] Invariant cache hit.
[2024-05-20 21:30:06] [INFO ] Dead Transitions using invariants and state equation in 1492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27854 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s655 1), p1:(AND (GEQ s1001 1) (GEQ s14933 1)), p2:(OR (LT s511 1) (LT s16999 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 45 reset in 2581 ms.
Stack based approach found an accepted trace after 32884 steps with 14 reset with depth 2256 and stack size 2256 in 861 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-09 finished in 31518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(F((p1||G(p0)))))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9399 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:30:19] [INFO ] Invariant cache hit.
[2024-05-20 21:30:20] [INFO ] Implicit Places using invariants in 1393 ms returned []
Implicit Place search using SMT only with invariants took 1393 ms to find 0 implicit places.
[2024-05-20 21:30:20] [INFO ] Invariant cache hit.
[2024-05-20 21:30:22] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12290 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s5788 1), p1:(GEQ s7676 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2385 steps with 0 reset in 73 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-10 finished in 12688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(p1) U X(X(p2)))))))'
Support contains 2 out of 17283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8007 Post agglomeration using F-continuation condition.Transition count delta: 8007
Deduced a syphon composed of 8007 places in 18 ms
Reduce places removed 8007 places and 0 transitions.
Iterating global reduction 2 with 16014 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Applied a total of 17274 rules in 19235 ms. Remains 8646 /17283 variables (removed 8637) and now considering 40503/49140 (removed 8637) transitions.
[2024-05-20 21:30:41] [INFO ] Flow matrix only has 32674 transitions (discarded 7829 similar events)
// Phase 1: matrix 32674 rows 8646 cols
[2024-05-20 21:30:48] [INFO ] Computed 92 invariants in 6909 ms
[2024-05-20 21:30:49] [INFO ] Implicit Places using invariants in 7721 ms returned []
Implicit Place search using SMT only with invariants took 7727 ms to find 0 implicit places.
[2024-05-20 21:30:49] [INFO ] Flow matrix only has 32674 transitions (discarded 7829 similar events)
[2024-05-20 21:30:49] [INFO ] Invariant cache hit.
[2024-05-20 21:30:50] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/17283 places, 40503/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27795 ms. Remains : 8646/17283 places, 40503/49140 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3723 1), p2:(GEQ s1020 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 504 steps with 0 reset in 17 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-11 finished in 28013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(p1)&&F(p2)))))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9246 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:31:17] [INFO ] Computed 92 invariants in 17127 ms
[2024-05-20 21:31:18] [INFO ] Implicit Places using invariants in 18627 ms returned []
Implicit Place search using SMT only with invariants took 18628 ms to find 0 implicit places.
[2024-05-20 21:31:18] [INFO ] Invariant cache hit.
[2024-05-20 21:31:20] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29389 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s4484 1), p1:(GEQ s12706 1), p2:(AND (GEQ s273 1) (GEQ s12871 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9852 ms.
Product exploration explored 100000 steps with 50000 reset in 9831 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 357 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-090-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-12 finished in 49789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||F((G(p2)&&p1)))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9327 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-20 21:31:49] [INFO ] Invariant cache hit.
[2024-05-20 21:31:51] [INFO ] Implicit Places using invariants in 1489 ms returned []
Implicit Place search using SMT only with invariants took 1490 ms to find 0 implicit places.
[2024-05-20 21:31:51] [INFO ] Invariant cache hit.
[2024-05-20 21:31:52] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12246 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p2), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s343 1) (GEQ s2733 1)), p2:(GEQ s11150 1), p0:(OR (LT s343 1) (LT s2733 1))], 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 5833 ms.
Product exploration explored 100000 steps with 25000 reset in 5830 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 127106 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127106 steps, saw 125093 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 21:32:09] [INFO ] Invariant cache hit.
[2024-05-20 21:32:11] [INFO ] [Real]Absence check using 90 positive place invariants in 156 ms returned sat
[2024-05-20 21:32:12] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 368 ms returned sat
[2024-05-20 21:32:34] [INFO ] After 25012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 21:32:36] [INFO ] [Nat]Absence check using 90 positive place invariants in 160 ms returned sat
[2024-05-20 21:32:37] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 370 ms returned sat
[2024-05-20 21:32:59] [INFO ] After 20802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-20 21:32:59] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:32:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:32:59] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 17283 transition count 48511
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 18 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17278 place count 8645 transition count 40500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17280 place count 8643 transition count 40500
Partial Free-agglomeration rule applied 8190 times.
Drop transitions removed 8190 transitions
Iterating global reduction 3 with 8190 rules applied. Total rules applied 25470 place count 8643 transition count 40500
Applied a total of 25470 rules in 31471 ms. Remains 8643 /17283 variables (removed 8640) and now considering 40500/49140 (removed 8640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31472 ms. Remains : 8643/17283 places, 40500/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 475 ms. (steps per millisecond=21 ) 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 36 ms. (steps per millisecond=277 ) 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 :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 21:33:31] [INFO ] Flow matrix only has 40499 transitions (discarded 1 similar events)
// Phase 1: matrix 40499 rows 8643 cols
[2024-05-20 21:33:35] [INFO ] Computed 92 invariants in 3732 ms
[2024-05-20 21:33:36] [INFO ] [Real]Absence check using 90 positive place invariants in 85 ms returned sat
[2024-05-20 21:33:36] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 143 ms returned sat
[2024-05-20 21:34:00] [INFO ] After 23230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-20 21:34:00] [INFO ] State equation strengthened by 40226 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:34:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:34:00] [INFO ] After 25427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 8643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8643/8643 places, 40500/40500 transitions.
Applied a total of 0 rules in 6228 ms. Remains 8643 /8643 variables (removed 0) and now considering 40500/40500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6228 ms. Remains : 8643/8643 places, 40500/40500 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9132 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:34:31] [INFO ] Computed 92 invariants in 15323 ms
[2024-05-20 21:34:33] [INFO ] Implicit Places using invariants in 16806 ms returned []
Implicit Place search using SMT only with invariants took 16808 ms to find 0 implicit places.
[2024-05-20 21:34:33] [INFO ] Invariant cache hit.
[2024-05-20 21:34:34] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27398 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 110459 steps, run timeout after 3002 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110459 steps, saw 108678 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-20 21:34:38] [INFO ] Invariant cache hit.
[2024-05-20 21:34:41] [INFO ] [Real]Absence check using 90 positive place invariants in 154 ms returned sat
[2024-05-20 21:34:42] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 372 ms returned sat
[2024-05-20 21:35:03] [INFO ] After 20756ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2024-05-20 21:35:03] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:35:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:35:03] [INFO ] After 25191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 17283 transition count 48511
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 16 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17276 place count 8645 transition count 40502
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17278 place count 8645 transition count 40500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17280 place count 8643 transition count 40500
Partial Free-agglomeration rule applied 8190 times.
Drop transitions removed 8190 transitions
Iterating global reduction 3 with 8190 rules applied. Total rules applied 25470 place count 8643 transition count 40500
Applied a total of 25470 rules in 34287 ms. Remains 8643 /17283 variables (removed 8640) and now considering 40500/49140 (removed 8640) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34287 ms. Remains : 8643/17283 places, 40500/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2024-05-20 21:35:38] [INFO ] Flow matrix only has 40499 transitions (discarded 1 similar events)
// Phase 1: matrix 40499 rows 8643 cols
[2024-05-20 21:35:42] [INFO ] Computed 92 invariants in 3741 ms
[2024-05-20 21:35:43] [INFO ] [Real]Absence check using 90 positive place invariants in 87 ms returned sat
[2024-05-20 21:35:44] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 151 ms returned sat
[2024-05-20 21:36:07] [INFO ] After 23103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-20 21:36:07] [INFO ] State equation strengthened by 40226 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:36:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:36:07] [INFO ] After 25351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 8643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8643/8643 places, 40500/40500 transitions.
Applied a total of 0 rules in 6228 ms. Remains 8643 /8643 variables (removed 0) and now considering 40500/40500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6229 ms. Remains : 8643/8643 places, 40500/40500 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 82874 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82874 steps, saw 77374 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-20 21:36:17] [INFO ] Flow matrix only has 40499 transitions (discarded 1 similar events)
[2024-05-20 21:36:17] [INFO ] Invariant cache hit.
[2024-05-20 21:36:18] [INFO ] [Real]Absence check using 90 positive place invariants in 80 ms returned sat
[2024-05-20 21:36:19] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 135 ms returned sat
[2024-05-20 21:36:42] [INFO ] After 23278ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-20 21:36:43] [INFO ] State equation strengthened by 40226 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:36:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:36:43] [INFO ] After 25357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 8643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8643/8643 places, 40500/40500 transitions.
Applied a total of 0 rules in 6341 ms. Remains 8643 /8643 variables (removed 0) and now considering 40500/40500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6341 ms. Remains : 8643/8643 places, 40500/40500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8643/8643 places, 40500/40500 transitions.
Applied a total of 0 rules in 6335 ms. Remains 8643 /8643 variables (removed 0) and now considering 40500/40500 (removed 0) transitions.
[2024-05-20 21:36:55] [INFO ] Flow matrix only has 40499 transitions (discarded 1 similar events)
[2024-05-20 21:36:55] [INFO ] Invariant cache hit.
[2024-05-20 21:36:56] [INFO ] Implicit Places using invariants in 780 ms returned []
Implicit Place search using SMT only with invariants took 781 ms to find 0 implicit places.
[2024-05-20 21:36:56] [INFO ] Flow matrix only has 40499 transitions (discarded 1 similar events)
[2024-05-20 21:36:56] [INFO ] Invariant cache hit.
[2024-05-20 21:36:57] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7924 ms. Remains : 8643/8643 places, 40500/40500 transitions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), true]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 5735 ms.
Product exploration explored 100000 steps with 25000 reset in 5832 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 17283 transition count 49140
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 91 Pre rules applied. Total rules applied 449 place count 17283 transition count 49140
Deduced a syphon composed of 540 places in 14 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 540 place count 17283 transition count 49140
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 17103 transition count 48960
Deduced a syphon composed of 360 places in 15 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 17103 transition count 48960
Performed 8098 Post agglomeration using F-continuation condition.Transition count delta: -15838
Deduced a syphon composed of 8458 places in 16 ms
Iterating global reduction 1 with 8098 rules applied. Total rules applied 8998 place count 17103 transition count 64798
Discarding 358 places :
Symmetric choice reduction at 1 with 358 rule applications. Total rules 9356 place count 16745 transition count 64440
Deduced a syphon composed of 8100 places in 10 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 9714 place count 16745 transition count 64440
Deduced a syphon composed of 8100 places in 10 ms
Applied a total of 9714 rules in 46363 ms. Remains 16745 /17283 variables (removed 538) and now considering 64440/49140 (removed -15300) transitions.
[2024-05-20 21:37:56] [INFO ] Flow matrix only has 56609 transitions (discarded 7831 similar events)
// Phase 1: matrix 56609 rows 16745 cols
[2024-05-20 21:38:12] [INFO ] Computed 92 invariants in 15869 ms
[2024-05-20 21:38:13] [INFO ] Dead Transitions using invariants and state equation in 17311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16745/17283 places, 64440/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63676 ms. Remains : 16745/17283 places, 64440/49140 transitions.
Built C files in :
/tmp/ltsmin1985115498971532220
[2024-05-20 21:38:14] [INFO ] Built C files in 289ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1985115498971532220
Running compilation step : cd /tmp/ltsmin1985115498971532220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1985115498971532220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1985115498971532220;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9167 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:38:42] [INFO ] Computed 92 invariants in 16035 ms
[2024-05-20 21:38:43] [INFO ] Implicit Places using invariants in 17463 ms returned []
Implicit Place search using SMT only with invariants took 17464 ms to find 0 implicit places.
[2024-05-20 21:38:43] [INFO ] Invariant cache hit.
[2024-05-20 21:38:45] [INFO ] Dead Transitions using invariants and state equation in 1414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28048 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Built C files in :
/tmp/ltsmin13446225999418518023
[2024-05-20 21:38:45] [INFO ] Built C files in 276ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13446225999418518023
Running compilation step : cd /tmp/ltsmin13446225999418518023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13446225999418518023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13446225999418518023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-20 21:38:50] [INFO ] Flatten gal took : 834 ms
[2024-05-20 21:38:50] [INFO ] Flatten gal took : 880 ms
[2024-05-20 21:38:51] [INFO ] Time to serialize gal into /tmp/LTL5408469600292159035.gal : 137 ms
[2024-05-20 21:38:51] [INFO ] Time to serialize properties into /tmp/LTL9941058040509693233.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5408469600292159035.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4337174258263247421.hoa' '-atoms' '/tmp/LTL9941058040509693233.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9941058040509693233.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4337174258263247421.hoa
Detected timeout of ITS tools.
[2024-05-20 21:39:07] [INFO ] Flatten gal took : 900 ms
[2024-05-20 21:39:08] [INFO ] Flatten gal took : 852 ms
[2024-05-20 21:39:08] [INFO ] Time to serialize gal into /tmp/LTL8092522508454759345.gal : 135 ms
[2024-05-20 21:39:08] [INFO ] Time to serialize properties into /tmp/LTL5906527888767915869.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8092522508454759345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5906527888767915869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X("((Node24IsInserted<1)||(Node8requestsent24<1))")))||(F(("((Node24IsInserted>=1)&&(Node8requestsent24>=1))")&&(G("(Node55Giv...176
Formula 0 simplified : X(XX!"((Node24IsInserted<1)||(Node8requestsent24<1))" & G(!"((Node24IsInserted>=1)&&(Node8requestsent24>=1))" | F!"(Node55GiveAnswer...164
Detected timeout of ITS tools.
[2024-05-20 21:39:24] [INFO ] Flatten gal took : 858 ms
[2024-05-20 21:39:24] [INFO ] Applying decomposition
[2024-05-20 21:39:25] [INFO ] Flatten gal took : 971 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13287069090735544812.txt' '-o' '/tmp/graph13287069090735544812.bin' '-w' '/tmp/graph13287069090735544812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13287069090735544812.bin' '-l' '-1' '-v' '-w' '/tmp/graph13287069090735544812.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:39:27] [INFO ] Decomposing Gal with order
[2024-05-20 21:39:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:39:33] [INFO ] Removed a total of 24341 redundant transitions.
[2024-05-20 21:39:34] [INFO ] Flatten gal took : 3392 ms
[2024-05-20 21:39:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 32684 labels/synchronizations in 5234 ms.
[2024-05-20 21:39:39] [INFO ] Time to serialize gal into /tmp/LTL16250881058109734408.gal : 180 ms
[2024-05-20 21:39:39] [INFO ] Time to serialize properties into /tmp/LTL7087313381411375186.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16250881058109734408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7087313381411375186.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(X("((i26.u94.Node24IsInserted<1)||(i10.u33.Node8requestsent24<1))")))||(F(("((i26.u94.Node24IsInserted>=1)&&(i10.u33.Node8requ...217
Formula 0 simplified : X(XX!"((i26.u94.Node24IsInserted<1)||(i10.u33.Node8requestsent24<1))" & G(!"((i26.u94.Node24IsInserted>=1)&&(i10.u33.Node8requestsen...205
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9003227866785760184
[2024-05-20 21:39:55] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9003227866785760184
Running compilation step : cd /tmp/ltsmin9003227866785760184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9003227866785760184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9003227866785760184;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-13 finished in 497760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8009 Post agglomeration using F-continuation condition.Transition count delta: 8009
Deduced a syphon composed of 8009 places in 18 ms
Reduce places removed 8009 places and 0 transitions.
Iterating global reduction 2 with 16018 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Applied a total of 17278 rules in 19241 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
[2024-05-20 21:40:17] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
// Phase 1: matrix 32670 rows 8644 cols
[2024-05-20 21:40:24] [INFO ] Computed 92 invariants in 6671 ms
[2024-05-20 21:40:24] [INFO ] Implicit Places using invariants in 7494 ms returned []
Implicit Place search using SMT only with invariants took 7497 ms to find 0 implicit places.
[2024-05-20 21:40:24] [INFO ] Flow matrix only has 32670 transitions (discarded 7831 similar events)
[2024-05-20 21:40:24] [INFO ] Invariant cache hit.
[2024-05-20 21:40:25] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/17283 places, 40501/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27528 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-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:(GEQ s2673 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 451 steps with 0 reset in 15 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-14 finished in 27641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G((p0||G(p1)))))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 9760 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-20 21:40:50] [INFO ] Computed 92 invariants in 14821 ms
[2024-05-20 21:40:51] [INFO ] Implicit Places using invariants in 16267 ms returned []
Implicit Place search using SMT only with invariants took 16271 ms to find 0 implicit places.
[2024-05-20 21:40:51] [INFO ] Invariant cache hit.
[2024-05-20 21:40:53] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27534 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LT s5546 1), p1:(OR (LT s208 1) (LT s931 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 44 reset in 2438 ms.
Product exploration explored 100000 steps with 46 reset in 2467 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 80 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 21:40:59] [INFO ] Invariant cache hit.
[2024-05-20 21:41:01] [INFO ] [Real]Absence check using 90 positive place invariants in 155 ms returned sat
[2024-05-20 21:41:02] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 368 ms returned sat
[2024-05-20 21:41:24] [INFO ] After 21873ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 21:41:24] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:41:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:41:24] [INFO ] After 25156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 16 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17276 place count 8646 transition count 40501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8192 times.
Drop transitions removed 8192 transitions
Iterating global reduction 3 with 8192 rules applied. Total rules applied 25470 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 3 with 90 rules applied. Total rules applied 25560 place count 8644 transition count 40501
Applied a total of 25560 rules in 37360 ms. Remains 8644 /17283 variables (removed 8639) and now considering 40501/49140 (removed 8639) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37361 ms. Remains : 8644/17283 places, 40501/49140 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 79197 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79197 steps, saw 76736 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 40501 rows 8644 cols
[2024-05-20 21:42:09] [INFO ] Computed 92 invariants in 3576 ms
[2024-05-20 21:42:10] [INFO ] [Real]Absence check using 90 positive place invariants in 80 ms returned sat
[2024-05-20 21:42:10] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 141 ms returned sat
[2024-05-20 21:42:34] [INFO ] After 23497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-20 21:42:34] [INFO ] State equation strengthened by 40228 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:42:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:42:34] [INFO ] After 25347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 6491 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6491 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 6400 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
[2024-05-20 21:42:47] [INFO ] Invariant cache hit.
[2024-05-20 21:42:48] [INFO ] Implicit Places using invariants in 773 ms returned []
Implicit Place search using SMT only with invariants took 779 ms to find 0 implicit places.
[2024-05-20 21:42:48] [INFO ] Invariant cache hit.
[2024-05-20 21:42:48] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7973 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 17283 transition count 48512
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 16655 transition count 48512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 16655 transition count 48511
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8008 Post agglomeration using F-continuation condition.Transition count delta: 8008
Deduced a syphon composed of 8008 places in 17 ms
Reduce places removed 8008 places and 0 transitions.
Iterating global reduction 2 with 16016 rules applied. Total rules applied 17274 place count 8646 transition count 40503
Applied a total of 17274 rules in 19771 ms. Remains 8646 /17283 variables (removed 8637) and now considering 40503/49140 (removed 8637) transitions.
[2024-05-20 21:43:09] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
// Phase 1: matrix 32672 rows 8646 cols
[2024-05-20 21:43:16] [INFO ] Computed 92 invariants in 7102 ms
[2024-05-20 21:43:17] [INFO ] Implicit Places using invariants in 7881 ms returned []
Implicit Place search using SMT only with invariants took 7883 ms to find 0 implicit places.
[2024-05-20 21:43:17] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
[2024-05-20 21:43:17] [INFO ] Invariant cache hit.
[2024-05-20 21:43:17] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/17283 places, 40503/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28416 ms. Remains : 8646/17283 places, 40503/49140 transitions.
Computed a total of 271 stabilizing places and 450 stable transitions
Computed a total of 271 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 21:43:18] [INFO ] Flow matrix only has 32672 transitions (discarded 7831 similar events)
[2024-05-20 21:43:18] [INFO ] Invariant cache hit.
[2024-05-20 21:43:19] [INFO ] [Real]Absence check using 90 positive place invariants in 78 ms returned sat
[2024-05-20 21:43:20] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 136 ms returned sat
[2024-05-20 21:43:40] [INFO ] After 20637ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-20 21:43:41] [INFO ] State equation strengthened by 24206 read => feed constraints.
[2024-05-20 21:43:43] [INFO ] After 2785ms SMT Verify possible using 24206 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:43:43] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 21:43:44] [INFO ] [Nat]Absence check using 90 positive place invariants in 80 ms returned sat
[2024-05-20 21:43:45] [INFO ] [Nat]Absence check using 90 positive and 2 generalized place invariants in 134 ms returned sat
[2024-05-20 21:44:07] [INFO ] After 22531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 21:44:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 21:44:08] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 8646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8646/8646 places, 40503/40503 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8646 transition count 40501
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 8192 times.
Drop transitions removed 8192 transitions
Iterating global reduction 1 with 8192 rules applied. Total rules applied 8196 place count 8644 transition count 40501
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 1 with 90 rules applied. Total rules applied 8286 place count 8644 transition count 40501
Applied a total of 8286 rules in 24471 ms. Remains 8644 /8646 variables (removed 2) and now considering 40501/40503 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24472 ms. Remains : 8644/8646 places, 40501/40503 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 40501 rows 8644 cols
[2024-05-20 21:44:37] [INFO ] Computed 92 invariants in 3568 ms
[2024-05-20 21:44:38] [INFO ] [Real]Absence check using 90 positive place invariants in 79 ms returned sat
[2024-05-20 21:44:38] [INFO ] [Real]Absence check using 90 positive and 2 generalized place invariants in 133 ms returned sat
[2024-05-20 21:45:02] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 8644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8644/8644 places, 40501/40501 transitions.
Applied a total of 0 rules in 6565 ms. Remains 8644 /8644 variables (removed 0) and now considering 40501/40501 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6565 ms. Remains : 8644/8644 places, 40501/40501 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 197 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Entered a terminal (fully accepting) state of product in 33432 steps with 72 reset in 1099 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-15 finished in 284755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X((X(X(!p1)) U (F(p3)&&p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||F((G(p2)&&p1)))))'
[2024-05-20 21:45:11] [INFO ] Flatten gal took : 846 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1468495331466431448
[2024-05-20 21:45:12] [INFO ] Too many transitions (49140) to apply POR reductions. Disabling POR matrices.
[2024-05-20 21:45:12] [INFO ] Built C files in 389ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1468495331466431448
Running compilation step : cd /tmp/ltsmin1468495331466431448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 21:45:12] [INFO ] Applying decomposition
[2024-05-20 21:45:13] [INFO ] Flatten gal took : 907 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3354880828121782896.txt' '-o' '/tmp/graph3354880828121782896.bin' '-w' '/tmp/graph3354880828121782896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3354880828121782896.bin' '-l' '-1' '-v' '-w' '/tmp/graph3354880828121782896.weights' '-q' '0' '-e' '0.001'
[2024-05-20 21:45:15] [INFO ] Decomposing Gal with order
[2024-05-20 21:45:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 21:45:21] [INFO ] Removed a total of 24347 redundant transitions.
[2024-05-20 21:45:22] [INFO ] Flatten gal took : 3553 ms
[2024-05-20 21:45:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 32145 labels/synchronizations in 5436 ms.
[2024-05-20 21:45:28] [INFO ] Time to serialize gal into /tmp/LTLFireability4680939275983022801.gal : 182 ms
[2024-05-20 21:45:28] [INFO ] Time to serialize properties into /tmp/LTLFireability3942939337569479247.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4680939275983022801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3942939337569479247.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((("(i44.u174.Node38GiveAnswer43>=1)")&&(G("((i57.u223.Node56IsInserted>=1)&&(i79.u309.Node77Request>=1))")))U(X((X(X(!("((i57.u223....329
Formula 0 simplified : (!"(i44.u174.Node38GiveAnswer43>=1)" | F!"((i57.u223.Node56IsInserted>=1)&&(i79.u309.Node77Request>=1))") R X(XX"((i57.u223.Node56Is...313
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/ltsmin1468495331466431448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1468495331466431448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 360 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-20 21:58:29] [INFO ] Flatten gal took : 1834 ms
[2024-05-20 21:58:29] [INFO ] Time to serialize gal into /tmp/LTLFireability2110537350201270260.gal : 208 ms
[2024-05-20 21:58:29] [INFO ] Time to serialize properties into /tmp/LTLFireability15599098037850021194.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2110537350201270260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15599098037850021194.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((("(Node38GiveAnswer43>=1)")&&(G("((Node56IsInserted>=1)&&(Node77Request>=1))")))U(X((X(X(!("((Node56IsInserted>=1)&&(Node77Request...257
Formula 0 simplified : (!"(Node38GiveAnswer43>=1)" | F!"((Node56IsInserted>=1)&&(Node77Request>=1))") R X(XX"((Node56IsInserted>=1)&&(Node77Request>=1))" R...241
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11730388 kB
After kill :
MemTotal: 16393216 kB
MemFree: 13958360 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is CANInsertWithFailure-PT-090, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521500103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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