fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r216-tall-162098205100485
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ShieldIIPt-PT-050A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4757.111 736173.00 1586086.00 50447.80 FFFFFFFFFFFFTFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 12:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 12:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 265K May 5 16:52 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 ShieldIIPt-PT-050A-00
FORMULA_NAME ShieldIIPt-PT-050A-01
FORMULA_NAME ShieldIIPt-PT-050A-02
FORMULA_NAME ShieldIIPt-PT-050A-03
FORMULA_NAME ShieldIIPt-PT-050A-04
FORMULA_NAME ShieldIIPt-PT-050A-05
FORMULA_NAME ShieldIIPt-PT-050A-06
FORMULA_NAME ShieldIIPt-PT-050A-07
FORMULA_NAME ShieldIIPt-PT-050A-08
FORMULA_NAME ShieldIIPt-PT-050A-09
FORMULA_NAME ShieldIIPt-PT-050A-10
FORMULA_NAME ShieldIIPt-PT-050A-11
FORMULA_NAME ShieldIIPt-PT-050A-12
FORMULA_NAME ShieldIIPt-PT-050A-13
FORMULA_NAME ShieldIIPt-PT-050A-14
FORMULA_NAME ShieldIIPt-PT-050A-15

=== Now, execution of the tool begins

BK_START 1621111865148

Running Version 0
[2021-05-15 20:51:06] [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]
[2021-05-15 20:51:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 20:51:06] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2021-05-15 20:51:06] [INFO ] Transformed 953 places.
[2021-05-15 20:51:06] [INFO ] Transformed 703 transitions.
[2021-05-15 20:51:06] [INFO ] Found NUPN structural information;
[2021-05-15 20:51:06] [INFO ] Parsed PT model containing 953 places and 703 transitions in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 20:51:07] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 56 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 93 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:07] [INFO ] Computed 451 place invariants in 30 ms
[2021-05-15 20:51:07] [INFO ] Implicit Places using invariants in 739 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:07] [INFO ] Computed 451 place invariants in 12 ms
[2021-05-15 20:51:09] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:09] [INFO ] Computed 451 place invariants in 4 ms
[2021-05-15 20:51:09] [INFO ] Dead Transitions using invariants and state equation in 517 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
[2021-05-15 20:51:09] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-15 20:51:09] [INFO ] Flatten gal took : 187 ms
FORMULA ShieldIIPt-PT-050A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 20:51:10] [INFO ] Flatten gal took : 90 ms
[2021-05-15 20:51:10] [INFO ] Input system was already deterministic with 702 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1169 ms. (steps per millisecond=85 ) properties (out of 31) seen :11
Running SMT prover for 20 properties.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:11] [INFO ] Computed 451 place invariants in 3 ms
[2021-05-15 20:51:11] [INFO ] [Real]Absence check using 451 positive place invariants in 81 ms returned sat
[2021-05-15 20:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:51:12] [INFO ] [Real]Absence check using state equation in 534 ms returned unsat :0 sat :3 real:17
Attempting to minimize the solution found.
Minimization took 110 ms.
[2021-05-15 20:51:12] [INFO ] SMT Verify possible in real domain returnedunsat :0 sat :0 real:20
[2021-05-15 20:51:13] [INFO ] [Nat]Absence check using 451 positive place invariants in 64 ms returned sat
[2021-05-15 20:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:51:14] [INFO ] [Nat]Absence check using state equation in 821 ms returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 535 ms.
[2021-05-15 20:51:14] [INFO ] SMT Verify possible in nat domain returned unsat :0 sat :20
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 134 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:51:15] [INFO ] Computed 451 place invariants in 3 ms
[2021-05-15 20:51:15] [INFO ] Implicit Places using invariants in 684 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 688 ms to find 2 implicit places.
[2021-05-15 20:51:15] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:51:15] [INFO ] Computed 449 place invariants in 3 ms
[2021-05-15 20:51:16] [INFO ] Dead Transitions using invariants and state equation in 502 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 61 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:51:16] [INFO ] Computed 449 place invariants in 3 ms
[2021-05-15 20:51:17] [INFO ] Implicit Places using invariants in 574 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 575 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 58 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:51:17] [INFO ] Computed 448 place invariants in 7 ms
[2021-05-15 20:51:17] [INFO ] Implicit Places using invariants in 613 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:51:17] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:51:18] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s565 1), p1:(AND (EQ s709 1) (EQ s718 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 1030 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-050A-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-01 finished in 4959 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(G(p1))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 14 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:19] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:51:20] [INFO ] Implicit Places using invariants in 605 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:20] [INFO ] Computed 451 place invariants in 5 ms
[2021-05-15 20:51:21] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:21] [INFO ] Computed 451 place invariants in 3 ms
[2021-05-15 20:51:22] [INFO ] Dead Transitions using invariants and state equation in 539 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050A-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s81 1) (EQ s92 1)), p2:(NEQ s489 1), p1:(OR (NEQ s487 1) (NEQ s512 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 952 ms.
Product exploration explored 100000 steps with 0 reset in 1301 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1009 ms.
Product exploration explored 100000 steps with 0 reset in 1208 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 702
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 702
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 121 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2021-05-15 20:51:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:51:28] [INFO ] Computed 451 place invariants in 5 ms
[2021-05-15 20:51:28] [INFO ] Dead Transitions using invariants and state equation in 568 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Product exploration explored 100000 steps with 0 reset in 973 ms.
Product exploration explored 100000 steps with 0 reset in 1188 ms.
[2021-05-15 20:51:31] [INFO ] Flatten gal took : 67 ms
[2021-05-15 20:51:31] [INFO ] Flatten gal took : 64 ms
[2021-05-15 20:51:31] [INFO ] Time to serialize gal into /tmp/LTL10899279202263362912.gal : 13 ms
[2021-05-15 20:51:31] [INFO ] Time to serialize properties into /tmp/LTL11385504330865237860.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10899279202263362912.gal, -t, CGAL, -LTL, /tmp/LTL11385504330865237860.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10899279202263362912.gal -t CGAL -LTL /tmp/LTL11385504330865237860.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((F("((p81==1)&&(p92==1))"))||(X(G("((p487==0)||(p512==0))"))))||(G("(p489==0)"))))
Formula 0 simplified : !(F"((p81==1)&&(p92==1))" | XG"((p487==0)||(p512==0))" | G"(p489==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:51:46] [INFO ] Flatten gal took : 116 ms
[2021-05-15 20:51:46] [INFO ] Applying decomposition
[2021-05-15 20:51:46] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10666083359234739825.txt, -o, /tmp/graph10666083359234739825.bin, -w, /tmp/graph10666083359234739825.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10666083359234739825.bin, -l, -1, -v, -w, /tmp/graph10666083359234739825.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:51:46] [INFO ] Decomposing Gal with order
[2021-05-15 20:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:51:46] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-15 20:51:47] [INFO ] Flatten gal took : 113 ms
[2021-05-15 20:51:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 46 ms.
[2021-05-15 20:51:47] [INFO ] Time to serialize gal into /tmp/LTL18278759651216863008.gal : 17 ms
[2021-05-15 20:51:47] [INFO ] Time to serialize properties into /tmp/LTL13609377470734927516.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18278759651216863008.gal, -t, CGAL, -LTL, /tmp/LTL13609377470734927516.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18278759651216863008.gal -t CGAL -LTL /tmp/LTL13609377470734927516.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((F("((i2.i1.i2.u34.p81==1)&&(i2.i1.i2.u38.p92==1))"))||(X(G("((i14.i1.i1.u204.p487==0)||(i14.i1.i1.u215.p512==0))"))))||(G("(i13.u205.p489==0)"))))
Formula 0 simplified : !(F"((i2.i1.i2.u34.p81==1)&&(i2.i1.i2.u38.p92==1))" | XG"((i14.i1.i1.u204.p487==0)||(i14.i1.i1.u215.p512==0))" | G"(i13.u205.p489==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6644084684758758476
[2021-05-15 20:52:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6644084684758758476
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6644084684758758476]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6644084684758758476] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6644084684758758476] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-050A-02 finished in 43264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||((F(p2)&&p1) U p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 57 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:52:03] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:52:03] [INFO ] Implicit Places using invariants in 525 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 529 ms to find 2 implicit places.
[2021-05-15 20:52:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:52:03] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:52:04] [INFO ] Dead Transitions using invariants and state equation in 523 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 48 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:52:04] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:52:04] [INFO ] Implicit Places using invariants in 525 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 526 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 43 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:04] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:52:05] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:05] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:52:06] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050A-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (EQ s8 1) (EQ s19 1)), p0:(AND (EQ s425 1) (EQ s427 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 901 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 7 in 0 ms.
FORMULA ShieldIIPt-PT-050A-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-03 finished in 4172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p0)) U (p1&&X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 13 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:52:07] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:52:07] [INFO ] Implicit Places using invariants in 555 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:52:07] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:52:08] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:52:08] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:52:09] [INFO ] Dead Transitions using invariants and state equation in 488 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 3469 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-050A-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s793 1) (EQ s808 1)) (AND (EQ s611 1) (EQ s628 1))), p0:(AND (OR (NEQ s793 1) (NEQ s808 1)) (OR (NEQ s631 1) (NEQ s644 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1463 steps with 0 reset in 18 ms.
FORMULA ShieldIIPt-PT-050A-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-04 finished in 5539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 40 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:52:12] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:52:13] [INFO ] Implicit Places using invariants in 585 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 586 ms to find 2 implicit places.
[2021-05-15 20:52:13] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:52:13] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:52:14] [INFO ] Dead Transitions using invariants and state equation in 537 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 27 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:52:14] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:52:14] [INFO ] Implicit Places using invariants in 510 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 520 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 32 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:14] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:52:15] [INFO ] Implicit Places using invariants in 522 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:15] [INFO ] Computed 448 place invariants in 12 ms
[2021-05-15 20:52:16] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 2616 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050A-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s419 1), p1:(OR (NEQ s174 1) (NEQ s191 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 0 reset in 849 ms.
Product exploration explored 100000 steps with 0 reset in 1124 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 917 ms.
Product exploration explored 100000 steps with 0 reset in 1167 ms.
[2021-05-15 20:52:23] [INFO ] Flatten gal took : 46 ms
[2021-05-15 20:52:23] [INFO ] Flatten gal took : 44 ms
[2021-05-15 20:52:23] [INFO ] Time to serialize gal into /tmp/LTL4242216468311436783.gal : 5 ms
[2021-05-15 20:52:24] [INFO ] Time to serialize properties into /tmp/LTL11885757506786566234.ltl : 1355 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4242216468311436783.gal, -t, CGAL, -LTL, /tmp/LTL11885757506786566234.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4242216468311436783.gal -t CGAL -LTL /tmp/LTL11885757506786566234.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(p419==0)"))&&(F(G("((p174==0)||(p191==0))"))))))
Formula 0 simplified : !G(F"(p419==0)" & FG"((p174==0)||(p191==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:52:39] [INFO ] Flatten gal took : 43 ms
[2021-05-15 20:52:39] [INFO ] Applying decomposition
[2021-05-15 20:52:39] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14264412111096752116.txt, -o, /tmp/graph14264412111096752116.bin, -w, /tmp/graph14264412111096752116.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14264412111096752116.bin, -l, -1, -v, -w, /tmp/graph14264412111096752116.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:52:39] [INFO ] Decomposing Gal with order
[2021-05-15 20:52:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:52:39] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-15 20:52:39] [INFO ] Flatten gal took : 58 ms
[2021-05-15 20:52:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2021-05-15 20:52:41] [INFO ] Time to serialize gal into /tmp/LTL4503953080076413520.gal : 2077 ms
[2021-05-15 20:52:41] [INFO ] Time to serialize properties into /tmp/LTL12979140571888576758.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4503953080076413520.gal, -t, CGAL, -LTL, /tmp/LTL12979140571888576758.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4503953080076413520.gal -t CGAL -LTL /tmp/LTL12979140571888576758.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("(i12.u176.p419==0)"))&&(F(G("((i5.i1.i1.u73.p174==0)||(i5.i1.i1.u80.p191==0))"))))))
Formula 0 simplified : !G(F"(i12.u176.p419==0)" & FG"((i5.i1.i1.u73.p174==0)||(i5.i1.i1.u80.p191==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
110 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.20607,42152,1,0,47479,555,4219,99762,120,3871,100325
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-050A-05 finished in 30303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 952 transition count 700
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 950 transition count 700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 948 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 948 transition count 698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 947 transition count 698
Applied a total of 8 rules in 55 ms. Remains 947 /953 variables (removed 6) and now considering 698/702 (removed 4) transitions.
// Phase 1: matrix 698 rows 947 cols
[2021-05-15 20:52:43] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:52:43] [INFO ] Implicit Places using invariants in 488 ms returned [936]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
[2021-05-15 20:52:43] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:52:43] [INFO ] Computed 448 place invariants in 12 ms
[2021-05-15 20:52:44] [INFO ] Dead Transitions using invariants and state equation in 529 ms returned []
Starting structural reductions, iteration 1 : 946/953 places, 698/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 945 transition count 697
Applied a total of 2 rules in 33 ms. Remains 945 /946 variables (removed 1) and now considering 697/698 (removed 1) transitions.
// Phase 1: matrix 697 rows 945 cols
[2021-05-15 20:52:44] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:52:44] [INFO ] Implicit Places using invariants in 569 ms returned []
// Phase 1: matrix 697 rows 945 cols
[2021-05-15 20:52:44] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:52:45] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 945/953 places, 697/702 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s361 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 936 ms.
Product exploration explored 100000 steps with 0 reset in 1153 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 908 ms.
Product exploration explored 100000 steps with 0 reset in 1126 ms.
[2021-05-15 20:52:57] [INFO ] Flatten gal took : 27 ms
[2021-05-15 20:52:57] [INFO ] Flatten gal took : 28 ms
[2021-05-15 20:52:57] [INFO ] Time to serialize gal into /tmp/LTL610652085608782120.gal : 3 ms
[2021-05-15 20:52:57] [INFO ] Time to serialize properties into /tmp/LTL9709095270382864455.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL610652085608782120.gal, -t, CGAL, -LTL, /tmp/LTL9709095270382864455.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL610652085608782120.gal -t CGAL -LTL /tmp/LTL9709095270382864455.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(p362==0)")))
Formula 0 simplified : !G"(p362==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:53:12] [INFO ] Flatten gal took : 73 ms
[2021-05-15 20:53:12] [INFO ] Applying decomposition
[2021-05-15 20:53:12] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6570493401021457613.txt, -o, /tmp/graph6570493401021457613.bin, -w, /tmp/graph6570493401021457613.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6570493401021457613.bin, -l, -1, -v, -w, /tmp/graph6570493401021457613.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:53:12] [INFO ] Decomposing Gal with order
[2021-05-15 20:53:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:53:13] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-15 20:53:13] [INFO ] Flatten gal took : 53 ms
[2021-05-15 20:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 20:53:13] [INFO ] Time to serialize gal into /tmp/LTL18050658097280801487.gal : 7 ms
[2021-05-15 20:53:13] [INFO ] Time to serialize properties into /tmp/LTL5508187839433038359.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18050658097280801487.gal, -t, CGAL, -LTL, /tmp/LTL5508187839433038359.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18050658097280801487.gal -t CGAL -LTL /tmp/LTL5508187839433038359.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("(i10.i1.i0.u152.p362==0)")))
Formula 0 simplified : !G"(i10.i1.i0.u152.p362==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
86 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.964105,36292,1,0,39657,148,3167,74119,115,614,75191
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-06 finished in 30838 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 36 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:53:14] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:14] [INFO ] Implicit Places using invariants in 592 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 593 ms to find 2 implicit places.
[2021-05-15 20:53:14] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:53:14] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:53:15] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 24 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:53:15] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:53:15] [INFO ] Implicit Places using invariants in 596 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 605 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 45 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:15] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:53:16] [INFO ] Implicit Places using invariants in 596 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:53:16] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:53:17] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 9589 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s635 1) (EQ s646 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 836 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldIIPt-PT-050A-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-07 finished in 13824 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X((p0||X(G(p1))))||(p2 U (p3||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:27] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:28] [INFO ] Implicit Places using invariants in 563 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:28] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:53:29] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:29] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:53:29] [INFO ] Dead Transitions using invariants and state equation in 483 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-050A-08 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p2 p1), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p3 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p3, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p3:(AND (OR (NEQ s725 1) (NEQ s742 1)) (NEQ s168 1)), p2:(NEQ s168 1), p1:(EQ s263 1), p0:(AND (EQ s924 1) (EQ s949 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 919 ms.
Product exploration explored 100000 steps with 0 reset in 1096 ms.
Knowledge obtained : [p3, p2, (NOT p1), (NOT p0)]
java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, p3], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:138)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:112)
at fr.lip6.move.gal.application.SpotRunner.buildAutomaton(SpotRunner.java:463)
at fr.lip6.move.gal.application.SpotRunner.isProductEmpty(SpotRunner.java:613)
at fr.lip6.move.gal.application.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:384)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:174)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 961 ms.
Product exploration explored 100000 steps with 0 reset in 1202 ms.
Applying partial POR strategy [false, false, false, false, true, true, false]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 6 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 702
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 702
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 49 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2021-05-15 20:53:45] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:53:45] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:53:46] [INFO ] Dead Transitions using invariants and state equation in 469 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Product exploration explored 100000 steps with 0 reset in 908 ms.
Product exploration explored 100000 steps with 0 reset in 1164 ms.
[2021-05-15 20:53:48] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:53:48] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:53:48] [INFO ] Time to serialize gal into /tmp/LTL9130369373638428351.gal : 3 ms
[2021-05-15 20:53:55] [INFO ] Time to serialize properties into /tmp/LTL6238936188274831152.ltl : 7068 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9130369373638428351.gal, -t, CGAL, -LTL, /tmp/LTL6238936188274831152.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9130369373638428351.gal -t CGAL -LTL /tmp/LTL6238936188274831152.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((X(("((p924==1)&&(p949==1))")||(X(G("(p263==1)")))))||(("(p168==0)")U(("(((p725==0)||(p742==0))&&(p168==0))")||(G("(p168==0)")))))))
Formula 0 simplified : !G(X("((p924==1)&&(p949==1))" | XG"(p263==1)") | ("(p168==0)" U ("(((p725==0)||(p742==0))&&(p168==0))" | G"(p168==0)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:54:10] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:54:10] [INFO ] Applying decomposition
[2021-05-15 20:54:10] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3371842344514406323.txt, -o, /tmp/graph3371842344514406323.bin, -w, /tmp/graph3371842344514406323.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3371842344514406323.bin, -l, -1, -v, -w, /tmp/graph3371842344514406323.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:54:10] [INFO ] Decomposing Gal with order
[2021-05-15 20:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:54:10] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-15 20:54:10] [INFO ] Flatten gal took : 47 ms
[2021-05-15 20:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-15 20:54:10] [INFO ] Time to serialize gal into /tmp/LTL11533791305801674671.gal : 12 ms
[2021-05-15 20:54:10] [INFO ] Time to serialize properties into /tmp/LTL16619745256505356446.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11533791305801674671.gal, -t, CGAL, -LTL, /tmp/LTL16619745256505356446.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11533791305801674671.gal -t CGAL -LTL /tmp/LTL16619745256505356446.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((X(("((i27.u388.p924==1)&&(i27.u399.p949==1))")||(X(G("(i7.u110.p263==1)")))))||(("(i4.i1.i1.u70.p168==0)")U(("(((i21.u305.p725==0)||(i21.u312.p742==0))&&(i4.i1.i1.u70.p168==0))")||(G("(i4.i1.i1.u70.p168==0)")))))))
Formula 0 simplified : !G(X("((i27.u388.p924==1)&&(i27.u399.p949==1))" | XG"(i7.u110.p263==1)") | ("(i4.i1.i1.u70.p168==0)" U ("(((i21.u305.p725==0)||(i21.u312.p742==0))&&(i4.i1.i1.u70.p168==0))" | G"(i4.i1.i1.u70.p168==0)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
48 unique states visited
10 strongly connected components in search stack
90 transitions explored
48 items max in DFS search stack
1482 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.9248,500112,1,0,958898,454,4467,3.06147e+06,122,2126,401496
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-08 finished in 57946 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:25] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:54:26] [INFO ] Implicit Places using invariants in 503 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:26] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:54:27] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:27] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:54:27] [INFO ] Dead Transitions using invariants and state equation in 507 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s109 1) (NEQ s124 1)), p0:(AND (EQ s652 1) (EQ s661 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 844 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA ShieldIIPt-PT-050A-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-09 finished in 2970 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||X(F(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 12 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:28] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:54:29] [INFO ] Implicit Places using invariants in 534 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:29] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:54:30] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:30] [INFO ] Computed 451 place invariants in 4 ms
[2021-05-15 20:54:30] [INFO ] Dead Transitions using invariants and state equation in 463 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050A-10 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s645 1), p1:(EQ s875 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null][false]]
Product exploration explored 100000 steps with 0 reset in 879 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 2 ms.
FORMULA ShieldIIPt-PT-050A-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-10 finished in 3001 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:31] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:54:32] [INFO ] Implicit Places using invariants in 499 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:32] [INFO ] Computed 451 place invariants in 7 ms
[2021-05-15 20:54:33] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:33] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:54:33] [INFO ] Dead Transitions using invariants and state equation in 501 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 9806 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s621 0) (NEQ s627 0) (NEQ s629 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 849 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA ShieldIIPt-PT-050A-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050A-11 finished in 12654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:44] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:54:44] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:45] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:54:46] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:54:46] [INFO ] Computed 451 place invariants in 10 ms
[2021-05-15 20:54:46] [INFO ] Dead Transitions using invariants and state equation in 544 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s4 0) (EQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2935 ms.
Product exploration explored 100000 steps with 33333 reset in 3059 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 2917 ms.
Product exploration explored 100000 steps with 33333 reset in 3055 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 702
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 702
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 33 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2021-05-15 20:55:03] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:55:03] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:55:04] [INFO ] Dead Transitions using invariants and state equation in 579 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Product exploration explored 100000 steps with 33333 reset in 7907 ms.
Product exploration explored 100000 steps with 33333 reset in 8027 ms.
[2021-05-15 20:55:20] [INFO ] Flatten gal took : 37 ms
[2021-05-15 20:55:20] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:55:20] [INFO ] Time to serialize gal into /tmp/LTL17776392157430442287.gal : 3 ms
[2021-05-15 20:55:20] [INFO ] Time to serialize properties into /tmp/LTL7070510581009904737.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17776392157430442287.gal, -t, CGAL, -LTL, /tmp/LTL7070510581009904737.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17776392157430442287.gal -t CGAL -LTL /tmp/LTL7070510581009904737.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p4==0)||(p17==0))")))))
Formula 0 simplified : !XXF"((p4==0)||(p17==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
945 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.5639,156432,1,0,7,757301,20,0,23561,320911,12
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-050A-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-12 finished in 45775 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 700
Applied a total of 4 rules in 68 ms. Remains 951 /953 variables (removed 2) and now considering 700/702 (removed 2) transitions.
// Phase 1: matrix 700 rows 951 cols
[2021-05-15 20:55:36] [INFO ] Computed 451 place invariants in 1 ms
[2021-05-15 20:55:37] [INFO ] Implicit Places using invariants in 581 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 591 ms to find 2 implicit places.
[2021-05-15 20:55:37] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 700 rows 949 cols
[2021-05-15 20:55:37] [INFO ] Computed 449 place invariants in 2 ms
[2021-05-15 20:55:37] [INFO ] Dead Transitions using invariants and state equation in 488 ms returned []
Starting structural reductions, iteration 1 : 949/953 places, 700/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 22 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2021-05-15 20:55:37] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:55:38] [INFO ] Implicit Places using invariants in 507 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 537 ms to find 1 implicit places.
Starting structural reductions, iteration 2 : 947/953 places, 699/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 29 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:55:38] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:55:39] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:55:39] [INFO ] Computed 448 place invariants in 2 ms
[2021-05-15 20:55:39] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 946/953 places, 698/702 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s234 1) (NEQ s243 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 851 ms.
Product exploration explored 100000 steps with 0 reset in 1098 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 870 ms.
Product exploration explored 100000 steps with 0 reset in 1079 ms.
[2021-05-15 20:55:44] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:55:44] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:55:44] [INFO ] Time to serialize gal into /tmp/LTL8500926354659691177.gal : 3 ms
[2021-05-15 20:55:55] [INFO ] Time to serialize properties into /tmp/LTL4684576445289374726.ltl : 11323 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8500926354659691177.gal, -t, CGAL, -LTL, /tmp/LTL4684576445289374726.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8500926354659691177.gal -t CGAL -LTL /tmp/LTL4684576445289374726.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p234==0)||(p243==0))")))
Formula 0 simplified : !G"((p234==0)||(p243==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:56:10] [INFO ] Flatten gal took : 41 ms
[2021-05-15 20:56:10] [INFO ] Applying decomposition
[2021-05-15 20:56:10] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12347146266029802093.txt, -o, /tmp/graph12347146266029802093.bin, -w, /tmp/graph12347146266029802093.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12347146266029802093.bin, -l, -1, -v, -w, /tmp/graph12347146266029802093.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:56:14] [INFO ] Decomposing Gal with order
[2021-05-15 20:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:56:14] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-15 20:56:14] [INFO ] Flatten gal took : 56 ms
[2021-05-15 20:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 39 ms.
[2021-05-15 20:56:14] [INFO ] Time to serialize gal into /tmp/LTL8299326461867705317.gal : 7 ms
[2021-05-15 20:56:14] [INFO ] Time to serialize properties into /tmp/LTL7191078155929967958.ltl : 135 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8299326461867705317.gal, -t, CGAL, -LTL, /tmp/LTL7191078155929967958.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8299326461867705317.gal -t CGAL -LTL /tmp/LTL7191078155929967958.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((i6.u98.p234==0)||(i6.u101.p243==0))")))
Formula 0 simplified : !G"((i6.u98.p234==0)||(i6.u101.p243==0))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
991 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.0208,422272,1,0,988041,608,4193,2.40373e+06,119,4657,461844
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-13 finished in 57347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 952 transition count 700
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 950 transition count 700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 948 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 948 transition count 698
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 947 transition count 698
Applied a total of 8 rules in 39 ms. Remains 947 /953 variables (removed 6) and now considering 698/702 (removed 4) transitions.
// Phase 1: matrix 698 rows 947 cols
[2021-05-15 20:56:33] [INFO ] Computed 449 place invariants in 1 ms
[2021-05-15 20:56:33] [INFO ] Implicit Places using invariants in 535 ms returned [936]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 554 ms to find 1 implicit places.
[2021-05-15 20:56:33] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 698 rows 946 cols
[2021-05-15 20:56:33] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:56:34] [INFO ] Dead Transitions using invariants and state equation in 476 ms returned []
Starting structural reductions, iteration 1 : 946/953 places, 698/702 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 945 transition count 697
Applied a total of 2 rules in 33 ms. Remains 945 /946 variables (removed 1) and now considering 697/698 (removed 1) transitions.
// Phase 1: matrix 697 rows 945 cols
[2021-05-15 20:56:34] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:56:34] [INFO ] Implicit Places using invariants in 494 ms returned []
// Phase 1: matrix 697 rows 945 cols
[2021-05-15 20:56:34] [INFO ] Computed 448 place invariants in 1 ms
[2021-05-15 20:56:35] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 945/953 places, 697/702 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050A-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s414 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 860 ms.
Product exploration explored 100000 steps with 0 reset in 1050 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 856 ms.
Product exploration explored 100000 steps with 0 reset in 1066 ms.
[2021-05-15 20:56:39] [INFO ] Flatten gal took : 23 ms
[2021-05-15 20:56:39] [INFO ] Flatten gal took : 22 ms
[2021-05-15 20:56:51] [INFO ] Time to serialize gal into /tmp/LTL13085383579889370725.gal : 382 ms
[2021-05-15 20:56:51] [INFO ] Time to serialize properties into /tmp/LTL16186363010166708450.ltl : 66 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13085383579889370725.gal, -t, CGAL, -LTL, /tmp/LTL16186363010166708450.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13085383579889370725.gal -t CGAL -LTL /tmp/LTL16186363010166708450.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p415==0)"))))
Formula 0 simplified : !FG"(p415==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-15 20:57:06] [INFO ] Flatten gal took : 23 ms
[2021-05-15 20:57:06] [INFO ] Applying decomposition
[2021-05-15 20:57:06] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10713226170037488051.txt, -o, /tmp/graph10713226170037488051.bin, -w, /tmp/graph10713226170037488051.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10713226170037488051.bin, -l, -1, -v, -w, /tmp/graph10713226170037488051.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:57:06] [INFO ] Decomposing Gal with order
[2021-05-15 20:57:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:57:06] [INFO ] Removed a total of 149 redundant transitions.
[2021-05-15 20:57:06] [INFO ] Flatten gal took : 46 ms
[2021-05-15 20:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-15 20:57:12] [INFO ] Time to serialize gal into /tmp/LTL16429597030639810769.gal : 5952 ms
[2021-05-15 20:57:13] [INFO ] Time to serialize properties into /tmp/LTL723746373774985686.ltl : 205 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16429597030639810769.gal, -t, CGAL, -LTL, /tmp/LTL723746373774985686.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16429597030639810769.gal -t CGAL -LTL /tmp/LTL723746373774985686.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G("(i13.i0.i1.u174.p415==0)"))))
Formula 0 simplified : !FG"(i13.i0.i1.u174.p415==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16091287643135481441
[2021-05-15 20:57:28] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16091287643135481441
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16091287643135481441]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16091287643135481441] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16091287643135481441] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-050A-14 finished in 61623 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X((X(p1)||p0)))||(G(F(p3))&&p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 953 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Applied a total of 0 rules in 11 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:57:29] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:57:30] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:57:30] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:57:31] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:57:31] [INFO ] Computed 451 place invariants in 3 ms
[2021-05-15 20:57:32] [INFO ] Dead Transitions using invariants and state equation in 547 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Stuttering acceptance computed with spot in 298 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-050A-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(NOT p1), acceptance={} source=8 dest: 10}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 9}, { cond=true, acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (EQ s822 1) (EQ s833 1)), p0:(OR (EQ s822 0) (EQ s833 0)), p1:(AND (EQ s233 1) (EQ s244 1)), p3:(AND (EQ s501 1) (EQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2470 ms.
Product exploration explored 100000 steps with 25000 reset in 2588 ms.
Knowledge obtained : [(NOT p2), p0, (NOT p1), (NOT p3)]
Stuttering acceptance computed with spot in 381 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 25000 reset in 2422 ms.
Product exploration explored 100000 steps with 25000 reset in 2567 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Support contains 6 out of 953 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 702
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 702
Deduced a syphon composed of 2 places in 6 ms
Applied a total of 2 rules in 40 ms. Remains 953 /953 variables (removed 0) and now considering 702/702 (removed 0) transitions.
[2021-05-15 20:57:43] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 702 rows 953 cols
[2021-05-15 20:57:43] [INFO ] Computed 451 place invariants in 2 ms
[2021-05-15 20:57:44] [INFO ] Dead Transitions using invariants and state equation in 474 ms returned []
Finished structural reductions, in 1 iterations. Remains : 953/953 places, 702/702 transitions.
Product exploration explored 100000 steps with 25000 reset in 2423 ms.
Product exploration explored 100000 steps with 25000 reset in 2572 ms.
[2021-05-15 20:57:49] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:57:49] [INFO ] Flatten gal took : 37 ms
[2021-05-15 20:57:49] [INFO ] Time to serialize gal into /tmp/LTL11865033240778126829.gal : 3 ms
[2021-05-15 20:57:49] [INFO ] Time to serialize properties into /tmp/LTL12918291172016833838.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11865033240778126829.gal, -t, CGAL, -LTL, /tmp/LTL12918291172016833838.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11865033240778126829.gal -t CGAL -LTL /tmp/LTL12918291172016833838.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X(("((p822==0)||(p833==0))")||(X("((p233==1)&&(p244==1))")))))||(("((p822==1)&&(p833==1))")&&(G(F("((p501==1)&&(p503==1))")))))))
Formula 0 simplified : !X(XX("((p822==0)||(p833==0))" | X"((p233==1)&&(p244==1))") | ("((p822==1)&&(p833==1))" & GF"((p501==1)&&(p503==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
968 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.77342,159184,1,0,8,757309,18,0,23567,320911,17
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-050A-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-050A-15 finished in 30029 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2883271210729179885
[2021-05-15 20:57:59] [INFO ] Computing symmetric may disable matrix : 702 transitions.
[2021-05-15 20:57:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 20:57:59] [INFO ] Computing symmetric may enable matrix : 702 transitions.
[2021-05-15 20:57:59] [INFO ] Applying decomposition
[2021-05-15 20:57:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 20:57:59] [INFO ] Flatten gal took : 38 ms
[2021-05-15 20:57:59] [INFO ] Computing Do-Not-Accords matrix : 702 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1952850794243933932.txt, -o, /tmp/graph1952850794243933932.bin, -w, /tmp/graph1952850794243933932.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1952850794243933932.bin, -l, -1, -v, -w, /tmp/graph1952850794243933932.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:57:59] [INFO ] Decomposing Gal with order
[2021-05-15 20:57:59] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-15 20:57:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:57:59] [INFO ] Built C files in 197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2883271210729179885
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin2883271210729179885]
[2021-05-15 20:57:59] [INFO ] Removed a total of 150 redundant transitions.
[2021-05-15 20:57:59] [INFO ] Flatten gal took : 43 ms
[2021-05-15 20:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-15 20:57:59] [INFO ] Time to serialize gal into /tmp/LTLFireability4063635124848000351.gal : 8 ms
[2021-05-15 20:57:59] [INFO ] Time to serialize properties into /tmp/LTLFireability8107943468473003769.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability4063635124848000351.gal, -t, CGAL, -LTL, /tmp/LTLFireability8107943468473003769.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability4063635124848000351.gal -t CGAL -LTL /tmp/LTLFireability8107943468473003769.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((((F("((i2.u34.p81==1)&&(i2.u38.p92==1))"))||(X(G(!("((i14.i0.i0.u204.p487==1)&&(i14.i0.i0.u215.p512==1))")))))||(G("(i13.u205.p489!=1)"))))
Formula 0 simplified : !(F"((i2.u34.p81==1)&&(i2.u38.p92==1))" | XG!"((i14.i0.i0.u204.p487==1)&&(i14.i0.i0.u215.p512==1))" | G"(i13.u205.p489!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 5531 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2883271210729179885]
Link finished in 68 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))||X([]((LTLAPp1==true)))||[]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2883271210729179885]
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
10201 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,102.123,2215804,1,0,2.78028e+06,442,3184,2.23778e+07,82,1682,7451
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G("(i11.u174.p415==0)"))))
Formula 1 simplified : !FG"(i11.u174.p415==0)"
WARNING : LTSmin timed out (>240 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true))||X([]((LTLAPp1==true)))||[]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2883271210729179885]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2883271210729179885]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3050 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,132.626,2215804,1,0,2.99112e+06,442,3767,2.23778e+07,91,1682,637333
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
LTSmin run took 74078 ms.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621112601321

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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 r216-tall-162098205100485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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