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

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

=== Now, execution of the tool begins

BK_START 1494599247438


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ AutoFlight-PT-01b @ 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: 226/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 114 places, 112 transitions, 104 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 131 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-01b-CTLCardinality.task
lola: E ((E (F ((1 <= p14))) U (1 <= p113))) : A ((((p50 <= 1) OR (p94 <= p12)) U ((2 <= p47) AND (p75 <= p89)))) : ((p67 <= p15) AND E (G (E (G ((p70 <= p6)))))) : E (G (A (G ((p59 <= 2))))) : NOT(A (((p4 <= 2) U (p7 + 1 <= p107)))) : E (F ((((3 <= p25) OR ((p92 <= p28) AND (3 <= p3))) OR E (F ((3 <= p66)))))) : NOT(E (G (E (X ((p13 <= p74)))))) : A (G (E (X (TRUE)))) : A (G (E (F ((p86 <= 2))))) : ((A (G (((p82 <= p56) AND (2 <= p98)))) OR E (((p26 <= p86) U (2 <= p43)))) AND (((1 <= p71) AND (p76 <= p102)) OR E (((p95 <= p88) U (p25 <= p4))))) : A (F (E (X ((1 <= p66))))) : A (((p53 <= p103) U E (F ((3 <= p7))))) : ((E (((3 <= p33) U (p25 <= p56))) OR (E (G ((3 <= p74))) AND (((3 <= p100) AND (p9 <= p98)) OR ((p37 <= p99))))) AND E (G (((p111 <= p74) AND (p16 <= p11) AND ((2 <= p13) OR (p70 <= p80)))))) : E (G ((p71 <= p23))) : A ((E (F ((p17 <= p67))) U E (G ((p22 <= p99))))) : ((p62 <= p24) AND ((((1 <= p110) AND (p105 <= p13) AND ((2 <= p79) OR (3 <= p82))) OR ((2 <= p45) AND (1 <= p107) AND (p80 <= p38) AND (1 <= p52))) OR A (G ((p93 <= 2)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((1 <= p14))) U (1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (1 <= p14)) U (1 <= p113))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p50 <= 1) OR (p94 <= p12)) U ((2 <= p47) AND (p75 <= p89))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p50 <= 1) OR (p94 <= p12)) U ((2 <= p47) AND (p75 <= p89)))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p67 <= p15) AND E (G (E (G ((p70 <= p6))))))
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: (p67 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p67 <= p15)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p70 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p6 + 1 <= p70))))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: SUBRESULTlola:
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: E (G (A (G ((p59 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (3 <= p59))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 1003888 markings, 4662624 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1799062 markings, 8715364 edges, 159035 markings/sec, 5 secs
lola: 2444661 markings, 12458256 edges, 129120 markings/sec, 10 secs
lola: 3129841 markings, 16573632 edges, 137036 markings/sec, 15 secs
lola: 3734489 markings, 20457996 edges, 120930 markings/sec, 20 secs
lola: 4330959 markings, 24338007 edges, 119294 markings/sec, 25 secs
lola: 4913546 markings, 28389195 edges, 116517 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((p4 <= 2) U (p7 + 1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p4 <= 2) U (p7 + 1 <= p107)))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p25) OR ((p92 <= p28) AND (3 <= p3))) OR E (F ((3 <= p66))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p25) OR ((p92 <= p28) AND (3 <= p3)))))
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 16 bytes per marking, with 24 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-01b-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-01b-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p66)))
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 16 bytes per marking, with 24 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 unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: lola: ========================================state equation: write sara problem file to AutoFlight-PT-01b-CTLCardinality-6.sara

lola: ...considering subproblem: NOT(E (G (E (X ((p13 <= p74))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: lola: processed formula: A(TRUE U AX((p74 + 1 <= p13)))
lola: ========================================
processed formula length: 30
lola: 7 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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).
sara: try reading problem file AutoFlight-PT-01b-CTLCardinality-6.sara.
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 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p86 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p86 <= 2)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((p82 <= p56) AND (2 <= p98)))) OR E (((p26 <= p86) U (2 <= p43)))) AND (((1 <= p71) AND (p76 <= p102)) OR E (((p95 <= p88) U (p25 <= p4)))))
lola: lola: ================================================================================

lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p82 <= p56) AND (2 <= p98))))
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 16 bytes per marking, with 24 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: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p26 <= p86) U (2 <= p43)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p26 <= p86) U (2 <= p43))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= p66)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((1 <= p66)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 11 will run for 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p53 <= p103) U E (F ((3 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p53 <= p103) U E(TRUE U (3 <= p7)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 1023093 markings, 4870582 edges, 3111067875914285056 markings/sec, 0 secs
lola: 1776127 markings, 8991524 edges, 150607 markings/sec, 5 secs
lola: 2440960 markings, 12841326 edges, 132967 markings/sec, 10 secs
lola: 3054846 markings, 16592731 edges, 122777 markings/sec, 15 secs
lola: 3650052 markings, 20344020 edges, 119041 markings/sec, 20 secs
lola: 4275768 markings, 24485303 edges, 125143 markings/sec, 25 secs
lola: 4897977 markings, 28540048 edges, 124442 markings/sec, 30 secs
lola: 5480904 markings, 32694480 edges, 116585 markings/sec, 35 secs
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 864 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (((3 <= p33) U (p25 <= p56))) OR (E (G ((3 <= p74))) AND (((3 <= p100) AND (p9 <= p98)) OR ((p37 <= p99))))) AND E (G (((p111 <= p74) AND (p16 <= p11) AND ((2 <= p13) OR (p70 <= p80))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p33) U (p25 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p33) U (p25 <= p56))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 13 will run for 1152 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p111 <= p74) AND (p16 <= p11) AND ((2 <= p13) OR (p70 <= p80)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p74 + 1 <= p111) OR (p11 + 1 <= p16) OR ((p13 <= 1) AND (p80 + 1 <= p70)))))
lola: processed formula length: 93
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: subprocess 13 will run for 1152 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p71 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p23 + 1 <= p71)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: lola: using a bit-perfect encoder (--encoder=bit)========================================

lola: using 16 bytes per marking, with 24 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 14 will run for 1729 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p17 <= p67))) U E (G ((p22 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p17 <= p67)) U NOT(A(TRUE U (p99 + 1 <= p22))))
lola: processed formula length: 59
lola: 4 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 15 will run for 3458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p62 <= p24) AND ((((1 <= p110) AND (p105 <= p13) AND ((2 <= p79) OR (3 <= p82))) OR ((2 <= p45) AND (1 <= p107) AND (p80 <= p38) AND (1 <= p52))) OR A (G ((p93 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p62 <= p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p62 <= p24)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p93 <= 2)))
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 16 bytes per marking, with 24 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 AutoFlight-PT-01b-CTLCardinality-17.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no no yes yes no yes no no yes yes yes
lola: ========================================
FORMULA AutoFlight-PT-01b-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494599329743

--------------------
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-01b"
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-01b.tgz
mv AutoFlight-PT-01b 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-01b, 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-149436126000174"
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 ;