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 180K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K 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 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 9.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is TriangularGrid-PT-1200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748500361
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527205123452


BK_STOP 1527205173319

--------------------
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 TriangularGrid-PT-1200 as instance name.
Using TriangularGrid 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': 2464, 'Memory': 116.53, 'Tool': 'gspn'}, {'Time': 5391, 'Memory': 150.95, 'Tool': 'gspn'}, {'Time': 5982, 'Memory': 241.27, 'Tool': 'itstools'}, {'Time': 6041, 'Memory': 242.41, 'Tool': 'itstools'}, {'Time': 6439, 'Memory': 129.96, 'Tool': 'lola'}, {'Time': 6533, 'Memory': 129.76, 'Tool': 'lola'}, {'Time': 20777, 'Memory': 7578.46, 'Tool': 'marcie'}, {'Time': 22148, 'Memory': 7578.56, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.6132305194805197x far from the best tool gspn.
CTLFireability lola TriangularGrid-PT-1200...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
TriangularGrid-PT-1200: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ TriangularGrid-PT-1200 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 28/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 16 places, 12 transitions, 8 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 19 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-1200-CTLFireability.task
lola: E ((((NOT FIREABLE(t_1_0) OR NOT FIREABLE(to1_1_1)) AND (NOT FIREABLE(to2_1_1) OR NOT FIREABLE(ti2_1_1_1))) U (E (F (FIREABLE(ti1_3_1_1))) AND (FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti1_2_1_1))))) : NOT(E (F ((FIREABLE(t_2_1) AND FIREABLE(to3_1_1) AND FIREABLE(ti3_1_1_1))))) : E (G (A (F ((NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1)))))) : ((FIREABLE(ti1_2_1_1) OR E (F (A (G (FIREABLE(ti3_1_1_1)))))) OR NOT(((E (F (FIREABLE(to3_1_1))) OR ((FIREABLE(t_2_1) OR FIREABLE(ti1_3_1_1)) AND FIREABLE(ti3_1_1_1))) OR FIREABLE(to1_1_1)))) : (NOT(E ((NOT FIREABLE(to1_1_1) U (FIREABLE(to3_1_1) AND FIREABLE(ti1_3_1_1))))) AND E ((FIREABLE(to1_1_1) U A (X (FIREABLE(to1_1_1)))))) : E (F (NOT(E (F (NOT FIREABLE(ti3_2_1_1)))))) : E (F (NOT(E (F (FIREABLE(to1_1_1)))))) : A (G ((E (F (NOT FIREABLE(ti1_2_1_1))) OR (E (G (FIREABLE(ti3_2_1_1))) AND (FIREABLE(ti2_1_1_1) OR FIREABLE(ti2_3_1_1)))))) : E ((((NOT FIREABLE(to1_1_1) OR NOT FIREABLE(ti3_1_1_1)) AND (NOT FIREABLE(ti2_3_1_1))) U (FIREABLE(to2_1_1) AND E (G (FIREABLE(t_1_2)))))) : (E (((NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1)) U FIREABLE(ti2_1_1_1))) OR (E (((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) U FIREABLE(t_2_1))) AND (((NOT FIREABLE(t_1_2) OR NOT FIREABLE(to1_1_1)) AND FIREABLE(t_1_2)) OR NOT(E (G (FIREABLE(to2_1_1))))))) : E (((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t_1_2) OR NOT FIREABLE(ti3_1_1_1)) U A (X ((FIREABLE(t_1_0) AND FIREABLE(to2_1_1)))))) : (E (G ((A (F (FIREABLE(ti3_2_1_1))) AND (NOT FIREABLE(ti1_2_1_1) AND NOT FIREABLE(to2_1_1))))) OR E (((FIREABLE(to1_1_1) OR FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1)) U A (G (FIREABLE(ti1_2_1_1)))))) : FIREABLE(t_2_1) : FIREABLE(ti1_3_1_1) : A (F (E (F ((FIREABLE(to2_1_1) OR FIREABLE(t_1_2) OR FIREABLE(to1_1_1)))))) : FIREABLE(t_2_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: E ((((NOT FIREABLE(t_1_0) OR NOT FIREABLE(to1_1_1)) AND (NOT FIREABLE(to2_1_1) OR NOT FIREABLE(ti2_1_1_1))) U (E (F (FIREABLE(ti1_3_1_1))) AND (FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti1_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((NOT FIREABLE(t_1_0) OR NOT FIREABLE(to1_1_1)) AND (NOT FIREABLE(to2_1_1) OR NOT FIREABLE(ti2_1_1_1))) U (E(TRUE U FIREABLE(ti1_3_1_1)) AND (FIREABLE(ti1_3_1_1) AND NOT FIREABLE(ti1_2_1_1))))
lola: processed formula length: 196
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 35163 markings, 146333 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((FIREABLE(t_2_1) AND FIREABLE(to3_1_1) AND FIREABLE(ti3_1_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 32 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 invariant.
lola: 47550 markings, 105263 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1))))))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 4333 markings, 11671 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(ti1_2_1_1) OR E (F (A (G (FIREABLE(ti3_1_1_1)))))) OR NOT(((E (F (FIREABLE(to3_1_1))) OR ((FIREABLE(t_2_1) OR FIREABLE(ti1_3_1_1)) AND FIREABLE(ti3_1_1_1))) OR FIREABLE(to1_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti1_2_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti1_2_1_1)
lola: processed formula length: 19
lola: 9 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(ti3_1_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(ti3_1_1_1))))
lola: processed formula length: 48
lola: 12 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 102707 markings, 542822 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(to3_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 32 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E ((NOT FIREABLE(to1_1_1) U (FIREABLE(to3_1_1) AND FIREABLE(ti1_3_1_1))))) AND E ((FIREABLE(to1_1_1) U A (X (FIREABLE(to1_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 ((FIREABLE(to1_1_1) R (NOT FIREABLE(to3_1_1) OR NOT FIREABLE(ti1_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(to1_1_1) R (NOT FIREABLE(to3_1_1) OR NOT FIREABLE(ti1_3_1_1))))
lola: processed formula: A ((FIREABLE(to1_1_1) R (NOT FIREABLE(to3_1_1) OR NOT FIREABLE(ti1_3_1_1))))
lola: processed formula length: 77
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(to1_1_1) U A (X (FIREABLE(to1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(to1_1_1) U AX(FIREABLE(to1_1_1)))
lola: processed formula length: 44
lola: 6 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 362 markings, 361 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 (NOT(E (F (NOT FIREABLE(ti3_2_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(ti3_2_1_1))))
lola: processed formula length: 48
lola: 6 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 102707 markings, 542822 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F (FIREABLE(to1_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 FIREABLE(to1_1_1))))
lola: processed formula length: 42
lola: 6 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 37106 markings, 126685 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (NOT FIREABLE(ti1_2_1_1))) OR (E (G (FIREABLE(ti3_2_1_1))) AND (FIREABLE(ti2_1_1_1) OR FIREABLE(ti2_3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U NOT FIREABLE(ti1_2_1_1))) AND (A(TRUE U NOT FIREABLE(ti3_2_1_1)) OR (NOT FIREABLE(ti2_1_1_1) AND NOT FIREABLE(ti2_3_1_1))))))
lola: processed formula length: 152
lola: 8 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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 3 significant temporal operators and needs 13 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: 109552 markings, 730104 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((NOT FIREABLE(to1_1_1) OR NOT FIREABLE(ti3_1_1_1)) AND (NOT FIREABLE(ti2_3_1_1))) U (FIREABLE(to2_1_1) AND E (G (FIREABLE(t_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((NOT FIREABLE(to1_1_1) OR NOT FIREABLE(ti3_1_1_1)) AND (NOT FIREABLE(ti2_3_1_1))) U (FIREABLE(to2_1_1) AND NOT(A(TRUE U NOT FIREABLE(t_1_2)))))
lola: processed formula length: 147
lola: 3 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 33014 markings, 99372 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1)) U FIREABLE(ti2_1_1_1))) OR (E (((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) U FIREABLE(t_2_1))) AND (((NOT FIREABLE(t_1_2) OR NOT FIREABLE(to1_1_1)) AND FIREABLE(t_1_2)) OR NOT(E (G (FIREABLE(to2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1)) U FIREABLE(ti2_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(t_1_2) AND NOT FIREABLE(ti3_2_1_1)) U FIREABLE(ti2_1_1_1))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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 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: 3615 markings, 5384 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) U FIREABLE(t_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(ti3_1_1_1) AND FIREABLE(to3_1_1)) U FIREABLE(t_2_1))
lola: processed formula length: 64
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t_1_2) OR NOT FIREABLE(ti3_1_1_1)) U A (X ((FIREABLE(t_1_0) AND FIREABLE(to2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(ti1_2_1_1) OR NOT FIREABLE(t_1_2) OR NOT FIREABLE(ti3_1_1_1)) U AX((FIREABLE(t_1_0) AND FIREABLE(to2_1_1))))
lola: processed formula length: 126
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 109552 markings, 527149 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((A (F (FIREABLE(ti3_2_1_1))) AND (NOT FIREABLE(ti1_2_1_1) AND NOT FIREABLE(to2_1_1))))) OR E (((FIREABLE(to1_1_1) OR FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1)) U A (G (FIREABLE(ti1_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (FIREABLE(ti3_2_1_1))) AND (NOT FIREABLE(ti1_2_1_1) AND NOT FIREABLE(to2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U FIREABLE(ti3_2_1_1))) OR (FIREABLE(ti1_2_1_1) OR FIREABLE(to2_1_1)))))
lola: processed formula length: 98
lola: 4 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 88 markings, 89 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(to1_1_1) OR FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1)) U A (G (FIREABLE(ti1_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(to1_1_1) OR FIREABLE(ti2_3_1_1) OR FIREABLE(ti3_1_1_1)) U NOT(E(TRUE U NOT FIREABLE(ti1_2_1_1))))
lola: processed formula length: 111
lola: 3 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 109552 markings, 680537 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_2_1)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-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 13 will run for 1178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti1_3_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti1_3_1_1)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-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 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((FIREABLE(to2_1_1) OR FIREABLE(t_1_2) OR FIREABLE(to1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (FIREABLE(to2_1_1) OR FIREABLE(t_1_2) OR FIREABLE(to1_1_1))))
lola: processed formula length: 81
lola: 2 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t_2_1)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 16 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-1200-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: RESULT
lola:
SUMMARY: no yes no no yes no no yes no no no no no no yes no
FORMULA TriangularGrid-PT-1200-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA TriangularGrid-PT-1200-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-1200-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="TriangularGrid-PT-1200"
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/TriangularGrid-PT-1200.tgz
mv TriangularGrid-PT-1200 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 TriangularGrid-PT-1200, 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 r178-smll-152708748500361"
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 ;