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 176K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 8.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is CircularTrains-PT-012, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-152646362400004
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526464720160


BK_STOP 1526464767100

--------------------
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 CircularTrains-PT-012 as instance name.
Using CircularTrains 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': True, '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': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
/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': 54, 'Memory': 101.27, 'Tool': 'gspn'}, {'Time': 156, 'Memory': 110.77, 'Tool': 'lola'}, {'Time': 279, 'Memory': 112.4, 'Tool': 'lola'}, {'Time': 1366, 'Memory': 144.03, 'Tool': 'gspn'}, {'Time': 2174, 'Memory': 228.34, 'Tool': 'itstools'}, {'Time': 2249, 'Memory': 228.42, 'Tool': 'itstools'}, {'Time': 7402, 'Memory': 7483.01, 'Tool': 'marcie'}, {'Time': 7978, 'Memory': 7482.62, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.888888888888889x far from the best tool gspn.
CTLFireability lola CircularTrains-PT-012...

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


checking for too many tokens
===========================================================================================
CircularTrains-PT-012: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ CircularTrains-PT-012 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 36/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 12 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-012-CTLFireability.task
lola: (FIREABLE(t2_to_3) AND FIREABLE(t4_to_5)) : FIREABLE(t9_to_10) : A ((FIREABLE(t12_to_1) U (FIREABLE(t6_to_7) OR (NOT FIREABLE(t10_to_11) AND NOT FIREABLE(t5_to_6))))) : (NOT(A (G ((NOT FIREABLE(t12_to_1) OR NOT FIREABLE(t1_to_2))))) OR E (G ((E (F (FIREABLE(t8_to_9))) OR A (F (FIREABLE(t8_to_9))))))) : A (F (A (((FIREABLE(t4_to_5) AND FIREABLE(t12_to_1)) U NOT FIREABLE(t4_to_5))))) : FIREABLE(t11_to_12) : E (G (A (G ((NOT FIREABLE(t6_to_7) OR (FIREABLE(t8_to_9) AND FIREABLE(t7_to_8))))))) : FIREABLE(t9_to_10) : NOT((E (F ((NOT FIREABLE(t1_to_2) AND NOT FIREABLE(t2_to_3)))) AND ())) : FIREABLE(t12_to_1) : NOT((E (G ((FIREABLE(t11_to_12) AND (FIREABLE(t11_to_12) OR FIREABLE(t4_to_5))))) AND (FIREABLE(t8_to_9) OR FIREABLE(t10_to_11)))) : NOT((A ((FIREABLE(t2_to_3) U FIREABLE(t1_to_2))) OR FIREABLE(t4_to_5))) : (FIREABLE(t10_to_11) OR (((E (F (FIREABLE(t6_to_7))) AND FIREABLE(t1_to_2)) OR A (X (FIREABLE(t6_to_7)))) OR E ((FIREABLE(t6_to_7) U NOT FIREABLE(t5_to_6))))) : (FIREABLE(t8_to_9) AND FIREABLE(t1_to_2)) : FIREABLE(t5_to_6) : NOT((E ((NOT FIREABLE(t1_to_2) U (FIREABLE(t6_to_7) AND FIREABLE(t11_to_12)))) AND (E (F ((FIREABLE(t1_to_2) OR FIREABLE(t12_to_1)))) AND FIREABLE(t12_to_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: (FIREABLE(t2_to_3) AND FIREABLE(t4_to_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t2_to_3) AND FIREABLE(t4_to_5))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t9_to_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t9_to_10)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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: A ((FIREABLE(t12_to_1) U (FIREABLE(t6_to_7) OR (NOT FIREABLE(t10_to_11) AND NOT FIREABLE(t5_to_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(t12_to_1) U (FIREABLE(t6_to_7) OR (NOT FIREABLE(t10_to_11) AND NOT FIREABLE(t5_to_6)))))
lola: processed formula: A ((FIREABLE(t12_to_1) U (FIREABLE(t6_to_7) OR (NOT FIREABLE(t10_to_11) AND NOT FIREABLE(t5_to_6)))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G ((NOT FIREABLE(t12_to_1) OR NOT FIREABLE(t1_to_2))))) OR E (G ((E (F (FIREABLE(t8_to_9))) OR A (F (FIREABLE(t8_to_9)))))))
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: E (F ((FIREABLE(t12_to_1) AND FIREABLE(t1_to_2))))
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 44 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 unreachable.
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (FIREABLE(t8_to_9))) OR A (F (FIREABLE(t8_to_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U FIREABLE(t8_to_9))) AND NOT(A(TRUE U FIREABLE(t8_to_9))))))
lola: processed formula length: 86
lola: 7 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: 19 markings, 52 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((FIREABLE(t4_to_5) AND FIREABLE(t12_to_1)) U NOT FIREABLE(t4_to_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((FIREABLE(t4_to_5) AND FIREABLE(t12_to_1)) U NOT FIREABLE(t4_to_5)))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t11_to_12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t11_to_12)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((NOT FIREABLE(t6_to_7) OR (FIREABLE(t8_to_9) AND FIREABLE(t7_to_8)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (FIREABLE(t6_to_7) AND (NOT FIREABLE(t8_to_9) OR NOT FIREABLE(t7_to_8))))))
lola: processed formula length: 98
lola: 4 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t9_to_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t9_to_10)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((NOT FIREABLE(t1_to_2) AND NOT FIREABLE(t2_to_3)))) AND ()))
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 44 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t12_to_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12_to_1)
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((FIREABLE(t11_to_12) AND (FIREABLE(t11_to_12) OR FIREABLE(t4_to_5))))) AND (FIREABLE(t8_to_9) OR FIREABLE(t10_to_11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t11_to_12) OR (NOT FIREABLE(t11_to_12) AND NOT FIREABLE(t4_to_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(t11_to_12) OR (NOT FIREABLE(t11_to_12) AND NOT FIREABLE(t4_to_5)))))
lola: processed formula: A (F ((NOT FIREABLE(t11_to_12) OR (NOT FIREABLE(t11_to_12) AND NOT FIREABLE(t4_to_5)))))
lola: processed formula length: 89
lola: 5 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A ((FIREABLE(t2_to_3) U FIREABLE(t1_to_2))) OR FIREABLE(t4_to_5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t2_to_3) R NOT FIREABLE(t1_to_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(FIREABLE(t2_to_3) U FIREABLE(t1_to_2)))
lola: processed formula length: 45
lola: 9 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t4_to_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t4_to_5)
lola: processed formula length: 21
lola: 6 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t10_to_11) OR (((E (F (FIREABLE(t6_to_7))) AND FIREABLE(t1_to_2)) OR A (X (FIREABLE(t6_to_7)))) OR E ((FIREABLE(t6_to_7) U NOT FIREABLE(t5_to_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t10_to_11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t10_to_11)
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t6_to_7)))
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 44 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1_to_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1_to_2)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t6_to_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t6_to_7)))
lola: processed formula: A (X (FIREABLE(t6_to_7)))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 21 markings, 21 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t8_to_9) AND FIREABLE(t1_to_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t8_to_9) AND FIREABLE(t1_to_2))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t5_to_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t5_to_6)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-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 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E ((NOT FIREABLE(t1_to_2) U (FIREABLE(t6_to_7) AND FIREABLE(t11_to_12)))) AND (E (F ((FIREABLE(t1_to_2) OR FIREABLE(t12_to_1)))) AND FIREABLE(t12_to_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t1_to_2) R (NOT FIREABLE(t6_to_7) OR NOT FIREABLE(t11_to_12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(t1_to_2) R (NOT FIREABLE(t6_to_7) OR NOT FIREABLE(t11_to_12))))
lola: processed formula: A ((FIREABLE(t1_to_2) R (NOT FIREABLE(t6_to_7) OR NOT FIREABLE(t11_to_12))))
lola: processed formula length: 77
lola: 10 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 48 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: 39 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no yes no yes yes yes unknown no no yes
FORMULA CircularTrains-PT-012-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircularTrains-PT-012-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="CircularTrains-PT-012"
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/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 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 CircularTrains-PT-012, 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 r046-smll-152646362400004"
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 ;