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_Peterson-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681100003
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496257081876


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Peterson-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_Peterson-COL-2: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_Peterson-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: 246/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 138 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-CTLCardinality.task
lola: A (G (NOT(A (X ((3 <= p100 + p101 + p98 + p96 + p97 + p99)))))) : NOT(E ((((p36 + p37 + p38 + p39 + p40 + p41 <= p90 + p91 + p92 + p93 + p94 + p95) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) U ((3 <= p42 + p43 + p45 + p46 + p47 + p44) AND (3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))) : A (G (NOT(E (G ((3 <= p36 + p37 + p38 + p39 + p40 + p41)))))) : (E (((3 <= p100 + p101 + p98 + p96 + p97 + p99) U (2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) OR (E (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65))) AND E (F ((3 <= p42 + p43 + p45 + p46 + p47 + p44))))) : (NOT(A (((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p42 + p43 + p45 + p46 + p47 + p44) U (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))) OR (A (G (((2 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65) OR (1 <= p90 + p91 + p92 + p93 + p94 + p95)))) AND ((p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p102 + p103 + p104 + p105 + p106 + p107) OR ((p100 + p101 + p98 + p96 + p97 + p99 + 1 <= p90 + p91 + p92 + p93 + p94 + p95) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= 2))))) : A (G (TRUE)) : A ((((3 <= p42 + p43 + p45 + p46 + p47 + p44) AND (3 <= p100 + p101 + p98 + p96 + p97 + p99) AND (2 <= p100 + p101 + p98 + p96 + p97 + p99)) U A (G ((1 <= p90 + p91 + p92 + p93 + p94 + p95))))) : E ((E (G ((1 <= p42 + p43 + p45 + p46 + p47 + p44))) U FALSE)) : A (G ((A (F ((2 <= p90 + p91 + p92 + p93 + p94 + p95))) OR A (G ((p90 + p91 + p92 + p93 + p94 + p95 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))))) : (A (G (A (G ((3 <= p36 + p37 + p38 + p39 + p40 + p41))))) OR A (G (E (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))) : ((3 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR E (X (E (F ((p42 + p43 + p45 + p46 + p47 + p44 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))) : (A ((((2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR (p90 + p91 + p92 + p93 + p94 + p95 <= p66 + p67 + p68)) U ((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p90 + p91 + p92 + p93 + p94 + p95) OR (2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)))) AND (E (G (((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p66 + p67 + p68) AND (p102 + p103 + p104 + p105 + p106 + p107 <= p42 + p43 + p45 + p46 + p47 + p44)))) OR (() AND E (X ((2 <= p100 + p101 + p98 + p96 + p97 + p99)))))) : (NOT(E (F ((p100 + p101 + p98 + p96 + p97 + p99 + 1 <= p66 + p67 + p68)))) OR ((E (X ((3 <= p87 + p88 + p89))) OR (((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) AND ((1 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR (3 <= p66 + p67 + p68)))) AND (E (X ((p102 + p103 + p104 + p105 + p106 + p107 <= p87 + p88 + p89))) OR E (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))) : (A (G (E (F ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p66 + p67 + p68))))) OR ((2 <= p66 + p67 + p68) AND (((p90 + p91 + p92 + p93 + p94 + p95 <= 0) AND (p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) OR A (G ((p66 + p67 + p68 <= p100 + p101 + p98 + p96 + p97 + p99)))))) : (A (G (TRUE)) OR (3 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) : ((NOT(E (F ((p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))) OR ((1 <= p90 + p91 + p92 + p93 + p94 + p95) OR E (G ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p42 + p43 + p45 + p46 + p47 + p44))))) AND (E ((TRUE U (1 <= p66 + p67 + p68))) AND ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1))))
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 (NOT(A (X ((3 <= p100 + p101 + p98 + p96 + p97 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p100 + p101 + p98 + p96 + p97 + p99 <= 2)))))
lola: processed formula length: 66
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E ((((p36 + p37 + p38 + p39 + p40 + p41 <= p90 + p91 + p92 + p93 + p94 + p95) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) U ((3 <= p42 + p43 + p45 + p46 + p47 + p44) AND (3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(((p36 + p37 + p38 + p39 + p40 + p41 <= p90 + p91 + p92 + p93 + p94 + p95) OR (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) U ((3 <= p42 + p43 + p45 + p46 + p47 + p44) AND (3 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))
lola: processed formula length: 351
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((3 <= p36 + p37 + p38 + p39 + p40 + p41))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p36 + p37 + p38 + p39 + p40 + p41 <= 2)))))
lola: processed formula length: 70
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((3 <= p100 + p101 + p98 + p96 + p97 + p99) U (2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))) OR (E (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65))) AND E (F ((3 <= p42 + p43 + p45 + p46 + p47 + p44)))))
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: E (((3 <= p100 + p101 + p98 + p96 + p97 + p99) U (2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p100 + p101 + p98 + p96 + p97 + p99) U (2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))
lola: processed formula length: 160
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))
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 388 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p42 + p43 + p45 + p46 + p47 + p44)))
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 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p42 + p43 + p45 + p46 + p47 + p44) U (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))) OR (A (G (((2 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p... (shortened)
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 (((p42 + p43 + p45 + p46 + p47 + p44 + 1 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) R (p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + 1 <= p66 + p67 + p68)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p42 + p43 + p45 + p46 + p47 + p44) U (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))
lola: processed formula length: 281
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65) OR (1 <= p90 + p91 + p92 + p93 + p94 + p95))))
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 388 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p102 + p103 + p104 + p105 + p106 + p107) OR ((p100 + p101 + p98 + p96 + p97 + p99 + 1 <= p90 + p91 + p92 + p93 + p94 + p95) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p102 + p103 + p104 + p105 + p106 + p107) OR ((p100 + p101 + p98 + p96 + p97 + p99 + 1 <= p90 + p91 + p92 + p93 + p94 + p95) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= 2)))
lola: processed formula length: 286
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: 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 108 places; total mentions: 0
lola: closed formula file Peterson-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p42 + p43 + p45 + p46 + p47 + p44) AND (3 <= p100 + p101 + p98 + p96 + p97 + p99) AND (2 <= p100 + p101 + p98 + p96 + p97 + p99)) U A (G ((1 <= p90 + p91 + p92 + p93 + p94 + p95)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((3 <= p42 + p43 + p45 + p46 + p47 + p44) AND (3 <= p100 + p101 + p98 + p96 + p97 + p99) AND (2 <= p100 + p101 + p98 + p96 + p97 + p99)) U NOT(E(TRUE U (p90 + p91 + p92 + p93 + p94 + p95 <= 0))))
lola: processed formula length: 197
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((1 <= p42 + p43 + p45 + p46 + p47 + p44))) U FALSE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((2 <= p90 + p91 + p92 + p93 + p94 + p95))) OR A (G ((p90 + p91 + p92 + p93 + p94 + p95 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (2 <= p90 + p91 + p92 + p93 + p94 + p95))) AND E(TRUE U (p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + 1 <= p90 + p91 + p92 + p93 + p94 + p95)))))
lola: processed formula length: 235
lola: 6 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((3 <= p36 + p37 + p38 + p39 + p40 + p41))))) OR A (G (E (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))))
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 (G ((3 <= p36 + p37 + p38 + p39 + p40 + p41)))
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 388 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
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 (p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: processed formula length: 180
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR E (X (E (F ((p42 + p43 + p45 + p46 + p47 + p44 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p42 + p43 + p45 + p46 + p47 + p44 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p42 + p43 + p45 + p46 + p47 + p44 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))
lola: processed formula length: 158
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR (p90 + p91 + p92 + p93 + p94 + p95 <= p66 + p67 + p68)) U ((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p90 + p91 + p92 + p93 + p94 + p95) OR (2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79... (shortened)
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 ((((2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR (p90 + p91 + p92 + p93 + p94 + p95 <= p66 + p67 + p68)) U ((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p90 + p91 + p92 + p93 + p94 + p95) OR (2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR (p90 + p91 + p92 + p93 + p94 + p95 <= p66 + p67 + p68)) U ((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p90 + p91 + p92 + p93 + p94 + p95) OR (2 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + ... (shortened)
lola: processed formula length: 442
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 <= p66 + p67 + p68) AND (p102 + p103 + p104 + p105 + p106 + p107 <= p42 + p43 + p45 + p46 + p47 + p44))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p66 + p67 + p68 + 1 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) OR (p42 + p43 + p45 + p46 + p47 + p44 + 1 <= p102 + p103 + p104 + p105 + p106 + p107))))
lola: processed formula length: 234
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT(E (F ((p100 + p101 + p98 + p96 + p97 + p99 + 1 <= p66 + p67 + p68)))) OR ((E (X ((3 <= p87 + p88 + p89))) OR (((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) A... (shortened)
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: A (G ((p66 + p67 + p68 <= p100 + p101 + p98 + p96 + p97 + p99)))
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 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-12.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sararesult: no

lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= p87 + p88 + p89)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= p87 + p88 + p89))
lola: processed formula length: 26
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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: ========================================
sara: try reading problem file Peterson-COL-2-CTLCardinality-12.sara.
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) AND ((1 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p102 + p103 + p104 + p105 + p106 + p107 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) OR (p66 + p67 + p68 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) AND ((1 <= p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p8... (shortened)
lola: processed formula length: 431
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-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:
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p66 + p67 + p68))))) OR ((2 <= p66 + p67 + p68) AND (((p90 + p91 + p92 + p93 + p94 + p95 <= 0) AND (p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) OR A (G ((p66 + p67 + p68 <= p100 + p1... (shortened)
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 (E (F ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p66 + p67 + p68)))))
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 (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p66 + p67 + p68)))))
lola: processed formula length: 156
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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).
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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (TRUE)) OR (3 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))) OR ((1 <= p90 + p91 + p92 + p93 + p94 + p95) OR E (G ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p42 + p43 + p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)))
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 388 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: 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: E (G ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p42 + p43 + p45 + p46 + p47 + p44)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p42 + p43 + p45 + p46 + p47 + p44 + 1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))
lola: processed formula length: 163
lola: 7 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 388 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 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p66 + p67 + p68)))
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 388 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-COL-2-CTLCardinality-18.sara
lola: SUBRESULT
lola: result: yes
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1))
lola: processed formula length: 155
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no yes yes yes yes no yes yes yes
sara: try reading problem file Peterson-COL-2-CTLCardinality-18.sara.
sara: place or transition ordering is non-deterministic
FORMULA Peterson-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496257082732

--------------------
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_Peterson-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_Peterson-COL-2.tgz
mv S_Peterson-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_Peterson-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 r128-smll-149441681100003"
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 ;