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.r064-tall-162038396700109.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 DES-PT-30b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 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.2K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 103K May 5 16:51 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 DES-PT-30b-00
FORMULA_NAME DES-PT-30b-01
FORMULA_NAME DES-PT-30b-02
FORMULA_NAME DES-PT-30b-03
FORMULA_NAME DES-PT-30b-04
FORMULA_NAME DES-PT-30b-05
FORMULA_NAME DES-PT-30b-06
FORMULA_NAME DES-PT-30b-07
FORMULA_NAME DES-PT-30b-08
FORMULA_NAME DES-PT-30b-09
FORMULA_NAME DES-PT-30b-10
FORMULA_NAME DES-PT-30b-11
FORMULA_NAME DES-PT-30b-12
FORMULA_NAME DES-PT-30b-13
FORMULA_NAME DES-PT-30b-14
FORMULA_NAME DES-PT-30b-15

=== Now, execution of the tool begins

BK_START 1620473929968

Running Version 0
[2021-05-08 11:38:51] [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-08 11:38:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:38:51] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-08 11:38:51] [INFO ] Transformed 399 places.
[2021-05-08 11:38:51] [INFO ] Transformed 350 transitions.
[2021-05-08 11:38:51] [INFO ] Found NUPN structural information;
[2021-05-08 11:38:51] [INFO ] Parsed PT model containing 399 places and 350 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 11:38:51] [INFO ] Initial state test concluded for 4 properties.
FORMULA DES-PT-30b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 374 transition count 328
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 374 transition count 328
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 361 transition count 315
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 361 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 82 place count 361 transition count 306
Applied a total of 82 rules in 97 ms. Remains 361 /399 variables (removed 38) and now considering 306/350 (removed 44) transitions.
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 11:38:52] [INFO ] Computed 62 place invariants in 37 ms
[2021-05-08 11:38:52] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 11:38:52] [INFO ] Computed 62 place invariants in 16 ms
[2021-05-08 11:38:53] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 11:38:53] [INFO ] Computed 62 place invariants in 20 ms
[2021-05-08 11:38:53] [INFO ] Dead Transitions using invariants and state equation in 227 ms returned []
Finished structural reductions, in 1 iterations. Remains : 361/399 places, 306/350 transitions.
[2021-05-08 11:38:53] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-08 11:38:53] [INFO ] Flatten gal took : 59 ms
FORMULA DES-PT-30b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 11:38:53] [INFO ] Flatten gal took : 26 ms
[2021-05-08 11:38:53] [INFO ] Input system was already deterministic with 306 transitions.
Incomplete random walk after 100000 steps, including 850 resets, run finished after 425 ms. (steps per millisecond=235 ) properties (out of 25) seen :17
Running SMT prover for 8 properties.
// Phase 1: matrix 306 rows 361 cols
[2021-05-08 11:38:54] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 11:38:54] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-08 11:38:54] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 21 ms returned sat
[2021-05-08 11:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:54] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-08 11:38:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:38:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-08 11:38:54] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 14 ms returned sat
[2021-05-08 11:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:54] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2021-05-08 11:38:54] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-08 11:38:55] [INFO ] Added : 190 causal constraints over 39 iterations in 1001 ms. Result :sat
[2021-05-08 11:38:55] [INFO ] [Real]Absence check using 32 positive place invariants in 10 ms returned sat
[2021-05-08 11:38:55] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 19 ms returned sat
[2021-05-08 11:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:55] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-08 11:38:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:38:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-08 11:38:55] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 13 ms returned sat
[2021-05-08 11:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:55] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2021-05-08 11:38:55] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-08 11:38:56] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 4 ms to minimize.
[2021-05-08 11:38:56] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2021-05-08 11:38:56] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2021-05-08 11:38:56] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2021-05-08 11:38:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2021-05-08 11:38:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 359 ms
[2021-05-08 11:38:57] [INFO ] Added : 182 causal constraints over 37 iterations in 1197 ms. Result :sat
[2021-05-08 11:38:57] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-08 11:38:57] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 15 ms returned sat
[2021-05-08 11:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:57] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-08 11:38:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:38:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-08 11:38:57] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 14 ms returned sat
[2021-05-08 11:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:57] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-08 11:38:57] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 11:38:58] [INFO ] Added : 175 causal constraints over 35 iterations in 796 ms. Result :sat
[2021-05-08 11:38:58] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-08 11:38:58] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 14 ms returned sat
[2021-05-08 11:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:58] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-08 11:38:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:38:58] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-08 11:38:58] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 13 ms returned sat
[2021-05-08 11:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:38:58] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-08 11:38:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2021-05-08 11:38:58] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2021-05-08 11:38:58] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2021-05-08 11:38:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2021-05-08 11:38:58] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 11:38:59] [INFO ] Added : 245 causal constraints over 49 iterations in 1204 ms. Result :sat
[2021-05-08 11:38:59] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-08 11:39:00] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 23 ms returned sat
[2021-05-08 11:39:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:00] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-08 11:39:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:39:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2021-05-08 11:39:00] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 14 ms returned sat
[2021-05-08 11:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:00] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-08 11:39:00] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2021-05-08 11:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-08 11:39:00] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-08 11:39:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2021-05-08 11:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-08 11:39:01] [INFO ] Added : 205 causal constraints over 41 iterations in 1096 ms. Result :sat
[2021-05-08 11:39:01] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-08 11:39:01] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 14 ms returned sat
[2021-05-08 11:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:01] [INFO ] [Real]Absence check using state equation in 58 ms returned unsat
[2021-05-08 11:39:01] [INFO ] [Real]Absence check using 32 positive place invariants in 22 ms returned sat
[2021-05-08 11:39:01] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 14 ms returned sat
[2021-05-08 11:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:01] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 11:39:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:39:01] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2021-05-08 11:39:01] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 15 ms returned sat
[2021-05-08 11:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:02] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-08 11:39:02] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-08 11:39:02] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2021-05-08 11:39:02] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
[2021-05-08 11:39:03] [INFO ] Added : 198 causal constraints over 40 iterations in 1115 ms. Result :sat
[2021-05-08 11:39:03] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-08 11:39:03] [INFO ] [Real]Absence check using 32 positive and 30 generalized place invariants in 15 ms returned sat
[2021-05-08 11:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:03] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 11:39:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:39:03] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2021-05-08 11:39:03] [INFO ] [Nat]Absence check using 32 positive and 30 generalized place invariants in 15 ms returned sat
[2021-05-08 11:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:39:03] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2021-05-08 11:39:03] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2021-05-08 11:39:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 604 ms
[2021-05-08 11:39:04] [INFO ] Computed and/alt/rep : 300/628/300 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-08 11:39:04] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2021-05-08 11:39:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-08 11:39:04] [INFO ] Added : 201 causal constraints over 41 iterations in 920 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p0)&&F(p1))||X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 355 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 353 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 353 transition count 293
Applied a total of 21 rules in 52 ms. Remains 353 /361 variables (removed 8) and now considering 293/306 (removed 13) transitions.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:39:05] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 11:39:05] [INFO ] Implicit Places using invariants in 164 ms returned []
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:39:05] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:39:05] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:39:05] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:39:05] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/361 places, 293/306 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DES-PT-30b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s218 1), p0:(OR (NEQ s123 1) (NEQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 276 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 3 out of 353 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 353/353 places, 293/293 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 353 transition count 293
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 15 place count 353 transition count 323
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 353 transition count 323
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 348 transition count 318
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 348 transition count 318
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 111 place count 348 transition count 321
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 121 place count 338 transition count 311
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 131 place count 338 transition count 311
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 338 transition count 339
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 336 transition count 333
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 336 transition count 333
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 141 rules in 144 ms. Remains 336 /353 variables (removed 17) and now considering 333/293 (removed -40) transitions.
[2021-05-08 11:39:07] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 333 rows 336 cols
[2021-05-08 11:39:07] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:39:08] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 1 iterations. Remains : 336/353 places, 333/293 transitions.
Product exploration explored 100000 steps with 50000 reset in 1296 ms.
Product exploration explored 100000 steps with 50000 reset in 1169 ms.
[2021-05-08 11:39:10] [INFO ] Flatten gal took : 21 ms
[2021-05-08 11:39:10] [INFO ] Flatten gal took : 20 ms
[2021-05-08 11:39:10] [INFO ] Time to serialize gal into /tmp/LTL5485765351651691935.gal : 10 ms
[2021-05-08 11:39:10] [INFO ] Time to serialize properties into /tmp/LTL13574877282354612298.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/LTL5485765351651691935.gal, -t, CGAL, -LTL, /tmp/LTL13574877282354612298.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/LTL5485765351651691935.gal -t CGAL -LTL /tmp/LTL13574877282354612298.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(G("((p124!=1)||(p149!=1))")))||((X("((p124!=1)||(p149!=1))"))&&(F("(p259!=1)")))))
Formula 0 simplified : !(XG"((p124!=1)||(p149!=1))" | (X"((p124!=1)||(p149!=1))" & F"(p259!=1)"))
Detected timeout of ITS tools.
[2021-05-08 11:39:25] [INFO ] Flatten gal took : 56 ms
[2021-05-08 11:39:25] [INFO ] Applying decomposition
[2021-05-08 11:39:25] [INFO ] Flatten gal took : 39 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/graph11016445138469757963.txt, -o, /tmp/graph11016445138469757963.bin, -w, /tmp/graph11016445138469757963.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/graph11016445138469757963.bin, -l, -1, -v, -w, /tmp/graph11016445138469757963.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:39:25] [INFO ] Decomposing Gal with order
[2021-05-08 11:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:39:25] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-08 11:39:26] [INFO ] Flatten gal took : 51 ms
[2021-05-08 11:39:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2021-05-08 11:39:26] [INFO ] Time to serialize gal into /tmp/LTL11904800019832158916.gal : 6 ms
[2021-05-08 11:39:26] [INFO ] Time to serialize properties into /tmp/LTL11679530644880869874.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/LTL11904800019832158916.gal, -t, CGAL, -LTL, /tmp/LTL11679530644880869874.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/LTL11904800019832158916.gal -t CGAL -LTL /tmp/LTL11679530644880869874.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X(G("((i2.u8.p124!=1)||(i2.u8.p149!=1))")))||((X("((i2.u8.p124!=1)||(i2.u8.p149!=1))"))&&(F("(i8.u36.p259!=1)")))))
Formula 0 simplified : !(XG"((i2.u8.p124!=1)||(i2.u8.p149!=1))" | (X"((i2.u8.p124!=1)||(i2.u8.p149!=1))" & F"(i8.u36.p259!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7029371127446501039
[2021-05-08 11:39:41] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7029371127446501039
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/ltsmin7029371127446501039]
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/ltsmin7029371127446501039] 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/ltsmin7029371127446501039] 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 DES-PT-30b-00 finished in 37079 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F(p0) U (p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 360 transition count 288
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 343 transition count 288
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 343 transition count 277
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 332 transition count 277
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 327 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 327 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 327 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 327 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 326 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 325 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 325 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 325 transition count 265
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 324 transition count 264
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 225 place count 250 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 248 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 246 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 245 transition count 190
Applied a total of 232 rules in 80 ms. Remains 245 /361 variables (removed 116) and now considering 190/306 (removed 116) transitions.
// Phase 1: matrix 190 rows 245 cols
[2021-05-08 11:39:42] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:39:42] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 190 rows 245 cols
[2021-05-08 11:39:42] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:39:42] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2021-05-08 11:39:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 190 rows 245 cols
[2021-05-08 11:39:42] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:39:42] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 245/361 places, 190/306 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-30b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s140 1), p2:(AND (EQ s175 1) (EQ s192 1)), p0:(AND (EQ s140 1) (EQ s91 1) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DES-PT-30b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-01 finished in 774 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((!p0&&X(p0))||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 355 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 353 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 353 transition count 293
Applied a total of 21 rules in 28 ms. Remains 353 /361 variables (removed 8) and now considering 293/306 (removed 13) transitions.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:39:42] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:39:43] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:39:43] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:39:43] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:39:43] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:39:43] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/361 places, 293/306 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s156 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 2617 reset in 184 ms.
Product exploration explored 100000 steps with 2620 reset in 239 ms.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2654 reset in 189 ms.
Product exploration explored 100000 steps with 2637 reset in 199 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 353 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 353/353 places, 293/293 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 353 transition count 293
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 353 transition count 323
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 353 transition count 323
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 348 transition count 318
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 348 transition count 318
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 113 place count 348 transition count 321
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 124 place count 337 transition count 310
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 135 place count 337 transition count 310
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 93 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 141 place count 337 transition count 336
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 335 transition count 330
Deduced a syphon composed of 91 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 335 transition count 330
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 145 rules in 48 ms. Remains 335 /353 variables (removed 18) and now considering 330/293 (removed -37) transitions.
[2021-05-08 11:39:44] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 330 rows 335 cols
[2021-05-08 11:39:44] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:39:45] [INFO ] Dead Transitions using invariants and state equation in 299 ms returned []
Finished structural reductions, in 1 iterations. Remains : 335/353 places, 330/293 transitions.
Product exploration explored 100000 steps with 14053 reset in 744 ms.
Product exploration explored 100000 steps with 14066 reset in 584 ms.
[2021-05-08 11:39:46] [INFO ] Flatten gal took : 31 ms
[2021-05-08 11:39:46] [INFO ] Flatten gal took : 15 ms
[2021-05-08 11:39:46] [INFO ] Time to serialize gal into /tmp/LTL3993140166681156342.gal : 1 ms
[2021-05-08 11:39:46] [INFO ] Time to serialize properties into /tmp/LTL14699022170537293814.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/LTL3993140166681156342.gal, -t, CGAL, -LTL, /tmp/LTL14699022170537293814.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/LTL3993140166681156342.gal -t CGAL -LTL /tmp/LTL14699022170537293814.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p181==1)"))||(("(p181!=1)")&&(X("(p181==1)")))))))
Formula 0 simplified : !XF(G"(p181==1)" | ("(p181!=1)" & X"(p181==1)"))
Detected timeout of ITS tools.
[2021-05-08 11:40:01] [INFO ] Flatten gal took : 18 ms
[2021-05-08 11:40:01] [INFO ] Applying decomposition
[2021-05-08 11:40:01] [INFO ] Flatten gal took : 14 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/graph4118872908284715162.txt, -o, /tmp/graph4118872908284715162.bin, -w, /tmp/graph4118872908284715162.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/graph4118872908284715162.bin, -l, -1, -v, -w, /tmp/graph4118872908284715162.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:40:01] [INFO ] Decomposing Gal with order
[2021-05-08 11:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:40:01] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-08 11:40:01] [INFO ] Flatten gal took : 38 ms
[2021-05-08 11:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2021-05-08 11:40:01] [INFO ] Time to serialize gal into /tmp/LTL1425110120845410305.gal : 10 ms
[2021-05-08 11:40:01] [INFO ] Time to serialize properties into /tmp/LTL434445872333580429.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/LTL1425110120845410305.gal, -t, CGAL, -LTL, /tmp/LTL434445872333580429.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/LTL1425110120845410305.gal -t CGAL -LTL /tmp/LTL434445872333580429.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i2.u15.p181==1)"))||(("(i2.u15.p181!=1)")&&(X("(i2.u15.p181==1)")))))))
Formula 0 simplified : !XF(G"(i2.u15.p181==1)" | ("(i2.u15.p181!=1)" & X"(i2.u15.p181==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10550065091097975655
[2021-05-08 11:40:16] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10550065091097975655
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/ltsmin10550065091097975655]
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/ltsmin10550065091097975655] 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/ltsmin10550065091097975655] 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 DES-PT-30b-02 finished in 34886 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 360 transition count 288
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 343 transition count 288
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 343 transition count 277
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 332 transition count 277
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 327 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 327 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 327 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 327 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 326 transition count 268
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 325 transition count 267
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 325 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 325 transition count 265
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 324 transition count 264
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 229 place count 248 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 246 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 234 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 235 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 243 transition count 188
Applied a total of 236 rules in 141 ms. Remains 243 /361 variables (removed 118) and now considering 188/306 (removed 118) transitions.
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:40:17] [INFO ] Computed 61 place invariants in 19 ms
[2021-05-08 11:40:18] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:40:18] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-08 11:40:18] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2021-05-08 11:40:18] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:40:18] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:40:18] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/361 places, 188/306 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s84 1) (NEQ s154 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 5049 reset in 310 ms.
Product exploration explored 100000 steps with 5025 reset in 297 ms.
Graph (complete) has 820 edges and 243 vertex of which 239 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5020 reset in 251 ms.
Product exploration explored 100000 steps with 5043 reset in 265 ms.
[2021-05-08 11:40:20] [INFO ] Flatten gal took : 29 ms
[2021-05-08 11:40:20] [INFO ] Flatten gal took : 33 ms
[2021-05-08 11:40:20] [INFO ] Time to serialize gal into /tmp/LTL18042662063452283680.gal : 8 ms
[2021-05-08 11:40:20] [INFO ] Time to serialize properties into /tmp/LTL10452949637074449277.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/LTL18042662063452283680.gal, -t, CGAL, -LTL, /tmp/LTL10452949637074449277.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/LTL18042662063452283680.gal -t CGAL -LTL /tmp/LTL10452949637074449277.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((p89!=1)||(p243!=1))"))))
Formula 0 simplified : !GF"((p89!=1)||(p243!=1))"
Detected timeout of ITS tools.
[2021-05-08 11:40:35] [INFO ] Flatten gal took : 14 ms
[2021-05-08 11:40:35] [INFO ] Applying decomposition
[2021-05-08 11:40:35] [INFO ] Flatten gal took : 23 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/graph2968359644072358232.txt, -o, /tmp/graph2968359644072358232.bin, -w, /tmp/graph2968359644072358232.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/graph2968359644072358232.bin, -l, -1, -v, -w, /tmp/graph2968359644072358232.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:40:35] [INFO ] Decomposing Gal with order
[2021-05-08 11:40:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:40:35] [INFO ] Removed a total of 43 redundant transitions.
[2021-05-08 11:40:35] [INFO ] Flatten gal took : 33 ms
[2021-05-08 11:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2021-05-08 11:40:35] [INFO ] Time to serialize gal into /tmp/LTL17521607477970538270.gal : 19 ms
[2021-05-08 11:40:35] [INFO ] Time to serialize properties into /tmp/LTL16059688943767783800.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/LTL17521607477970538270.gal, -t, CGAL, -LTL, /tmp/LTL16059688943767783800.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/LTL17521607477970538270.gal -t CGAL -LTL /tmp/LTL16059688943767783800.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((u8.p89!=1)||(u8.p243!=1))"))))
Formula 0 simplified : !GF"((u8.p89!=1)||(u8.p243!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5835795664353756968
[2021-05-08 11:40:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5835795664353756968
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/ltsmin5835795664353756968]
Compilation finished in 926 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5835795664353756968]
Link finished in 40 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin5835795664353756968]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-03 finished in 47805 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 9 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 360 transition count 289
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 344 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 343 transition count 288
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 34 place count 343 transition count 277
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 56 place count 332 transition count 277
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 327 transition count 272
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 327 transition count 272
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 327 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 69 place count 327 transition count 268
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 326 transition count 268
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 325 transition count 267
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 325 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 325 transition count 265
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 77 place count 324 transition count 264
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 229 place count 248 transition count 188
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 233 place count 246 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 244 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 236 place count 243 transition count 188
Applied a total of 236 rules in 59 ms. Remains 243 /361 variables (removed 118) and now considering 188/306 (removed 118) transitions.
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:41:05] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 11:41:05] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:41:05] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:41:06] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2021-05-08 11:41:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 188 rows 243 cols
[2021-05-08 11:41:06] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 11:41:06] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 243/361 places, 188/306 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-05 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:(AND (EQ s198 1) (EQ s200 1) (EQ s202 1) (EQ s204 1) (EQ s206 1) (EQ s208 1) (EQ s210 1) (EQ s212 1)), p1:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-05 finished in 648 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||F(p1)))&&F((p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 356 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 356 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 356 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 355 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 355 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 354 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Applied a total of 18 rules in 22 ms. Remains 354 /361 variables (removed 7) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:41:06] [INFO ] Computed 62 place invariants in 6 ms
[2021-05-08 11:41:06] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:41:06] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:41:06] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:41:06] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:41:06] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/361 places, 295/306 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s107 1) (EQ s142 1)), p1:(AND (EQ s92 1) (EQ s203 1)), p0:(AND (EQ s151 1) (EQ s317 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-07 finished in 801 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 360 transition count 288
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 343 transition count 288
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 34 place count 343 transition count 278
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 54 place count 333 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 328 transition count 273
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 328 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 328 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 328 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 327 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 326 transition count 268
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 326 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 326 transition count 266
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 325 transition count 265
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 231 place count 247 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 235 place count 245 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 244 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 243 transition count 188
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 242 transition count 187
Applied a total of 238 rules in 56 ms. Remains 242 /361 variables (removed 119) and now considering 187/306 (removed 119) transitions.
// Phase 1: matrix 187 rows 242 cols
[2021-05-08 11:41:07] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:41:07] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 187 rows 242 cols
[2021-05-08 11:41:07] [INFO ] Computed 61 place invariants in 3 ms
[2021-05-08 11:41:07] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2021-05-08 11:41:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 187 rows 242 cols
[2021-05-08 11:41:07] [INFO ] Computed 61 place invariants in 2 ms
[2021-05-08 11:41:07] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Finished structural reductions, in 1 iterations. Remains : 242/361 places, 187/306 transitions.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-30b-08 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 (EQ s22 0) (EQ s155 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 5346 reset in 201 ms.
Product exploration explored 100000 steps with 5456 reset in 237 ms.
Graph (complete) has 783 edges and 242 vertex of which 238 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 5485 reset in 201 ms.
Product exploration explored 100000 steps with 5482 reset in 245 ms.
[2021-05-08 11:41:08] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:41:08] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:41:08] [INFO ] Time to serialize gal into /tmp/LTL16706214657712956584.gal : 1 ms
[2021-05-08 11:41:08] [INFO ] Time to serialize properties into /tmp/LTL18192415019179209926.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/LTL16706214657712956584.gal, -t, CGAL, -LTL, /tmp/LTL18192415019179209926.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/LTL16706214657712956584.gal -t CGAL -LTL /tmp/LTL18192415019179209926.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((p27==0)||(p250==0))")))
Formula 0 simplified : !G"((p27==0)||(p250==0))"
Detected timeout of ITS tools.
[2021-05-08 11:41:23] [INFO ] Flatten gal took : 10 ms
[2021-05-08 11:41:23] [INFO ] Applying decomposition
[2021-05-08 11:41:23] [INFO ] Flatten gal took : 9 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/graph15503090136666303516.txt, -o, /tmp/graph15503090136666303516.bin, -w, /tmp/graph15503090136666303516.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/graph15503090136666303516.bin, -l, -1, -v, -w, /tmp/graph15503090136666303516.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:41:23] [INFO ] Decomposing Gal with order
[2021-05-08 11:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:41:23] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-08 11:41:23] [INFO ] Flatten gal took : 36 ms
[2021-05-08 11:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 2 ms.
[2021-05-08 11:41:23] [INFO ] Time to serialize gal into /tmp/LTL12563179862560567060.gal : 29 ms
[2021-05-08 11:41:23] [INFO ] Time to serialize properties into /tmp/LTL15527249849493599059.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/LTL12563179862560567060.gal, -t, CGAL, -LTL, /tmp/LTL15527249849493599059.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/LTL12563179862560567060.gal -t CGAL -LTL /tmp/LTL15527249849493599059.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G("((u10.p27==0)||(u10.p250==0))")))
Formula 0 simplified : !G"((u10.p27==0)||(u10.p250==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17421556652684705213
[2021-05-08 11:41:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17421556652684705213
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/ltsmin17421556652684705213]
Compilation finished in 891 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17421556652684705213]
Link finished in 33 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)), --buchi-type=spotba], workingDir=/tmp/ltsmin17421556652684705213]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-30b-08 finished in 46879 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 356 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 356 transition count 301
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 356 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 355 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 355 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 355 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 354 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 354 transition count 294
Applied a total of 19 rules in 24 ms. Remains 354 /361 variables (removed 7) and now considering 294/306 (removed 12) transitions.
// Phase 1: matrix 294 rows 354 cols
[2021-05-08 11:41:53] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:41:54] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 294 rows 354 cols
[2021-05-08 11:41:54] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:41:54] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
// Phase 1: matrix 294 rows 354 cols
[2021-05-08 11:41:54] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:41:54] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/361 places, 294/306 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s177 0), p1:(OR (EQ s168 0) (EQ s177 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Graph (complete) has 767 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 220 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 354/354 places, 294/294 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 354 transition count 294
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 354 transition count 324
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 354 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 349 transition count 319
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 349 transition count 319
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 113 place count 349 transition count 320
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 124 place count 338 transition count 309
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 135 place count 338 transition count 309
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 141 place count 338 transition count 337
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 336 transition count 331
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 336 transition count 331
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 145 rules in 57 ms. Remains 336 /354 variables (removed 18) and now considering 331/294 (removed -37) transitions.
[2021-05-08 11:41:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 331 rows 336 cols
[2021-05-08 11:41:55] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:41:56] [INFO ] Dead Transitions using invariants and state equation in 424 ms returned []
Finished structural reductions, in 1 iterations. Remains : 336/354 places, 331/294 transitions.
Product exploration explored 100000 steps with 50000 reset in 1129 ms.
Product exploration explored 100000 steps with 50000 reset in 1126 ms.
[2021-05-08 11:41:58] [INFO ] Flatten gal took : 14 ms
[2021-05-08 11:41:58] [INFO ] Flatten gal took : 10 ms
[2021-05-08 11:41:58] [INFO ] Time to serialize gal into /tmp/LTL15112909837060231934.gal : 29 ms
[2021-05-08 11:41:58] [INFO ] Time to serialize properties into /tmp/LTL8284291680058955867.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/LTL15112909837060231934.gal, -t, CGAL, -LTL, /tmp/LTL8284291680058955867.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/LTL15112909837060231934.gal -t CGAL -LTL /tmp/LTL8284291680058955867.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(p205!=0)")||(X("((p195==0)||(p205==1))")))))
Formula 0 simplified : !F("(p205!=0)" | X"((p195==0)||(p205==1))")
Detected timeout of ITS tools.
[2021-05-08 11:42:13] [INFO ] Flatten gal took : 10 ms
[2021-05-08 11:42:13] [INFO ] Applying decomposition
[2021-05-08 11:42:13] [INFO ] Flatten gal took : 10 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/graph1349685253171642106.txt, -o, /tmp/graph1349685253171642106.bin, -w, /tmp/graph1349685253171642106.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/graph1349685253171642106.bin, -l, -1, -v, -w, /tmp/graph1349685253171642106.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:42:13] [INFO ] Decomposing Gal with order
[2021-05-08 11:42:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:42:13] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-08 11:42:13] [INFO ] Flatten gal took : 44 ms
[2021-05-08 11:42:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-08 11:42:13] [INFO ] Time to serialize gal into /tmp/LTL9566415520948837240.gal : 15 ms
[2021-05-08 11:42:13] [INFO ] Time to serialize properties into /tmp/LTL10313974777827432467.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/LTL9566415520948837240.gal, -t, CGAL, -LTL, /tmp/LTL10313974777827432467.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/LTL9566415520948837240.gal -t CGAL -LTL /tmp/LTL10313974777827432467.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(i4.i0.i0.u23.p205!=0)")||(X("((i4.i0.i0.u22.p195==0)||(i4.i0.i0.u23.p205==1))")))))
Formula 0 simplified : !F("(i4.i0.i0.u23.p205!=0)" | X"((i4.i0.i0.u22.p195==0)||(i4.i0.i0.u23.p205==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1714011759112105778
[2021-05-08 11:42:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1714011759112105778
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/ltsmin1714011759112105778]
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/ltsmin1714011759112105778] 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/ltsmin1714011759112105778] 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 DES-PT-30b-09 finished in 36020 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 356 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 356 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 356 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 355 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 355 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 354 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Applied a total of 18 rules in 21 ms. Remains 354 /361 variables (removed 7) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:42:29] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:42:30] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:42:30] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:42:30] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:42:30] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:42:30] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/361 places, 295/306 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-30b-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (NEQ s136 1) (NEQ s168 1)), p0:(OR (EQ s182 1) (EQ s148 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Graph (complete) has 769 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 354/354 places, 295/295 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 354 transition count 295
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 16 place count 354 transition count 325
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 354 transition count 325
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 349 transition count 320
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 349 transition count 320
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 111 place count 349 transition count 321
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 122 place count 338 transition count 310
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 133 place count 338 transition count 310
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 137 place count 338 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 336 transition count 322
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 336 transition count 322
Deduced a syphon composed of 87 places in 0 ms
Applied a total of 141 rules in 42 ms. Remains 336 /354 variables (removed 18) and now considering 322/295 (removed -27) transitions.
[2021-05-08 11:42:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 322 rows 336 cols
[2021-05-08 11:42:32] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:42:32] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 336/354 places, 322/295 transitions.
Product exploration explored 100000 steps with 50000 reset in 1121 ms.
Product exploration explored 100000 steps with 50000 reset in 1116 ms.
[2021-05-08 11:42:34] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:42:34] [INFO ] Flatten gal took : 10 ms
[2021-05-08 11:42:34] [INFO ] Time to serialize gal into /tmp/LTL8910038837125087251.gal : 3 ms
[2021-05-08 11:42:34] [INFO ] Time to serialize properties into /tmp/LTL13958009452599219793.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/LTL8910038837125087251.gal, -t, CGAL, -LTL, /tmp/LTL13958009452599219793.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/LTL8910038837125087251.gal -t CGAL -LTL /tmp/LTL13958009452599219793.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p138!=1)||(p194!=1))"))&&("((p213==1)||(p163==0))"))))
Formula 0 simplified : !X("((p213==1)||(p163==0))" & F"((p138!=1)||(p194!=1))")
Detected timeout of ITS tools.
[2021-05-08 11:42:49] [INFO ] Flatten gal took : 11 ms
[2021-05-08 11:42:49] [INFO ] Applying decomposition
[2021-05-08 11:42:49] [INFO ] Flatten gal took : 13 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/graph2714742727055507921.txt, -o, /tmp/graph2714742727055507921.bin, -w, /tmp/graph2714742727055507921.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/graph2714742727055507921.bin, -l, -1, -v, -w, /tmp/graph2714742727055507921.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:42:49] [INFO ] Decomposing Gal with order
[2021-05-08 11:42:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:42:49] [INFO ] Removed a total of 14 redundant transitions.
[2021-05-08 11:42:49] [INFO ] Flatten gal took : 31 ms
[2021-05-08 11:42:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2021-05-08 11:42:49] [INFO ] Time to serialize gal into /tmp/LTL18029967506523124910.gal : 11 ms
[2021-05-08 11:42:49] [INFO ] Time to serialize properties into /tmp/LTL17289460960123995658.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/LTL18029967506523124910.gal, -t, CGAL, -LTL, /tmp/LTL17289460960123995658.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/LTL18029967506523124910.gal -t CGAL -LTL /tmp/LTL17289460960123995658.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("((i1.u7.p138!=1)||(i4.u23.p194!=1))"))&&("((i4.u21.p213==1)||(i2.u11.p163==0))"))))
Formula 0 simplified : !X("((i4.u21.p213==1)||(i2.u11.p163==0))" & F"((i1.u7.p138!=1)||(i4.u23.p194!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8775276241322979624
[2021-05-08 11:43:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8775276241322979624
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/ltsmin8775276241322979624]
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/ltsmin8775276241322979624] 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/ltsmin8775276241322979624] 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 DES-PT-30b-11 finished in 35907 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F((p0 U (p1||G(p0)))) U p2)||(X(p3)&&G(p4))))], workingDir=/home/mcc/execution]
Support contains 7 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 356 transition count 301
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 356 transition count 301
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 356 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 355 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 355 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 354 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Applied a total of 18 rules in 24 ms. Remains 354 /361 variables (removed 7) and now considering 295/306 (removed 11) transitions.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:43:05] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:43:06] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:43:06] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:43:06] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 354 cols
[2021-05-08 11:43:06] [INFO ] Computed 62 place invariants in 5 ms
[2021-05-08 11:43:06] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 354/361 places, 295/306 transitions.
Stuttering acceptance computed with spot in 1361 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p0) p4 p2 (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p4))]
Running random walk in product with property : DES-PT-30b-14 automaton TGBA [mat=[[{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p4 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p4 (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p4 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p4) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p4 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p4 p2 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p4) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p4 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(NEQ s228 1), p2:(AND (EQ s96 1) (EQ s143 1)), p1:(AND (OR (NEQ s266 1) (NEQ s298 1)) (OR (NEQ s137 1) (NEQ s168 1))), p0:(OR (NEQ s137 1) (NEQ s168 1)), p3:(AND (NEQ s137 0) (NEQ s168 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3979 reset in 214 ms.
Product exploration explored 100000 steps with 3967 reset in 217 ms.
Graph (complete) has 769 edges and 354 vertex of which 348 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Knowledge obtained : [p4, (NOT p2), p1, p0, (NOT p3)]
Stuttering acceptance computed with spot in 308 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p0) p4 p2 (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p4))]
Product exploration explored 100000 steps with 3891 reset in 202 ms.
Product exploration explored 100000 steps with 3904 reset in 209 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p3) p4), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p0) p4 p2 (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p4))]
Support contains 7 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 354/354 places, 295/295 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 354 transition count 295
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 15 place count 354 transition count 325
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 24 place count 354 transition count 325
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 349 transition count 320
Deduced a syphon composed of 19 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 349 transition count 320
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 102 place count 349 transition count 321
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 112 place count 339 transition count 311
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 339 transition count 311
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 339 transition count 335
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 337 transition count 329
Deduced a syphon composed of 81 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 337 transition count 329
Deduced a syphon composed of 81 places in 1 ms
Applied a total of 132 rules in 39 ms. Remains 337 /354 variables (removed 17) and now considering 329/295 (removed -34) transitions.
[2021-05-08 11:43:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 329 rows 337 cols
[2021-05-08 11:43:09] [INFO ] Computed 62 place invariants in 7 ms
[2021-05-08 11:43:09] [INFO ] Dead Transitions using invariants and state equation in 163 ms returned []
Finished structural reductions, in 1 iterations. Remains : 337/354 places, 329/295 transitions.
Product exploration explored 100000 steps with 13259 reset in 541 ms.
Product exploration explored 100000 steps with 13247 reset in 547 ms.
[2021-05-08 11:43:11] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:43:11] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:43:11] [INFO ] Time to serialize gal into /tmp/LTL12984435507575281306.gal : 2 ms
[2021-05-08 11:43:11] [INFO ] Time to serialize properties into /tmp/LTL5900769163228960737.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/LTL12984435507575281306.gal, -t, CGAL, -LTL, /tmp/LTL5900769163228960737.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/LTL12984435507575281306.gal -t CGAL -LTL /tmp/LTL5900769163228960737.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((((F(("((p140!=1)||(p194!=1))")U(("(((p306!=1)||(p338!=1))&&((p140!=1)||(p194!=1)))")||(G("((p140!=1)||(p194!=1))")))))U("((p97==1)&&(p149==1))"))||((X("((p140!=0)&&(p194!=0))"))&&(G("(p268!=1)")))))
Formula 0 simplified : !((F("((p140!=1)||(p194!=1))" U ("(((p306!=1)||(p338!=1))&&((p140!=1)||(p194!=1)))" | G"((p140!=1)||(p194!=1))")) U "((p97==1)&&(p149==1))") | (X"((p140!=0)&&(p194!=0))" & G"(p268!=1)"))
Detected timeout of ITS tools.
[2021-05-08 11:43:28] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:43:28] [INFO ] Applying decomposition
[2021-05-08 11:43:28] [INFO ] Flatten gal took : 10 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/graph2607891010365138615.txt, -o, /tmp/graph2607891010365138615.bin, -w, /tmp/graph2607891010365138615.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/graph2607891010365138615.bin, -l, -1, -v, -w, /tmp/graph2607891010365138615.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:43:28] [INFO ] Decomposing Gal with order
[2021-05-08 11:43:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:43:29] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-08 11:43:29] [INFO ] Flatten gal took : 23 ms
[2021-05-08 11:43:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2021-05-08 11:43:29] [INFO ] Time to serialize gal into /tmp/LTL9772694746653059040.gal : 178 ms
[2021-05-08 11:43:29] [INFO ] Time to serialize properties into /tmp/LTL6492613882590180138.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/LTL9772694746653059040.gal, -t, CGAL, -LTL, /tmp/LTL6492613882590180138.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/LTL9772694746653059040.gal -t CGAL -LTL /tmp/LTL6492613882590180138.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((((F(("((i3.u6.p140!=1)||(i3.u21.p194!=1))")U(("(((i7.u51.p306!=1)||(i7.u61.p338!=1))&&((i3.u6.p140!=1)||(i3.u21.p194!=1)))")||(G("((i3.u6.p140!=1)||(i3.u21.p194!=1))")))))U("((i0.u1.p97==1)&&(i2.u8.p149==1))"))||((X("((i3.u6.p140!=0)&&(i3.u21.p194!=0))"))&&(G("(i8.u40.p268!=1)")))))
Formula 0 simplified : !((F("((i3.u6.p140!=1)||(i3.u21.p194!=1))" U ("(((i7.u51.p306!=1)||(i7.u61.p338!=1))&&((i3.u6.p140!=1)||(i3.u21.p194!=1)))" | G"((i3.u6.p140!=1)||(i3.u21.p194!=1))")) U "((i0.u1.p97==1)&&(i2.u8.p149==1))") | (X"((i3.u6.p140!=0)&&(i3.u21.p194!=0))" & G"(i8.u40.p268!=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17268282406934610712
[2021-05-08 11:43:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17268282406934610712
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/ltsmin17268282406934610712]
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/ltsmin17268282406934610712] 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/ltsmin17268282406934610712] 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 DES-PT-30b-14 finished in 39461 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 361 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 361/361 places, 306/306 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 355 transition count 300
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 355 transition count 300
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 355 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 354 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 354 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 353 transition count 294
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 353 transition count 293
Applied a total of 21 rules in 27 ms. Remains 353 /361 variables (removed 8) and now considering 293/306 (removed 13) transitions.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:43:45] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:43:45] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:43:45] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:43:46] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
// Phase 1: matrix 293 rows 353 cols
[2021-05-08 11:43:46] [INFO ] Computed 62 place invariants in 3 ms
[2021-05-08 11:43:46] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/361 places, 293/306 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-30b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s209 0)), p1:(OR (NEQ s30 1) (NEQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 879 reset in 183 ms.
Product exploration explored 100000 steps with 863 reset in 197 ms.
Graph (complete) has 766 edges and 353 vertex of which 347 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 876 reset in 171 ms.
Product exploration explored 100000 steps with 867 reset in 202 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Support contains 2 out of 353 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 353/353 places, 293/293 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 353 transition count 293
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 353 transition count 295
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 353 transition count 295
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 348 transition count 290
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 348 transition count 290
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 113 place count 348 transition count 293
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 124 place count 337 transition count 282
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 135 place count 337 transition count 282
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 141 place count 337 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 335 transition count 304
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 335 transition count 304
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 145 rules in 36 ms. Remains 335 /353 variables (removed 18) and now considering 304/293 (removed -11) transitions.
[2021-05-08 11:43:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 304 rows 335 cols
[2021-05-08 11:43:50] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 11:43:50] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 335/353 places, 304/293 transitions.
Product exploration explored 100000 steps with 4700 reset in 341 ms.
Product exploration explored 100000 steps with 4683 reset in 370 ms.
[2021-05-08 11:43:50] [INFO ] Flatten gal took : 9 ms
[2021-05-08 11:43:50] [INFO ] Flatten gal took : 8 ms
[2021-05-08 11:43:50] [INFO ] Time to serialize gal into /tmp/LTL5884549544627842647.gal : 1 ms
[2021-05-08 11:43:50] [INFO ] Time to serialize properties into /tmp/LTL4996242814193585393.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/LTL5884549544627842647.gal, -t, CGAL, -LTL, /tmp/LTL4996242814193585393.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/LTL5884549544627842647.gal -t CGAL -LTL /tmp/LTL4996242814193585393.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((p31!=1)||(p250!=1))")))&&("((p31==0)||(p250==0))"))))
Formula 0 simplified : !X("((p31==0)||(p250==0))" & GF"((p31!=1)||(p250!=1))")
Detected timeout of ITS tools.
[2021-05-08 11:44:06] [INFO ] Flatten gal took : 8 ms
[2021-05-08 11:44:06] [INFO ] Applying decomposition
[2021-05-08 11:44:06] [INFO ] Flatten gal took : 9 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/graph12735499174819088952.txt, -o, /tmp/graph12735499174819088952.bin, -w, /tmp/graph12735499174819088952.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/graph12735499174819088952.bin, -l, -1, -v, -w, /tmp/graph12735499174819088952.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:44:06] [INFO ] Decomposing Gal with order
[2021-05-08 11:44:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:44:06] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-08 11:44:06] [INFO ] Flatten gal took : 19 ms
[2021-05-08 11:44:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-08 11:44:06] [INFO ] Time to serialize gal into /tmp/LTL2696133369990032183.gal : 15 ms
[2021-05-08 11:44:06] [INFO ] Time to serialize properties into /tmp/LTL2852354788519159371.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/LTL2696133369990032183.gal, -t, CGAL, -LTL, /tmp/LTL2852354788519159371.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/LTL2696133369990032183.gal -t CGAL -LTL /tmp/LTL2852354788519159371.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((u33.p31!=1)||(u33.p250!=1))")))&&("((u33.p31==0)||(u33.p250==0))"))))
Formula 0 simplified : !X("((u33.p31==0)||(u33.p250==0))" & GF"((u33.p31!=1)||(u33.p250!=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1803920917095467675
[2021-05-08 11:44:21] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1803920917095467675
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/ltsmin1803920917095467675]
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/ltsmin1803920917095467675] 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/ltsmin1803920917095467675] 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 DES-PT-30b-15 finished in 36892 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4408783834055086157
[2021-05-08 11:44:22] [INFO ] Applying decomposition
[2021-05-08 11:44:22] [INFO ] Computing symmetric may disable matrix : 306 transitions.
[2021-05-08 11:44:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:44:22] [INFO ] Flatten gal took : 24 ms
[2021-05-08 11:44:22] [INFO ] Computing symmetric may enable matrix : 306 transitions.
[2021-05-08 11:44:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2147879413960160394.txt, -o, /tmp/graph2147879413960160394.bin, -w, /tmp/graph2147879413960160394.weights], workingDir=null]
[2021-05-08 11:44:22] [INFO ] Computing Do-Not-Accords matrix : 306 transitions.
[2021-05-08 11:44:22] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-08 11:44:22] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4408783834055086157
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/ltsmin4408783834055086157]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2147879413960160394.bin, -l, -1, -v, -w, /tmp/graph2147879413960160394.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 11:44:22] [INFO ] Decomposing Gal with order
[2021-05-08 11:44:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 11:44:22] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-08 11:44:22] [INFO ] Flatten gal took : 33 ms
[2021-05-08 11:44:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2021-05-08 11:44:22] [INFO ] Time to serialize gal into /tmp/LTLFireability7058306331605405290.gal : 3 ms
[2021-05-08 11:44:22] [INFO ] Time to serialize properties into /tmp/LTLFireability14279411237603555992.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/LTLFireability7058306331605405290.gal, -t, CGAL, -LTL, /tmp/LTLFireability14279411237603555992.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/LTLFireability7058306331605405290.gal -t CGAL -LTL /tmp/LTLFireability14279411237603555992.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !(((X(!("((i2.i0.u10.p124==1)&&(i2.i0.u10.p149==1))")))U(((F("(i9.i0.u37.p259!=1)"))&&(X(!("((i2.i0.u10.p124==1)&&(i2.i0.u10.p149==1))"))))||(G(X(!("((i2.i0.u10.p124==1)&&(i2.i0.u10.p149==1))")))))))
Formula 0 simplified : !(X!"((i2.i0.u10.p124==1)&&(i2.i0.u10.p149==1))" U ((X!"((i2.i0.u10.p124==1)&&(i2.i0.u10.p149==1))" & F"(i9.i0.u37.p259!=1)") | GX!"((i2.i0.u10.p124==1)&&(i2.i0.u10.p149==1))"))
Compilation finished in 5421 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4408783834055086157]
Link finished in 53 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, ((X((LTLAPp0==true))&&<>((LTLAPp1==true)))||X([]((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
LTSmin run took 795 ms.
FORMULA DES-PT-30b-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, X(<>(((!(LTLAPp2==true)&&X((LTLAPp2==true)))||[]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
LTSmin run took 154519 ms.
FORMULA DES-PT-30b-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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/ltsmin4408783834055086157]
WARNING : LTSmin timed out (>327 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, -p, --pins-guards, --when, --ltl, [](<>((LTLAPp3==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
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, []((LTLAPp4==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
LTSmin run took 17975 ms.
FORMULA DES-PT-30b-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, <>(((LTLAPp5==true)||X((LTLAPp6==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
LTSmin run took 436 ms.
FORMULA DES-PT-30b-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, X(((LTLAPp7==true)&&<>((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
LTSmin run took 418 ms.
FORMULA DES-PT-30b-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, ((<>(((LTLAPp9==true) U ((LTLAPp10==true)||[]((LTLAPp9==true))))) U (LTLAPp11==true))||(X((LTLAPp12==true))&&[]((LTLAPp13==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
LTSmin run took 8280 ms.
FORMULA DES-PT-30b-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
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, X(((LTLAPp14==true)&&[](<>((LTLAPp15==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
WARNING : LTSmin timed out (>327 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, X(((LTLAPp14==true)&&[](<>((LTLAPp15==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
Retrying LTSmin with larger timeout 2616 s
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/ltsmin4408783834055086157]
LTSmin run took 15415 ms.
FORMULA DES-PT-30b-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, X(((LTLAPp14==true)&&[](<>((LTLAPp15==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
Detected timeout of ITS tools.
[2021-05-08 12:06:12] [INFO ] Applying decomposition
[2021-05-08 12:06:12] [INFO ] Flatten gal took : 25 ms
[2021-05-08 12:06:12] [INFO ] Decomposing Gal with order
[2021-05-08 12:06:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:06:13] [INFO ] Removed a total of 127 redundant transitions.
[2021-05-08 12:06:13] [INFO ] Flatten gal took : 75 ms
[2021-05-08 12:06:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 441 labels/synchronizations in 43 ms.
[2021-05-08 12:06:13] [INFO ] Time to serialize gal into /tmp/LTLFireability3696117404178437295.gal : 3 ms
[2021-05-08 12:06:21] [INFO ] Time to serialize properties into /tmp/LTLFireability9362716062856054869.ltl : 8616 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/LTLFireability3696117404178437295.gal, -t, CGAL, -LTL, /tmp/LTLFireability9362716062856054869.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/LTLFireability3696117404178437295.gal -t CGAL -LTL /tmp/LTLFireability9362716062856054869.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("((i0.i0.i0.u4.p31==0)||(i1.i1.i0.i0.u137.p250==0))")&&(G(F(!("((i0.i0.i0.u4.p31==1)&&(i1.i1.i0.i0.u137.p250==1))")))))))
Formula 0 simplified : !X("((i0.i0.i0.u4.p31==0)||(i1.i1.i0.i0.u137.p250==0))" & GF!"((i0.i0.i0.u4.p31==1)&&(i1.i1.i0.i0.u137.p250==1))")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: LTL layer: formula: X(((LTLAPp14==true)&&[](<>((LTLAPp15==true)))))
pins2lts-mc-linux64( 1/ 8), 0.008: "X(((LTLAPp14==true)&&[](<>((LTLAPp15==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.008: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.029: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.118: DFS-FIFO for weak LTL, using special progress label 323
pins2lts-mc-linux64( 0/ 8), 0.118: There are 324 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.118: State length is 362, there are 314 groups
pins2lts-mc-linux64( 0/ 8), 0.118: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.118: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.118: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.118: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.300: ~1 levels ~960 states ~4984 transitions
pins2lts-mc-linux64( 3/ 8), 0.314: ~1 levels ~1920 states ~10232 transitions
pins2lts-mc-linux64( 6/ 8), 0.327: ~1 levels ~3840 states ~20848 transitions
pins2lts-mc-linux64( 3/ 8), 0.364: ~1 levels ~7680 states ~45248 transitions
pins2lts-mc-linux64( 4/ 8), 0.449: ~1 levels ~15360 states ~100944 transitions
pins2lts-mc-linux64( 7/ 8), 0.624: ~1 levels ~30720 states ~188552 transitions
pins2lts-mc-linux64( 5/ 8), 0.940: ~1 levels ~61440 states ~386416 transitions
pins2lts-mc-linux64( 5/ 8), 1.588: ~1 levels ~122880 states ~822776 transitions
pins2lts-mc-linux64( 5/ 8), 2.990: ~1 levels ~245760 states ~1838384 transitions
pins2lts-mc-linux64( 1/ 8), 6.703: ~1 levels ~491520 states ~3897968 transitions
pins2lts-mc-linux64( 3/ 8), 13.695: ~1 levels ~983040 states ~8456856 transitions
pins2lts-mc-linux64( 3/ 8), 26.679: ~1 levels ~1966080 states ~16458408 transitions
pins2lts-mc-linux64( 3/ 8), 55.100: ~1 levels ~3932160 states ~33783808 transitions
pins2lts-mc-linux64( 3/ 8), 114.248: ~1 levels ~7864320 states ~69491728 transitions
pins2lts-mc-linux64( 3/ 8), 231.402: ~1 levels ~15728640 states ~143472320 transitions
pins2lts-mc-linux64( 3/ 8), 471.009: ~1 levels ~31457280 states ~300271688 transitions
pins2lts-mc-linux64( 3/ 8), 972.372: ~1 levels ~62914560 states ~624534200 transitions
pins2lts-mc-linux64( 4/ 8), 1492.205: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1492.234:
pins2lts-mc-linux64( 0/ 8), 1492.234: mean standard work distribution: 7.1% (states) 2.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1492.235:
pins2lts-mc-linux64( 0/ 8), 1492.235: Explored 80468110 states 983141999 transitions, fanout: 12.218
pins2lts-mc-linux64( 0/ 8), 1492.235: Total exploration time 1492.090 sec (1492.060 sec minimum, 1492.081 sec on average)
pins2lts-mc-linux64( 0/ 8), 1492.235: States per second: 53930, Transitions per second: 658903
pins2lts-mc-linux64( 0/ 8), 1492.235:
pins2lts-mc-linux64( 0/ 8), 1492.235: Progress states detected: 134217253
pins2lts-mc-linux64( 0/ 8), 1492.235: Redundant explorations: -40.0464
pins2lts-mc-linux64( 0/ 8), 1492.235:
pins2lts-mc-linux64( 0/ 8), 1492.235: Queue width: 8B, total height: 92064951, memory: 702.40MB
pins2lts-mc-linux64( 0/ 8), 1492.235: Tree memory: 1134.1MB, 8.9 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1492.235: Tree fill ratio (roots/leafs): 99.0%/43.0%
pins2lts-mc-linux64( 0/ 8), 1492.235: Stored 308 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1492.235: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1492.235: Est. total memory use: 1836.5MB (~1726.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, X(((LTLAPp14==true)&&[](<>((LTLAPp15==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
255
java.lang.RuntimeException: Unexpected exception when executing 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, X(((LTLAPp14==true)&&[](<>((LTLAPp15==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4408783834055086157]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 12:28:12] [INFO ] Flatten gal took : 9 ms
[2021-05-08 12:28:12] [INFO ] Input system was already deterministic with 306 transitions.
[2021-05-08 12:28:12] [INFO ] Transformed 361 places.
[2021-05-08 12:28:12] [INFO ] Transformed 306 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 12:28:12] [INFO ] Time to serialize gal into /tmp/LTLFireability8006056682430889116.gal : 1 ms
[2021-05-08 12:28:12] [INFO ] Time to serialize properties into /tmp/LTLFireability10742013457747476078.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/LTLFireability8006056682430889116.gal, -t, CGAL, -LTL, /tmp/LTLFireability10742013457747476078.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability8006056682430889116.gal -t CGAL -LTL /tmp/LTLFireability10742013457747476078.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("((p31==0)||(p250==0))")&&(G(F(!("((p31==1)&&(p250==1))")))))))
Formula 0 simplified : !X("((p31==0)||(p250==0))" & GF!"((p31==1)&&(p250==1))")

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DES-PT-30b"
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 DES-PT-30b, 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 r064-tall-162038396700109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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