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_LamportFastMutEx-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649900147
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496354855439


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_LamportFastMutEx-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_LamportFastMutEx-COL-2: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_LamportFastMutEx-COL-2 @ 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: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-2-CTLCardinality.task
lola: A (G (TRUE)) : (1 <= p0 + p1 + p2) : (((((p33 + p34 + p35 <= 2) AND (p3 + p4 + p5 + 1 <= p33 + p34 + p35)) OR (p65 + p64 + p63 + 1 <= p21 + p22 + p23)) AND (p24 + p25 + p26 + 1 <= p66 + p67 + p68)) OR A (X (((p39 + p40 + p41 + 1 <= p53 + p52 + p51) OR (p3 + p4 + p5 <= 0))))) : A (G ((2 <= p30 + p31 + p32))) : NOT((A (X (((3 <= p53 + p52 + p51) OR (3 <= p30 + p31 + p32)))) AND (((2 <= p0 + p1 + p2) OR (2 <= p18 + p19 + p20) OR (p18 + p19 + p20 <= p21 + p22 + p23)) AND ((p66 + p67 + p68 + 1 <= p24 + p25 + p26) OR (p33 + p34 + p35 + 1 <= p18 + p19 + p20))))) : E (F (A (X ((p0 + p1 + p2 <= p3 + p4 + p5))))) : A ((((p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 <= p0 + p1 + p2) AND (p18 + p19 + p20 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) AND ((p30 + p31 + p32 <= p33 + p34 + p35) OR (1 <= p21 + p22 + p23))) U (p62 + p61 + p60 <= p21 + p22 + p23))) : (A (X (((1 <= p53 + p52 + p51) AND (p3 + p4 + p5 <= p33 + p34 + p35) AND (p24 + p25 + p26 + 1 <= p65 + p64 + p63)))) AND E (F (E (F ((p30 + p31 + p32 <= p27 + p28 + p29)))))) : (p27 + p28 + p29 + 1 <= p18 + p19 + p20) : (A (X (((p27 + p28 + p29 + 1 <= p65 + p64 + p63) AND (p24 + p25 + p26 <= p66 + p67 + p68)))) OR A (((1 <= p24 + p25 + p26) U ((3 <= p66 + p67 + p68) OR (p18 + p19 + p20 <= p53 + p52 + p51))))) : E (((((3 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p65 + p64 + p63 <= p39 + p40 + p41)) AND (p18 + p19 + p20 <= 2)) U ((p36 + p37 + p38 <= p6 + p7 + p8) OR (1 <= p53 + p52 + p51) OR (p62 + p61 + p60 + 1 <= p66 + p67 + p68)))) : E (G ((((p3 + p4 + p5 <= 1) OR (p36 + p37 + p38 + 1 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42)) AND E (G ((2 <= p30 + p31 + p32)))))) : NOT(((2 <= p62 + p61 + p60) OR E (X (((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p6 + p7 + p8 <= p39 + p40 + p41)))))) : (3 <= p66 + p67 + p68) : E (((2 <= p36 + p37 + p38) U ((1 <= p6 + p7 + p8) AND (1 <= p58 + p56 + p54 + p55 + p57 + p59)))) : (3 <= p65 + p64 + p63)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p0 + p1 + p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0 + p1 + p2)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((p33 + p34 + p35 <= 2) AND (p3 + p4 + p5 + 1 <= p33 + p34 + p35)) OR (p65 + p64 + p63 + 1 <= p21 + p22 + p23)) AND (p24 + p25 + p26 + 1 <= p66 + p67 + p68)) OR A (X (((p39 + p40 + p41 + 1 <= p53 + p52 + p51) OR (p3 + p4 + p5 <= 0)))))
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: ((((p33 + p34 + p35 <= 2) AND (p3 + p4 + p5 + 1 <= p33 + p34 + p35)) OR (p65 + p64 + p63 + 1 <= p21 + p22 + p23)) AND (p24 + p25 + p26 + 1 <= p66 + p67 + p68))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p33 + p34 + p35 <= 2) AND (p3 + p4 + p5 + 1 <= p33 + p34 + p35)) OR (p65 + p64 + p63 + 1 <= p21 + p22 + p23)) AND (p24 + p25 + p26 + 1 <= p66 + p67 + p68))
lola: processed formula length: 160
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 4 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p39 + p40 + p41 + 1 <= p53 + p52 + p51) OR (p3 + p4 + p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((p39 + p40 + p41 + 1 <= p53 + p52 + p51) OR (p3 + p4 + p5 <= 0)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: 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: A (G ((2 <= p30 + p31 + p32)))
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 208 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (((3 <= p53 + p52 + p51) OR (3 <= p30 + p31 + p32)))) AND (((2 <= p0 + p1 + p2) OR (2 <= p18 + p19 + p20) OR (p18 + p19 + p20 <= p21 + p22 + p23)) AND ((p66 + p67 + p68 + 1 <= p24 + p25 + p26) OR (p33 + p34 + p35 + 1 <= p18 + p19 + p20)))))
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: E (X (((p53 + p52 + p51 <= 2) AND (p30 + p31 + p32 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p53 + p52 + p51 <= 2) AND (p30 + p31 + p32 <= 2)))
lola: processed formula length: 55
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: SUBRESULT
lola: 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 (A (X ((p0 + p1 + p2 <= p3 + p4 + p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p0 + p1 + p2 <= p3 + p4 + p5)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: 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: A ((((p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 <= p0 + p1 + p2) AND (p18 + p19 + p20 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) AND ((p30 + p31 + p32 <= p33 + p34 + p35) OR (1 <= p21 + p22 + p23))) U (p62 + p61 + p60 <= p21 + p22 + p23)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 <= p0 + p1 + p2) AND (p18 + p19 + p20 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) AND ((p30 + p31 + p32 <= p33 + p34 + p35) OR (1 <= p21 + p22 + p23))) U (p62 + p61 + p60 <= p21 + p22 + p23))
lola: processed formula length: 260
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p53 + p52 + p51) AND (p3 + p4 + p5 <= p33 + p34 + p35) AND (p24 + p25 + p26 + 1 <= p65 + p64 + p63)))) AND E (F (E (F ((p30 + p31 + p32 <= p27 + p28 + p29))))))
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: A (X (((1 <= p53 + p52 + p51) AND (p3 + p4 + p5 <= p33 + p34 + p35) AND (p24 + p25 + p26 + 1 <= p65 + p64 + p63))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((1 <= p53 + p52 + p51) AND (p3 + p4 + p5 <= p33 + p34 + p35) AND (p24 + p25 + p26 + 1 <= p65 + p64 + p63)))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: 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: (p27 + p28 + p29 + 1 <= p18 + p19 + p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p27 + p28 + p29 + 1 <= p18 + p19 + p20)
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (((p27 + p28 + p29 + 1 <= p65 + p64 + p63) AND (p24 + p25 + p26 <= p66 + p67 + p68)))) OR A (((1 <= p24 + p25 + p26) U ((3 <= p66 + p67 + p68) OR (p18 + p19 + p20 <= p53 + p52 + p51)))))
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 (((p27 + p28 + p29 + 1 <= p65 + p64 + p63) AND (p24 + p25 + p26 <= p66 + p67 + p68))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((p27 + p28 + p29 + 1 <= p65 + p64 + p63) AND (p24 + p25 + p26 <= p66 + p67 + p68)))
lola: processed formula length: 87
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p24 + p25 + p26) U ((3 <= p66 + p67 + p68) OR (p18 + p19 + p20 <= p53 + p52 + p51))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((1 <= p24 + p25 + p26) U ((3 <= p66 + p67 + p68) OR (p18 + p19 + p20 <= p53 + p52 + p51)))
lola: processed formula length: 93
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: SUBRESULT
lola: lola: result: no========================================

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((3 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p65 + p64 + p63 <= p39 + p40 + p41)) AND (p18 + p19 + p20 <= 2)) U ((p36 + p37 + p38 <= p6 + p7 + p8) OR (1 <= p53 + p52 + p51) OR (p62 + p61 + p60 + 1 <= p66 + p67 + p68))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((3 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42) OR (p65 + p64 + p63 <= p39 + p40 + p41)) AND (p18 + p19 + p20 <= 2)) U ((p36 + p37 + p38 <= p6 + p7 + p8) OR (1 <= p53 + p52 + p51) OR (p62 + p61 + p60 + 1 <= p66 + p67 + p68)))
lola: processed formula length: 243
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p3 + p4 + p5 <= 1) OR (p36 + p37 + p38 + 1 <= p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42)) AND E (G ((2 <= p30 + p31 + p32))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((2 <= p3 + p4 + p5) AND (p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 <= p36 + p37 + p38)) OR A(TRUE U (p30 + p31 + p32 <= 1)))))
lola: processed formula length: 151
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((2 <= p62 + p61 + p60) OR E (X (((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p6 + p7 + p8 <= p39 + p40 + p41))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p62 + p61 + p60 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p62 + p61 + p60 <= 1)
lola: processed formula length: 22
lola: 5 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 2) OR (p39 + p40 + p41 + 1 <= p6 + p7 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 2) OR (p39 + p40 + p41 + 1 <= p6 + p7 + p8)))
lola: processed formula length: 105
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p66 + p67 + p68)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p66 + p67 + p68)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p36 + p37 + p38) U ((1 <= p6 + p7 + p8) AND (1 <= p58 + p56 + p54 + p55 + p57 + p59))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= p36 + p37 + p38) U ((1 <= p6 + p7 + p8) AND (1 <= p58 + p56 + p54 + p55 + p57 + p59)))
lola: processed formula length: 94
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 208 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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p65 + p64 + p63)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p65 + p64 + p63)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-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: ========================================RESULT

lola:
SUMMARY: yes no yes no yes yes yes no yes no yes no yes no no no
FORMULA LamportFastMutEx-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496354855624

--------------------
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_LamportFastMutEx-COL-2"
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_LamportFastMutEx-COL-2.tgz
mv S_LamportFastMutEx-COL-2 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_LamportFastMutEx-COL-2, 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-149441649900147"
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 ;