Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r276-smll-165307352900075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is UtilityControlRoom-COL-Z2T4N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-165307352900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 8.6K Apr 29 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 9 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 09:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653119129346

Running Version 202205111006
[2022-05-21 07:45:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 07:45:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:45:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-21 07:45:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-21 07:45:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 909 ms
[2022-05-21 07:45:32] [INFO ] Imported 13 HL places and 12 HL transitions for a total of 174 PT places and 270.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 07:45:32] [INFO ] Built PT skeleton of HLPN with 13 places and 12 transitions 37 arcs in 8 ms.
[2022-05-21 07:45:32] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 29) seen :28
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
[2022-05-21 07:45:33] [INFO ] Flatten gal took : 161 ms
[2022-05-21 07:45:33] [INFO ] Flatten gal took : 6 ms
Transition timeout forces synchronizations/join behavior on parameter c of sort Cli
Domain [Cli(10), Z(2), Z(2)] of place MovetoZ breaks symmetries in sort Z
[2022-05-21 07:45:33] [INFO ] Unfolded HLPN to a Petri net with 174 places and 270 transitions 850 arcs in 25 ms.
[2022-05-21 07:45:33] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Ensure Unique test removed 40 transitions
Reduce redundant transitions removed 40 transitions.
Support contains 164 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:45:33] [INFO ] Computed 23 place invariants in 24 ms
[2022-05-21 07:45:33] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:45:33] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-21 07:45:33] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:45:33] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-21 07:45:34] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 230/230 transitions.
Support contains 164 out of 174 places after structural reductions.
[2022-05-21 07:45:34] [INFO ] Flatten gal took : 45 ms
[2022-05-21 07:45:34] [INFO ] Flatten gal took : 38 ms
[2022-05-21 07:45:34] [INFO ] Input system was already deterministic with 230 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 27) seen :26
Finished Best-First random walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(F(p0))&&X(p1)))||G(p2))))'
Support contains 43 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 16 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:45:35] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:45:35] [INFO ] Implicit Places using invariants in 138 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 503 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s0 s1) (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51)), p2:(GT 2 (ADD s113 s114 s115 s116 s117 s118 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7954 reset in 632 ms.
Product exploration explored 100000 steps with 7931 reset in 706 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 1048 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 321 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 19 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 1015 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:45:40] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:45:40] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:45:40] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:45:40] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:45:40] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:45:40] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
Knowledge based reduction with 1 factoid took 428 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 18 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2)]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 712 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 6 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 379 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 7966 reset in 412 ms.
Product exploration explored 100000 steps with 7979 reset in 307 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 250 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 28 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2022-05-21 07:45:44] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:45:44] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-21 07:45:44] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Product exploration explored 100000 steps with 8004 reset in 754 ms.
Product exploration explored 100000 steps with 7944 reset in 497 ms.
Built C files in :
/tmp/ltsmin4850539898888963426
[2022-05-21 07:45:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4850539898888963426
Running compilation step : cd /tmp/ltsmin4850539898888963426;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin4850539898888963426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4850539898888963426;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2435898074754651272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 43 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:46:01] [INFO ] Computed 22 place invariants in 17 ms
[2022-05-21 07:46:01] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:46:01] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:46:01] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:46:01] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:46:01] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/153 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin3773086839989213762
[2022-05-21 07:46:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3773086839989213762
Running compilation step : cd /tmp/ltsmin3773086839989213762;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 682 ms.
Running link step : cd /tmp/ltsmin3773086839989213762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3773086839989213762;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1661118362859044346.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:46:16] [INFO ] Flatten gal took : 21 ms
[2022-05-21 07:46:16] [INFO ] Flatten gal took : 19 ms
[2022-05-21 07:46:16] [INFO ] Time to serialize gal into /tmp/LTL1864881305370895835.gal : 8 ms
[2022-05-21 07:46:16] [INFO ] Time to serialize properties into /tmp/LTL4277461740739333991.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1864881305370895835.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4277461740739333991.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1864881...266
Read 1 LTL properties
Checking formula 0 : !((X((F((F(F("((IdleTechs_0+IdleTechs_1)<=(((((Assigned_0+Assigned_1)+(Assigned_2+Assigned_3))+((Assigned_4+Assigned_5)+(Assigned_6+As...796
Formula 0 simplified : !X(F(F"((IdleTechs_0+IdleTechs_1)<=(((((Assigned_0+Assigned_1)+(Assigned_2+Assigned_3))+((Assigned_4+Assigned_5)+(Assigned_6+Assigne...779
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 07:46:32] [INFO ] Flatten gal took : 18 ms
[2022-05-21 07:46:32] [INFO ] Applying decomposition
[2022-05-21 07:46:32] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9067905105448163221.txt' '-o' '/tmp/graph9067905105448163221.bin' '-w' '/tmp/graph9067905105448163221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9067905105448163221.bin' '-l' '-1' '-v' '-w' '/tmp/graph9067905105448163221.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:46:32] [INFO ] Decomposing Gal with order
[2022-05-21 07:46:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:46:32] [INFO ] Removed a total of 139 redundant transitions.
[2022-05-21 07:46:32] [INFO ] Flatten gal took : 124 ms
[2022-05-21 07:46:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 20 ms.
[2022-05-21 07:46:32] [INFO ] Time to serialize gal into /tmp/LTL6552022469758786568.gal : 7 ms
[2022-05-21 07:46:32] [INFO ] Time to serialize properties into /tmp/LTL1237320941505711513.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6552022469758786568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1237320941505711513.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6552022...266
Read 1 LTL properties
Checking formula 0 : !((X((F((F(F("((gu5.IdleTechs_0+gu5.IdleTechs_1)<=(((((gu5.Assigned_0+gu5.Assigned_1)+(gu5.Assigned_2+gu5.Assigned_3))+((gu5.Assigned_...1153
Formula 0 simplified : !X(F(F"((gu5.IdleTechs_0+gu5.IdleTechs_1)<=(((((gu5.Assigned_0+gu5.Assigned_1)+(gu5.Assigned_2+gu5.Assigned_3))+((gu5.Assigned_4+gu5...1136
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1237370993757883541
[2022-05-21 07:46:47] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1237370993757883541
Running compilation step : cd /tmp/ltsmin1237370993757883541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 466 ms.
Running link step : cd /tmp/ltsmin1237370993757883541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1237370993757883541;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((<>(<>((LTLAPp0==true)))&&X((LTLAPp1==true))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-00 finished in 87633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(X(p1)) U !G((G(p0)||p2)))))'
Support contains 62 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 174 transition count 210
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 33 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:47:02] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:47:02] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:47:02] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:47:03] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2022-05-21 07:47:03] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:47:03] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-21 07:47:03] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, (OR p2 p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 0}, { cond=p2, acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 577 ms.
Stack based approach found an accepted trace after 35455 steps with 0 reset with depth 35456 and stack size 2754 in 244 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-01 finished in 1641 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(G(p1)))))'
Support contains 31 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 19 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:47:04] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:47:04] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:47:04] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 07:47:04] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:47:04] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-21 07:47:05] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 2 (ADD s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153)), p0:(LEQ s103 (ADD s92 s93 s94 s95 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-03 finished in 950 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0))||p1)))'
Support contains 33 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Applied a total of 100 rules in 22 ms. Remains 134 /174 variables (removed 40) and now considering 170/230 (removed 60) transitions.
// Phase 1: matrix 170 rows 134 cols
[2022-05-21 07:47:05] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-21 07:47:05] [INFO ] Implicit Places using invariants in 132 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/174 places, 170/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 133 /133 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/174 places, 170/230 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s82 (ADD s0 s1)) (OR (LEQ (ADD s0 s1) (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81)) (LEQ (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1284 reset in 345 ms.
Product exploration explored 100000 steps with 1281 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 434 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 8 factoid took 306 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 170/170 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 07:47:07] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:47:07] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 07:47:07] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 07:47:07] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2022-05-21 07:47:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 170 rows 133 cols
[2022-05-21 07:47:07] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:07] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 170/170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1277 reset in 250 ms.
Product exploration explored 100000 steps with 1249 reset in 215 ms.
Built C files in :
/tmp/ltsmin3743889730900423935
[2022-05-21 07:47:09] [INFO ] Computing symmetric may disable matrix : 170 transitions.
[2022-05-21 07:47:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:47:09] [INFO ] Computing symmetric may enable matrix : 170 transitions.
[2022-05-21 07:47:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:47:09] [INFO ] Computing Do-Not-Accords matrix : 170 transitions.
[2022-05-21 07:47:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:47:09] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3743889730900423935
Running compilation step : cd /tmp/ltsmin3743889730900423935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 506 ms.
Running link step : cd /tmp/ltsmin3743889730900423935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3743889730900423935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10453477967591682788.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 170/170 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 133 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 102 transition count 120
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 102 transition count 120
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 92 transition count 100
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 92 transition count 100
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 82 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 82 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 112 place count 82 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 112 place count 82 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 132 place count 72 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 152 place count 62 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 52 transition count 50
Applied a total of 172 rules in 21 ms. Remains 52 /133 variables (removed 81) and now considering 50/170 (removed 120) transitions.
// Phase 1: matrix 50 rows 52 cols
[2022-05-21 07:47:24] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:24] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 50 rows 52 cols
[2022-05-21 07:47:24] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:47:24] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2022-05-21 07:47:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 52 cols
[2022-05-21 07:47:24] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:47:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/133 places, 50/170 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/133 places, 50/170 transitions.
Built C files in :
/tmp/ltsmin1798659265548117836
[2022-05-21 07:47:24] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2022-05-21 07:47:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:47:24] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2022-05-21 07:47:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:47:24] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2022-05-21 07:47:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:47:24] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1798659265548117836
Running compilation step : cd /tmp/ltsmin1798659265548117836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 212 ms.
Running link step : cd /tmp/ltsmin1798659265548117836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1798659265548117836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10018768710251536180.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 07:47:39] [INFO ] Flatten gal took : 13 ms
[2022-05-21 07:47:39] [INFO ] Flatten gal took : 10 ms
[2022-05-21 07:47:39] [INFO ] Time to serialize gal into /tmp/LTL14909264128817844065.gal : 4 ms
[2022-05-21 07:47:39] [INFO ] Time to serialize properties into /tmp/LTL14803289996074222561.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14909264128817844065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14803289996074222561.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1490926...268
Read 1 LTL properties
Checking formula 0 : !((G((G(F("(Idles_0>=1)")))||("((Idles_0<=(IdleTechs_0+IdleTechs_1))&&(((IdleTechs_0+IdleTechs_1)<=((((ControlRoomDispatch_0+ControlRo...975
Formula 0 simplified : !G("((Idles_0<=(IdleTechs_0+IdleTechs_1))&&(((IdleTechs_0+IdleTechs_1)<=((((ControlRoomDispatch_0+ControlRoomDispatch_1)+(ControlRoo...966
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-21 07:47:54] [INFO ] Flatten gal took : 11 ms
[2022-05-21 07:47:54] [INFO ] Applying decomposition
[2022-05-21 07:47:54] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13391286814592852340.txt' '-o' '/tmp/graph13391286814592852340.bin' '-w' '/tmp/graph13391286814592852340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13391286814592852340.bin' '-l' '-1' '-v' '-w' '/tmp/graph13391286814592852340.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:47:54] [INFO ] Decomposing Gal with order
[2022-05-21 07:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:47:54] [INFO ] Removed a total of 115 redundant transitions.
[2022-05-21 07:47:54] [INFO ] Flatten gal took : 38 ms
[2022-05-21 07:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 6 ms.
[2022-05-21 07:47:54] [INFO ] Time to serialize gal into /tmp/LTL7403826742841897713.gal : 3 ms
[2022-05-21 07:47:54] [INFO ] Time to serialize properties into /tmp/LTL6738589525236710376.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7403826742841897713.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6738589525236710376.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7403826...266
Read 1 LTL properties
Checking formula 0 : !((G((G(F("(gi0.gu1.Idles_0>=1)")))||("((gi0.gu1.Idles_0<=(gi0.gu1.IdleTechs_0+gi0.gu1.IdleTechs_1))&&(((gi0.gu1.IdleTechs_0+gi0.gu1.I...1263
Formula 0 simplified : !G("((gi0.gu1.Idles_0<=(gi0.gu1.IdleTechs_0+gi0.gu1.IdleTechs_1))&&(((gi0.gu1.IdleTechs_0+gi0.gu1.IdleTechs_1)<=((((gi0.gu1.ControlR...1254
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
495 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.98224,132324,1,0,60,689974,33,1,3253,405288,159
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-04 finished in 55431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((G(p0)||p0))&&G(p1)&&p2))))'
Support contains 51 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 6 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:00] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:48:00] [INFO ] Implicit Places using invariants in 128 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(GT (ADD s113 s114 s115 s116 s117 s118 s119 s120 s121 s122) (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101)), p0:(LEQ 3 s102), p2:(LEQ (ADD s72 s73 s74...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-05 finished in 388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 41 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:01] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:48:01] [INFO ] Implicit Places using invariants in 98 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31) (ADD s103 s104 s105 s106 s107 s108 s109 s110 s111 s112)), p1:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19049 reset in 305 ms.
Product exploration explored 100000 steps with 18930 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 210 rows 153 cols
[2022-05-21 07:48:02] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:48:02] [INFO ] [Real]Absence check using 22 positive place invariants in 13 ms returned sat
[2022-05-21 07:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:02] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-21 07:48:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:48:02] [INFO ] [Nat]Absence check using 22 positive place invariants in 12 ms returned sat
[2022-05-21 07:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:03] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-05-21 07:48:03] [INFO ] Computed and/alt/rep : 200/310/200 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-21 07:48:03] [INFO ] Added : 90 causal constraints over 18 iterations in 396 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 30 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 153 transition count 190
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 133 transition count 190
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 113 transition count 170
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 100 place count 113 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 112 transition count 130
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 112 transition count 130
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 112 place count 102 transition count 120
Iterating global reduction 1 with 10 rules applied. Total rules applied 122 place count 102 transition count 120
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 132 place count 92 transition count 100
Iterating global reduction 1 with 10 rules applied. Total rules applied 142 place count 92 transition count 100
Applied a total of 142 rules in 27 ms. Remains 92 /153 variables (removed 61) and now considering 100/210 (removed 110) transitions.
// Phase 1: matrix 100 rows 92 cols
[2022-05-21 07:48:03] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:03] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 100 rows 92 cols
[2022-05-21 07:48:03] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-05-21 07:48:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 100 rows 92 cols
[2022-05-21 07:48:03] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-21 07:48:03] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/153 places, 100/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/153 places, 100/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 100 rows 92 cols
[2022-05-21 07:48:04] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:04] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2022-05-21 07:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:04] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-21 07:48:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:48:04] [INFO ] [Nat]Absence check using 22 positive place invariants in 15 ms returned sat
[2022-05-21 07:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:04] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-21 07:48:04] [INFO ] Computed and/alt/rep : 90/140/90 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-21 07:48:04] [INFO ] Added : 42 causal constraints over 9 iterations in 108 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18928 reset in 276 ms.
Product exploration explored 100000 steps with 18922 reset in 272 ms.
Built C files in :
/tmp/ltsmin12226622737460486221
[2022-05-21 07:48:05] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-05-21 07:48:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:05] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-05-21 07:48:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:05] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-05-21 07:48:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12226622737460486221
Running compilation step : cd /tmp/ltsmin12226622737460486221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin12226622737460486221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12226622737460486221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10528924718339621407.hoa' '--buchi-type=spotba'
LTSmin run took 1371 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-07 finished in 5850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&X(p1))))'
Support contains 63 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Applied a total of 0 rules in 2 ms. Remains 174 /174 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 174 cols
[2022-05-21 07:48:06] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:48:07] [INFO ] Implicit Places using invariants in 130 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 173/174 places, 230/230 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 173/174 places, 230/230 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s122 (ADD s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172)), p0:(LEQ (ADD s52 s53 s54 s55 s56 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 311 ms.
Stack based approach found an accepted trace after 3010 steps with 0 reset with depth 3011 and stack size 3011 in 11 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-08 finished in 584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(F(!(p0 U (F(p1)||p0)))))&&F(p2))))'
Support contains 52 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 144 transition count 200
Applied a total of 60 rules in 16 ms. Remains 144 /174 variables (removed 30) and now considering 200/230 (removed 30) transitions.
// Phase 1: matrix 200 rows 144 cols
[2022-05-21 07:48:07] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:48:07] [INFO ] Implicit Places using invariants in 168 ms returned [102, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 175 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/174 places, 200/230 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/174 places, 200/230 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) p1 p0), (NOT p2), (OR p1 p0), (OR p0 p1), p1]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ (ADD s0 s1) (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101)), p0:(LEQ (ADD s92 s93 s94 s95 s96 s97 s98 s99 s100 s101) (ADD s102 s103 s104 s105 s10...], 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]]
Product exploration explored 100000 steps with 0 reset in 271 ms.
Stack based approach found an accepted trace after 4407 steps with 0 reset with depth 4408 and stack size 4408 in 13 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-09 finished in 693 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U !(p1 U X(p2)))))'
Support contains 23 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 4 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:08] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:48:08] [INFO ] Implicit Places using invariants in 118 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 210/230 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 153/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 209 ms :[p2, p2, p2, p2, p2, true]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s102 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p0:(LEQ 2 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 334 ms.
Product exploration explored 100000 steps with 33333 reset in 345 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) (NOT p2))
Knowledge based reduction with 14 factoid took 537 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-11 finished in 1584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 192 place count 83 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 202 place count 83 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 212 place count 83 transition count 80
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 233 place count 72 transition count 70
Applied a total of 233 rules in 29 ms. Remains 72 /174 variables (removed 102) and now considering 70/230 (removed 160) transitions.
// Phase 1: matrix 70 rows 72 cols
[2022-05-21 07:48:09] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:09] [INFO ] Implicit Places using invariants in 66 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/174 places, 70/230 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 61 transition count 60
Applied a total of 20 rules in 5 ms. Remains 61 /71 variables (removed 10) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 61 cols
[2022-05-21 07:48:09] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-21 07:48:09] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 60 rows 61 cols
[2022-05-21 07:48:09] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-21 07:48:10] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 61/174 places, 60/230 transitions.
Finished structural reductions, in 2 iterations. Remains : 61/174 places, 60/230 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s31 s32 s33 s34 s35 s36 s37 s38 s39 s40))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 218 ms.
Stack based approach found an accepted trace after 2099 steps with 0 reset with depth 2100 and stack size 2100 in 5 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-12 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((G(F((G(p0)&&p1)))&&p0)))))'
Support contains 31 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 174 transition count 190
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 100 place count 134 transition count 170
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 100 place count 134 transition count 150
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 140 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 113 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 113 transition count 130
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 152 place count 103 transition count 120
Iterating global reduction 2 with 10 rules applied. Total rules applied 162 place count 103 transition count 120
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 172 place count 93 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 182 place count 93 transition count 100
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 203 place count 82 transition count 90
Applied a total of 203 rules in 24 ms. Remains 82 /174 variables (removed 92) and now considering 90/230 (removed 140) transitions.
// Phase 1: matrix 90 rows 82 cols
[2022-05-21 07:48:10] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:10] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 90 rows 82 cols
[2022-05-21 07:48:10] [INFO ] Computed 22 place invariants in 2 ms
[2022-05-21 07:48:10] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-21 07:48:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 90 rows 82 cols
[2022-05-21 07:48:10] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:10] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/174 places, 90/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/174 places, 90/230 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 2 s51), p0:(GT (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61) (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 199 ms.
Stack based approach found an accepted trace after 4834 steps with 0 reset with depth 4835 and stack size 3095 in 16 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-13 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 230/230 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 154 transition count 210
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 154 transition count 210
Applied a total of 40 rules in 3 ms. Remains 154 /174 variables (removed 20) and now considering 210/230 (removed 20) transitions.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:10] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-21 07:48:11] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:11] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:48:11] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:11] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-21 07:48:11] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 210/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/174 places, 210/230 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-COL-Z2T4N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s103 (ADD s114 s115 s116 s117 s118 s119 s120 s121 s122 s123))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 13207 reset in 310 ms.
Product exploration explored 100000 steps with 13234 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 210 rows 154 cols
[2022-05-21 07:48:12] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-21 07:48:12] [INFO ] [Real]Absence check using 23 positive place invariants in 16 ms returned sat
[2022-05-21 07:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:13] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-05-21 07:48:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:48:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-21 07:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:13] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2022-05-21 07:48:13] [INFO ] Computed and/alt/rep : 180/270/180 causal constraints (skipped 20 transitions) in 24 ms.
[2022-05-21 07:48:13] [INFO ] Added : 69 causal constraints over 14 iterations in 333 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 210/210 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 154 transition count 190
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 134 transition count 190
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 120 place count 94 transition count 150
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 140 place count 94 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 93 transition count 110
Ensure Unique test removed 1 places
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 92 transition count 110
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 153 place count 82 transition count 100
Iterating global reduction 1 with 10 rules applied. Total rules applied 163 place count 82 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 173 place count 72 transition count 80
Iterating global reduction 1 with 10 rules applied. Total rules applied 183 place count 72 transition count 80
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 193 place count 62 transition count 70
Iterating global reduction 1 with 10 rules applied. Total rules applied 203 place count 62 transition count 70
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 213 place count 62 transition count 60
Applied a total of 213 rules in 35 ms. Remains 62 /154 variables (removed 92) and now considering 60/210 (removed 150) transitions.
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:13] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:13] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:13] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-21 07:48:14] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-05-21 07:48:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:14] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:14] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/154 places, 60/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/154 places, 60/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 60 rows 62 cols
[2022-05-21 07:48:14] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-21 07:48:14] [INFO ] [Real]Absence check using 22 positive place invariants in 11 ms returned sat
[2022-05-21 07:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:14] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-21 07:48:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:48:14] [INFO ] [Nat]Absence check using 22 positive place invariants in 8 ms returned sat
[2022-05-21 07:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:48:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-21 07:48:14] [INFO ] Computed and/alt/rep : 40/60/40 causal constraints (skipped 10 transitions) in 5 ms.
[2022-05-21 07:48:14] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16217 reset in 387 ms.
Product exploration explored 100000 steps with 16258 reset in 420 ms.
Built C files in :
/tmp/ltsmin16359415958193018300
[2022-05-21 07:48:15] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2022-05-21 07:48:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:15] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2022-05-21 07:48:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:15] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2022-05-21 07:48:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16359415958193018300
Running compilation step : cd /tmp/ltsmin16359415958193018300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin16359415958193018300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16359415958193018300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16149521699976564244.hoa' '--buchi-type=spotba'
LTSmin run took 79 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property UtilityControlRoom-COL-Z2T4N10-LTLCardinality-14 finished in 5133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(F(p0))&&X(p1)))||G(p2))))'
[2022-05-21 07:48:16] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11658028108554253471
[2022-05-21 07:48:16] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2022-05-21 07:48:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:16] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2022-05-21 07:48:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:16] [INFO ] Applying decomposition
[2022-05-21 07:48:16] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2022-05-21 07:48:16] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 07:48:16] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11658028108554253471
Running compilation step : cd /tmp/ltsmin11658028108554253471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 07:48:16] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15196409455361050903.txt' '-o' '/tmp/graph15196409455361050903.bin' '-w' '/tmp/graph15196409455361050903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15196409455361050903.bin' '-l' '-1' '-v' '-w' '/tmp/graph15196409455361050903.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:48:16] [INFO ] Decomposing Gal with order
[2022-05-21 07:48:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:48:16] [INFO ] Removed a total of 169 redundant transitions.
[2022-05-21 07:48:16] [INFO ] Flatten gal took : 98 ms
[2022-05-21 07:48:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 249 labels/synchronizations in 27 ms.
[2022-05-21 07:48:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality8075870516524849496.gal : 5 ms
[2022-05-21 07:48:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality16189696510666416987.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8075870516524849496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16189696510666416987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X((F((F(F("((gu3.IdleTechs_0+gu3.IdleTechs_1)<=(((((gu3.Assigned_0+gu3.Assigned_1)+(gu3.Assigned_2+gu3.Assigned_3))+((gu3.Assigned_...1157
Formula 0 simplified : !X(F(F"((gu3.IdleTechs_0+gu3.IdleTechs_1)<=(((((gu3.Assigned_0+gu3.Assigned_1)+(gu3.Assigned_2+gu3.Assigned_3))+((gu3.Assigned_4+gu3...1140
Compilation finished in 674 ms.
Running link step : cd /tmp/ltsmin11658028108554253471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11658028108554253471;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((<>(<>((LTLAPp0==true)))&&X((LTLAPp1==true))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
LTSmin run took 3185 ms.
FORMULA UtilityControlRoom-COL-Z2T4N10-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 169058 ms.

BK_STOP 1653119300363

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="UtilityControlRoom-COL-Z2T4N10"
export BK_EXAMINATION="LTLCardinality"
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 UtilityControlRoom-COL-Z2T4N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-165307352900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtilityControlRoom-COL-Z2T4N10.tgz
mv UtilityControlRoom-COL-Z2T4N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;