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_ParamProductionCell-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650100321
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496377564256


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


checking for too many tokens
===========================================================================================
S_ParamProductionCell-PT-5: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLFireability @ S_ParamProductionCell-PT-5 @ 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: 433/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 231 places, 202 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 320 transition conflict sets
lola: TASK
lola: reading formula from ParamProductionCell-PT-5-LTLFireability.task
lola: A ((F (F (F (FIREABLE(TL_lower_Cstop)))) U X (F (FIREABLE(A2L_rot2_Pstart))))) : A (FIREABLE(deposit_belt_lock_output_area)) : A (X (F (FIREABLE(DB_deliver_Pstop)))) : A (G (((FIREABLE(A2L_rot2_csc) U FIREABLE(DB_deliver_Pstart)) U FIREABLE(A2U_rot2_Pstop)))) : A ((X (X (G (FIREABLE(A1U_ret_csc)))) U G (FIREABLE(A1U_rot1_Pstop)))) : A (G (G (X (F (FIREABLE(PL_lower_Pstart)))))) : A ((G (X (FIREABLE(forge_Cstop))) U FIREABLE(A2L_c1))) : A (F (G (F (F (F (FIREABLE(TU_rot_Pstop))))))) : A (FIREABLE(arm1_unlock_input_area)) : A ((F (X (G (FIREABLE(TU_rot_Cstop)))) U FIREABLE(A1L_rot1_csc))) : A (F (F (F (FIREABLE(A2U_rot1_Pstart))))) : A (FIREABLE(TL_lower_csc)) : A (((X (FIREABLE(A1U_rot3_Pstop)) U FIREABLE(CU_lower_Pstart)) U F (F (FIREABLE(CL_grasp))))) : A (G (FIREABLE(feed_belt_unlock_input_area))) : A (X (F (F ((FIREABLE(A1U_ret_Cstop) U FIREABLE(arm1_lock_swivel_2)))))) : A (FIREABLE(A1L_grasp))
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 ((F (F (F (FIREABLE(TL_lower_Cstop)))) U X (F (FIREABLE(A2L_rot2_Pstart)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(TL_lower_Cstop)) U X (F (FIREABLE(A2L_rot2_Pstart)))))
lola: processed formula: A ((F (FIREABLE(TL_lower_Cstop)) U X (F (FIREABLE(A2L_rot2_Pstart)))))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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: 1105117 markings, 4305014 edges, 221023 markings/sec, 0 secs
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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(deposit_belt_lock_output_area))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(deposit_belt_lock_output_area)
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(DB_deliver_Pstop))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(DB_deliver_Pstop))))
lola: processed formula: A (X (F (FIREABLE(DB_deliver_Pstop))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(A2L_rot2_csc) U FIREABLE(DB_deliver_Pstart)) U FIREABLE(A2U_rot2_Pstop))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((FIREABLE(A2L_rot2_csc) U FIREABLE(DB_deliver_Pstart)) U FIREABLE(A2U_rot2_Pstop))))
lola: processed formula: A (G (((FIREABLE(A2L_rot2_csc) U FIREABLE(DB_deliver_Pstart)) U FIREABLE(A2U_rot2_Pstop))))
lola: processed formula length: 91
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 bytes per marking, with 29 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X (G (FIREABLE(A1U_ret_csc)))) U G (FIREABLE(A1U_rot1_Pstop))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G (FIREABLE(A1U_ret_csc)))) U G (FIREABLE(A1U_rot1_Pstop))))
lola: processed formula: A ((X (X (G (FIREABLE(A1U_ret_csc)))) U G (FIREABLE(A1U_rot1_Pstop))))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 bytes per marking, with 28 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F (FIREABLE(PL_lower_Pstart))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (X (F (FIREABLE(PL_lower_Pstart))))))
lola: processed formula: A (G (G (X (F (FIREABLE(PL_lower_Pstart))))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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: 1195529 markings, 4668319 edges, 239106 markings/sec, 0 secs
lola: 2007277 markings, 8850672 edges, 162350 markings/sec, 5 secs
lola: 2637601 markings, 13441353 edges, 126065 markings/sec, 10 secs
lola: 3219986 markings, 18143316 edges, 116477 markings/sec, 15 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: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X (FIREABLE(forge_Cstop))) U FIREABLE(A2L_c1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X (FIREABLE(forge_Cstop))) U FIREABLE(A2L_c1)))
lola: processed formula: A ((G (X (FIREABLE(forge_Cstop))) U FIREABLE(A2L_c1)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (F (F (FIREABLE(TU_rot_Pstop)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(TU_rot_Pstop))))
lola: processed formula: A (G (F (FIREABLE(TU_rot_Pstop))))
lola: processed formula length: 34
lola: 3 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(arm1_unlock_input_area))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(arm1_unlock_input_area)
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-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 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X (G (FIREABLE(TU_rot_Cstop)))) U FIREABLE(A1L_rot1_csc)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X (G (FIREABLE(TU_rot_Cstop)))) U FIREABLE(A1L_rot1_csc)))
lola: processed formula: A ((F (X (G (FIREABLE(TU_rot_Cstop)))) U FIREABLE(A1L_rot1_csc)))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (FIREABLE(A2U_rot1_Pstart)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (FIREABLE(A2U_rot1_Pstart)))
lola: processed formula: A (F (FIREABLE(A2U_rot1_Pstart)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(TL_lower_csc))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TL_lower_csc)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-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 12 will run for 877 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((X (FIREABLE(A1U_rot3_Pstop)) U FIREABLE(CU_lower_Pstart)) U F (F (FIREABLE(CL_grasp)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (FIREABLE(A1U_rot3_Pstop)) U FIREABLE(CU_lower_Pstart)) U F (FIREABLE(CL_grasp))))
lola: processed formula: A (((X (FIREABLE(A1U_rot3_Pstop)) U FIREABLE(CU_lower_Pstart)) U F (FIREABLE(CL_grasp))))
lola: processed formula length: 89
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 bytes per marking, with 31 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 1169 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(feed_belt_unlock_input_area)))
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 688 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 14 will run for 1754 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((FIREABLE(A1U_ret_Cstop) U FIREABLE(arm1_lock_swivel_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(A1U_ret_Cstop) U FIREABLE(arm1_lock_swivel_2)))))
lola: processed formula: A (X (F ((FIREABLE(A1U_ret_Cstop) U FIREABLE(arm1_lock_swivel_2)))))
lola: processed formula length: 68
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 692 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 15 will run for 3506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(A1L_grasp))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(A1L_grasp)
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-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: RESULT
lola:
SUMMARY: no no yes no no yes no yes no no no no yes no yes no
lola: ========================================
FORMULA ParamProductionCell-PT-5-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496377598177

--------------------
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_ParamProductionCell-PT-5"
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_ParamProductionCell-PT-5.tgz
mv S_ParamProductionCell-PT-5 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_ParamProductionCell-PT-5, 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 r118-blw7-149441650100321"
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 ;