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 FlexibleBarrier-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034100012
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496481379951


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
FlexibleBarrier-PT-04b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-04b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ FlexibleBarrier-PT-04b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 573/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 268 places, 305 transitions, 262 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-04b-CTLCardinality.task
lola: A (X (E (F ((p158 + 1 <= p179))))) : ((E (G (((1 <= p91) OR (p81 <= p67)))) AND E (G (((p196 <= p211) AND (p126 <= p242))))) AND E (G (((3 <= p150) OR (1 <= p40) OR ((p50 <= p172) AND (p136 <= p255)))))) : A (((p115 <= p0) U A (F ((1 <= p147))))) : NOT(((p221 <= p79) AND A (F (((2 <= p94) AND (3 <= p97)))))) : A (F ((1 <= p230))) : E (F (A (X ((2 <= p169))))) : (E (F ((1 <= p11))) AND A (F (A (G ((1 <= p48)))))) : E (G ((p37 <= p260))) : E (F ((A (F ((3 <= p140))) AND A (G ((3 <= p237)))))) : NOT((E (F ((p123 + 1 <= p186))) AND A (G (((p168 <= p256) OR (2 <= p84)))))) : NOT(NOT(E (G ((p84 <= 2))))) : E (F (A (X (((2 <= p246) OR (2 <= p35)))))) : (A (G (E (F ((2 <= p249))))) OR E (X (A (X ((3 <= p250)))))) : E (((p235 <= p183) U ((3 <= p20) OR ((3 <= p91) AND (p33 <= p119))))) : E (G (A (X (((p52 <= p105) OR (1 <= p196)))))) : E (X (NOT(A (G ((p12 <= p59))))))
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 (X (E (F ((p158 + 1 <= p179)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p158 + 1 <= p179)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((1 <= p91) OR (p81 <= p67)))) AND E (G (((p196 <= p211) AND (p126 <= p242))))) AND E (G (((3 <= p150) OR (1 <= p40) OR ((p50 <= p172) AND (p136 <= p255))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p91) OR (p81 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p91 <= 0) AND (p67 + 1 <= p81))))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: E (G (((p196 <= p211) AND (p126 <= p242))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p211 + 1 <= p196) OR (p242 + 1 <= p126))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p150) OR (1 <= p40) OR ((p50 <= p172) AND (p136 <= p255)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p150 <= 2) AND (p40 <= 0) AND ((p172 + 1 <= p50) OR (p255 + 1 <= p136)))))
lola: processed formula length: 90
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: A (((p115 <= p0) U A (F ((1 <= p147)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((p115 <= p0) U A(TRUE U (1 <= p147)))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((p221 <= p79) AND A (F (((2 <= p94) AND (3 <= p97))))))
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: (p79 + 1 <= p221)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p79 + 1 <= p221)
lola: processed formula length: 17
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p94 <= 1) OR (p97 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= p94) AND (3 <= p97))))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p230)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= p230))
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: E (F (A (X ((2 <= p169)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((2 <= p169)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p11))) AND A (F (A (G ((1 <= p48))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p11)))
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 36 bytes per marking, with 26 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 FlexibleBarrier-PT-04b-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (p48 <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: ========================================SUBRESULT

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p37 <= p260)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p260 + 1 <= p37)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((3 <= p140))) AND A (G ((3 <= p237))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U (3 <= p140)) AND NOT(E(TRUE U (p237 <= 2)))))
lola: processed formula length: 64
lola: 4 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 776254 markings, 3084877 edges, 3689339798746562560 markings/sec, 0 secs
lola: 1467888 markings, 5961682 edges, 138327 markings/sec, 5 secs
lola: 2121822 markings, 8756733 edges, 130787 markings/sec, 10 secs
lola: 2774122 markings, 11731482 edges, 130460 markings/sec, 15 secs
lola: 3387082 markings, 14463631 edges, 122592 markings/sec, 20 secs
lola: 3863622 markings, 16724513 edges, 95308 markings/sec, 25 secs
lola: 4463951 markings, 19463317 edges, 120066 markings/sec, 30 secs
lola: 5025275 markings, 22163077 edges, 112265 markings/sec, 35 secs
lola: 5578667 markings, 24666172 edges, 110678 markings/sec, 40 secs
lola: 6138017 markings, 27247119 edges, 111870 markings/sec, 45 secs
lola: 6736246 markings, 29909598 edges, 119646 markings/sec, 50 secs
lola: 7314949 markings, 32560036 edges, 115741 markings/sec, 55 secs
lola: 7815426 markings, 35024070 edges, 100095 markings/sec, 60 secs
lola: 8377371 markings, 37722534 edges, 112389 markings/sec, 65 secs
lola: 8938774 markings, 40248097 edges, 112281 markings/sec, 70 secs
lola: 9498616 markings, 42892946 edges, 111968 markings/sec, 75 secs
lola: 9974768 markings, 45284908 edges, 95230 markings/sec, 80 secs
lola: 10515585 markings, 47887216 edges, 108163 markings/sec, 85 secs
lola: 11025729 markings, 50403870 edges, 102029 markings/sec, 90 secs
lola: 11539966 markings, 52957015 edges, 102847 markings/sec, 95 secs
lola: 12067278 markings, 55585177 edges, 105462 markings/sec, 100 secs
lola: 12574900 markings, 58132619 edges, 101524 markings/sec, 105 secs
lola: 13068603 markings, 60510489 edges, 98741 markings/sec, 110 secs
lola: 13545189 markings, 62787395 edges, 95317 markings/sec, 115 secs
lola: 14051185 markings, 65271250 edges, 101199 markings/sec, 120 secs
lola: 14564532 markings, 67660173 edges, 102669 markings/sec, 125 secs
lola: 15107838 markings, 70140817 edges, 108661 markings/sec, 130 secs
lola: 15603022 markings, 72585404 edges, 99037 markings/sec, 135 secs
lola: 16100870 markings, 74967609 edges, 99570 markings/sec, 140 secs
lola: 16560424 markings, 77296233 edges, 91911 markings/sec, 145 secs
lola: 16971443 markings, 79470080 edges, 82204 markings/sec, 150 secs
lola: 17427914 markings, 81778259 edges, 91294 markings/sec, 155 secs
lola: 17866543 markings, 83887423 edges, 87726 markings/sec, 160 secs
lola: 18351623 markings, 86461802 edges, 97016 markings/sec, 165 secs
lola: 18803149 markings, 88738958 edges, 90305 markings/sec, 170 secs
lola: 19184959 markings, 90719582 edges, 76362 markings/sec, 175 secs
lola: 19559540 markings, 92835908 edges, 74916 markings/sec, 180 secs
lola: 20012933 markings, 95173661 edges, 90679 markings/sec, 185 secs
lola: 20454382 markings, 97343578 edges, 88290 markings/sec, 190 secs
lola: 20971219 markings, 99426475 edges, 103367 markings/sec, 195 secs
lola: 21319328 markings, 101205924 edges, 69622 markings/sec, 200 secs
lola: 21590575 markings, 102883624 edges, 54249 markings/sec, 205 secs
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 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((p123 + 1 <= p186))) AND A (G (((p168 <= p256) OR (2 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p186 <= p123)))
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 36 bytes per marking, with 26 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 FlexibleBarrier-PT-04b-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04b-CTLCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p256 + 1 <= p168) AND (p84 <= 1))))
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 36 bytes per marking, with 26 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: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G ((p84 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p84)))
lola: processed formula length: 25
lola: 8 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((2 <= p246) OR (2 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((2 <= p246) OR (2 <= p35))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((2 <= p249))))) OR E (X (A (X ((3 <= p250))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= p249)))))
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 (2 <= p249)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 1477708 markings, 3171696 edges, 3689339798746562560 markings/sec, 0 secs
lola: 2600182 markings, 5846056 edges, 224495 markings/sec, 5 secs
lola: 3693025 markings, 8688507 edges, 218569 markings/sec, 10 secs
lola: 4745047 markings, 11355044 edges, 210404 markings/sec, 15 secs
lola: 5708757 markings, 14008477 edges, 192742 markings/sec, 20 secs
lola: 6746848 markings, 16710668 edges, 207618 markings/sec, 25 secs
lola: 7687148 markings, 19393670 edges, 188060 markings/sec, 30 secs
lola: 8620173 markings, 21997285 edges, 186605 markings/sec, 35 secs
lola: 9564020 markings, 24491686 edges, 188769 markings/sec, 40 secs
lola: 10406668 markings, 26775178 edges, 168530 markings/sec, 45 secs
lola: 11263065 markings, 29268429 edges, 171279 markings/sec, 50 secs
lola: 12100451 markings, 31769205 edges, 167477 markings/sec, 55 secs
lola: 12989460 markings, 34372168 edges, 177802 markings/sec, 60 secs
lola: 13811989 markings, 36831747 edges, 164506 markings/sec, 65 secs
lola: 14640346 markings, 39270653 edges, 165671 markings/sec, 70 secs
lola: 15540647 markings, 41884809 edges, 180060 markings/sec, 75 secs
lola: 16380595 markings, 44503275 edges, 167990 markings/sec, 80 secs
lola: 17087064 markings, 46825475 edges, 141294 markings/sec, 85 secs
lola: 17848557 markings, 49377692 edges, 152299 markings/sec, 90 secs
lola: 18577124 markings, 51776650 edges, 145713 markings/sec, 95 secs
lola: 19117358 markings, 53826244 edges, 108047 markings/sec, 100 secs
lola: 19532308 markings, 55599619 edges, 82990 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((3 <= p250)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((3 <= p250)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p235 <= p183) U ((3 <= p20) OR ((3 <= p91) AND (p33 <= p119)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p235 <= p183) U ((3 <= p20) OR ((3 <= p91) AND (p33 <= p119))))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: 1304944 markings, 3012913 edges, 260979 markings/sec, 0 secs
lola: 2640189 markings, 5795458 edges, 267049 markings/sec, 5 secs
lola: 3413738 markings, 8271854 edges, 154710 markings/sec, 10 secs
lola: 4113878 markings, 10664714 edges, 140028 markings/sec, 15 secs
lola: 4707474 markings, 12806695 edges, 118719 markings/sec, 20 secs
lola: 5189406 markings, 14733361 edges, 96386 markings/sec, 25 secs
lola: 5782107 markings, 17160158 edges, 118540 markings/sec, 30 secs
lola: 6327184 markings, 19396524 edges, 109015 markings/sec, 35 secs
lola: 7230156 markings, 21928714 edges, 180594 markings/sec, 40 secs
lola: 8048419 markings, 24250006 edges, 163653 markings/sec, 45 secs
lola: 9076913 markings, 26832439 edges, 205699 markings/sec, 50 secs
lola: 10054001 markings, 29358277 edges, 195418 markings/sec, 55 secs
lola: 10940703 markings, 31767185 edges, 177340 markings/sec, 60 secs
lola: 11686409 markings, 33796724 edges, 149141 markings/sec, 65 secs
lola: 12522893 markings, 36082770 edges, 167297 markings/sec, 70 secs
lola: 13379878 markings, 38449945 edges, 171397 markings/sec, 75 secs
lola: 14166243 markings, 40631968 edges, 157273 markings/sec, 80 secs
lola: 15106352 markings, 43020829 edges, 188022 markings/sec, 85 secs
lola: 15906246 markings, 45364677 edges, 159979 markings/sec, 90 secs
lola: 16702003 markings, 47515975 edges, 159151 markings/sec, 95 secs
lola: 17368573 markings, 49626430 edges, 133314 markings/sec, 100 secs
lola: 18147724 markings, 51806957 edges, 155830 markings/sec, 105 secs
lola: 18916364 markings, 53896519 edges, 153728 markings/sec, 110 secs
lola: 19675910 markings, 56076974 edges, 151909 markings/sec, 115 secs
lola: 20478664 markings, 58322357 edges, 160551 markings/sec, 120 secs
lola: 21119479 markings, 60340741 edges, 128163 markings/sec, 125 secs
lola: 21855584 markings, 62568169 edges, 147221 markings/sec, 130 secs
lola: 22552439 markings, 64605902 edges, 139371 markings/sec, 135 secs
lola: 23181653 markings, 66715342 edges, 125843 markings/sec, 140 secs
lola: 23832405 markings, 68931634 edges, 130150 markings/sec, 145 secs
lola: 24565755 markings, 71221272 edges, 146670 markings/sec, 150 secs
lola: 25244649 markings, 73542422 edges, 135779 markings/sec, 155 secs
lola: 25817456 markings, 75601923 edges, 114561 markings/sec, 160 secs
lola: 26319596 markings, 77314019 edges, 100428 markings/sec, 165 secs
lola: 26635226 markings, 78635260 edges, 63126 markings/sec, 170 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 14 will run for 1519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((p52 <= p105) OR (1 <= p196))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(((p52 <= p105) OR (1 <= p196))))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: lola: ========================================using 36 bytes per marking, with 26 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 15 will run for 3038 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (G ((p12 <= p59))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p59 + 1 <= p12)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 268 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-04b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 26 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: RESULT
lola:
SUMMARY: yes yes no yes no yes no yes no yes yes yes no no yes yes
lola: ========================================
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496481881173

--------------------
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="FlexibleBarrier-PT-04b"
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/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 FlexibleBarrier-PT-04b, 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 r188-blw3-149581034100012"
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 ;