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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_SafeBus-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443433000240
=====================================================================

--------------------
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 SafeBus-COL-03-LTLFireability-0
FORMULA_NAME SafeBus-COL-03-LTLFireability-1
FORMULA_NAME SafeBus-COL-03-LTLFireability-10
FORMULA_NAME SafeBus-COL-03-LTLFireability-11
FORMULA_NAME SafeBus-COL-03-LTLFireability-12
FORMULA_NAME SafeBus-COL-03-LTLFireability-13
FORMULA_NAME SafeBus-COL-03-LTLFireability-14
FORMULA_NAME SafeBus-COL-03-LTLFireability-15
FORMULA_NAME SafeBus-COL-03-LTLFireability-2
FORMULA_NAME SafeBus-COL-03-LTLFireability-3
FORMULA_NAME SafeBus-COL-03-LTLFireability-4
FORMULA_NAME SafeBus-COL-03-LTLFireability-5
FORMULA_NAME SafeBus-COL-03-LTLFireability-6
FORMULA_NAME SafeBus-COL-03-LTLFireability-7
FORMULA_NAME SafeBus-COL-03-LTLFireability-8
FORMULA_NAME SafeBus-COL-03-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496445569705


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


checking for too many tokens
===========================================================================================
S_SafeBus-PT-03: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLFireability @ S_SafeBus-PT-03 @ 3540 seconds
----- 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: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 57 places, 91 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 108 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-03-LTLFireability.task
lola: A (X (G (X (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) U (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3))))))) : A (((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) U (F ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3))) U G ((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))))) : A (X (X (X ((FIREABLE(loss_a) U (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3))))))) : A ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))) : A ((F ((FIREABLE(loss_a) U (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U X (X ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3)))))) : A (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) : A (G (X (G (X (X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))))) : A ((FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3))) : A (X (F (F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))) : A ((F (F (F ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))))) U F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))) : A ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3))) : A (((F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))) U G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U (X ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3))) U G ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))) : A (X (((FIREABLE(loss_a) U (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))) U F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))) : A ((FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3))) : A ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3))) : A (X (G (G (((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) U (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) U (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_pro... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) U (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)))))))
lola: processed formula: A (X (G (X (((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)) U (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_pro... (shortened)
lola: processed formula length: 447
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 29 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) U (F ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) U (F ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3))) U G ((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3))))))
lola: processed formula: A (((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) U (F ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1... (shortened)
lola: processed formula length: 970
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((FIREABLE(loss_a) U (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X ((FIREABLE(loss_a) U (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))))
lola: processed formula: A (X (X (X ((FIREABLE(loss_a) U (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))))
lola: processed formula length: 196
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 29 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((FIREABLE(loss_a) U (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U X (X ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(loss_a) U (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U X (X ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))))))
lola: processed formula: A ((F ((FIREABLE(loss_a) U (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U X (X ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))))))
lola: processed formula length: 261
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 29 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3))))
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 148 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: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X (X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (X (X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))))))
lola: processed formula: A (G (X (G (X (X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))))))
lola: processed formula length: 90
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 29 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3))
lola: processed formula length: 267
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))
lola: processed formula: A (X (F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))
lola: processed formula length: 171
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F (F ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))))) U F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))) U F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))
lola: processed formula: A ((F ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3))) U F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))
lola: processed formula length: 155
lola: 2 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3))
lola: processed formula length: 222
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))) U G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U (X ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))) U G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U (X ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3))) U G ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))))
lola: processed formula: A (((F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))) U G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))) U (X ((FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABL... (shortened)
lola: processed formula length: 1148
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 28 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 27 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: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((FIREABLE(loss_a) U (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))) U F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((FIREABLE(loss_a) U (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))) U F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3))))))
lola: processed formula: A (X (((FIREABLE(loss_a) U (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3))) U F ((FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3))))))
lola: processed formula length: 269
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3))
lola: processed formula length: 267
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.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: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3))
lola: processed formula length: 147
lola: 1 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) U (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (G (((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) U (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))))))
lola: processed formula: A (X (G (G (((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3)) U (FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)))))))
lola: processed formula length: 300
lola: 0 rewrites
lola: formula mentions 0 of 57 places; total mentions: 0
lola: closed formula file SafeBus-COL-03-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 152 bytes per marking, with 29 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: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no yes yes yes no yes no no no
FORMULA SafeBus-COL-03-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-COL-03-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496445570008

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_SafeBus-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lola"
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/S_SafeBus-PT-03.tgz
mv S_SafeBus-PT-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_SafeBus-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-csrt-149443433000240"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;