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 208K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.7K 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
-rw-r--r-- 1 mcc users 41K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006000116
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527490052140


BK_STOP 1527490389628

--------------------
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 FlexibleBarrier-PT-06a as instance name.
Using FlexibleBarrier 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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
/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': 1951, 'Memory': 166.59, 'Tool': 'gspn'}, {'Time': 2431, 'Memory': 229.22, 'Tool': 'itstools'}, {'Time': 2511, 'Memory': 2206.7, 'Tool': 'marcie'}, {'Time': 331043, 'Memory': 788.28, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 169.67862634546387x far from the best tool gspn.
CTLFireability lola FlexibleBarrier-PT-06a...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
FlexibleBarrier-PT-06a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-06a: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ FlexibleBarrier-PT-06a @ 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: 229/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 154 transitions, 67 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 142 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06a-CTLFireability.task
lola: E (F (FIREABLE(t78))) : NOT(E (((FIREABLE(t130) OR NOT FIREABLE(t135)) U (FIREABLE(t59) AND FIREABLE(t126) AND FIREABLE(t39) AND FIREABLE(t68))))) : E (F ((FIREABLE(t18) AND FIREABLE(t90) AND (FIREABLE(t112) OR FIREABLE(t77))))) : E (F (A (G (NOT FIREABLE(t94))))) : NOT((A (G ((NOT FIREABLE(t131) OR NOT FIREABLE(t106)))) AND E (F ((NOT FIREABLE(t34) OR (FIREABLE(t127) AND FIREABLE(t98))))))) : (NOT(A (X (NOT FIREABLE(t62)))) OR A (G (E (F ((FIREABLE(t93) OR FIREABLE(t62))))))) : A (G ((A (X (NOT FIREABLE(t139))) OR E (F ((FIREABLE(t42) AND FIREABLE(t25))))))) : E (F (NOT(E (F ((FIREABLE(t10) AND FIREABLE(t100))))))) : E (F (NOT(E (F (FIREABLE(t14)))))) : (E ((A (X (FIREABLE(t82))) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95)))) AND E (X (E (F ((FIREABLE(t28) AND FIREABLE(t105))))))) : E (F ((A (X ((FIREABLE(t151) OR FIREABLE(t138)))) AND (E (G (FIREABLE(t9))) OR E (F (FIREABLE(t46))))))) : (E (F ((FIREABLE(t59) AND FIREABLE(t36)))) OR NOT(((A (G (FIREABLE(t45))) AND (NOT FIREABLE(t54) OR NOT FIREABLE(t93))) OR (E (F (FIREABLE(t152))) OR (FIREABLE(t57) AND FIREABLE(t148) AND NOT FIREABLE(t0)))))) : (A (G (((NOT FIREABLE(t118) OR NOT FIREABLE(t56)) OR E (F (FIREABLE(t152)))))) OR NOT(NOT((A (G (FIREABLE(t125))) OR FIREABLE(t90))))) : A ((NOT FIREABLE(t55) U ((NOT FIREABLE(t117) AND (FIREABLE(t136) OR FIREABLE(t131))) AND E (F (FIREABLE(t118)))))) : FIREABLE(t124) : (A (G (((NOT FIREABLE(t92) OR NOT FIREABLE(t74)) OR E (G (FIREABLE(t119)))))) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t141) AND (FIREABLE(t97) OR FIREABLE(t7) OR FIREABLE(t3))))
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 (F (FIREABLE(t78)))
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 12 bytes per marking, with 29 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((FIREABLE(t130) OR NOT FIREABLE(t135)) U (FIREABLE(t59) AND FIREABLE(t126) AND FIREABLE(t39) AND FIREABLE(t68)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((NOT FIREABLE(t130) AND FIREABLE(t135)) R (NOT FIREABLE(t59) OR NOT FIREABLE(t126) OR NOT FIREABLE(t39) OR NOT FIREABLE(t68))))
lola: processed formula: A (((NOT FIREABLE(t130) AND FIREABLE(t135)) R (NOT FIREABLE(t59) OR NOT FIREABLE(t126) OR NOT FIREABLE(t39) OR NOT FIREABLE(t68))))
lola: processed formula length: 134
lola: 4 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 27 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1322950 markings, 4116504 edges, 264590 markings/sec, 0 secs
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: 1694285 markings, 6954508 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t18) AND FIREABLE(t90) AND (FIREABLE(t112) OR FIREABLE(t77)))))
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 12 bytes per marking, with 29 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: 72 markings, 87 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t94)))))
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(t94))))
lola: processed formula length: 38
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 978223 markings, 4495420 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1799573 markings, 8682640 edges, 164270 markings/sec, 5 secs
lola: 2490016 markings, 13248232 edges, 138089 markings/sec, 10 secs
lola: 2630099 markings, 17349833 edges, 28017 markings/sec, 15 secs
lola: 2753943 markings, 21467554 edges, 24769 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2811073 markings, 24410083 edges
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (G ((NOT FIREABLE(t131) OR NOT FIREABLE(t106)))) AND E (F ((NOT FIREABLE(t34) OR (FIREABLE(t127) AND FIREABLE(t98)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t131) AND FIREABLE(t106))))
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 12 bytes per marking, with 29 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: 1064690 markings, 3206776 edges, 212938 markings/sec, 0 secs
lola: 1816682 markings, 7691148 edges, 150398 markings/sec, 5 secs
lola: 2437618 markings, 11943075 edges, 124187 markings/sec, 10 secs
lola: 2972560 markings, 16163907 edges, 106988 markings/sec, 15 secs
lola: 2985761 markings, 20892522 edges, 2640 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2985985 markings, 24993067 edges
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t34) AND (NOT FIREABLE(t127) OR NOT FIREABLE(t98)))))
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 12 bytes per marking, with 29 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 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (X (NOT FIREABLE(t62)))) OR A (G (E (F ((FIREABLE(t93) OR FIREABLE(t62)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(t62)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(t62))
lola: processed formula length: 17
lola: 4 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((FIREABLE(t93) OR FIREABLE(t62))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (FIREABLE(t93) OR FIREABLE(t62))))))
lola: processed formula length: 63
lola: 5 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 951901 markings, 4287207 edges, 190380 markings/sec, 0 secs
lola: 1868177 markings, 9023914 edges, 183255 markings/sec, 5 secs
lola: 2509431 markings, 13552910 edges, 128251 markings/sec, 10 secs
lola: 2642268 markings, 17672268 edges, 26567 markings/sec, 15 secs
lola: 2764637 markings, 21802250 edges, 24474 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2811073 markings, 24148554 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X (NOT FIREABLE(t139))) OR E (F ((FIREABLE(t42) AND FIREABLE(t25)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(AX(NOT FIREABLE(t139))) AND NOT(E(TRUE U (FIREABLE(t42) AND FIREABLE(t25)))))))
lola: processed formula length: 97
lola: 4 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 982302 markings, 3068456 edges, 3687031648961953792 markings/sec, 0 secs
lola: 1751436 markings, 5913932 edges, 153827 markings/sec, 5 secs
lola: 2451889 markings, 8876950 edges, 140091 markings/sec, 10 secs
lola: 2971948 markings, 12248524 edges, 104012 markings/sec, 15 secs
lola: 2980103 markings, 16094179 edges, 1631 markings/sec, 20 secs
lola: 2983679 markings, 19915754 edges, 715 markings/sec, 25 secs
lola: 2985520 markings, 23998947 edges, 368 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2985985 markings, 26998190 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F ((FIREABLE(t10) AND FIREABLE(t100)))))))
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(t10) AND FIREABLE(t100)))))
lola: processed formula length: 59
lola: 6 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1107029 markings, 5134021 edges, 3687031648961953792 markings/sec, 0 secs
lola: 2002922 markings, 9726448 edges, 179179 markings/sec, 5 secs
lola: 2509027 markings, 14138739 edges, 101221 markings/sec, 10 secs
lola: 2646863 markings, 17892865 edges, 27567 markings/sec, 15 secs
lola: 2766220 markings, 21815366 edges, 23871 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2811073 markings, 24435974 edges
lola: ========================================
lola: subprocess 8 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F (FIREABLE(t14))))))
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(t14))))
lola: processed formula length: 38
lola: 6 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1138883 markings, 5030137 edges, 3687031648961953792 markings/sec, 0 secs
lola: 2051258 markings, 9682619 edges, 182475 markings/sec, 5 secs
lola: 2452977 markings, 14145722 edges, 80344 markings/sec, 10 secs
lola: 2618977 markings, 18296971 edges, 33200 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2737868 markings, 22742441 edges
lola: ========================================
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((A (X (FIREABLE(t82))) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95)))) AND E (X (E (F ((FIREABLE(t28) AND FIREABLE(t105)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X (FIREABLE(t82))) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX(FIREABLE(t82)) U ((FIREABLE(t27) AND FIREABLE(t133)) OR NOT FIREABLE(t95)))
lola: processed formula length: 81
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 10 will run for 559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((FIREABLE(t28) AND FIREABLE(t105))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (FIREABLE(t28) AND FIREABLE(t105))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1334811 markings, 4136435 edges, 3689320832170983424 markings/sec, 0 secs
lola: 2442542 markings, 8552999 edges, 221546 markings/sec, 5 secs
lola: 2974871 markings, 13148022 edges, 106466 markings/sec, 10 secs
lola: 2981874 markings, 17286632 edges, 1401 markings/sec, 15 secs
lola: 2984677 markings, 21406172 edges, 561 markings/sec, 20 secs
lola: 2985964 markings, 26037190 edges, 257 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2985984 markings, 26666496 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((FIREABLE(t151) OR FIREABLE(t138)))) AND (E (G (FIREABLE(t9))) OR E (F (FIREABLE(t46)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((FIREABLE(t151) OR FIREABLE(t138))) AND (NOT(A(TRUE U NOT FIREABLE(t9))) OR E(TRUE U FIREABLE(t46)))))
lola: processed formula length: 116
lola: 5 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1286787 markings, 3963409 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2245343 markings, 7656800 edges, 191711 markings/sec, 5 secs
lola: 2970968 markings, 11605841 edges, 145125 markings/sec, 10 secs
lola: 2979493 markings, 15364833 edges, 1705 markings/sec, 15 secs
lola: 2983382 markings, 19161189 edges, 778 markings/sec, 20 secs
lola: 2985357 markings, 23129252 edges, 395 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2985985 markings, 26666497 edges
lola: ========================================
lola: subprocess 11 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t59) AND FIREABLE(t36)))) OR NOT(((A (G (FIREABLE(t45))) AND (NOT FIREABLE(t54) OR NOT FIREABLE(t93))) OR (E (F (FIREABLE(t152))) OR (FIREABLE(t57) AND FIREABLE(t148) AND NOT FIREABLE(t0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t59) AND FIREABLE(t36))))
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 12 bytes per marking, with 29 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: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(t118) OR NOT FIREABLE(t56)) OR E (F (FIREABLE(t152)))))) OR NOT(NOT((A (G (FIREABLE(t125))) OR FIREABLE(t90)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t118) OR NOT FIREABLE(t56)) OR E (F (FIREABLE(t152))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((FIREABLE(t118) AND FIREABLE(t56)) AND NOT(E(TRUE U FIREABLE(t152))))))
lola: processed formula length: 85
lola: 14 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1672569 markings, 4671257 edges, 3687031648961953792 markings/sec, 0 secs
lola: 2520385 markings, 8953875 edges, 169563 markings/sec, 5 secs
lola: 2645775 markings, 12625694 edges, 25078 markings/sec, 10 secs
lola: 2771518 markings, 16697953 edges, 25149 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2811073 markings, 18683199 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t55) U ((NOT FIREABLE(t117) AND (FIREABLE(t136) OR FIREABLE(t131))) AND E (F (FIREABLE(t118))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT FIREABLE(t55) U ((NOT FIREABLE(t117) AND (FIREABLE(t136) OR FIREABLE(t131))) AND E(TRUE U FIREABLE(t118))))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 11 markings, 15 edges
lola: ========================================
lola: subprocess 14 will run for 1634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t124)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t124)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-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 15 will run for 3269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((NOT FIREABLE(t92) OR NOT FIREABLE(t74)) OR E (G (FIREABLE(t119)))))) OR (NOT FIREABLE(t48) AND NOT FIREABLE(t141) AND (FIREABLE(t97) OR FIREABLE(t7) OR FIREABLE(t3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t92) OR NOT FIREABLE(t74)) OR E (G (FIREABLE(t119))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((FIREABLE(t92) AND FIREABLE(t74)) AND A(TRUE U NOT FIREABLE(t119)))))
lola: processed formula length: 83
lola: 6 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 29 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: 1647467 markings, 4524969 edges, 3689320832170983424 markings/sec, 0 secs
lola: 2514178 markings, 8734492 edges, 173342 markings/sec, 5 secs
lola: 2647766 markings, 12634566 edges, 26718 markings/sec, 10 secs
lola: 2761457 markings, 16246986 edges, 22738 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2811073 markings, 18622022 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes yes no no no no yes yes no no yes
----- Kill lola and sara stderr -----
FORMULA FlexibleBarrier-PT-06a-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="FlexibleBarrier-PT-06a"
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/FlexibleBarrier-PT-06a.tgz
mv FlexibleBarrier-PT-06a 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 FlexibleBarrier-PT-06a, 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 r094-blw7-152650006000116"
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 ;