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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650100318
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496377529363


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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ 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-CTLCardinality.task
lola: ((A2L_rot2_rs <= A2U_out) AND (A (G ((TU_out <= crane_above_deposit_belt))) OR (((1 <= A2L_in) OR (PL_lower_rs <= A2U_rot2_run)) AND E (G ((arm2_release_ext <= CU_ready_to_transport)))))) : ((((3 <= swivel) AND (1 <= TL_lower_run)) OR A (X (((2 <= ch_TA1_free) OR (table_load_angle <= crane_transport_height))))) AND E (G (A (F ((TL_in <= A1L_rot1_rs)))))) : (E (G (((A1L_rot2_rs <= 1) OR (A1L_ext_rs + 1 <= DB_deliver_run)))) OR (DB_deliver_rs + 1 <= CU_lower_run)) : A (F ((2 <= A2U_ext_run))) : NOT(((E (G ((1 <= CU_ready_to_transport))) OR E (G ((ch_PA2_free <= arm2_backward)))) OR (2 <= A1U_rot2_run))) : E (F ((3 <= arm2_pick_up_angle))) : E (F (E (X (((A2L_rot2_run <= A2L_rot2_in) AND (2 <= arm2_retract_ext)))))) : A (F ((arm2_stop <= arm1_forward))) : A (F ((((belt2_stop + 1 <= A1U_rot1_run) AND (table_ready_for_loading <= 0)) OR A (G ((1 <= table_at_unload_angle)))))) : E (G ((A1U_rot2_run <= A1L_ext_run))) : E (G (A (((1 <= A2U_rot2_in) U (crane_storing <= A2U_rot2_run))))) : NOT((E (G (((A2U_out <= TU_lift_rs) OR (table_upward <= arm1_backward)))) AND E (G ((A1U_extendet <= 1))))) : E (G (NOT(A (G ((3 <= arm1_having_swivel_1)))))) : (NOT((E (X ((2 <= TL_lower_rs))) OR ((table_at_unload_angle + 1 <= TL_lower_rs) AND ((crane_release_height <= CL_lower_run) OR (A2L_rot3_in <= A2L_ret_rs))))) AND NOT(NOT(E (F ((1 <= A1U_rot2_rs)))))) : (E ((((arm2_magnet_on <= TL_in) OR (ch_PA2_free <= arm2_storing)) U (A1L_in <= 0))) AND A (X (A (F ((1 <= A2U_rot3_in)))))) : NOT(E (G (E (F ((2 <= A2L_ret_rs))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A2L_rot2_rs <= A2U_out) AND (A (G ((TU_out <= crane_above_deposit_belt))) OR (((1 <= A2L_in) OR (PL_lower_rs <= A2U_rot2_run)) AND E (G ((arm2_release_ext <= CU_ready_to_transport))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A2L_rot2_rs <= A2U_out)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A2L_rot2_rs <= A2U_out)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
lola: processed formula with 1 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TU_out <= crane_above_deposit_belt)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-5-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= A2L_in) OR (PL_lower_rs <= A2U_rot2_run))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= A2L_in) OR (PL_lower_rs <= A2U_rot2_run))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
lola: processed formula with 2 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((arm2_release_ext <= CU_ready_to_transport)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (CU_ready_to_transport + 1 <= arm2_release_ext)))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================lola:
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= swivel) AND (1 <= TL_lower_run)) OR A (X (((2 <= ch_TA1_free) OR (table_load_angle <= crane_transport_height))))) AND E (G (A (F ((TL_in <= A1L_rot1_rs))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= swivel) AND (1 <= TL_lower_run))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= swivel) AND (1 <= TL_lower_run))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
lola: processed formula with 2 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 (((2 <= ch_TA1_free) OR (table_load_angle <= crane_transport_height))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((2 <= ch_TA1_free) OR (table_load_angle <= crane_transport_height)))
lola: processed formula length: 73
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((TL_in <= A1L_rot1_rs)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (TL_in <= A1L_rot1_rs)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((A1L_rot2_rs <= 1) OR (A1L_ext_rs + 1 <= DB_deliver_run)))) OR (DB_deliver_rs + 1 <= CU_lower_run))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A1L_rot2_rs <= 1) OR (A1L_ext_rs + 1 <= DB_deliver_run))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= A1L_rot2_rs) AND (DB_deliver_run <= A1L_ext_rs))))
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-CTLCardinality.task
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: 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A2U_ext_run)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= A2U_ext_run))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((1 <= CU_ready_to_transport))) OR E (G ((ch_PA2_free <= arm2_backward)))) OR (2 <= A1U_rot2_run)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CU_ready_to_transport <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (CU_ready_to_transport <= 0))
lola: processed formula length: 38
lola: 11 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((arm2_backward + 1 <= ch_PA2_free)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (arm2_backward + 1 <= ch_PA2_free))
lola: processed formula length: 44
lola: 11 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A1U_rot2_run <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A1U_rot2_run <= 1)
lola: processed formula length: 19
lola: 10 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= arm2_pick_up_angle)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-5-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file ParamProductionCell-PT-5-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (((A2L_rot2_run <= A2L_rot2_in) AND (2 <= arm2_retract_ext))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(((A2L_rot2_run <= A2L_rot2_in) AND (2 <= arm2_retract_ext))))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 986811 markings, 3443831 edges, 2806861595810988032 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((arm2_stop <= arm1_forward)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (arm2_stop <= arm1_forward))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((belt2_stop + 1 <= A1U_rot1_run) AND (table_ready_for_loading <= 0)) OR A (G ((1 <= table_at_unload_angle))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((belt2_stop + 1 <= A1U_rot1_run) AND (table_ready_for_loading <= 0)) OR NOT(E(TRUE U (table_at_unload_angle <= 0)))))
lola: processed formula length: 128
lola: 3 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A1U_rot2_run <= A1L_ext_run)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A1L_ext_run + 1 <= A1U_rot2_run)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((1 <= A2U_rot2_in) U (crane_storing <= A2U_rot2_run)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((1 <= A2U_rot2_in) U (crane_storing <= A2U_rot2_run)))))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((A2U_out <= TU_lift_rs) OR (table_upward <= arm1_backward)))) AND E (G ((A1U_extendet <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((TU_lift_rs + 1 <= A2U_out) AND (arm1_backward + 1 <= table_upward))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((TU_lift_rs + 1 <= A2U_out) AND (arm1_backward + 1 <= table_upward)))
lola: processed formula length: 79
lola: 8 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A1U_extendet)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (2 <= A1U_extendet))
lola: processed formula length: 29
lola: 8 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((3 <= arm1_having_swivel_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (arm1_having_swivel_1 <= 2)))))
lola: processed formula length: 57
lola: 5 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (X ((2 <= TL_lower_rs))) OR ((table_at_unload_angle + 1 <= TL_lower_rs) AND ((crane_release_height <= CL_lower_run) OR (A2L_rot3_in <= A2L_ret_rs))))) AND NOT(NOT(E (F ((1 <= A1U_rot2_rs))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((TL_lower_rs <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((TL_lower_rs <= 1))
lola: processed formula length: 22
lola: 13 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((TL_lower_rs <= table_at_unload_angle) OR ((CL_lower_run + 1 <= crane_release_height) AND (A2L_ret_rs + 1 <= A2L_rot3_in)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((TL_lower_rs <= table_at_unload_angle) OR ((CL_lower_run + 1 <= crane_release_height) AND (A2L_ret_rs + 1 <= A2L_rot3_in)))
lola: processed formula length: 125
lola: 12 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
lola: processed formula with 3 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 15 will run for 3530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= A1U_rot2_rs)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ParamProductionCell-PT-5-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((arm2_magnet_on <= TL_in) OR (ch_PA2_free <= arm2_storing)) U (A1L_in <= 0))) AND A (X (A (F ((1 <= A2U_rot3_in))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((arm2_magnet_on <= TL_in) OR (ch_PA2_free <= arm2_storing)) U (A1L_in <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((arm2_magnet_on <= TL_in) OR (ch_PA2_free <= arm2_storing)) U (A1L_in <= 0))
lola: processed formula length: 80
lola: 1 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: ========================================
lola: subprocess 15 will run for 3530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= A2U_rot3_in)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (1 <= A2U_rot3_in)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3530 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (E (F ((2 <= A2L_ret_rs))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (2 <= A2L_ret_rs))))
lola: processed formula length: 42
lola: 8 rewrites
lola: formula mentions 0 of 231 places; total mentions: 0
lola: closed formula file ParamProductionCell-PT-5-CTLCardinality.task
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: 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: RESULT
lola:
SUMMARY: yes yes yes no yes no no yes no yes no no yes yes no yes
lola: ========================================
FORMULA ParamProductionCell-PT-5-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ParamProductionCell-PT-5-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496377541484

--------------------
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="CTLCardinality"
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 CTLCardinality"
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-149441650100318"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;