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 AutoFlight-PT-01a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436125900165
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494599180493


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ AutoFlight-PT-01a @ 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: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 32 places, 30 transitions, 22 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 32 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-01a-CTLCardinality.task
lola: (p21 <= p11) : ((((p1 <= p30) OR (((p6 <= p15) OR (p9 <= p21)) AND (p13 <= 1))) OR A (F (((p6 <= p17) OR (p9 <= p16))))) OR (p10 <= p14)) : (((A (G ((3 <= p14))) AND A (F ((1 <= p28)))) AND (A (X ((p13 <= p22))) OR ((p13 <= p11) AND (p24 <= p3) AND (p28 <= 0)))) AND (A (((2 <= p10) U (3 <= p13))) AND A (((p5 <= p17) U (2 <= p10))))) : ((1 <= p4) AND (((2 <= p18) OR (p21 <= p25) OR (1 <= p16) OR (1 <= p28) OR ((p3 <= p23) AND (3 <= p31)) OR ((p26 <= p24) AND (p12 <= p29))) OR A (F ((3 <= p24))))) : NOT(E (X (E (G ((3 <= p27)))))) : A (((3 <= p26) U E (F ((p20 <= p30))))) : (1 <= p27) : NOT(((3 <= p30) OR E (((3 <= p10) U (p15 <= p12))))) : (2 <= p2) : (A (X (E (X ((1 <= p7))))) OR (p30 <= p2)) : A ((A (X ((p0 <= p3))) U A (F ((2 <= p0))))) : ((NOT(E (X ((p31 <= p15)))) AND (((2 <= p19) AND (p29 <= p12) AND (2 <= p1)) OR ((3 <= p1) AND ((1 <= p7) OR (2 <= p20))))) AND E (G (A (X ((p9 <= p14)))))) : E (G ((E (F ((p7 <= p23))) AND E (F ((p31 <= p3)))))) : ((A (G (((3 <= p16) OR (2 <= p16)))) AND A (F (((p31 <= p11) AND (1 <= p11))))) OR (3 <= p10)) : A (F (((p20 + 1 <= p22) AND (p5 <= 0) AND ((2 <= p17) OR (3 <= p1) OR (p23 <= 2))))) : E (X ((2 <= p18)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p21 <= p11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 <= p11)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-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: ((((p1 <= p30) OR (((p6 <= p15) OR (p9 <= p21)) AND (p13 <= 1))) OR A (F (((p6 <= p17) OR (p9 <= p16))))) OR (p10 <= p14))
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: ((p1 <= p30) OR (((p6 <= p15) OR (p9 <= p21)) AND (p13 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1 <= p30) OR (((p6 <= p15) OR (p9 <= p21)) AND (p13 <= 1)))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: processed formula with 4 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((3 <= p14))) AND A (F ((1 <= p28)))) AND (A (X ((p13 <= p22))) OR ((p13 <= p11) AND (p24 <= p3) AND (p28 <= 0)))) AND (A (((2 <= p10) U (3 <= p13))) AND A (((p5 <= p17) U (2 <= p10)))))
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: A (G ((3 <= p14)))
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 4 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULTlola:
lola: ======================================== result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (((2 <= p18) OR (p21 <= p25) OR (1 <= p16) OR (1 <= p28) OR ((p3 <= p23) AND (3 <= p31)) OR ((p26 <= p24) AND (p12 <= p29))) OR A (F ((3 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (E (G ((3 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (p27 <= 2)))
lola: processed formula length: 24
lola: 7 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p26) U E (F ((p20 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((3 <= p26) U E(TRUE U (p20 <= p30)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p27)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p27)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: processed formula with 1 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((3 <= p30) OR E (((3 <= p10) U (p15 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p30 <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p30 <= 2)
lola: processed formula length: 10
lola: 6 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p10 <= 2) R (p12 + 1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((3 <= p10) U (p15 <= p12)))
lola: processed formula length: 33
lola: 9 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p2)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: processed formula with 1 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 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (X ((1 <= p7))))) OR (p30 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((1 <= p7)))
lola: processed formula length: 17
lola: 2 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p0 <= p3))) U A (F ((2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p0 <= p3)) U A(TRUE U (2 <= p0)))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 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 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (X ((p31 <= p15)))) AND (((2 <= p19) AND (p29 <= p12) AND (2 <= p1)) OR ((3 <= p1) AND ((1 <= p7) OR (2 <= p20))))) AND E (G (A (X ((p9 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p15 + 1 <= p31)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p15 + 1 <= p31))
lola: processed formula length: 20
lola: 5 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p7 <= p23))) AND E (F ((p31 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (p7 <= p23))) OR NOT(E(TRUE U (p31 <= p3))))))
lola: processed formula length: 73
lola: 4 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((3 <= p16) OR (2 <= p16)))) AND A (F (((p31 <= p11) AND (1 <= p11))))) OR (3 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p16) OR (2 <= p16))))
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 4 bytes per marking, with 10 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p10)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p20 + 1 <= p22) AND (p5 <= 0) AND ((2 <= p17) OR (3 <= p1) OR (p23 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p20 + 1 <= p22) AND (p5 <= 0) AND ((2 <= p17) OR (3 <= p1) OR (p23 <= 2))))
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= p18))
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 32 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================lola:
RESULT
lola:
SUMMARY: yes yes no no yes yes no no no yes no no yes no no no
FORMULA AutoFlight-PT-01a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01a-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494599180642

--------------------
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="AutoFlight-PT-01a"
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/AutoFlight-PT-01a.tgz
mv AutoFlight-PT-01a 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 AutoFlight-PT-01a, 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 r008-csrt-149436125900165"
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 ;