Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025300516.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300516
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 03:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 03:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 03:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 907K May 10 09:34 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 ShieldPPPs-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653009979299

Running Version 202205111006
[2022-05-20 01:26:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 01:26:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 01:26:20] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-05-20 01:26:20] [INFO ] Transformed 3103 places.
[2022-05-20 01:26:20] [INFO ] Transformed 2603 transitions.
[2022-05-20 01:26:20] [INFO ] Found NUPN structural information;
[2022-05-20 01:26:20] [INFO ] Parsed PT model containing 3103 places and 2603 transitions in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-100A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 363 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:21] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:26:23] [INFO ] Implicit Places using invariants in 1771 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:23] [INFO ] Computed 1101 place invariants in 23 ms
[2022-05-20 01:26:24] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 3315 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:24] [INFO ] Computed 1101 place invariants in 16 ms
[2022-05-20 01:26:26] [INFO ] Dead Transitions using invariants and state equation in 1574 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Support contains 52 out of 3103 places after structural reductions.
[2022-05-20 01:26:26] [INFO ] Flatten gal took : 342 ms
[2022-05-20 01:26:27] [INFO ] Flatten gal took : 199 ms
[2022-05-20 01:26:27] [INFO ] Input system was already deterministic with 2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 31) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:26:28] [INFO ] Computed 1101 place invariants in 20 ms
[2022-05-20 01:26:29] [INFO ] [Real]Absence check using 1101 positive place invariants in 196 ms returned sat
[2022-05-20 01:26:32] [INFO ] After 4042ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:15
[2022-05-20 01:26:33] [INFO ] [Nat]Absence check using 1101 positive place invariants in 211 ms returned sat
[2022-05-20 01:26:57] [INFO ] After 23016ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2022-05-20 01:26:57] [INFO ] After 23024ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-20 01:26:57] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
Fused 16 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 555 ms.
Support contains 29 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 889 times.
Drop transitions removed 889 transitions
Iterating global reduction 0 with 889 rules applied. Total rules applied 893 place count 3101 transition count 2601
Applied a total of 893 rules in 763 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 56961 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{0=1}
Probabilistic random walk after 56961 steps, saw 56217 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :1
Running SMT prover for 14 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:02] [INFO ] Computed 1101 place invariants in 122 ms
[2022-05-20 01:27:04] [INFO ] [Real]Absence check using 1048 positive place invariants in 197 ms returned sat
[2022-05-20 01:27:04] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 10 ms returned sat
[2022-05-20 01:27:06] [INFO ] After 3810ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 01:27:07] [INFO ] [Nat]Absence check using 1048 positive place invariants in 223 ms returned sat
[2022-05-20 01:27:07] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 12 ms returned sat
[2022-05-20 01:27:31] [INFO ] After 23136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 01:27:31] [INFO ] After 23141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-20 01:27:31] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 14 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 491 ms.
Support contains 26 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 159 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=18 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 121725 steps, run timeout after 6002 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 121725 steps, saw 120453 distinct states, run finished after 6002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:27:40] [INFO ] Computed 1101 place invariants in 71 ms
[2022-05-20 01:27:42] [INFO ] [Real]Absence check using 1048 positive place invariants in 210 ms returned sat
[2022-05-20 01:27:42] [INFO ] [Real]Absence check using 1048 positive and 53 generalized place invariants in 11 ms returned sat
[2022-05-20 01:27:44] [INFO ] After 3617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-20 01:27:45] [INFO ] [Nat]Absence check using 1048 positive place invariants in 207 ms returned sat
[2022-05-20 01:27:45] [INFO ] [Nat]Absence check using 1048 positive and 53 generalized place invariants in 11 ms returned sat
[2022-05-20 01:28:09] [INFO ] After 23110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-20 01:28:09] [INFO ] After 23123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 01:28:09] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 14 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 458 ms.
Support contains 26 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 145 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 148 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:10] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 01:28:12] [INFO ] Implicit Places using invariants in 1795 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:12] [INFO ] Computed 1101 place invariants in 40 ms
[2022-05-20 01:28:14] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 3748 ms to find 0 implicit places.
[2022-05-20 01:28:14] [INFO ] Redundant transitions in 201 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:28:14] [INFO ] Computed 1101 place invariants in 38 ms
[2022-05-20 01:28:15] [INFO ] Dead Transitions using invariants and state equation in 1569 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(!X(p1)))))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 144 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:16] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:28:17] [INFO ] Implicit Places using invariants in 1572 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:17] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:28:19] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 3165 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:19] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:28:21] [INFO ] Dead Transitions using invariants and state equation in 1563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 495 ms :[p1, p1, p1, p1, p1, true, p1, p1, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s1577 1) (EQ s2243 1) (EQ s2255 1)), p1:(AND (EQ s1185 1) (EQ s1187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4425 ms.
Product exploration explored 100000 steps with 25000 reset in 4543 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 9 states, 15 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86684 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86684 steps, saw 78094 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:34] [INFO ] Computed 1101 place invariants in 15 ms
[2022-05-20 01:28:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 222 ms returned sat
[2022-05-20 01:28:36] [INFO ] After 1407ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:28:36] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 4 ms to minimize.
[2022-05-20 01:28:36] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2022-05-20 01:28:37] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2022-05-20 01:28:37] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2022-05-20 01:28:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2022-05-20 01:28:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2022-05-20 01:28:37] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2022-05-20 01:28:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1303 ms
[2022-05-20 01:28:37] [INFO ] After 2783ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:37] [INFO ] After 3557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 232 ms returned sat
[2022-05-20 01:28:40] [INFO ] After 1425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:28:40] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2022-05-20 01:28:40] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2022-05-20 01:28:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2022-05-20 01:28:40] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-05-20 01:28:40] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-20 01:28:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 907 ms
[2022-05-20 01:28:41] [INFO ] After 2402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2022-05-20 01:28:41] [INFO ] After 3278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 901 place count 3100 transition count 2600
Applied a total of 901 rules in 535 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3103 places, 2600/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55941 steps, run visited all 1 properties in 1204 ms. (steps per millisecond=46 )
Probabilistic random walk after 55941 steps, saw 55225 distinct states, run finished after 1208 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 3103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 123 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:43] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:28:45] [INFO ] Implicit Places using invariants in 1466 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:45] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:28:46] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2952 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:46] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:28:48] [INFO ] Dead Transitions using invariants and state equation in 1433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85999 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85999 steps, saw 77481 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:28:51] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:28:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 208 ms returned sat
[2022-05-20 01:28:54] [INFO ] After 1437ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 01:28:54] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2022-05-20 01:28:54] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-05-20 01:28:54] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2022-05-20 01:28:54] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2022-05-20 01:28:54] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-05-20 01:28:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-20 01:28:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2022-05-20 01:28:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1225 ms
[2022-05-20 01:28:55] [INFO ] After 2743ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:55] [INFO ] After 3505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:28:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 228 ms returned sat
[2022-05-20 01:28:57] [INFO ] After 1425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:28:57] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 0 ms to minimize.
[2022-05-20 01:28:57] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2022-05-20 01:28:58] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-20 01:28:58] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2022-05-20 01:28:58] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-05-20 01:28:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 914 ms
[2022-05-20 01:28:58] [INFO ] After 2408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 01:28:58] [INFO ] After 3264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 901 place count 3100 transition count 2600
Applied a total of 901 rules in 523 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3103 places, 2600/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Finished probabilistic random walk after 55941 steps, run visited all 1 properties in 1234 ms. (steps per millisecond=45 )
Probabilistic random walk after 55941 steps, saw 55225 distinct states, run finished after 1238 ms. (steps per millisecond=45 ) properties seen :1
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 170 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 168 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 25000 reset in 4228 ms.
Product exploration explored 100000 steps with 25000 reset in 4480 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 145 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 9 ms
Applied a total of 2 rules in 622 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-20 01:29:11] [INFO ] Redundant transitions in 183 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:29:11] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 01:29:12] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Product exploration timeout after 68780 steps with 17195 reset in 10002 ms.
Product exploration timeout after 68130 steps with 17032 reset in 10002 ms.
Built C files in :
/tmp/ltsmin10349918675841281680
[2022-05-20 01:29:32] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10349918675841281680
Running compilation step : cd /tmp/ltsmin10349918675841281680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10349918675841281680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10349918675841281680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 114 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:29:35] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:29:37] [INFO ] Implicit Places using invariants in 1664 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:29:37] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:29:39] [INFO ] Implicit Places using invariants and state equation in 2329 ms returned []
Implicit Place search using SMT with State Equation took 4010 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:29:39] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:29:41] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin12270555305065144383
[2022-05-20 01:29:41] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12270555305065144383
Running compilation step : cd /tmp/ltsmin12270555305065144383;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12270555305065144383;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12270555305065144383;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:29:44] [INFO ] Flatten gal took : 155 ms
[2022-05-20 01:29:44] [INFO ] Flatten gal took : 158 ms
[2022-05-20 01:29:45] [INFO ] Time to serialize gal into /tmp/LTL2035762926771584489.gal : 30 ms
[2022-05-20 01:29:45] [INFO ] Time to serialize properties into /tmp/LTL1377879862333531285.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2035762926771584489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1377879862333531285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2035762...266
Read 1 LTL properties
Checking formula 0 : !(((G("(((p1577==1)&&(p2243==1))&&(p2255==1))"))U(X(X(!(X("((p1185==1)&&(p1187==1))")))))))
Formula 0 simplified : !(G"(((p1577==1)&&(p2243==1))&&(p2255==1))" U XX!X"((p1185==1)&&(p1187==1))")
Detected timeout of ITS tools.
[2022-05-20 01:30:00] [INFO ] Flatten gal took : 202 ms
[2022-05-20 01:30:00] [INFO ] Applying decomposition
[2022-05-20 01:30:00] [INFO ] Flatten gal took : 149 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14269408583875576525.txt' '-o' '/tmp/graph14269408583875576525.bin' '-w' '/tmp/graph14269408583875576525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14269408583875576525.bin' '-l' '-1' '-v' '-w' '/tmp/graph14269408583875576525.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:30:00] [INFO ] Decomposing Gal with order
[2022-05-20 01:30:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:30:01] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:30:01] [INFO ] Flatten gal took : 263 ms
[2022-05-20 01:30:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1204 labels/synchronizations in 320 ms.
[2022-05-20 01:30:01] [INFO ] Time to serialize gal into /tmp/LTL8593082064224054666.gal : 39 ms
[2022-05-20 01:30:01] [INFO ] Time to serialize properties into /tmp/LTL11062954578061989477.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8593082064224054666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11062954578061989477.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8593082...246
Read 1 LTL properties
Checking formula 0 : !(((G("(((i27.i1.i3.u560.p1577==1)&&(i39.i1.i2.u796.p2243==1))&&(i39.i1.i2.u800.p2255==1))"))U(X(X(!(X("((i21.i0.i1.u420.p1185==1)&&(i...187
Formula 0 simplified : !(G"(((i27.i1.i3.u560.p1577==1)&&(i39.i1.i2.u796.p2243==1))&&(i39.i1.i2.u800.p2255==1))" U XX!X"((i21.i0.i1.u420.p1185==1)&&(i21.i0....175
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7229229942448230696
[2022-05-20 01:30:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7229229942448230696
Running compilation step : cd /tmp/ltsmin7229229942448230696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7229229942448230696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7229229942448230696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-00 finished in 123899 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&p1))&&X(X(!(p2 U G(p2))))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 127 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:20] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:30:23] [INFO ] Implicit Places using invariants in 3048 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:23] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:30:24] [INFO ] Implicit Places using invariants and state equation in 1657 ms returned []
Implicit Place search using SMT with State Equation took 4712 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:24] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:30:26] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), true, p2, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s2300 0) (EQ s2317 0)), p0:(OR (EQ s2619 0) (EQ s2661 0)), p2:(AND (EQ s2619 1) (EQ s2661 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 4618 ms.
Product exploration explored 100000 steps with 33333 reset in 4753 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p2))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-100A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-100A-LTLFireability-01 finished in 16146 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3101 transition count 2601
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3100 transition count 2600
Applied a total of 4 rules in 407 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:30:36] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:30:38] [INFO ] Implicit Places using invariants in 1528 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:30:38] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 01:30:39] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 3091 ms to find 0 implicit places.
[2022-05-20 01:30:39] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:30:39] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 01:30:41] [INFO ] Dead Transitions using invariants and state equation in 1524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3100/3103 places, 2600/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3103 places, 2600/2603 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s588 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6776 steps with 0 reset in 131 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-02 finished in 5311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((G((F(p1)&&p2))&&p2))))'
Support contains 8 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 152 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:41] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:30:43] [INFO ] Implicit Places using invariants in 1649 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:43] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:30:44] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 3226 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:30:44] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:30:46] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s1195 0) (EQ s1197 0)) (OR (EQ s755 0) (EQ s767 0))), p2:(OR (EQ s256 0) (EQ s277 0)), p1:(OR (EQ s2393 0) (EQ s2409 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5850 steps with 0 reset in 122 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-03 finished in 5235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U (F(G(!p0))&&(p0 U p1))))&&F(p2)))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 271 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:47] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:30:48] [INFO ] Implicit Places using invariants in 1648 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:48] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:30:50] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
[2022-05-20 01:30:50] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:50] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:30:51] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p2) p0), p0, (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s1478 0), p1:(AND (EQ s2836 1) (EQ s2878 1)), p0:(AND (EQ s2798 1) (EQ s2819 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 28 reset in 1915 ms.
Product exploration explored 100000 steps with 24 reset in 2348 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 431 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p1)), (X (NOT p0)), (X (X p2)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:30:57] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:31:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 2132 ms returned sat
[2022-05-20 01:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:31:12] [INFO ] [Real]Absence check using state equation in 8993 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 3101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 116 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:12] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 01:31:14] [INFO ] Implicit Places using invariants in 1636 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:14] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:31:15] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 3159 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:15] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:31:17] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Finished random walk after 494 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:17] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:31:23] [INFO ] [Real]Absence check using 1101 positive place invariants in 2075 ms returned sat
[2022-05-20 01:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:31:32] [INFO ] [Real]Absence check using state equation in 9318 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 25 reset in 1989 ms.
Product exploration explored 100000 steps with 26 reset in 2385 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 133 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-20 01:31:38] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:38] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:31:40] [INFO ] Dead Transitions using invariants and state equation in 1756 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Product exploration explored 100000 steps with 27 reset in 1951 ms.
Product exploration explored 100000 steps with 23 reset in 2332 ms.
Built C files in :
/tmp/ltsmin13136993561664364514
[2022-05-20 01:31:44] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13136993561664364514
Running compilation step : cd /tmp/ltsmin13136993561664364514;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13136993561664364514;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13136993561664364514;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 148 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:47] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:31:50] [INFO ] Implicit Places using invariants in 3172 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:50] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:31:52] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 4718 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:31:52] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:31:54] [INFO ] Dead Transitions using invariants and state equation in 1716 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin5396178217999801879
[2022-05-20 01:31:54] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5396178217999801879
Running compilation step : cd /tmp/ltsmin5396178217999801879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5396178217999801879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5396178217999801879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:31:57] [INFO ] Flatten gal took : 291 ms
[2022-05-20 01:31:58] [INFO ] Flatten gal took : 293 ms
[2022-05-20 01:31:58] [INFO ] Time to serialize gal into /tmp/LTL3384143700327822442.gal : 24 ms
[2022-05-20 01:31:58] [INFO ] Time to serialize properties into /tmp/LTL11880997538524359156.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3384143700327822442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11880997538524359156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3384143...267
Read 1 LTL properties
Checking formula 0 : !(((F(("((p2798==1)&&(p2819==1))")U((F(G(!("((p2798==1)&&(p2819==1))"))))&&(("((p2798==1)&&(p2819==1))")U("((p2836==1)&&(p2878==1))"))...179
Formula 0 simplified : !(F("((p2798==1)&&(p2819==1))" U (FG!"((p2798==1)&&(p2819==1))" & ("((p2798==1)&&(p2819==1))" U "((p2836==1)&&(p2878==1))"))) & F"(p...165
Detected timeout of ITS tools.
[2022-05-20 01:32:13] [INFO ] Flatten gal took : 142 ms
[2022-05-20 01:32:13] [INFO ] Applying decomposition
[2022-05-20 01:32:13] [INFO ] Flatten gal took : 144 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15894871908779911221.txt' '-o' '/tmp/graph15894871908779911221.bin' '-w' '/tmp/graph15894871908779911221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15894871908779911221.bin' '-l' '-1' '-v' '-w' '/tmp/graph15894871908779911221.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:32:13] [INFO ] Decomposing Gal with order
[2022-05-20 01:32:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:32:14] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:32:14] [INFO ] Flatten gal took : 317 ms
[2022-05-20 01:32:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 183 ms.
[2022-05-20 01:32:14] [INFO ] Time to serialize gal into /tmp/LTL4148829496808447463.gal : 60 ms
[2022-05-20 01:32:14] [INFO ] Time to serialize properties into /tmp/LTL11261448206865937153.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4148829496808447463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11261448206865937153.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4148829...246
Read 1 LTL properties
Checking formula 0 : !(((F(("((i50.i1.i3.u993.p2798==1)&&(i50.i1.i3.u1000.p2819==1))")U((F(G(!("((i50.i1.i3.u993.p2798==1)&&(i50.i1.i3.u1000.p2819==1))")))...319
Formula 0 simplified : !(F("((i50.i1.i3.u993.p2798==1)&&(i50.i1.i3.u1000.p2819==1))" U (FG!"((i50.i1.i3.u993.p2798==1)&&(i50.i1.i3.u1000.p2819==1))" & ("((...305
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11646230080902980553
[2022-05-20 01:32:29] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11646230080902980553
Running compilation step : cd /tmp/ltsmin11646230080902980553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11646230080902980553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11646230080902980553;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-04 finished in 106220 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((!p0||X(!p1))) U (G((!p0||X(!p1)))&&p2))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 176 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:33] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:36] [INFO ] Implicit Places using invariants in 3177 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:36] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:37] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 4754 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:37] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:32:39] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), p1, (AND p0 p1), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s2183 1) (EQ s2202 1)), p0:(AND (EQ s2183 1) (EQ s2202 1)), p1:(AND (EQ s438 1) (EQ s459 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9020 steps with 1 reset in 211 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-05 finished in 6921 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 120 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:40] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:32:41] [INFO ] Implicit Places using invariants in 1601 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:41] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:43] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 3164 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:43] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:44] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s2183 1) (NEQ s2203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1903 steps with 0 reset in 32 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-07 finished in 4963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&((F(p2)&&p2)||p1))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 130 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:45] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:32:46] [INFO ] Implicit Places using invariants in 1594 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:46] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:48] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 3085 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:48] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:32:49] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s1344 0) (EQ s1356 0)), p2:(EQ s2105 0), p0:(AND (EQ s1344 1) (EQ s1356 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 26 reset in 1796 ms.
Stuttering criterion allowed to conclude after 6575 steps with 0 reset in 151 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-08 finished in 6952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(G(X((p0 U X(p1)))))&&F(p2)))))'
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 128 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:51] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:32:53] [INFO ] Implicit Places using invariants in 1579 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:53] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:32:55] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 3154 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:32:55] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:32:56] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s886 0) (EQ s897 0)), p0:(EQ s94 1), p1:(AND (EQ s2514 1) (EQ s2541 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 99 reset in 1673 ms.
Product exploration explored 100000 steps with 102 reset in 2021 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 7 states, 16 edges and 3 AP to 7 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:33:02] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:33:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 01:33:03] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 01:33:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 207 ms returned sat
[2022-05-20 01:33:28] [INFO ] After 23919ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 01:33:28] [INFO ] After 23924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 01:33:28] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 293 ms.
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 397 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 61427 steps, run timeout after 3005 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61427 steps, saw 60679 distinct states, run finished after 3005 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:33:33] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:33:34] [INFO ] [Real]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:33:34] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:33:34] [INFO ] After 1007ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 01:33:35] [INFO ] [Nat]Absence check using 1046 positive place invariants in 202 ms returned sat
[2022-05-20 01:33:35] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:33:59] [INFO ] After 23842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 01:33:59] [INFO ] After 23845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-20 01:33:59] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 128 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 127 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:00] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:34:02] [INFO ] Implicit Places using invariants in 2001 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:34:02] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:36:42] [INFO ] Performed 1907/3101 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2022-05-20 01:36:42] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2022-05-20 01:36:42] [INFO ] Implicit Places using invariants and state equation in 160057 ms returned []
Implicit Place search using SMT with State Equation took 162059 ms to find 0 implicit places.
[2022-05-20 01:36:42] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:36:42] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 01:36:43] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 7 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:36:44] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:36:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 2726 ms returned sat
[2022-05-20 01:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:36:59] [INFO ] [Real]Absence check using state equation in 8455 ms returned unknown
Could not prove EG (NOT p1)
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 117 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:36:59] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:37:01] [INFO ] Implicit Places using invariants in 1584 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:37:01] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:37:03] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 3336 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:37:03] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:37:04] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 7 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:37:06] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:37:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 214 ms returned sat
[2022-05-20 01:37:07] [INFO ] After 1040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 01:37:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 213 ms returned sat
[2022-05-20 01:37:32] [INFO ] After 23870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 01:37:32] [INFO ] After 23872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 01:37:32] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 350 ms.
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 894 times.
Drop transitions removed 894 transitions
Iterating global reduction 0 with 894 rules applied. Total rules applied 898 place count 3101 transition count 2601
Applied a total of 898 rules in 382 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 48949 steps, run timeout after 3005 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48949 steps, saw 48269 distinct states, run finished after 3005 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:37:37] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 01:37:38] [INFO ] [Real]Absence check using 1046 positive place invariants in 190 ms returned sat
[2022-05-20 01:37:38] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:37:38] [INFO ] After 1043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 01:37:39] [INFO ] [Nat]Absence check using 1046 positive place invariants in 197 ms returned sat
[2022-05-20 01:37:39] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:38:03] [INFO ] After 23918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-20 01:38:03] [INFO ] After 23921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 01:38:03] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 141 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 128 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:04] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:38:06] [INFO ] Implicit Places using invariants in 1963 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:06] [INFO ] Computed 1101 place invariants in 29 ms
[2022-05-20 01:38:08] [INFO ] Implicit Places using invariants and state equation in 2206 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
[2022-05-20 01:38:08] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:08] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:38:10] [INFO ] Dead Transitions using invariants and state equation in 1563 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 128 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:38:10] [INFO ] Computed 1101 place invariants in 31 ms
[2022-05-20 01:38:11] [INFO ] [Real]Absence check using 1046 positive place invariants in 199 ms returned sat
[2022-05-20 01:38:11] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 11 ms returned sat
[2022-05-20 01:38:11] [INFO ] After 1024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 01:38:12] [INFO ] [Nat]Absence check using 1046 positive place invariants in 197 ms returned sat
[2022-05-20 01:38:12] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-20 01:39:09] [INFO ] After 57985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 214 ms. Reduced automaton from 7 states, 15 edges and 3 AP to 7 states, 15 edges and 3 AP.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:39:09] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:39:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 2585 ms returned sat
[2022-05-20 01:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:39:24] [INFO ] [Real]Absence check using state equation in 8765 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 100 reset in 1671 ms.
Product exploration explored 100000 steps with 100 reset in 2016 ms.
Applying partial POR strategy [false, false, true, false, true, false, false]
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 16 ms
Applied a total of 2 rules in 281 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-20 01:39:29] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:39:29] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:39:31] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Product exploration explored 100000 steps with 100 reset in 1695 ms.
Product exploration explored 100000 steps with 100 reset in 2022 ms.
Built C files in :
/tmp/ltsmin14391373568156997902
[2022-05-20 01:39:34] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14391373568156997902
Running compilation step : cd /tmp/ltsmin14391373568156997902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14391373568156997902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14391373568156997902;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 126 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:39:38] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:39:39] [INFO ] Implicit Places using invariants in 1992 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:39:39] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:39:41] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 3505 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:39:41] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:39:42] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin14360747134685391863
[2022-05-20 01:39:42] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14360747134685391863
Running compilation step : cd /tmp/ltsmin14360747134685391863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14360747134685391863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14360747134685391863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:39:46] [INFO ] Flatten gal took : 131 ms
[2022-05-20 01:39:46] [INFO ] Flatten gal took : 133 ms
[2022-05-20 01:39:46] [INFO ] Time to serialize gal into /tmp/LTL17188929638008971727.gal : 11 ms
[2022-05-20 01:39:46] [INFO ] Time to serialize properties into /tmp/LTL6300365732548360116.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17188929638008971727.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6300365732548360116.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1718892...267
Read 1 LTL properties
Checking formula 0 : !((X(F((G(G(X(("(p94==1)")U(X("((p2514==1)&&(p2541==1))"))))))&&(F("((p886==0)||(p897==0))"))))))
Formula 0 simplified : !XF(GX("(p94==1)" U X"((p2514==1)&&(p2541==1))") & F"((p886==0)||(p897==0))")
Detected timeout of ITS tools.
[2022-05-20 01:40:01] [INFO ] Flatten gal took : 130 ms
[2022-05-20 01:40:01] [INFO ] Applying decomposition
[2022-05-20 01:40:01] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12840549505310545735.txt' '-o' '/tmp/graph12840549505310545735.bin' '-w' '/tmp/graph12840549505310545735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12840549505310545735.bin' '-l' '-1' '-v' '-w' '/tmp/graph12840549505310545735.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:40:01] [INFO ] Decomposing Gal with order
[2022-05-20 01:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:40:02] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:40:02] [INFO ] Flatten gal took : 135 ms
[2022-05-20 01:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 115 ms.
[2022-05-20 01:40:02] [INFO ] Time to serialize gal into /tmp/LTL8667262177052430037.gal : 24 ms
[2022-05-20 01:40:02] [INFO ] Time to serialize properties into /tmp/LTL12859140275216464110.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8667262177052430037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12859140275216464110.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8667262...246
Read 1 LTL properties
Checking formula 0 : !((X(F((G(G(X(("(i1.i0.i3.u33.p94==1)")U(X("((i44.i0.i1.u892.p2514==1)&&(i44.i0.i3.u902.p2541==1))"))))))&&(F("((i15.i1.i2.u315.p886==...191
Formula 0 simplified : !XF(GX("(i1.i0.i3.u33.p94==1)" U X"((i44.i0.i1.u892.p2514==1)&&(i44.i0.i3.u902.p2541==1))") & F"((i15.i1.i2.u315.p886==0)||(i15.i1.i...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12895453870814608153
[2022-05-20 01:40:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12895453870814608153
Running compilation step : cd /tmp/ltsmin12895453870814608153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12895453870814608153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12895453870814608153;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-09 finished in 448858 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!X(p0) U p1))))'
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 123 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:40:20] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:40:22] [INFO ] Implicit Places using invariants in 1623 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:40:22] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:40:23] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 3194 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:40:24] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:40:25] [INFO ] Dead Transitions using invariants and state equation in 1553 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 314 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2002 1) (EQ s2013 1)), p0:(AND (EQ s141 1) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 48 reset in 1680 ms.
Product exploration explored 100000 steps with 48 reset in 2029 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:40:30] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:40:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 227 ms returned sat
[2022-05-20 01:40:32] [INFO ] After 2232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:40:33] [INFO ] [Nat]Absence check using 1101 positive place invariants in 226 ms returned sat
[2022-05-20 01:40:34] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:40:34] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-20 01:40:35] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2022-05-20 01:40:35] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-05-20 01:40:35] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-20 01:40:35] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2022-05-20 01:40:35] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-20 01:40:35] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-05-20 01:40:36] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 4 ms to minimize.
[2022-05-20 01:40:36] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2022-05-20 01:40:36] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-20 01:40:36] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-20 01:40:36] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2022-05-20 01:40:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2070 ms
[2022-05-20 01:40:36] [INFO ] After 3524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 01:40:36] [INFO ] After 4368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 901 place count 3100 transition count 2600
Applied a total of 901 rules in 495 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3103 places, 2600/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125865 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125865 steps, saw 124772 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:40:40] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:40:41] [INFO ] [Real]Absence check using 1052 positive place invariants in 204 ms returned sat
[2022-05-20 01:40:41] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 14 ms returned sat
[2022-05-20 01:40:43] [INFO ] After 2486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:40:44] [INFO ] [Nat]Absence check using 1052 positive place invariants in 208 ms returned sat
[2022-05-20 01:40:44] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 11 ms returned sat
[2022-05-20 01:40:49] [INFO ] After 5234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:40:53] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2022-05-20 01:40:53] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2022-05-20 01:40:53] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2022-05-20 01:40:53] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2022-05-20 01:40:54] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2022-05-20 01:40:54] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2022-05-20 01:40:54] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2022-05-20 01:40:54] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-20 01:40:55] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2022-05-20 01:40:55] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-20 01:40:55] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2022-05-20 01:40:55] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-20 01:40:55] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2022-05-20 01:40:56] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2022-05-20 01:40:56] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2022-05-20 01:40:56] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2022-05-20 01:40:56] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 4 ms to minimize.
[2022-05-20 01:40:57] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2022-05-20 01:40:57] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2022-05-20 01:40:57] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2022-05-20 01:40:57] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2022-05-20 01:40:57] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 0 ms to minimize.
[2022-05-20 01:40:58] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2022-05-20 01:40:58] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2022-05-20 01:40:58] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2022-05-20 01:40:58] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2022-05-20 01:40:58] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-05-20 01:40:59] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2022-05-20 01:40:59] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2022-05-20 01:40:59] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-20 01:40:59] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 2 ms to minimize.
[2022-05-20 01:41:08] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 15515 ms
[2022-05-20 01:41:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 01:41:08] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 124 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 124 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:41:08] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:41:10] [INFO ] Implicit Places using invariants in 1950 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:41:10] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:41:12] [INFO ] Implicit Places using invariants and state equation in 1920 ms returned []
Implicit Place search using SMT with State Equation took 3872 ms to find 0 implicit places.
[2022-05-20 01:41:12] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:41:12] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 01:41:14] [INFO ] Dead Transitions using invariants and state equation in 1556 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 130 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:41:14] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 01:41:15] [INFO ] [Real]Absence check using 1052 positive place invariants in 198 ms returned sat
[2022-05-20 01:41:15] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:41:16] [INFO ] After 2438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:41:17] [INFO ] [Nat]Absence check using 1052 positive place invariants in 205 ms returned sat
[2022-05-20 01:41:17] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:41:22] [INFO ] After 4840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:41:26] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2022-05-20 01:41:26] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2022-05-20 01:41:26] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2022-05-20 01:41:26] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 2 ms to minimize.
[2022-05-20 01:41:27] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2022-05-20 01:41:27] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2022-05-20 01:41:27] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 1 ms to minimize.
[2022-05-20 01:41:27] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-20 01:41:28] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2022-05-20 01:41:28] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2022-05-20 01:41:28] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2022-05-20 01:41:28] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-20 01:41:29] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-20 01:41:29] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-20 01:41:29] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2022-05-20 01:41:29] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:41:29] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2022-05-20 01:41:30] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2022-05-20 01:41:30] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-05-20 01:41:30] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:41:30] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:41:31] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 1 ms to minimize.
[2022-05-20 01:41:31] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2022-05-20 01:41:31] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2022-05-20 01:41:31] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2022-05-20 01:41:31] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2022-05-20 01:41:32] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2022-05-20 01:41:32] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-05-20 01:41:32] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2022-05-20 01:41:32] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-20 01:41:32] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2022-05-20 01:41:41] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 16043 ms
[2022-05-20 01:41:41] [INFO ] After 24413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:41:41] [INFO ] After 25148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 289 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:41:42] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:41:48] [INFO ] [Real]Absence check using 1101 positive place invariants in 2364 ms returned sat
[2022-05-20 01:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:41:57] [INFO ] [Real]Absence check using state equation in 8818 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 134 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:41:57] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:41:59] [INFO ] Implicit Places using invariants in 1577 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:41:59] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:42:00] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 3107 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:42:00] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:42:02] [INFO ] Dead Transitions using invariants and state equation in 1444 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:42:03] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:42:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 233 ms returned sat
[2022-05-20 01:42:05] [INFO ] After 2208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:42:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 226 ms returned sat
[2022-05-20 01:42:07] [INFO ] After 1436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:42:07] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2022-05-20 01:42:07] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2022-05-20 01:42:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-05-20 01:42:09] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-20 01:42:09] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2022-05-20 01:42:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-05-20 01:42:09] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2011 ms
[2022-05-20 01:42:09] [INFO ] After 3543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2022-05-20 01:42:09] [INFO ] After 4381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 900 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 901 place count 3100 transition count 2600
Applied a total of 901 rules in 528 ms. Remains 3100 /3103 variables (removed 3) and now considering 2600/2603 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3103 places, 2600/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 123028 steps, run timeout after 3006 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 123028 steps, saw 121956 distinct states, run finished after 3006 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:42:13] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:42:14] [INFO ] [Real]Absence check using 1052 positive place invariants in 199 ms returned sat
[2022-05-20 01:42:14] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:42:16] [INFO ] After 2464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:42:16] [INFO ] [Nat]Absence check using 1052 positive place invariants in 204 ms returned sat
[2022-05-20 01:42:16] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:42:21] [INFO ] After 4940ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:42:25] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2022-05-20 01:42:25] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2022-05-20 01:42:26] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2022-05-20 01:42:26] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-20 01:42:26] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2022-05-20 01:42:26] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2022-05-20 01:42:27] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2022-05-20 01:42:27] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-20 01:42:27] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2022-05-20 01:42:27] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2022-05-20 01:42:27] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2022-05-20 01:42:28] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-20 01:42:28] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2022-05-20 01:42:28] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2022-05-20 01:42:28] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2022-05-20 01:42:29] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 01:42:29] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2022-05-20 01:42:29] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2022-05-20 01:42:29] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2022-05-20 01:42:29] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:42:30] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:42:30] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2022-05-20 01:42:30] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2022-05-20 01:42:30] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-05-20 01:42:31] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2022-05-20 01:42:31] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2022-05-20 01:42:31] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2022-05-20 01:42:31] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2022-05-20 01:42:31] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2022-05-20 01:42:32] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2022-05-20 01:42:32] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-05-20 01:42:41] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 15854 ms
[2022-05-20 01:42:41] [INFO ] After 24334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:42:41] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 128 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 123 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:42:41] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:42:43] [INFO ] Implicit Places using invariants in 1946 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:42:43] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:42:45] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 3878 ms to find 0 implicit places.
[2022-05-20 01:42:45] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:42:45] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:42:47] [INFO ] Dead Transitions using invariants and state equation in 1560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 134 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:42:47] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:42:47] [INFO ] [Real]Absence check using 1052 positive place invariants in 203 ms returned sat
[2022-05-20 01:42:47] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 14 ms returned sat
[2022-05-20 01:42:49] [INFO ] After 2388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:42:50] [INFO ] [Nat]Absence check using 1052 positive place invariants in 199 ms returned sat
[2022-05-20 01:42:50] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:42:55] [INFO ] After 4942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:42:59] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2022-05-20 01:42:59] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2022-05-20 01:42:59] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2022-05-20 01:42:59] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2022-05-20 01:43:00] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2022-05-20 01:43:00] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2022-05-20 01:43:00] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2022-05-20 01:43:00] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-05-20 01:43:01] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2022-05-20 01:43:01] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2022-05-20 01:43:01] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2022-05-20 01:43:01] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2022-05-20 01:43:01] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2022-05-20 01:43:02] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-20 01:43:02] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2022-05-20 01:43:02] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 01:43:02] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-05-20 01:43:03] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2022-05-20 01:43:03] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2022-05-20 01:43:03] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:43:03] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2022-05-20 01:43:03] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
[2022-05-20 01:43:04] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2022-05-20 01:43:04] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2022-05-20 01:43:04] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
[2022-05-20 01:43:04] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-05-20 01:43:04] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2022-05-20 01:43:05] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2022-05-20 01:43:05] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2022-05-20 01:43:05] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-05-20 01:43:05] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-20 01:43:14] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 15990 ms
[2022-05-20 01:43:14] [INFO ] After 24507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:43:14] [INFO ] After 25183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:43:15] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:43:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 2582 ms returned sat
[2022-05-20 01:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:43:30] [INFO ] [Real]Absence check using state equation in 8611 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 47 reset in 1751 ms.
Product exploration explored 100000 steps with 48 reset in 2112 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 10 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3103 transition count 2603
Deduced a syphon composed of 2 places in 10 ms
Applied a total of 2 rules in 263 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
[2022-05-20 01:43:34] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:43:34] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:43:36] [INFO ] Dead Transitions using invariants and state equation in 1606 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/3103 places, 2603/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Product exploration explored 100000 steps with 48 reset in 1745 ms.
Product exploration explored 100000 steps with 49 reset in 2125 ms.
Built C files in :
/tmp/ltsmin14024965186106365796
[2022-05-20 01:43:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14024965186106365796
Running compilation step : cd /tmp/ltsmin14024965186106365796;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14024965186106365796;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14024965186106365796;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 126 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:43:43] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:43:45] [INFO ] Implicit Places using invariants in 1652 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:43:45] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:43:46] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:43:47] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:43:48] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Built C files in :
/tmp/ltsmin15915801168681659271
[2022-05-20 01:43:48] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15915801168681659271
Running compilation step : cd /tmp/ltsmin15915801168681659271;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15915801168681659271;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15915801168681659271;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:43:51] [INFO ] Flatten gal took : 138 ms
[2022-05-20 01:43:52] [INFO ] Flatten gal took : 141 ms
[2022-05-20 01:43:52] [INFO ] Time to serialize gal into /tmp/LTL932144347599461786.gal : 13 ms
[2022-05-20 01:43:52] [INFO ] Time to serialize properties into /tmp/LTL7192565381098583788.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL932144347599461786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7192565381098583788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9321443...265
Read 1 LTL properties
Checking formula 0 : !((X(G((!(X("((p141==1)&&(p143==1))")))U("((p2002==1)&&(p2013==1))")))))
Formula 0 simplified : !XG(!X"((p141==1)&&(p143==1))" U "((p2002==1)&&(p2013==1))")
Detected timeout of ITS tools.
[2022-05-20 01:44:07] [INFO ] Flatten gal took : 135 ms
[2022-05-20 01:44:07] [INFO ] Applying decomposition
[2022-05-20 01:44:07] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12678465300615430117.txt' '-o' '/tmp/graph12678465300615430117.bin' '-w' '/tmp/graph12678465300615430117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12678465300615430117.bin' '-l' '-1' '-v' '-w' '/tmp/graph12678465300615430117.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:44:07] [INFO ] Decomposing Gal with order
[2022-05-20 01:44:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:44:08] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:44:08] [INFO ] Flatten gal took : 144 ms
[2022-05-20 01:44:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1206 labels/synchronizations in 225 ms.
[2022-05-20 01:44:08] [INFO ] Time to serialize gal into /tmp/LTL2586650686242711337.gal : 23 ms
[2022-05-20 01:44:08] [INFO ] Time to serialize properties into /tmp/LTL15342853340467658865.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2586650686242711337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15342853340467658865.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2586650...246
Read 1 LTL properties
Checking formula 0 : !((X(G((!(X("((i2.i0.i3.u50.p141==1)&&(i2.i0.i2.u51.p143==1))")))U("((i37.i0.i1.u711.p2002==1)&&(i37.i0.i1.u714.p2013==1))")))))
Formula 0 simplified : !XG(!X"((i2.i0.i3.u50.p141==1)&&(i2.i0.i2.u51.p143==1))" U "((i37.i0.i1.u711.p2002==1)&&(i37.i0.i1.u714.p2013==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13942736808139827883
[2022-05-20 01:44:23] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13942736808139827883
Running compilation step : cd /tmp/ltsmin13942736808139827883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13942736808139827883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13942736808139827883;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-10 finished in 245816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Applied a total of 0 rules in 120 ms. Remains 3103 /3103 variables (removed 0) and now considering 2603/2603 (removed 0) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:44:26] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:44:28] [INFO ] Implicit Places using invariants in 1629 ms returned []
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:44:28] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:44:29] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 3241 ms to find 0 implicit places.
// Phase 1: matrix 2603 rows 3103 cols
[2022-05-20 01:44:29] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:44:31] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3103/3103 places, 2603/2603 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1276 1) (EQ s1295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100A-LTLFireability-11 finished in 5032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&F(!p1)))))))'
Support contains 3 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 254 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:44:31] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:44:33] [INFO ] Implicit Places using invariants in 1707 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:44:33] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:44:35] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 3272 ms to find 0 implicit places.
[2022-05-20 01:44:35] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:44:35] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:44:36] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldPPPs-PT-100A-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}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2384 1), p1:(AND (EQ s295 1) (EQ s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 77 reset in 1807 ms.
Product exploration explored 100000 steps with 78 reset in 2167 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:44:41] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:44:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 221 ms returned sat
[2022-05-20 01:44:44] [INFO ] After 2649ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 01:44:45] [INFO ] [Nat]Absence check using 1101 positive place invariants in 221 ms returned sat
[2022-05-20 01:45:04] [INFO ] After 20185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 269 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 107446 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{1=1}
Probabilistic random walk after 107446 steps, saw 106499 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:45:08] [INFO ] Computed 1101 place invariants in 28 ms
[2022-05-20 01:45:08] [INFO ] [Real]Absence check using 1045 positive place invariants in 202 ms returned sat
[2022-05-20 01:45:08] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 12 ms returned sat
[2022-05-20 01:45:10] [INFO ] After 2191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:45:11] [INFO ] [Nat]Absence check using 1045 positive place invariants in 212 ms returned sat
[2022-05-20 01:45:11] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 12 ms returned sat
[2022-05-20 01:45:21] [INFO ] After 11115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 151 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Finished probabilistic random walk after 107515 steps, run visited all 1 properties in 2460 ms. (steps per millisecond=43 )
Probabilistic random walk after 107515 steps, saw 106569 distinct states, run finished after 2463 ms. (steps per millisecond=43 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:45:25] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:45:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 1837 ms returned sat
[2022-05-20 01:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:45:40] [INFO ] [Real]Absence check using state equation in 9528 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 131 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:45:40] [INFO ] Computed 1101 place invariants in 14 ms
[2022-05-20 01:45:41] [INFO ] Implicit Places using invariants in 1640 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:45:41] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:45:43] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 3276 ms to find 0 implicit places.
[2022-05-20 01:45:43] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:45:43] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:45:45] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:45:46] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:45:46] [INFO ] [Real]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 01:45:48] [INFO ] After 2445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 01:45:49] [INFO ] [Nat]Absence check using 1101 positive place invariants in 219 ms returned sat
[2022-05-20 01:46:08] [INFO ] After 20195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Applied a total of 896 rules in 278 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 98732 steps, run timeout after 3006 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98732 steps, saw 97818 distinct states, run finished after 3006 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:46:12] [INFO ] Computed 1101 place invariants in 32 ms
[2022-05-20 01:46:13] [INFO ] [Real]Absence check using 1045 positive place invariants in 205 ms returned sat
[2022-05-20 01:46:13] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 12 ms returned sat
[2022-05-20 01:46:15] [INFO ] After 3317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 01:46:16] [INFO ] [Nat]Absence check using 1045 positive place invariants in 209 ms returned sat
[2022-05-20 01:46:16] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 12 ms returned sat
[2022-05-20 01:46:36] [INFO ] After 20428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 153 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 127 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:46:36] [INFO ] Computed 1101 place invariants in 37 ms
[2022-05-20 01:46:38] [INFO ] Implicit Places using invariants in 2081 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:46:38] [INFO ] Computed 1101 place invariants in 31 ms
[2022-05-20 01:46:40] [INFO ] Implicit Places using invariants and state equation in 1966 ms returned []
Implicit Place search using SMT with State Equation took 4052 ms to find 0 implicit places.
[2022-05-20 01:46:40] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:46:40] [INFO ] Computed 1101 place invariants in 35 ms
[2022-05-20 01:46:42] [INFO ] Dead Transitions using invariants and state equation in 1608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 138 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:46:42] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:46:43] [INFO ] [Real]Absence check using 1045 positive place invariants in 208 ms returned sat
[2022-05-20 01:46:43] [INFO ] [Real]Absence check using 1045 positive and 56 generalized place invariants in 11 ms returned sat
[2022-05-20 01:46:45] [INFO ] After 3298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 01:46:46] [INFO ] [Nat]Absence check using 1045 positive place invariants in 203 ms returned sat
[2022-05-20 01:46:46] [INFO ] [Nat]Absence check using 1045 positive and 56 generalized place invariants in 12 ms returned sat
[2022-05-20 01:47:06] [INFO ] After 20404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 271 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:47:06] [INFO ] Computed 1101 place invariants in 15 ms
[2022-05-20 01:47:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 1740 ms returned sat
[2022-05-20 01:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:47:21] [INFO ] [Real]Absence check using state equation in 9792 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 77 reset in 1687 ms.
Product exploration explored 100000 steps with 77 reset in 2029 ms.
Built C files in :
/tmp/ltsmin7924917930864647944
[2022-05-20 01:47:25] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:47:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7924917930864647944
Running compilation step : cd /tmp/ltsmin7924917930864647944;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7924917930864647944;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7924917930864647944;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 135 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:47:28] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 01:47:30] [INFO ] Implicit Places using invariants in 1640 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:47:30] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:47:31] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2022-05-20 01:47:32] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:47:32] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:47:33] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin4889962283155337482
[2022-05-20 01:47:33] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:47:33] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4889962283155337482
Running compilation step : cd /tmp/ltsmin4889962283155337482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4889962283155337482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4889962283155337482;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:47:36] [INFO ] Flatten gal took : 168 ms
[2022-05-20 01:47:37] [INFO ] Flatten gal took : 149 ms
[2022-05-20 01:47:37] [INFO ] Time to serialize gal into /tmp/LTL17529947560316997491.gal : 10 ms
[2022-05-20 01:47:37] [INFO ] Time to serialize properties into /tmp/LTL17197385826523966967.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17529947560316997491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17197385826523966967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1752994...268
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p2384==1)")U((G("(p2384==1)"))||(("(p2384==1)")&&(F(!("((p295==1)&&(p312==1))")))))))))
Formula 0 simplified : !GF("(p2384==1)" U (G"(p2384==1)" | ("(p2384==1)" & F!"((p295==1)&&(p312==1))")))
Detected timeout of ITS tools.
[2022-05-20 01:47:52] [INFO ] Flatten gal took : 141 ms
[2022-05-20 01:47:52] [INFO ] Applying decomposition
[2022-05-20 01:47:52] [INFO ] Flatten gal took : 145 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13584062622913725883.txt' '-o' '/tmp/graph13584062622913725883.bin' '-w' '/tmp/graph13584062622913725883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13584062622913725883.bin' '-l' '-1' '-v' '-w' '/tmp/graph13584062622913725883.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:47:52] [INFO ] Decomposing Gal with order
[2022-05-20 01:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:47:53] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:47:53] [INFO ] Flatten gal took : 165 ms
[2022-05-20 01:47:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 134 ms.
[2022-05-20 01:47:53] [INFO ] Time to serialize gal into /tmp/LTL7204039477874068958.gal : 26 ms
[2022-05-20 01:47:53] [INFO ] Time to serialize properties into /tmp/LTL2980524691221132179.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7204039477874068958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2980524691221132179.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7204039...245
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i44.i1.i0.u846.p2384==1)")U((G("(i44.i1.i0.u846.p2384==1)"))||(("(i44.i1.i0.u846.p2384==1)")&&(F(!("((i6.u105.p295==1)&&(i6....179
Formula 0 simplified : !GF("(i44.i1.i0.u846.p2384==1)" U (G"(i44.i1.i0.u846.p2384==1)" | ("(i44.i1.i0.u846.p2384==1)" & F!"((i6.u105.p295==1)&&(i6.u110.p31...165
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6702322463957184040
[2022-05-20 01:48:08] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6702322463957184040
Running compilation step : cd /tmp/ltsmin6702322463957184040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6702322463957184040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6702322463957184040;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-13 finished in 219898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 296 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:11] [INFO ] Computed 1101 place invariants in 17 ms
[2022-05-20 01:48:13] [INFO ] Implicit Places using invariants in 1710 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:13] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:48:15] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 3260 ms to find 0 implicit places.
[2022-05-20 01:48:15] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:15] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:48:16] [INFO ] Dead Transitions using invariants and state equation in 1463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s824 1) (EQ s835 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]]
Product exploration explored 100000 steps with 22 reset in 1909 ms.
Product exploration explored 100000 steps with 21 reset in 2308 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 423 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 86449 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86449 steps, saw 78499 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:24] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 01:48:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 215 ms returned sat
[2022-05-20 01:48:26] [INFO ] After 2256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:48:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 243 ms returned sat
[2022-05-20 01:48:38] [INFO ] After 11221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 0 with 897 rules applied. Total rules applied 897 place count 3101 transition count 2601
Applied a total of 897 rules in 272 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74158 steps, run visited all 1 properties in 1587 ms. (steps per millisecond=46 )
Probabilistic random walk after 74158 steps, saw 73350 distinct states, run finished after 1592 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:40] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:48:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 2586 ms returned sat
[2022-05-20 01:48:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:48:55] [INFO ] [Real]Absence check using state equation in 8601 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 150 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:55] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:48:57] [INFO ] Implicit Places using invariants in 1626 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:57] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:48:59] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 3138 ms to find 0 implicit places.
[2022-05-20 01:48:59] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:48:59] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:49:00] [INFO ] Dead Transitions using invariants and state equation in 1568 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 85502 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85502 steps, saw 77619 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:49:04] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:49:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 218 ms returned sat
[2022-05-20 01:49:06] [INFO ] After 2267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:49:07] [INFO ] [Nat]Absence check using 1101 positive place invariants in 230 ms returned sat
[2022-05-20 01:49:17] [INFO ] After 11075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 897 times.
Drop transitions removed 897 transitions
Iterating global reduction 0 with 897 rules applied. Total rules applied 897 place count 3101 transition count 2601
Applied a total of 897 rules in 285 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74158 steps, run visited all 1 properties in 1619 ms. (steps per millisecond=45 )
Probabilistic random walk after 74158 steps, saw 73350 distinct states, run finished after 1624 ms. (steps per millisecond=45 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:49:20] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:49:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 2523 ms returned sat
[2022-05-20 01:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 01:49:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21 reset in 1826 ms.
Product exploration explored 100000 steps with 21 reset in 2221 ms.
Built C files in :
/tmp/ltsmin13368382192606294504
[2022-05-20 01:49:39] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:49:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13368382192606294504
Running compilation step : cd /tmp/ltsmin13368382192606294504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13368382192606294504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13368382192606294504;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 134 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:49:42] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:49:44] [INFO ] Implicit Places using invariants in 1640 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:49:44] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:49:45] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 3227 ms to find 0 implicit places.
[2022-05-20 01:49:45] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:49:45] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:49:47] [INFO ] Dead Transitions using invariants and state equation in 1634 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin13877467749153173352
[2022-05-20 01:49:47] [INFO ] Too many transitions (2601) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:49:47] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13877467749153173352
Running compilation step : cd /tmp/ltsmin13877467749153173352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13877467749153173352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13877467749153173352;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:49:50] [INFO ] Flatten gal took : 132 ms
[2022-05-20 01:49:50] [INFO ] Flatten gal took : 136 ms
[2022-05-20 01:49:50] [INFO ] Time to serialize gal into /tmp/LTL4679110807811457915.gal : 9 ms
[2022-05-20 01:49:50] [INFO ] Time to serialize properties into /tmp/LTL10455886416105026864.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4679110807811457915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10455886416105026864.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4679110...267
Read 1 LTL properties
Checking formula 0 : !((F("((p824==1)&&(p835==1))")))
Formula 0 simplified : !F"((p824==1)&&(p835==1))"
Detected timeout of ITS tools.
[2022-05-20 01:50:05] [INFO ] Flatten gal took : 138 ms
[2022-05-20 01:50:05] [INFO ] Applying decomposition
[2022-05-20 01:50:06] [INFO ] Flatten gal took : 136 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8421454349031986098.txt' '-o' '/tmp/graph8421454349031986098.bin' '-w' '/tmp/graph8421454349031986098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8421454349031986098.bin' '-l' '-1' '-v' '-w' '/tmp/graph8421454349031986098.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:50:06] [INFO ] Decomposing Gal with order
[2022-05-20 01:50:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:50:06] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:50:06] [INFO ] Flatten gal took : 130 ms
[2022-05-20 01:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 127 ms.
[2022-05-20 01:50:06] [INFO ] Time to serialize gal into /tmp/LTL1430569328065393899.gal : 22 ms
[2022-05-20 01:50:06] [INFO ] Time to serialize properties into /tmp/LTL15733861472934989094.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1430569328065393899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15733861472934989094.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1430569...246
Read 1 LTL properties
Checking formula 0 : !((F("((i15.i0.i3.u293.p824==1)&&(i15.i0.i3.u296.p835==1))")))
Formula 0 simplified : !F"((i15.i0.i3.u293.p824==1)&&(i15.i0.i3.u296.p835==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7255832244711726093
[2022-05-20 01:50:21] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7255832244711726093
Running compilation step : cd /tmp/ltsmin7255832244711726093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7255832244711726093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7255832244711726093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-14 finished in 133502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(!X(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0 U (F(G(!p0))&&(p0 U p1))))&&F(p2)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(G(X((p0 U X(p1)))))&&F(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!X(p0) U p1))))'
Found a SL insensitive property : ShieldPPPs-PT-100A-LTLFireability-10
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Support contains 4 out of 3103 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Applied a total of 4 rules in 264 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:50:25] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 01:50:27] [INFO ] Implicit Places using invariants in 1608 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:50:27] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:50:28] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 3197 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:50:28] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 01:50:30] [INFO ] Dead Transitions using invariants and state equation in 1449 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 3101/3103 places, 2601/2603 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3103 places, 2601/2603 transitions.
Running random walk in product with property : ShieldPPPs-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2002 1) (EQ s2013 1)), p0:(AND (EQ s141 1) (EQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 48 reset in 1742 ms.
Product exploration explored 100000 steps with 48 reset in 2136 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:50:35] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:50:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 211 ms returned sat
[2022-05-20 01:50:37] [INFO ] After 2183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:50:37] [INFO ] [Nat]Absence check using 1101 positive place invariants in 209 ms returned sat
[2022-05-20 01:50:39] [INFO ] After 1382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:50:39] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2022-05-20 01:50:39] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2022-05-20 01:50:39] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2022-05-20 01:50:40] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-20 01:50:40] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-20 01:50:40] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 0 ms to minimize.
[2022-05-20 01:50:40] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-20 01:50:40] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2022-05-20 01:50:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2685 ms
[2022-05-20 01:50:42] [INFO ] After 4135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-05-20 01:50:42] [INFO ] After 4905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 897 place count 3100 transition count 2600
Applied a total of 897 rules in 377 ms. Remains 3100 /3101 variables (removed 1) and now considering 2600/2601 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3101 places, 2600/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 134718 steps, run timeout after 3004 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134718 steps, saw 133565 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:50:45] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:50:46] [INFO ] [Real]Absence check using 1052 positive place invariants in 200 ms returned sat
[2022-05-20 01:50:46] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 11 ms returned sat
[2022-05-20 01:50:48] [INFO ] After 2409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:50:49] [INFO ] [Nat]Absence check using 1052 positive place invariants in 203 ms returned sat
[2022-05-20 01:50:49] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:50:53] [INFO ] After 4905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:50:57] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2022-05-20 01:50:57] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2022-05-20 01:50:58] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2022-05-20 01:50:58] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2022-05-20 01:50:58] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2022-05-20 01:50:58] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-20 01:50:59] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-20 01:50:59] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-20 01:50:59] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2022-05-20 01:50:59] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-20 01:50:59] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2022-05-20 01:51:00] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2022-05-20 01:51:00] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2022-05-20 01:51:00] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-20 01:51:00] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2022-05-20 01:51:01] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-05-20 01:51:01] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-05-20 01:51:01] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-05-20 01:51:01] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2022-05-20 01:51:02] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2022-05-20 01:51:02] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 01:51:02] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2022-05-20 01:51:02] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2022-05-20 01:51:02] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:51:03] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 0 ms to minimize.
[2022-05-20 01:51:03] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2022-05-20 01:51:03] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 3 ms to minimize.
[2022-05-20 01:51:03] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2022-05-20 01:51:04] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2022-05-20 01:51:04] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2022-05-20 01:51:04] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2022-05-20 01:51:13] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 16005 ms
[2022-05-20 01:51:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 01:51:13] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 103 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 167 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 121 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:51:13] [INFO ] Computed 1101 place invariants in 36 ms
[2022-05-20 01:51:15] [INFO ] Implicit Places using invariants in 1927 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:51:15] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:51:17] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 3834 ms to find 0 implicit places.
[2022-05-20 01:51:17] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:51:17] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:51:19] [INFO ] Dead Transitions using invariants and state equation in 1548 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 122 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:51:19] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 01:51:20] [INFO ] [Real]Absence check using 1052 positive place invariants in 192 ms returned sat
[2022-05-20 01:51:20] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 12 ms returned sat
[2022-05-20 01:51:21] [INFO ] After 2375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:51:22] [INFO ] [Nat]Absence check using 1052 positive place invariants in 197 ms returned sat
[2022-05-20 01:51:22] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 11 ms returned sat
[2022-05-20 01:51:27] [INFO ] After 5020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:51:31] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2022-05-20 01:51:31] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2022-05-20 01:51:31] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2022-05-20 01:51:32] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2022-05-20 01:51:32] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2022-05-20 01:51:32] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2022-05-20 01:51:32] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2022-05-20 01:51:33] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2022-05-20 01:51:33] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2022-05-20 01:51:33] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2022-05-20 01:51:33] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2022-05-20 01:51:34] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2022-05-20 01:51:34] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2022-05-20 01:51:34] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2022-05-20 01:51:34] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2022-05-20 01:51:35] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2022-05-20 01:51:35] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-05-20 01:51:35] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-05-20 01:51:35] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2022-05-20 01:51:36] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2022-05-20 01:51:36] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2022-05-20 01:51:36] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-20 01:51:36] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2022-05-20 01:51:36] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2022-05-20 01:51:37] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 0 ms to minimize.
[2022-05-20 01:51:37] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-05-20 01:51:37] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 2 ms to minimize.
[2022-05-20 01:51:37] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 01:51:38] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-05-20 01:51:38] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2022-05-20 01:51:38] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-05-20 01:51:47] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 16527 ms
[2022-05-20 01:51:47] [INFO ] After 25116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:51:47] [INFO ] After 25815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:51:48] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 01:51:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 2571 ms returned sat
[2022-05-20 01:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:52:03] [INFO ] [Real]Absence check using state equation in 8754 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 115 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:52:03] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 01:52:04] [INFO ] Implicit Places using invariants in 1563 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:52:04] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:52:06] [INFO ] Implicit Places using invariants and state equation in 1566 ms returned []
Implicit Place search using SMT with State Equation took 3130 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:52:06] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:52:07] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:52:08] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 01:52:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 206 ms returned sat
[2022-05-20 01:52:10] [INFO ] After 2043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:52:11] [INFO ] [Nat]Absence check using 1101 positive place invariants in 206 ms returned sat
[2022-05-20 01:52:12] [INFO ] After 1394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:52:13] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 0 ms to minimize.
[2022-05-20 01:52:13] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2022-05-20 01:52:13] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2022-05-20 01:52:13] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2022-05-20 01:52:13] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
[2022-05-20 01:52:14] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 0 ms to minimize.
[2022-05-20 01:52:14] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-05-20 01:52:14] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2022-05-20 01:52:14] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2022-05-20 01:52:14] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-05-20 01:52:15] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-20 01:52:15] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2022-05-20 01:52:15] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2022-05-20 01:52:15] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2022-05-20 01:52:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3000 ms
[2022-05-20 01:52:15] [INFO ] After 4459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-05-20 01:52:15] [INFO ] After 5227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 0 with 896 rules applied. Total rules applied 896 place count 3101 transition count 2601
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 897 place count 3100 transition count 2600
Applied a total of 897 rules in 398 ms. Remains 3100 /3101 variables (removed 1) and now considering 2600/2601 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3101 places, 2600/2601 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 119867 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119867 steps, saw 118820 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:52:19] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:52:20] [INFO ] [Real]Absence check using 1052 positive place invariants in 191 ms returned sat
[2022-05-20 01:52:20] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 9 ms returned sat
[2022-05-20 01:52:22] [INFO ] After 2332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:52:22] [INFO ] [Nat]Absence check using 1052 positive place invariants in 190 ms returned sat
[2022-05-20 01:52:22] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 9 ms returned sat
[2022-05-20 01:52:27] [INFO ] After 4810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:52:31] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2022-05-20 01:52:31] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2022-05-20 01:52:31] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2022-05-20 01:52:32] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2022-05-20 01:52:32] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2022-05-20 01:52:32] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2022-05-20 01:52:32] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2022-05-20 01:52:33] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2022-05-20 01:52:33] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2022-05-20 01:52:33] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2022-05-20 01:52:33] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2022-05-20 01:52:34] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2022-05-20 01:52:34] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2022-05-20 01:52:34] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2022-05-20 01:52:34] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2022-05-20 01:52:35] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2022-05-20 01:52:35] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-20 01:52:35] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-05-20 01:52:35] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2022-05-20 01:52:36] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2022-05-20 01:52:36] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2022-05-20 01:52:36] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-20 01:52:36] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2022-05-20 01:52:37] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2022-05-20 01:52:37] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2022-05-20 01:52:37] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2022-05-20 01:52:37] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2022-05-20 01:52:37] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-20 01:52:38] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2022-05-20 01:52:38] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-20 01:52:38] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-05-20 01:52:47] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 16046 ms
[2022-05-20 01:52:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 01:52:47] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 112 ms.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 119 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 121 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:52:47] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:52:49] [INFO ] Implicit Places using invariants in 1960 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:52:49] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:52:51] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 3888 ms to find 0 implicit places.
[2022-05-20 01:52:51] [INFO ] Redundant transitions in 75 ms returned []
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:52:51] [INFO ] Computed 1101 place invariants in 27 ms
[2022-05-20 01:52:52] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3100/3100 places, 2600/2600 transitions.
Applied a total of 0 rules in 141 ms. Remains 3100 /3100 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2600 rows 3100 cols
[2022-05-20 01:52:53] [INFO ] Computed 1101 place invariants in 33 ms
[2022-05-20 01:52:53] [INFO ] [Real]Absence check using 1052 positive place invariants in 191 ms returned sat
[2022-05-20 01:52:53] [INFO ] [Real]Absence check using 1052 positive and 49 generalized place invariants in 9 ms returned sat
[2022-05-20 01:52:55] [INFO ] After 2378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 01:52:56] [INFO ] [Nat]Absence check using 1052 positive place invariants in 198 ms returned sat
[2022-05-20 01:52:56] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 10 ms returned sat
[2022-05-20 01:53:00] [INFO ] After 4769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 01:53:04] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2022-05-20 01:53:05] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2022-05-20 01:53:05] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2022-05-20 01:53:05] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2022-05-20 01:53:05] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2022-05-20 01:53:06] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2022-05-20 01:53:06] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2022-05-20 01:53:06] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2022-05-20 01:53:06] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2022-05-20 01:53:07] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2022-05-20 01:53:07] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2022-05-20 01:53:07] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-20 01:53:07] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-05-20 01:53:08] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2022-05-20 01:53:08] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2022-05-20 01:53:08] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2022-05-20 01:53:08] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2022-05-20 01:53:09] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-20 01:53:09] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2022-05-20 01:53:09] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2022-05-20 01:53:09] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 01:53:10] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 0 ms to minimize.
[2022-05-20 01:53:10] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2022-05-20 01:53:10] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2022-05-20 01:53:10] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 0 ms to minimize.
[2022-05-20 01:53:11] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 0 ms to minimize.
[2022-05-20 01:53:11] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2022-05-20 01:53:11] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-20 01:53:11] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2022-05-20 01:53:11] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2022-05-20 01:53:12] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2022-05-20 01:53:21] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 16597 ms
[2022-05-20 01:53:21] [INFO ] After 24971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-20 01:53:21] [INFO ] After 25680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 301 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:53:21] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 01:53:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 2519 ms returned sat
[2022-05-20 01:53:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 01:53:36] [INFO ] [Real]Absence check using state equation in 8777 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 48 reset in 1697 ms.
Product exploration explored 100000 steps with 49 reset in 2047 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (OR (NOT p1) p0), true]
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 132 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2022-05-20 01:53:41] [INFO ] Redundant transitions in 73 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:53:41] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:53:42] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Product exploration explored 100000 steps with 48 reset in 1733 ms.
Product exploration explored 100000 steps with 47 reset in 2097 ms.
Built C files in :
/tmp/ltsmin7306514376043428349
[2022-05-20 01:53:46] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7306514376043428349
Running compilation step : cd /tmp/ltsmin7306514376043428349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7306514376043428349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7306514376043428349;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 3101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 113 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:53:49] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 01:53:52] [INFO ] Implicit Places using invariants in 2981 ms returned []
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:53:52] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:53:54] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 4629 ms to find 0 implicit places.
// Phase 1: matrix 2601 rows 3101 cols
[2022-05-20 01:53:54] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 01:53:55] [INFO ] Dead Transitions using invariants and state equation in 1531 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3101/3101 places, 2601/2601 transitions.
Built C files in :
/tmp/ltsmin10301566056189572257
[2022-05-20 01:53:56] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10301566056189572257
Running compilation step : cd /tmp/ltsmin10301566056189572257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10301566056189572257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10301566056189572257;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 01:53:59] [INFO ] Flatten gal took : 129 ms
[2022-05-20 01:53:59] [INFO ] Flatten gal took : 132 ms
[2022-05-20 01:53:59] [INFO ] Time to serialize gal into /tmp/LTL6092452600546626302.gal : 8 ms
[2022-05-20 01:53:59] [INFO ] Time to serialize properties into /tmp/LTL5915674859793635236.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6092452600546626302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5915674859793635236.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6092452...266
Read 1 LTL properties
Checking formula 0 : !((X(G((!(X("((p141==1)&&(p143==1))")))U("((p2002==1)&&(p2013==1))")))))
Formula 0 simplified : !XG(!X"((p141==1)&&(p143==1))" U "((p2002==1)&&(p2013==1))")
Detected timeout of ITS tools.
[2022-05-20 01:54:14] [INFO ] Flatten gal took : 151 ms
[2022-05-20 01:54:14] [INFO ] Applying decomposition
[2022-05-20 01:54:14] [INFO ] Flatten gal took : 131 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16112864175702790328.txt' '-o' '/tmp/graph16112864175702790328.bin' '-w' '/tmp/graph16112864175702790328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16112864175702790328.bin' '-l' '-1' '-v' '-w' '/tmp/graph16112864175702790328.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:54:14] [INFO ] Decomposing Gal with order
[2022-05-20 01:54:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:54:15] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:54:15] [INFO ] Flatten gal took : 123 ms
[2022-05-20 01:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 119 ms.
[2022-05-20 01:54:15] [INFO ] Time to serialize gal into /tmp/LTL12130258784730269867.gal : 29 ms
[2022-05-20 01:54:15] [INFO ] Time to serialize properties into /tmp/LTL11868328930807793178.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12130258784730269867.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11868328930807793178.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1213025...247
Read 1 LTL properties
Checking formula 0 : !((X(G((!(X("((i2.i1.i3.u50.p141==1)&&(i2.i1.i2.u51.p143==1))")))U("((i34.u711.p2002==1)&&(i34.u714.p2013==1))")))))
Formula 0 simplified : !XG(!X"((i2.i1.i3.u50.p141==1)&&(i2.i1.i2.u51.p143==1))" U "((i34.u711.p2002==1)&&(i34.u714.p2013==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15908633052669537143
[2022-05-20 01:54:30] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15908633052669537143
Running compilation step : cd /tmp/ltsmin15908633052669537143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15908633052669537143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15908633052669537143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPs-PT-100A-LTLFireability-10 finished in 248333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&F(!p1)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2022-05-20 01:54:35] [INFO ] Flatten gal took : 136 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4440272352621290852
[2022-05-20 01:54:35] [INFO ] Too many transitions (2603) to apply POR reductions. Disabling POR matrices.
[2022-05-20 01:54:35] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4440272352621290852
Running compilation step : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 01:54:35] [INFO ] Applying decomposition
[2022-05-20 01:54:35] [INFO ] Flatten gal took : 280 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18266008710172979318.txt' '-o' '/tmp/graph18266008710172979318.bin' '-w' '/tmp/graph18266008710172979318.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18266008710172979318.bin' '-l' '-1' '-v' '-w' '/tmp/graph18266008710172979318.weights' '-q' '0' '-e' '0.001'
[2022-05-20 01:54:35] [INFO ] Decomposing Gal with order
[2022-05-20 01:54:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 01:54:36] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 01:54:36] [INFO ] Flatten gal took : 273 ms
[2022-05-20 01:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 226 ms.
[2022-05-20 01:54:37] [INFO ] Time to serialize gal into /tmp/LTLFireability5861927918530082955.gal : 35 ms
[2022-05-20 01:54:37] [INFO ] Time to serialize properties into /tmp/LTLFireability6481318217359792282.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5861927918530082955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6481318217359792282.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 6 LTL properties
Checking formula 0 : !(((G("(((i30.i1.i0.u560.p1577==1)&&(i43.i0.i1.u796.p2243==1))&&(i43.i0.i1.u800.p2255==1))"))U(X(X(!(X("((i23.i1.i2.u420.p1185==1)&&(i...187
Formula 0 simplified : !(G"(((i30.i1.i0.u560.p1577==1)&&(i43.i0.i1.u796.p2243==1))&&(i43.i0.i1.u800.p2255==1))" U XX!X"((i23.i1.i2.u420.p1185==1)&&(i23.i1....175
Compilation finished in 7405 ms.
Running link step : cd /tmp/ltsmin4440272352621290852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U X(X(!X((LTLAPp1==true)))))' '--buchi-type=spotba'
LTSmin run took 4360 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>(((LTLAPp2==true) U (<>([](!(LTLAPp2==true)))&&((LTLAPp2==true) U (LTLAPp3==true)))))&&<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>(((LTLAPp2==true) U (<>([](!(LTLAPp2==true)))&&((LTLAPp2==true) U (LTLAPp3==true)))))&&<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([]([](X(((LTLAPp5==true) U X((LTLAPp6==true))))))&&<>((LTLAPp7==true)))))' '--buchi-type=spotba'
LTSmin run took 14862 ms.
FORMULA ShieldPPPs-PT-100A-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((!X((LTLAPp8==true)) U (LTLAPp9==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((!X((LTLAPp8==true)) U (LTLAPp9==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp10==true) U ([]((LTLAPp10==true))||((LTLAPp10==true)&&<>(!(LTLAPp11==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 02:24:02] [INFO ] Applying decomposition
[2022-05-20 02:24:03] [INFO ] Flatten gal took : 687 ms
[2022-05-20 02:24:03] [INFO ] Decomposing Gal with order
[2022-05-20 02:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 02:24:05] [INFO ] Removed a total of 900 redundant transitions.
[2022-05-20 02:24:05] [INFO ] Flatten gal took : 682 ms
[2022-05-20 02:24:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1200 labels/synchronizations in 233 ms.
[2022-05-20 02:24:06] [INFO ] Time to serialize gal into /tmp/LTLFireability17988248280765089911.gal : 28 ms
[2022-05-20 02:24:06] [INFO ] Time to serialize properties into /tmp/LTLFireability16843164294099538382.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17988248280765089911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16843164294099538382.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 4 LTL properties
Checking formula 0 : !(((F(("((i722.u1265.p2798==1)&&(u1274.p2819==1))")U((F(G(!("((i722.u1265.p2798==1)&&(u1274.p2819==1))"))))&&(("((i722.u1265.p2798==1)...252
Formula 0 simplified : !(F("((i722.u1265.p2798==1)&&(u1274.p2819==1))" U (FG!"((i722.u1265.p2798==1)&&(u1274.p2819==1))" & ("((i722.u1265.p2798==1)&&(u1274...238
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp10==true) U ([]((LTLAPp10==true))||((LTLAPp10==true)&&<>(!(LTLAPp11==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin4440272352621290852;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp12==true))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-100A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-100A, 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 r222-tall-165286025300516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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