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 PermAdmissibility-COL-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484900345
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494648219481


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-01 @ 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: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-01-CTLCardinality.task
lola: E ((E (F ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p182))) U (2 <= p131))) : (((((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (1 <= p9) AND (p131 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)) OR ((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + 1 <= p53) AND (2 <= p191))) OR NOT(A (G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121))))) AND ((A (F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p35))) OR ((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= 0) OR (p54 + 1 <= p53))) AND E (((3 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))))) : E (F (E (G ((p164 <= 0))))) : NOT(((E (G ((1 <= p122))) OR A (F ((3 <= p182)))) OR (2 <= p181))) : E (G ((E (X ((p164 <= p182))) OR (1 <= p44)))) : A (G (NOT(E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))))) : A (F ((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))) : E (G (E (((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p122))))) : NOT((A (X (((p35 <= p104) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p122)))) AND (A (G ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p8))) OR A (F ((3 <= p182)))))) : A ((((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR (p181 <= 0)) U (3 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))) : A (((p105 <= 2) U A (F ((2 <= p191))))) : A ((((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p182 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) OR (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) U A (G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))) : A (F ((((p182 + 1 <= p181) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p8)) OR (p131 + 1 <= p105)))) : E (G (A (G ((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2))))) : (((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) AND (3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147)) OR (NOT(E (F ((1 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)))) OR (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))) : A (F (((3 <= p8) AND (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p34) AND (1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND ((p164 <= p131) OR (2 <= p181)) AND (p34 <= 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 ((p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p182))) U (2 <= p131)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p182)) U (2 <= p131))
lola: processed formula length: 90
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (1 <= p9) AND (p131 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)) OR ((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + 1 <= p53) AND (2 <= p191))) OR NOT(A (G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (1 <= p9) AND (p131 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)) OR ((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + 1 <= p53) AND (2 <= p191)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (1 <= p9) AND (p131 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)) OR ((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + 1 <= p53) AND (2 <= p191)))
lola: processed formula length: 283
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: processed formula with 5 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: E (F ((p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + 1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71)))
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 708 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 PermAdmissibility-COL-01-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p35))
lola: processed formula length: 72
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63) U (p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71))
lola: processed formula length: 162
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p164 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= p164))))
lola: processed formula length: 36
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: NOT(((E (G ((1 <= p122))) OR A (F ((3 <= p182)))) OR (2 <= p181)))
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: A (F ((p122 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p122 <= 0))
lola: processed formula length: 21
lola: 11 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p182 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p182)))
lola: processed formula length: 26
lola: 12 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p181 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p181 <= 1)
lola: processed formula length: 11
lola: 10 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (X ((p164 <= p182))) OR (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(EX((p164 <= p182))) AND (p44 <= 0))))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))
lola: processed formula length: 138
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: E (G (E (((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p122)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) U (3 <= p122)))))
lola: processed formula length: 141
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (((p35 <= p104) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p122)))) AND (A (G ((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= p8))) OR A (F ((3 <= p182))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p104 + 1 <= p35) OR (p122 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p104 + 1 <= p35) OR (p122 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))
lola: processed formula length: 79
lola: 12 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p8 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)))
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 708 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p182 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p182)))
lola: processed formula length: 26
lola: 13 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================lola:
========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR (p181 <= 0)) U (3 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (2 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR (p181 <= 0)) U (3 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))
lola: processed formula length: 197
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p105 <= 2) U A (F ((2 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p105 <= 2) U A(TRUE U (2 <= p191)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p182 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) OR (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) U... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) AND (p182 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147) OR (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) U N... (shortened)
lola: processed formula length: 523
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p182 + 1 <= p181) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p8)) OR (p131 + 1 <= p105))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p182 + 1 <= p181) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p8)) OR (p131 + 1 <= p105)))
lola: processed formula length: 125
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G ((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))
lola: processed formula length: 85
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) AND (3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147)) OR (NOT(E (F ((1 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)))) OR (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) AND (3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71) AND (3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147))
lola: processed formula length: 119
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= 0)))
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 708 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 PermAdmissibility-COL-01-CTLCardinality-15.sara
lola: state equation: calling and running sara
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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p8) AND (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p34) AND (1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND ((p164 <= p131) OR (2 <= p181)) AND (p34 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((3 <= p8) AND (p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p34) AND (1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND ((p164 <= p131) OR (2 <= p181)) AND (p34 <= 2)))
lola: processed formula length: 189
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 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: RESULT
lola:
SUMMARY: no yes yes yes no no yes no yes no no no yes yes unknown no
lola: ========================================
FORMULA PermAdmissibility-COL-01-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-01-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494648220687

--------------------
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="PermAdmissibility-COL-01"
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/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 PermAdmissibility-COL-01, 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 r038-blw7-149440484900345"
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 ;