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.r197-tall-171640625000138.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 FunctionPointer-PT-b002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b002-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716514272928

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=FunctionPointer-PT-b002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 01:31:14] [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-24 01:31:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:31:14] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-24 01:31:14] [INFO ] Transformed 306 places.
[2024-05-24 01:31:14] [INFO ] Transformed 840 transitions.
[2024-05-24 01:31:14] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 34 place count 188 transition count 538
Iterating global reduction 1 with 24 rules applied. Total rules applied 58 place count 188 transition count 538
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 188 transition count 484
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 178 transition count 464
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 178 transition count 464
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 148 place count 178 transition count 448
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 152 place count 174 transition count 440
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 174 transition count 440
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 170 transition count 424
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 170 transition count 424
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 167 transition count 418
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 167 transition count 418
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 166 transition count 414
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 166 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 165 transition count 410
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 165 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 164 transition count 408
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 164 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 163 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 163 transition count 406
Applied a total of 178 rules in 74 ms. Remains 163 /222 variables (removed 59) and now considering 406/648 (removed 242) transitions.
[2024-05-24 01:31:14] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
// Phase 1: matrix 278 rows 163 cols
[2024-05-24 01:31:14] [INFO ] Computed 2 invariants in 21 ms
[2024-05-24 01:31:15] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-24 01:31:15] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
[2024-05-24 01:31:15] [INFO ] Invariant cache hit.
[2024-05-24 01:31:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-24 01:31:15] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-24 01:31:15] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
[2024-05-24 01:31:15] [INFO ] Invariant cache hit.
[2024-05-24 01:31:15] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 935 ms. Remains : 163/222 places, 406/648 transitions.
Support contains 23 out of 163 places after structural reductions.
[2024-05-24 01:31:15] [INFO ] Flatten gal took : 51 ms
[2024-05-24 01:31:15] [INFO ] Flatten gal took : 24 ms
[2024-05-24 01:31:15] [INFO ] Input system was already deterministic with 406 transitions.
Support contains 22 out of 163 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 29 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 01:31:16] [INFO ] Flow matrix only has 278 transitions (discarded 128 similar events)
[2024-05-24 01:31:16] [INFO ] Invariant cache hit.
[2024-05-24 01:31:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 01:31:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:16] [INFO ] After 108ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2024-05-24 01:31:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-24 01:31:16] [INFO ] After 28ms SMT Verify possible using 60 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-24 01:31:16] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-24 01:31:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 01:31:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:16] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 01:31:17] [INFO ] After 53ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 01:31:17] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-24 01:31:17] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 98 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 97 transition count 234
Applied a total of 136 rules in 109 ms. Remains 97 /163 variables (removed 66) and now considering 234/406 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 97/163 places, 234/406 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 01:31:17] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-24 01:31:17] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 01:31:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 01:31:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:17] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 01:31:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 01:31:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 01:31:17] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 01:31:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:17] [INFO ] After 19ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 01:31:17] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 01:31:17] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 97/97 places, 234/234 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 586371 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 586371 steps, saw 385502 distinct states, run finished after 3004 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 01:31:20] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:20] [INFO ] Invariant cache hit.
[2024-05-24 01:31:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 01:31:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:20] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 01:31:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 01:31:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:21] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 01:31:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:21] [INFO ] After 18ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 01:31:21] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-24 01:31:21] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 234/234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-24 01:31:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:21] [INFO ] Invariant cache hit.
[2024-05-24 01:31:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-24 01:31:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:21] [INFO ] Invariant cache hit.
[2024-05-24 01:31:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-24 01:31:21] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 01:31:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:21] [INFO ] Invariant cache hit.
[2024-05-24 01:31:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 97/97 places, 234/234 transitions.
Graph (trivial) has 139 edges and 97 vertex of which 24 / 97 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 81 transition count 127
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 74 transition count 127
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 15 place count 74 transition count 115
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 39 place count 62 transition count 115
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 55 transition count 108
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 55 transition count 108
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 67 place count 55 transition count 94
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 97 place count 40 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 104 place count 33 transition count 65
Iterating global reduction 3 with 7 rules applied. Total rules applied 111 place count 33 transition count 65
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 116 place count 28 transition count 55
Iterating global reduction 3 with 5 rules applied. Total rules applied 121 place count 28 transition count 55
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 23 transition count 45
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 23 transition count 45
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 23 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 140 place count 21 transition count 43
Applied a total of 140 rules in 16 ms. Remains 21 /97 variables (removed 76) and now considering 43/234 (removed 191) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 43 rows 21 cols
[2024-05-24 01:31:21] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 01:31:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 01:31:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:21] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 01:31:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 01:31:21] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 01:31:21] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 01:31:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 01:31:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 01:31:21] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 01:31:21] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 01:31:21] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 01:31:21] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 24 stabilizing places and 64 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' '!(F(p0))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 98 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 97 transition count 234
Applied a total of 136 rules in 61 ms. Remains 97 /163 variables (removed 66) and now considering 234/406 (removed 172) transitions.
[2024-05-24 01:31:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-24 01:31:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 01:31:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 01:31:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:21] [INFO ] Invariant cache hit.
[2024-05-24 01:31:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:21] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-24 01:31:22] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 01:31:22] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:22] [INFO ] Invariant cache hit.
[2024-05-24 01:31:22] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 234/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 97/163 places, 234/406 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 231 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1) (GEQ s52 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 124 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-01 finished in 649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 142 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 137 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 107 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 106 transition count 254
Applied a total of 122 rules in 45 ms. Remains 106 /163 variables (removed 57) and now considering 254/406 (removed 152) transitions.
[2024-05-24 01:31:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-24 01:31:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 01:31:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 01:31:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-24 01:31:22] [INFO ] Invariant cache hit.
[2024-05-24 01:31:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 01:31:22] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-24 01:31:22] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 01:31:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-24 01:31:22] [INFO ] Invariant cache hit.
[2024-05-24 01:31:22] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/163 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 106/163 places, 254/406 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 387 steps with 0 reset in 6 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-02 finished in 453 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((X(p1)||p0))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 111 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 111 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 107 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 105 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 103 transition count 250
Applied a total of 122 rules in 18 ms. Remains 103 /163 variables (removed 60) and now considering 250/406 (removed 156) transitions.
[2024-05-24 01:31:22] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2024-05-24 01:31:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 01:31:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-24 01:31:22] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2024-05-24 01:31:22] [INFO ] Invariant cache hit.
[2024-05-24 01:31:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 01:31:23] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-24 01:31:23] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2024-05-24 01:31:23] [INFO ] Invariant cache hit.
[2024-05-24 01:31:23] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/163 places, 250/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 103/163 places, 250/406 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s35 1)), p1:(AND (GEQ s0 1) (GEQ s81 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]]
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (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 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b002-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b002-LTLFireability-03 finished in 941 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 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 148 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 148 transition count 368
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 142 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 137 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 112 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 106 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 105 transition count 256
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 105 transition count 252
Applied a total of 122 rules in 38 ms. Remains 105 /163 variables (removed 58) and now considering 252/406 (removed 154) transitions.
[2024-05-24 01:31:23] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2024-05-24 01:31:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 01:31:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 01:31:23] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-24 01:31:23] [INFO ] Invariant cache hit.
[2024-05-24 01:31:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 01:31:23] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-24 01:31:23] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-24 01:31:23] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-24 01:31:23] [INFO ] Invariant cache hit.
[2024-05-24 01:31:24] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/163 places, 252/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 105/163 places, 252/406 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 545 reset in 252 ms.
Stack based approach found an accepted trace after 41055 steps with 252 reset with depth 46 and stack size 45 in 129 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-05 finished in 771 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 382
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 380
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 146 transition count 362
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 146 transition count 362
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 139 transition count 338
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 133 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 121 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 121 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 115 transition count 272
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 109 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 101 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 98 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 97 transition count 234
Applied a total of 136 rules in 37 ms. Remains 97 /163 variables (removed 66) and now considering 234/406 (removed 172) transitions.
[2024-05-24 01:31:24] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-24 01:31:24] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 01:31:24] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-24 01:31:24] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:24] [INFO ] Invariant cache hit.
[2024-05-24 01:31:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:24] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-24 01:31:24] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 01:31:24] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-24 01:31:24] [INFO ] Invariant cache hit.
[2024-05-24 01:31:24] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 234/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 97/163 places, 234/406 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s27 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 159 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-07 finished in 361 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)||X((G(p2)&&p1)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 386
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 148 transition count 366
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 39 place count 143 transition count 350
Iterating global reduction 1 with 5 rules applied. Total rules applied 44 place count 143 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 139 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 139 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 135 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 135 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 131 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 131 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 127 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 123 transition count 298
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 123 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 120 transition count 292
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 120 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 118 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 116 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 115 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 115 transition count 282
Applied a total of 100 rules in 23 ms. Remains 115 /163 variables (removed 48) and now considering 282/406 (removed 124) transitions.
[2024-05-24 01:31:24] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
// Phase 1: matrix 191 rows 115 cols
[2024-05-24 01:31:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 01:31:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 01:31:24] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2024-05-24 01:31:24] [INFO ] Invariant cache hit.
[2024-05-24 01:31:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-24 01:31:25] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-24 01:31:25] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2024-05-24 01:31:25] [INFO ] Invariant cache hit.
[2024-05-24 01:31:25] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/163 places, 282/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 115/163 places, 282/406 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (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))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s26 1)), p1:(AND (GEQ s1 1) (GEQ s94 1)), p2:(AND (GEQ s1 1) (GEQ s103 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, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-08 finished in 590 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(X(G((p0&&X((X(p2)||p1)))))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 137 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 132 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 132 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 122 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 117 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 117 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 113 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 108 transition count 264
Applied a total of 112 rules in 36 ms. Remains 108 /163 variables (removed 55) and now considering 264/406 (removed 142) transitions.
[2024-05-24 01:31:25] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
// Phase 1: matrix 179 rows 108 cols
[2024-05-24 01:31:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 01:31:25] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 01:31:25] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-24 01:31:25] [INFO ] Invariant cache hit.
[2024-05-24 01:31:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-24 01:31:25] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-24 01:31:25] [INFO ] Flow matrix only has 179 transitions (discarded 85 similar events)
[2024-05-24 01:31:25] [INFO ] Invariant cache hit.
[2024-05-24 01:31:25] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/163 places, 264/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 108/163 places, 264/406 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(OR (LT s4 1) (LT s98 1)), p2:(OR (LT s1 1) (LT s81 1)), p1:(OR (LT s4 1) (LT s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 847 steps with 4 reset in 10 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-11 finished in 817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 388
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 150 transition count 370
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 145 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 145 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 140 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 140 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 135 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 135 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 130 transition count 308
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 130 transition count 308
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 125 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 125 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 113 transition count 272
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 110 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 109 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 109 transition count 260
Applied a total of 116 rules in 38 ms. Remains 109 /163 variables (removed 54) and now considering 260/406 (removed 146) transitions.
[2024-05-24 01:31:26] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2024-05-24 01:31:26] [INFO ] Computed 2 invariants in 3 ms
[2024-05-24 01:31:26] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-24 01:31:26] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-24 01:31:26] [INFO ] Invariant cache hit.
[2024-05-24 01:31:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 01:31:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-24 01:31:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 01:31:26] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-24 01:31:26] [INFO ] Invariant cache hit.
[2024-05-24 01:31:26] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/163 places, 260/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 109/163 places, 260/406 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s76 1)) (OR (LT s1 1) (LT s90 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 620 reset in 174 ms.
Product exploration explored 100000 steps with 634 reset in 167 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0)]
Finished random walk after 809 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-24 01:31:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-24 01:31:27] [INFO ] Invariant cache hit.
[2024-05-24 01:31:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 01:31:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-24 01:31:27] [INFO ] Invariant cache hit.
[2024-05-24 01:31:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-24 01:31:27] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-24 01:31:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 01:31:27] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-24 01:31:27] [INFO ] Invariant cache hit.
[2024-05-24 01:31:27] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 109/109 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4102 steps, including 14 resets, run visited all 1 properties in 14 ms. (steps per millisecond=293 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 629 reset in 162 ms.
Stack based approach found an accepted trace after 43633 steps with 259 reset with depth 71 and stack size 68 in 79 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-13 finished in 2425 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 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 147 transition count 366
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 147 transition count 366
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 140 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 140 transition count 342
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 134 transition count 324
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 128 transition count 308
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 128 transition count 308
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 122 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 122 transition count 290
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 116 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 110 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 110 transition count 264
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 105 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 102 transition count 248
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 102 transition count 248
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 125 place count 99 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 128 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 98 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 98 transition count 240
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 33 ms. Remains 98 /163 variables (removed 65) and now considering 238/406 (removed 168) transitions.
[2024-05-24 01:31:28] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-24 01:31:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 01:31:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 01:31:28] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:28] [INFO ] Invariant cache hit.
[2024-05-24 01:31:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:29] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-24 01:31:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 01:31:29] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:29] [INFO ] Invariant cache hit.
[2024-05-24 01:31:29] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/163 places, 238/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 98/163 places, 238/406 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b002-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:(OR (LT s0 1) (LT s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 565 reset in 155 ms.
Product exploration explored 100000 steps with 534 reset in 151 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 188 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 238/238 transitions.
Applied a total of 0 rules in 6 ms. Remains 98 /98 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-24 01:31:29] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:29] [INFO ] Invariant cache hit.
[2024-05-24 01:31:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-24 01:31:29] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:29] [INFO ] Invariant cache hit.
[2024-05-24 01:31:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:29] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-24 01:31:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 01:31:30] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:30] [INFO ] Invariant cache hit.
[2024-05-24 01:31:30] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 98/98 places, 238/238 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 364 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=182 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 544 reset in 145 ms.
Product exploration explored 100000 steps with 532 reset in 162 ms.
Built C files in :
/tmp/ltsmin5479731257089404778
[2024-05-24 01:31:30] [INFO ] Computing symmetric may disable matrix : 238 transitions.
[2024-05-24 01:31:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:31:30] [INFO ] Computing symmetric may enable matrix : 238 transitions.
[2024-05-24 01:31:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:31:30] [INFO ] Computing Do-Not-Accords matrix : 238 transitions.
[2024-05-24 01:31:30] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:31:30] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5479731257089404778
Running compilation step : cd /tmp/ltsmin5479731257089404778;'/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'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin5479731257089404778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5479731257089404778;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13778481722324734398.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 238/238 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-24 01:31:45] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:45] [INFO ] Invariant cache hit.
[2024-05-24 01:31:46] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-24 01:31:46] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:46] [INFO ] Invariant cache hit.
[2024-05-24 01:31:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-24 01:31:46] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-24 01:31:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 01:31:46] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-24 01:31:46] [INFO ] Invariant cache hit.
[2024-05-24 01:31:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 98/98 places, 238/238 transitions.
Built C files in :
/tmp/ltsmin10224837866534778461
[2024-05-24 01:31:46] [INFO ] Computing symmetric may disable matrix : 238 transitions.
[2024-05-24 01:31:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:31:46] [INFO ] Computing symmetric may enable matrix : 238 transitions.
[2024-05-24 01:31:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:31:46] [INFO ] Computing Do-Not-Accords matrix : 238 transitions.
[2024-05-24 01:31:46] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:31:46] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10224837866534778461
Running compilation step : cd /tmp/ltsmin10224837866534778461;'/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'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin10224837866534778461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10224837866534778461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9927316089356332725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 01:32:01] [INFO ] Flatten gal took : 12 ms
[2024-05-24 01:32:01] [INFO ] Flatten gal took : 12 ms
[2024-05-24 01:32:01] [INFO ] Time to serialize gal into /tmp/LTL5218601171593813755.gal : 3 ms
[2024-05-24 01:32:01] [INFO ] Time to serialize properties into /tmp/LTL2732917159647294724.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/LTL5218601171593813755.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10312154073778599056.hoa' '-atoms' '/tmp/LTL2732917159647294724.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/LTL2732917159647294724.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10312154073778599056.hoa
Detected timeout of ITS tools.
[2024-05-24 01:32:16] [INFO ] Flatten gal took : 11 ms
[2024-05-24 01:32:16] [INFO ] Flatten gal took : 10 ms
[2024-05-24 01:32:16] [INFO ] Time to serialize gal into /tmp/LTL4140715686920282439.gal : 3 ms
[2024-05-24 01:32:16] [INFO ] Time to serialize properties into /tmp/LTL611711657784463970.ltl : 6 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/LTL4140715686920282439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL611711657784463970.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...274
Read 1 LTL properties
Checking formula 0 : !((F(G("((s0<1)||(l188<1))"))))
Formula 0 simplified : GF!"((s0<1)||(l188<1))"
Detected timeout of ITS tools.
[2024-05-24 01:32:31] [INFO ] Flatten gal took : 13 ms
[2024-05-24 01:32:31] [INFO ] Applying decomposition
[2024-05-24 01:32:31] [INFO ] Flatten gal took : 10 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/graph8211222399715994755.txt' '-o' '/tmp/graph8211222399715994755.bin' '-w' '/tmp/graph8211222399715994755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8211222399715994755.bin' '-l' '-1' '-v' '-w' '/tmp/graph8211222399715994755.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:32:31] [INFO ] Decomposing Gal with order
[2024-05-24 01:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:32:31] [INFO ] Removed a total of 394 redundant transitions.
[2024-05-24 01:32:31] [INFO ] Flatten gal took : 70 ms
[2024-05-24 01:32:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 12 ms.
[2024-05-24 01:32:31] [INFO ] Time to serialize gal into /tmp/LTL16729834416938352726.gal : 4 ms
[2024-05-24 01:32:31] [INFO ] Time to serialize properties into /tmp/LTL18442650457436825901.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/LTL16729834416938352726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18442650457436825901.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i9.u1.s0<1)||(i10.i1.u22.l188<1))"))))
Formula 0 simplified : GF!"((i9.u1.s0<1)||(i10.i1.u22.l188<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16804171762416046738
[2024-05-24 01:32:46] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16804171762416046738
Running compilation step : cd /tmp/ltsmin16804171762416046738;'/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'
Compilation finished in 342 ms.
Running link step : cd /tmp/ltsmin16804171762416046738;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16804171762416046738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b002-LTLFireability-14 finished in 93347 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(G(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 406/406 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 138 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 134 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 130 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 130 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 126 transition count 302
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 122 transition count 294
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 122 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 119 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 117 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 115 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 114 transition count 278
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 114 transition count 272
Applied a total of 106 rules in 32 ms. Remains 114 /163 variables (removed 49) and now considering 272/406 (removed 134) transitions.
[2024-05-24 01:33:02] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
// Phase 1: matrix 187 rows 114 cols
[2024-05-24 01:33:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 01:33:02] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-24 01:33:02] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2024-05-24 01:33:02] [INFO ] Invariant cache hit.
[2024-05-24 01:33:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 01:33:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-24 01:33:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 01:33:02] [INFO ] Flow matrix only has 187 transitions (discarded 85 similar events)
[2024-05-24 01:33:02] [INFO ] Invariant cache hit.
[2024-05-24 01:33:02] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/163 places, 272/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 394 ms. Remains : 114/163 places, 272/406 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s104 1)), p1:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b002-LTLFireability-15 finished in 531 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)))'
[2024-05-24 01:33:02] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7456439312026393989
[2024-05-24 01:33:02] [INFO ] Computing symmetric may disable matrix : 406 transitions.
[2024-05-24 01:33:02] [INFO ] Applying decomposition
[2024-05-24 01:33:02] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:33:02] [INFO ] Computing symmetric may enable matrix : 406 transitions.
[2024-05-24 01:33:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:33:02] [INFO ] Flatten gal took : 16 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/graph11649971249675681192.txt' '-o' '/tmp/graph11649971249675681192.bin' '-w' '/tmp/graph11649971249675681192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11649971249675681192.bin' '-l' '-1' '-v' '-w' '/tmp/graph11649971249675681192.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:33:02] [INFO ] Decomposing Gal with order
[2024-05-24 01:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:33:02] [INFO ] Computing Do-Not-Accords matrix : 406 transitions.
[2024-05-24 01:33:02] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:33:02] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7456439312026393989
Running compilation step : cd /tmp/ltsmin7456439312026393989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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-24 01:33:02] [INFO ] Removed a total of 697 redundant transitions.
[2024-05-24 01:33:02] [INFO ] Flatten gal took : 30 ms
[2024-05-24 01:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 12 ms.
[2024-05-24 01:33:02] [INFO ] Time to serialize gal into /tmp/LTLFireability1856868576815122859.gal : 4 ms
[2024-05-24 01:33:02] [INFO ] Time to serialize properties into /tmp/LTLFireability3384407187120549140.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/LTLFireability1856868576815122859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3384407187120549140.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 1 LTL properties
Checking formula 0 : !((F(G("((i11.i1.u0.s0<1)||(i12.u40.l188<1))"))))
Formula 0 simplified : GF!"((i11.i1.u0.s0<1)||(i12.u40.l188<1))"
Compilation finished in 860 ms.
Running link step : cd /tmp/ltsmin7456439312026393989;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7456439312026393989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Initializing POR dependencies: labels 407, guards 406
pins2lts-mc-linux64( 7/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.038: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.748: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.748: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.748: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.919: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.933: There are 408 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.933: State length is 164, there are 410 groups
pins2lts-mc-linux64( 0/ 8), 0.933: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.933: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.933: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.933: Visible groups: 0 / 410, labels: 1 / 408
pins2lts-mc-linux64( 0/ 8), 0.933: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.933: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.968: [Blue] ~120 levels ~960 states ~2792 transitions
pins2lts-mc-linux64( 2/ 8), 1.012: [Blue] ~240 levels ~1920 states ~5672 transitions
pins2lts-mc-linux64( 2/ 8), 1.091: [Blue] ~480 levels ~3840 states ~11432 transitions
pins2lts-mc-linux64( 6/ 8), 1.265: [Blue] ~960 levels ~7680 states ~34048 transitions
pins2lts-mc-linux64( 2/ 8), 1.570: [Blue] ~1920 levels ~15360 states ~45992 transitions
pins2lts-mc-linux64( 2/ 8), 2.032: [Blue] ~3840 levels ~30720 states ~92072 transitions
pins2lts-mc-linux64( 2/ 8), 2.889: [Blue] ~7680 levels ~61440 states ~184232 transitions
pins2lts-mc-linux64( 2/ 8), 4.265: [Blue] ~15360 levels ~122880 states ~368552 transitions
pins2lts-mc-linux64( 2/ 8), 6.403: [Blue] ~30720 levels ~245760 states ~737192 transitions
pins2lts-mc-linux64( 2/ 8), 10.284: [Blue] ~61440 levels ~491520 states ~1474472 transitions
pins2lts-mc-linux64( 2/ 8), 17.334: [Blue] ~122880 levels ~983040 states ~2949032 transitions
pins2lts-mc-linux64( 2/ 8), 31.669: [Blue] ~245760 levels ~1966080 states ~5898152 transitions
pins2lts-mc-linux64( 2/ 8), 60.767: [Blue] ~491520 levels ~3932160 states ~11796392 transitions
pins2lts-mc-linux64( 2/ 8), 118.406: [Blue] ~983040 levels ~7864320 states ~23592872 transitions
pins2lts-mc-linux64( 3/ 8), 203.838: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 203.936:
pins2lts-mc-linux64( 0/ 8), 203.936: Explored 8130431 states 34265175 transitions, fanout: 4.214
pins2lts-mc-linux64( 0/ 8), 203.936: Total exploration time 202.990 sec (202.900 sec minimum, 202.934 sec on average)
pins2lts-mc-linux64( 0/ 8), 203.936: States per second: 40053, Transitions per second: 168802
pins2lts-mc-linux64( 0/ 8), 203.936:
pins2lts-mc-linux64( 0/ 8), 203.936: State space has 31408794 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 203.936: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 203.936: blue states: 8130431 (25.89%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 203.936: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 203.936: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 203.936:
pins2lts-mc-linux64( 0/ 8), 203.936: Total memory used for local state coloring: 124.1MB
pins2lts-mc-linux64( 0/ 8), 203.936:
pins2lts-mc-linux64( 0/ 8), 203.936: Queue width: 8B, total height: 8130431, memory: 62.03MB
pins2lts-mc-linux64( 0/ 8), 203.936: Tree memory: 495.6MB, 16.5 B/state, compr.: 2.5%
pins2lts-mc-linux64( 0/ 8), 203.936: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 203.936: Stored 408 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 203.936: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 203.936: Est. total memory use: 557.7MB (~1086.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7456439312026393989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7456439312026393989;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 01:53:39] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:53:39] [INFO ] Time to serialize gal into /tmp/LTLFireability7624864053017023134.gal : 2 ms
[2024-05-24 01:53:39] [INFO ] Time to serialize properties into /tmp/LTLFireability7488740731169644023.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7624864053017023134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7488740731169644023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("((s0<1)||(l188<1))"))))
Formula 0 simplified : GF!"((s0<1)||(l188<1))"
Detected timeout of ITS tools.
[2024-05-24 02:14:16] [INFO ] Flatten gal took : 484 ms
[2024-05-24 02:14:17] [INFO ] Input system was already deterministic with 406 transitions.
[2024-05-24 02:14:18] [INFO ] Transformed 163 places.
[2024-05-24 02:14:18] [INFO ] Transformed 406 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 02:14:18] [INFO ] Time to serialize gal into /tmp/LTLFireability11276589503051880667.gal : 3 ms
[2024-05-24 02:14:18] [INFO ] Time to serialize properties into /tmp/LTLFireability5785849889239841731.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11276589503051880667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5785849889239841731.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((s0<1)||(l188<1))"))))
Formula 0 simplified : GF!"((s0<1)||(l188<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4206456 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15826592 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="FunctionPointer-PT-b002"
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 FunctionPointer-PT-b002, 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 r197-tall-171640625000138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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