Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 29K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HexagonalGrid-PT-110, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636500004
=====================================================================

--------------------
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 HexagonalGrid-PT-110-CTLFireability-00
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-01
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-02
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-03
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-04
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-05
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-06
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-07
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-08
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-09
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-10
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-11
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-12
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-13
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-14
FORMULA_NAME HexagonalGrid-PT-110-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1526734125530


BK_STOP 1526734173774

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using HexagonalGrid-PT-110 as instance name.
Using HexagonalGrid as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 190, 'Memory': 113.07, 'Tool': 'lola'}, {'Time': 2279, 'Memory': 160.52, 'Tool': 'gspn'}, {'Time': 6132, 'Memory': 358.44, 'Tool': 'itstools'}, {'Time': 7481, 'Memory': 7482.82, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola HexagonalGrid-PT-110...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
HexagonalGrid-PT-110: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-110: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ HexagonalGrid-PT-110 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 73/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 31 places, 42 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 55 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-110-CTLFireability.task
lola: (NOT(E ((FIREABLE(t5_1_1) U FIREABLE(t2_1_1)))) AND (((NOT FIREABLE(ti1_4_1_1) OR A (F (FIREABLE(ti3_6_1_1)))) OR (FIREABLE(to3_1_1) OR NOT FIREABLE(to5_1_1) OR FIREABLE(ti4_3_1_1))) AND E (F (A (X (FIREABLE(ti2_4_1_1))))))) : (E (F (A (G ((FIREABLE(ti2_5_1_1) OR FIREABLE(to6_1_1)))))) OR NOT((((FIREABLE(ti1_2_1_1) AND FIREABLE(t1_1_1) AND (FIREABLE(ti3_5_1_1) OR FIREABLE(ti4_1_1_1))) OR FIREABLE(ti5_2_1_1)) OR ((FIREABLE(ti5_1_1_1) OR (FIREABLE(ti5_1_1_1) AND FIREABLE(ti5_2_1_1))) OR E (F (FIREABLE(ti1_5_1_1))))))) : (E (F ((NOT FIREABLE(ti5_1_1_1) AND NOT FIREABLE(ti4_3_1_1)))) AND NOT FIREABLE(ti2_5_1_1)) : E (((FIREABLE(ti2_5_1_1)) U (E (G (FIREABLE(ti2_5_1_1))) AND ((FIREABLE(ti5_4_1_1) OR FIREABLE(t5_1_1)) AND FIREABLE(t4_1_1))))) : NOT((E (X (A (F (FIREABLE(ti4_1_1_1))))) AND NOT(E (G ((FIREABLE(ti5_4_1_1) AND FIREABLE(t2_1_1))))))) : ((E (F (A (F (FIREABLE(ti2_3_1_1))))) AND ((A (F (FIREABLE(t4_1_1))) AND (FIREABLE(ti5_6_1_1) OR FIREABLE(to2_1_1) OR (FIREABLE(ti4_5_1_1) AND FIREABLE(to4_1_1)))) AND E (G ((FIREABLE(to2_1_1) AND FIREABLE(to3_1_1)))))) OR NOT(E (F (A (X (FIREABLE(t2_1_1))))))) : (E (F ((A (X (FIREABLE(ti6_4_1_1))) AND E (X (FIREABLE(to1_1_1)))))) OR A ((FIREABLE(ti6_5_1_1) U A (X (FIREABLE(to6_1_1)))))) : E (((NOT FIREABLE(to6_1_1) OR NOT FIREABLE(ti2_6_1_1) OR (FIREABLE(ti1_4_1_1) AND FIREABLE(t5_1_1) AND (FIREABLE(ti1_3_1_1) OR FIREABLE(ti5_2_1_1)))) U NOT(E (F (FIREABLE(t6_1_1)))))) : E (F ((A (G ((FIREABLE(ti5_3_1_1) AND FIREABLE(ti3_2_1_1)))) AND FIREABLE(ti6_4_1_1)))) : NOT(A (G (NOT(E (X (FIREABLE(ti2_5_1_1))))))) : A (F (NOT((A (X (FIREABLE(ti3_6_1_1))) OR E (F (FIREABLE(ti2_3_1_1))))))) : FIREABLE(ti5_2_1_1) : E (G ((E ((FIREABLE(ti6_1_1_1) U FIREABLE(t5_1_1))) OR ((FIREABLE(to4_1_1) AND FIREABLE(ti3_2_1_1) AND FIREABLE(ti1_2_1_1)) OR A (X (FIREABLE(ti5_6_1_1))))))) : NOT(E ((E (X (FIREABLE(ti1_2_1_1))) U (FIREABLE(ti3_4_1_1) AND FIREABLE(ti2_4_1_1) AND NOT FIREABLE(to3_1_1))))) : NOT((E (F ((FIREABLE(to5_1_1) OR FIREABLE(ti6_5_1_1) OR FIREABLE(t1_1_1)))) AND FIREABLE(ti4_3_1_1))) : (((NOT FIREABLE(ti3_5_1_1) OR FIREABLE(ti6_5_1_1) OR FIREABLE(to4_1_1) OR FIREABLE(ti3_4_1_1)) OR ((E (G (FIREABLE(ti2_5_1_1))) OR A (G (FIREABLE(ti6_2_1_1)))) OR (FIREABLE(ti3_6_1_1) OR FIREABLE(t3_1_1) OR NOT FIREABLE(ti2_6_1_1) OR NOT FIREABLE(ti3_1_1_1) OR NOT FIREABLE(ti4_3_1_1)))) AND (((((FIREABLE(t5_1_1) OR FIREABLE(t1_1_1)) AND NOT FIREABLE(ti2_6_1_1)) AND A (F (FIREABLE(ti1_5_1_1)))) AND E (G ((FIREABLE(ti1_2_1_1) AND FIREABLE(ti1_4_1_1))))) AND NOT FIREABLE(ti3_6_1_1)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E ((FIREABLE(t5_1_1) U FIREABLE(t2_1_1)))) AND (((NOT FIREABLE(ti1_4_1_1) OR A (F (FIREABLE(ti3_6_1_1)))) OR (FIREABLE(to3_1_1) OR NOT FIREABLE(to5_1_1) OR FIREABLE(ti4_3_1_1))) AND E (F (A (X (FIREABLE(ti2_4_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t5_1_1) R NOT FIREABLE(t2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((NOT FIREABLE(t5_1_1) R NOT FIREABLE(t2_1_1)))
lola: processed formula: A ((NOT FIREABLE(t5_1_1) R NOT FIREABLE(t2_1_1)))
lola: processed formula length: 49
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(ti1_4_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(ti1_4_1_1)
lola: processed formula length: 23
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FIREABLE(ti2_4_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(FIREABLE(ti2_4_1_1)))
lola: processed formula length: 33
lola: 7 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 774 markings, 1410 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((FIREABLE(ti2_5_1_1) OR FIREABLE(to6_1_1)))))) OR NOT((((FIREABLE(ti1_2_1_1) AND FIREABLE(t1_1_1) AND (FIREABLE(ti3_5_1_1) OR FIREABLE(ti4_1_1_1))) OR FIREABLE(ti5_2_1_1)) OR ((FIREABLE(ti5_1_1_1) OR (FIREABLE(ti5_1_1_1) AND FIREABLE(ti5_2_1_1))) OR E (F (FIREABLE(ti1_5_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(ti2_5_1_1) OR FIREABLE(to6_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (NOT FIREABLE(ti2_5_1_1) AND NOT FIREABLE(to6_1_1)))))
lola: processed formula length: 76
lola: 10 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 32968 markings, 260714 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t1_1_1) OR (NOT FIREABLE(ti3_5_1_1) AND NOT FIREABLE(ti4_1_1_1))) AND NOT FIREABLE(ti5_2_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t1_1_1) OR (NOT FIREABLE(ti3_5_1_1) AND NOT FIREABLE(ti4_1_1_1))) AND NOT FIREABLE(ti5_2_1_1))
lola: processed formula length: 138
lola: 7 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti5_1_1_1) AND (NOT FIREABLE(ti5_1_1_1) OR NOT FIREABLE(ti5_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(ti5_1_1_1) AND (NOT FIREABLE(ti5_1_1_1) OR NOT FIREABLE(ti5_2_1_1)))
lola: processed formula length: 83
lola: 7 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(ti1_5_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((NOT FIREABLE(ti5_1_1_1) AND NOT FIREABLE(ti4_3_1_1)))) AND NOT FIREABLE(ti2_5_1_1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ti5_1_1_1) AND NOT FIREABLE(ti4_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(ti2_5_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(ti2_5_1_1)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(ti2_5_1_1)) U (E (G (FIREABLE(ti2_5_1_1))) AND ((FIREABLE(ti5_4_1_1) OR FIREABLE(t5_1_1)) AND FIREABLE(t4_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(ti2_5_1_1)) U (NOT(A(TRUE U NOT FIREABLE(ti2_5_1_1))) AND ((FIREABLE(ti5_4_1_1) OR FIREABLE(t5_1_1)) AND FIREABLE(t4_1_1))))
lola: processed formula length: 137
lola: 3 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X (A (F (FIREABLE(ti4_1_1_1))))) AND NOT(E (G ((FIREABLE(ti5_4_1_1) AND FIREABLE(t2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (NOT FIREABLE(ti4_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U FIREABLE(ti4_1_1_1))))
lola: processed formula length: 38
lola: 15 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 82 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (A (F (FIREABLE(ti2_3_1_1))))) AND ((A (F (FIREABLE(t4_1_1))) AND (FIREABLE(ti5_6_1_1) OR FIREABLE(to2_1_1) OR (FIREABLE(ti4_5_1_1) AND FIREABLE(to4_1_1)))) AND E (G ((FIREABLE(to2_1_1) AND FIREABLE(to3_1_1)))))) OR NOT(E (F (A (X (FIREABLE(t2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F (FIREABLE(ti2_3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U FIREABLE(ti2_3_1_1)))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 44 markings, 119 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t4_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t4_1_1)))
lola: processed formula: A (F (FIREABLE(t4_1_1)))
lola: processed formula length: 24
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(t2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(t2_1_1)))))
lola: processed formula length: 44
lola: 8 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 773 markings, 1409 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((A (X (FIREABLE(ti6_4_1_1))) AND E (X (FIREABLE(to1_1_1)))))) OR A ((FIREABLE(ti6_5_1_1) U A (X (FIREABLE(to6_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (FIREABLE(ti6_4_1_1))) AND E (X (FIREABLE(to1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX(FIREABLE(ti6_4_1_1)) AND EX(FIREABLE(to1_1_1))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 40193 markings, 430884 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(ti6_5_1_1) U A (X (FIREABLE(to6_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(FIREABLE(ti6_5_1_1) U AX(FIREABLE(to6_1_1)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(to6_1_1) OR NOT FIREABLE(ti2_6_1_1) OR (FIREABLE(ti1_4_1_1) AND FIREABLE(t5_1_1) AND (FIREABLE(ti1_3_1_1) OR FIREABLE(ti5_2_1_1)))) U NOT(E (F (FIREABLE(t6_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(to6_1_1) OR NOT FIREABLE(ti2_6_1_1) OR (FIREABLE(ti1_4_1_1) AND FIREABLE(t5_1_1) AND (FIREABLE(ti1_3_1_1) OR FIREABLE(ti5_2_1_1)))) U NOT(E(TRUE U FIREABLE(t6_1_1))))
lola: processed formula length: 185
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 38408 markings, 349885 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((FIREABLE(ti5_3_1_1) AND FIREABLE(ti3_2_1_1)))) AND FIREABLE(ti6_4_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (NOT FIREABLE(ti5_3_1_1) OR NOT FIREABLE(ti3_2_1_1)))) AND FIREABLE(ti6_4_1_1)))
lola: processed formula length: 104
lola: 3 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 36073 markings, 292823 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (NOT(E (X (FIREABLE(ti2_5_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(FIREABLE(ti2_5_1_1)))
lola: processed formula length: 33
lola: 10 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT((A (X (FIREABLE(ti3_6_1_1))) OR E (F (FIREABLE(ti2_3_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX(NOT FIREABLE(ti3_6_1_1)) AND NOT(E(TRUE U FIREABLE(ti2_3_1_1)))))
lola: processed formula length: 78
lola: 11 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 21 markings, 61 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti5_2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti5_2_1_1)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((FIREABLE(ti6_1_1_1) U FIREABLE(t5_1_1))) OR ((FIREABLE(to4_1_1) AND FIREABLE(ti3_2_1_1) AND FIREABLE(ti1_2_1_1)) OR A (X (FIREABLE(ti5_6_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(FIREABLE(ti6_1_1_1) U FIREABLE(t5_1_1))) AND ((NOT FIREABLE(to4_1_1) OR NOT FIREABLE(ti3_2_1_1) OR NOT FIREABLE(ti1_2_1_1)) AND NOT(AX(FIREABLE(ti5_6_1_1)))))))
lola: processed formula length: 182
lola: 6 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((E (X (FIREABLE(ti1_2_1_1))) U (FIREABLE(ti3_4_1_1) AND FIREABLE(ti2_4_1_1) AND NOT FIREABLE(to3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(NOT(AX(NOT FIREABLE(ti1_2_1_1))) U (FIREABLE(ti3_4_1_1) AND FIREABLE(ti2_4_1_1) AND NOT FIREABLE(to3_1_1))))
lola: processed formula length: 114
lola: 9 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((FIREABLE(to5_1_1) OR FIREABLE(ti6_5_1_1) OR FIREABLE(t1_1_1)))) AND FIREABLE(ti4_3_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(to5_1_1) AND NOT FIREABLE(ti6_5_1_1) AND NOT FIREABLE(t1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(ti4_3_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(ti4_3_1_1)
lola: processed formula length: 23
lola: 5 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((NOT FIREABLE(ti3_5_1_1) OR FIREABLE(ti6_5_1_1) OR FIREABLE(to4_1_1) OR FIREABLE(ti3_4_1_1)) OR ((E (G (FIREABLE(ti2_5_1_1))) OR A (G (FIREABLE(ti6_2_1_1)))) OR (FIREABLE(ti3_6_1_1) OR FIREABLE(t3_1_1) OR NOT FIREABLE(ti2_6_1_1) OR NOT FIREABLE(ti3_1_1_1) OR NOT FIREABLE(ti4_3_1_1)))) AND (((((FIREABLE(t5_1_1) OR FIREABLE(t1_1_1)) AND NOT FIREABLE(ti2_6_1_1)) AND A (F (FIREABLE(ti1_5_1_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti3_5_1_1) OR FIREABLE(ti6_5_1_1) OR FIREABLE(to4_1_1) OR FIREABLE(ti3_4_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(ti3_5_1_1) OR FIREABLE(ti6_5_1_1) OR FIREABLE(to4_1_1) OR FIREABLE(ti3_4_1_1))
lola: processed formula length: 95
lola: 4 rewrites
lola: formula mentions 0 of 31 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-110-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no no no yes no no no yes yes unknown
FORMULA HexagonalGrid-PT-110-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-110-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

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="HexagonalGrid-PT-110"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/HexagonalGrid-PT-110.tgz
mv HexagonalGrid-PT-110 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is HexagonalGrid-PT-110, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-smll-152658636500004"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;