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-3253
Executing tool lola
Input is SwimmingPool-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008300174
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494935224348


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SwimmingPool-PT-08 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-08-CTLCardinality.task
lola: A (G (A (X ((Dressed + 1 <= Bags))))) : (A (G (E (G ((Dressed <= Cabins))))) AND (2 <= Out)) : A (F (E (F ((Bags <= Dress))))) : A (G ((A (G ((InBath <= Bags))) OR E (G ((1 <= WaitBag)))))) : NOT(E (F (((Out <= Cabins) AND (1 <= Dressed) AND (Entered + 1 <= Dressed))))) : NOT(((A (G ((Entered <= Cabins))) AND (((3 <= Bags) OR (Undress <= Out)) AND ((Undress <= Cabins) OR (3 <= Undress)))) AND (E (X (TRUE)) OR ((Undress <= 2) OR (Undress <= 1))))) : E ((A (G (TRUE)) U A (X ((1 <= Undress))))) : NOT(((E (F ((3 <= WaitBag))) AND A (X ((1 <= WaitBag)))) OR A (G (((1 <= Out)))))) : (((Undress <= Cabins) OR E (((Out <= Dress) U (3 <= Dress)))) AND ((2 <= Bags) AND A (G ((1 <= Bags))))) : E (F (((Cabins <= Dress) AND E (X ((1 <= Undress)))))) : A (G (E (X (((Dressed <= Out)))))) : NOT((E (F ((Cabins <= 1))) AND ((Dressed <= Entered) AND ((Undress <= Cabins) OR (2 <= Bags))))) : A (X (NOT(A (G ((3 <= Bags)))))) : E (G ((WaitBag <= Dress))) : A (G (A (F (())))) : E (F ((E (G ((1 <= WaitBag))) AND ((Entered <= 2) AND (Out <= 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 (A (X ((Dressed + 1 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((Dressed + 1 <= Bags)))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 1044383 markings, 2790444 edges, 2806861595810988032 markings/sec, 0 secs
lola: 1934249 markings, 5446586 edges, 177973 markings/sec, 5 secs
lola: 2756824 markings, 7984440 edges, 164515 markings/sec, 10 secs
lola: 3549339 markings, 10468794 edges, 158503 markings/sec, 15 secs
lola: 4306388 markings, 12880751 edges, 151410 markings/sec, 20 secs
lola: 5032421 markings, 15228240 edges, 145207 markings/sec, 25 secs
lola: 5748380 markings, 17539437 edges, 143192 markings/sec, 30 secs
lola: 6445309 markings, 19812818 edges, 139386 markings/sec, 35 secs
lola: 7135591 markings, 22066610 edges, 138056 markings/sec, 40 secs
lola: 7812681 markings, 24296713 edges, 135418 markings/sec, 45 secs
lola: 8473833 markings, 26492371 edges, 132230 markings/sec, 50 secs
lola: 9121756 markings, 28644387 edges, 129585 markings/sec, 55 secs
lola: 9767467 markings, 30788753 edges, 129142 markings/sec, 60 secs
lola: 10400091 markings, 32908288 edges, 126525 markings/sec, 65 secs
lola: 11037805 markings, 35025280 edges, 127543 markings/sec, 70 secs
lola: 11650565 markings, 37063651 edges, 122552 markings/sec, 75 secs
lola: 12255103 markings, 39082185 edges, 120908 markings/sec, 80 secs
lola: 12881618 markings, 41178632 edges, 125303 markings/sec, 85 secs
lola: 13501084 markings, 43260620 edges, 123893 markings/sec, 90 secs
lola: 14115568 markings, 45325895 edges, 122897 markings/sec, 95 secs
lola: 14723525 markings, 47384202 edges, 121591 markings/sec, 100 secs
lola: 15332611 markings, 49437230 edges, 121817 markings/sec, 105 secs
lola: 15938740 markings, 51483933 edges, 121226 markings/sec, 110 secs
lola: 16539426 markings, 53522111 edges, 120137 markings/sec, 115 secs
lola: 17140757 markings, 55558005 edges, 120266 markings/sec, 120 secs
lola: 17735161 markings, 57588069 edges, 118881 markings/sec, 125 secs
lola: 18324910 markings, 59609531 edges, 117950 markings/sec, 130 secs
lola: 18917944 markings, 61634442 edges, 118607 markings/sec, 135 secs
lola: 19506525 markings, 63653428 edges, 117716 markings/sec, 140 secs
lola: 20093993 markings, 65662610 edges, 117494 markings/sec, 145 secs
lola: 20680513 markings, 67674031 edges, 117304 markings/sec, 150 secs
lola: 21263726 markings, 69678987 edges, 116643 markings/sec, 155 secs
lola: 21844847 markings, 71676979 edges, 116224 markings/sec, 160 secs
lola: 22422700 markings, 73669803 edges, 115571 markings/sec, 165 secs
lola: 22991400 markings, 75645248 edges, 113740 markings/sec, 170 secs
lola: 23560251 markings, 77621343 edges, 113770 markings/sec, 175 secs
lola: 24132976 markings, 79600168 edges, 114545 markings/sec, 180 secs
lola: 24695139 markings, 81545742 edges, 112433 markings/sec, 185 secs
lola: 25256638 markings, 83490277 edges, 112300 markings/sec, 190 secs
lola: 25818936 markings, 85436268 edges, 112460 markings/sec, 195 secs
lola: 26379564 markings, 87377367 edges, 112126 markings/sec, 200 secs
lola: 26936851 markings, 89308590 edges, 111457 markings/sec, 205 secs
lola: 27497416 markings, 91248852 edges, 112113 markings/sec, 210 secs
lola: 28053351 markings, 93177774 edges, 111187 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((Dressed <= Cabins))))) AND (2 <= Out))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((Dressed <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (Cabins + 1 <= Dressed))))
lola: processed formula length: 48
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((Bags <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Bags <= Dress)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((InBath <= Bags))) OR E (G ((1 <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (Bags + 1 <= InBath)) AND A(TRUE U (WaitBag <= 0)))))
lola: processed formula length: 76
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((Out <= Cabins) AND (1 <= Dressed) AND (Entered + 1 <= Dressed)))))
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 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (G ((Entered <= Cabins))) AND (((3 <= Bags) OR (Undress <= Out)) AND ((Undress <= Cabins) OR (3 <= Undress)))) AND (E (X (TRUE)) OR ((Undress <= 2) OR (Undress <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Cabins + 1 <= Entered)))
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 24 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: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-5.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G (TRUE)) U A (X ((1 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= Undress)))
lola: processed formula length: 28
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (F ((3 <= WaitBag))) AND A (X ((1 <= WaitBag)))) OR A (G (((1 <= Out))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((WaitBag <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-7.sara
lola: The predicate is not invariant.
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((WaitBag <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: state equation: calling and running sara
lola: processed formula: EX((WaitBag <= 0))
lola: processed formula length: 18
lola: lola: 12 rewrites
========================================lola:
formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Out <= 0))))
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 24 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: SUBRESULT
lola: result: yeslola:
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-9.sara
The Boolean predicate is true.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Undress <= Cabins) OR E (((Out <= Dress) U (3 <= Dress)))) AND ((2 <= Bags) AND A (G ((1 <= Bags)))))
lola: lola: ========================================
lola: SUBTASK========================================

sara: try reading problem file SwimmingPool-PT-08-CTLCardinality-7.sara.
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Undress <= Cabins)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Undress <= Cabins)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Bags)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Bags)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: sara: using a bit-perfect encoder (--encoder=bit)place or transition ordering is non-deterministic

lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: sara: try reading problem file SwimmingPool-PT-08-CTLCardinality-9.sara.
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 SwimmingPool-PT-08-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: E (F (((Cabins <= Dress) AND E (X ((1 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((Cabins <= Dress) AND EX((1 <= Undress))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((Dressed <= Out))))))
lola: ========================================
lola: SUBTASK
lola:
checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((Dressed <= Out))))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((Cabins <= 1))) AND ((Dressed <= Entered) AND ((Undress <= Cabins) OR (2 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Cabins)))
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 24 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 SwimmingPool-PT-08-CTLCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 828 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Entered + 1 <= Dressed) OR ((Cabins + 1 <= Undress) AND (Bags <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Entered + 1 <= Dressed) OR ((Cabins + 1 <= Undress) AND (Bags <= 1)))
lola: processed formula length: 72
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 828 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (G ((3 <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (Bags <= 2)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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).
sara: try reading problem file SwimmingPool-PT-08-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: 1185822 markings, 3214147 edges, 237164 markings/sec, 0 secs
lola: 2088861 markings, 5917496 edges, 180608 markings/sec, 5 secs
lola: 2912967 markings, 8465737 edges, 164821 markings/sec, 10 secs
lola: 3701203 markings, 10951925 edges, 157647 markings/sec, 15 secs
lola: 4547256 markings, 13657062 edges, 169211 markings/sec, 20 secs
lola: 5348238 markings, 16250673 edges, 160196 markings/sec, 25 secs
lola: 6165314 markings, 18899714 edges, 163415 markings/sec, 30 secs
lola: 6968917 markings, 21521184 edges, 160721 markings/sec, 35 secs
lola: 7761767 markings, 24126922 edges, 158570 markings/sec, 40 secs
lola: 8541744 markings, 26718953 edges, 155995 markings/sec, 45 secs
lola: 9312457 markings, 29279894 edges, 154143 markings/sec, 50 secs
lola: 10081475 markings, 31833772 edges, 153804 markings/sec, 55 secs
lola: 10834873 markings, 34349351 edges, 150680 markings/sec, 60 secs
lola: 11586504 markings, 36851957 edges, 150326 markings/sec, 65 secs
lola: 12325652 markings, 39317256 edges, 147830 markings/sec, 70 secs
lola: 13035610 markings, 41693271 edges, 141992 markings/sec, 75 secs
lola: 13728065 markings, 44025915 edges, 138491 markings/sec, 80 secs
lola: 14396565 markings, 46275531 edges, 133700 markings/sec, 85 secs
lola: 15084549 markings, 48598932 edges, 137597 markings/sec, 90 secs
lola: 15770977 markings, 50914869 edges, 137286 markings/sec, 95 secs
lola: 16392302 markings, 53023560 edges, 124265 markings/sec, 100 secs
lola: 16986950 markings, 55036147 edges, 118930 markings/sec, 105 secs
lola: 17586254 markings, 57077910 edges, 119861 markings/sec, 110 secs
lola: 18185032 markings, 59131894 edges, 119756 markings/sec, 115 secs
lola: 18785822 markings, 61183557 edges, 120158 markings/sec, 120 secs
lola: 19381719 markings, 63227965 edges, 119179 markings/sec, 125 secs
lola: 19980810 markings, 65270581 edges, 119818 markings/sec, 130 secs
lola: 20577563 markings, 67320301 edges, 119351 markings/sec, 135 secs
lola: 21167105 markings, 69347886 edges, 117908 markings/sec, 140 secs
lola: 21764374 markings, 71400581 edges, 119454 markings/sec, 145 secs
lola: 22355422 markings, 73439795 edges, 118210 markings/sec, 150 secs
lola: 22939553 markings, 75463980 edges, 116826 markings/sec, 155 secs
lola: 23516132 markings, 77471409 edges, 115316 markings/sec, 160 secs
lola: 24115425 markings, 79539965 edges, 119859 markings/sec, 165 secs
lola: 24708407 markings, 81591662 edges, 118596 markings/sec, 170 secs
lola: 25296822 markings, 83628368 edges, 117683 markings/sec, 175 secs
lola: 25886114 markings, 85669033 edges, 117858 markings/sec, 180 secs
lola: 26475180 markings, 87708612 edges, 117813 markings/sec, 185 secs
lola: 27061017 markings, 89738751 edges, 117167 markings/sec, 190 secs
lola: 27649688 markings, 91780460 edges, 117734 markings/sec, 195 secs
lola: 28242400 markings, 93831000 edges, 118542 markings/sec, 200 secs
lola: 28818864 markings, 95829591 edges, 115293 markings/sec, 205 secs
lola: 29399386 markings, 97849698 edges, 116104 markings/sec, 210 secs
lola: 29980575 markings, 99872951 edges, 116238 markings/sec, 215 secs
lola: 30570248 markings, 101911176 edges, 117935 markings/sec, 220 secs
lola: 31156929 markings, 103942751 edges, 117336 markings/sec, 225 secs
lola: 31735341 markings, 105954943 edges, 115682 markings/sec, 230 secs
lola: 32308340 markings, 107956704 edges, 114600 markings/sec, 235 secs
lola: 32885490 markings, 109970835 edges, 115430 markings/sec, 240 secs
lola: 33468490 markings, 111986580 edges, 116600 markings/sec, 245 secs
lola: 34042235 markings, 113990761 edges, 114749 markings/sec, 250 secs
lola: 34619564 markings, 115995819 edges, 115466 markings/sec, 255 secs
lola: 35194354 markings, 117995797 edges, 114958 markings/sec, 260 secs
lola: 35770654 markings, 120001713 edges, 115260 markings/sec, 265 secs
lola: 36337536 markings, 121979801 edges, 113376 markings/sec, 270 secs
lola: 36903852 markings, 123955397 edges, 113263 markings/sec, 275 secs
lola: 37469170 markings, 125934472 edges, 113064 markings/sec, 280 secs
lola: 38039392 markings, 127916655 edges, 114044 markings/sec, 285 secs
lola: 38600465 markings, 129882957 edges, 112215 markings/sec, 290 secs
lola: 39168725 markings, 131868316 edges, 113652 markings/sec, 295 secs
lola: 39734051 markings, 133846879 edges, 113065 markings/sec, 300 secs
lola: 40293200 markings, 135809652 edges, 111830 markings/sec, 305 secs
lola: 40845838 markings, 137747980 edges, 110528 markings/sec, 310 secs
lola: 41405642 markings, 139711596 edges, 111961 markings/sec, 315 secs
lola: 41970954 markings, 141693179 edges, 113062 markings/sec, 320 secs
lola: 42535904 markings, 143670568 edges, 112990 markings/sec, 325 secs
lola: 43096673 markings, 145641641 edges, 112154 markings/sec, 330 secs
lola: 43650035 markings, 147585898 edges, 110672 markings/sec, 335 secs
lola: 44206454 markings, 149533062 edges, 111284 markings/sec, 340 secs
lola: 44757229 markings, 151468216 edges, 110155 markings/sec, 345 secs
lola: 45309439 markings, 153423632 edges, 110442 markings/sec, 350 secs
lola: 45862979 markings, 155377664 edges, 110708 markings/sec, 355 secs
lola: 46419941 markings, 157345844 edges, 111392 markings/sec, 360 secs
lola: 46976427 markings, 159306362 edges, 111297 markings/sec, 365 secs
lola: 47531871 markings, 161261008 edges, 111089 markings/sec, 370 secs
lola: 48073370 markings, 163178737 edges, 108300 markings/sec, 375 secs
lola: 48624229 markings, 165126180 edges, 110172 markings/sec, 380 secs
lola: 49165488 markings, 167054453 edges, 108252 markings/sec, 385 secs
lola: 49713209 markings, 169000090 edges, 109544 markings/sec, 390 secs
lola: 50246363 markings, 170901161 edges, 106631 markings/sec, 395 secs
lola: 50783646 markings, 172806434 edges, 107457 markings/sec, 400 secs
lola: 51320553 markings, 174703899 edges, 107381 markings/sec, 405 secs
lola: 51868065 markings, 176641769 edges, 109502 markings/sec, 410 secs
lola: 52412311 markings, 178574315 edges, 108849 markings/sec, 415 secs
lola: 52952668 markings, 180489572 edges, 108071 markings/sec, 420 secs
lola: 53496202 markings, 182414278 edges, 108707 markings/sec, 425 secs
lola: 54034403 markings, 184328987 edges, 107640 markings/sec, 430 secs
lola: 54564349 markings, 186223915 edges, 105989 markings/sec, 435 secs
lola: 55098316 markings, 188127012 edges, 106793 markings/sec, 440 secs
lola: 55639830 markings, 190047854 edges, 108303 markings/sec, 445 secs
lola: 56184345 markings, 191974885 edges, 108903 markings/sec, 450 secs
lola: 56727524 markings, 193900973 edges, 108636 markings/sec, 455 secs
lola: 57254437 markings, 195776885 edges, 105383 markings/sec, 460 secs
lola: 57793264 markings, 197688421 edges, 107765 markings/sec, 465 secs
lola: 58330653 markings, 199598805 edges, 107478 markings/sec, 470 secs
lola: 58860267 markings, 201497472 edges, 105923 markings/sec, 475 secs
lola: 59391914 markings, 203393786 edges, 106329 markings/sec, 480 secs
lola: 59928551 markings, 205297868 edges, 107327 markings/sec, 485 secs
lola: 60470563 markings, 207220888 edges, 108402 markings/sec, 490 secs
lola: 61001286 markings, 209112011 edges, 106145 markings/sec, 495 secs
lola: 61538295 markings, 211022923 edges, 107402 markings/sec, 500 secs
lola: 62074438 markings, 212935117 edges, 107229 markings/sec, 505 secs
lola: 62610160 markings, 214850148 edges, 107144 markings/sec, 510 secs
lola: 63145052 markings, 216762885 edges, 106978 markings/sec, 515 secs
lola: 63681128 markings, 218671103 edges, 107215 markings/sec, 520 secs
lola: 64216958 markings, 220587758 edges, 107166 markings/sec, 525 secs
lola: 64754221 markings, 222500538 edges, 107453 markings/sec, 530 secs
lola: 65290356 markings, 224407137 edges, 107227 markings/sec, 535 secs
lola: 65830176 markings, 226325398 edges, 107964 markings/sec, 540 secs
lola: 66370875 markings, 228249584 edges, 108140 markings/sec, 545 secs
lola: 66915311 markings, 230185024 edges, 108887 markings/sec, 550 secs
lola: 67452164 markings, 232103132 edges, 107371 markings/sec, 555 secs
lola: 67994100 markings, 234028719 edges, 108387 markings/sec, 560 secs
lola: 68533007 markings, 235951352 edges, 107781 markings/sec, 565 secs
lola: 69077750 markings, 237888975 edges, 108949 markings/sec, 570 secs
lola: 69605898 markings, 239782148 edges, 105630 markings/sec, 575 secs
lola: 70140101 markings, 241694457 edges, 106841 markings/sec, 580 secs
lola: 70670987 markings, 243585265 edges, 106177 markings/sec, 585 secs
lola: 71192461 markings, 245458646 edges, 104295 markings/sec, 590 secs
lola: 71719722 markings, 247346786 edges, 105452 markings/sec, 595 secs
lola: 72237768 markings, 249209342 edges, 103609 markings/sec, 600 secs
lola: 72763709 markings, 251091135 edges, 105188 markings/sec, 605 secs
lola: 73290367 markings, 252983734 edges, 105332 markings/sec, 610 secs
lola: 73822521 markings, 254885030 edges, 106431 markings/sec, 615 secs
lola: 74363624 markings, 256812384 edges, 108221 markings/sec, 620 secs
lola: 74894989 markings, 258717042 edges, 106273 markings/sec, 625 secs
lola: 75431163 markings, 260638013 edges, 107235 markings/sec, 630 secs
lola: 75969358 markings, 262564669 edges, 107639 markings/sec, 635 secs
lola: 76507771 markings, 264489501 edges, 107683 markings/sec, 640 secs
lola: 77035725 markings, 266392606 edges, 105591 markings/sec, 645 secs
lola: 77490270 markings, 268025327 edges, 90909 markings/sec, 650 secs
lola: 77937621 markings, 269633661 edges, 89470 markings/sec, 655 secs
lola: 78391468 markings, 271263036 edges, 90769 markings/sec, 660 secs
lola: 78849585 markings, 272898420 edges, 91623 markings/sec, 665 secs
lola: 79303815 markings, 274527156 edges, 90846 markings/sec, 670 secs
lola: 79750156 markings, 276140964 edges, 89268 markings/sec, 675 secs
lola: 80207840 markings, 277777553 edges, 91537 markings/sec, 680 secs
lola: 80650246 markings, 279369148 edges, 88481 markings/sec, 685 secs
lola: 81169398 markings, 281242217 edges, 103830 markings/sec, 690 secs
lola: 81693463 markings, 283124335 edges, 104813 markings/sec, 695 secs
lola: 82226413 markings, 285026149 edges, 106590 markings/sec, 700 secs
lola: 82745917 markings, 286898503 edges, 103901 markings/sec, 705 secs
lola: 83272053 markings, 288788212 edges, 105227 markings/sec, 710 secs
lola: 83807055 markings, 290702723 edges, 107000 markings/sec, 715 secs
lola: 84333081 markings, 292590721 edges, 105205 markings/sec, 720 secs
lola: 84847342 markings, 294435706 edges, 102852 markings/sec, 725 secs
lola: 85372474 markings, 296321883 edges, 105026 markings/sec, 730 secs
lola: 85893724 markings, 298198839 edges, 104250 markings/sec, 735 secs
lola: 86416709 markings, 300075110 edges, 104597 markings/sec, 740 secs
lola: 86946458 markings, 301977562 edges, 105950 markings/sec, 745 secs
lola: 87470797 markings, 303861232 edges, 104868 markings/sec, 750 secs
lola: 87985502 markings, 305698043 edges, 102941 markings/sec, 755 secs
lola: 88502250 markings, 307548388 edges, 103350 markings/sec, 760 secs
lola: 89027527 markings, 309441393 edges, 105055 markings/sec, 765 secs
lola: 89563747 markings, 311355716 edges, 107244 markings/sec, 770 secs
lola: 90088470 markings, 313243553 edges, 104945 markings/sec, 775 secs
lola: 90616831 markings, 315137857 edges, 105672 markings/sec, 780 secs
lola: 91085898 markings, 316832398 edges, 93813 markings/sec, 785 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 840 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((WaitBag <= Dress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Dress + 1 <= WaitBag)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: subprocess 14 will run for 1261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (()))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-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 2522 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= WaitBag))) AND ((Entered <= 2) AND (Out <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (WaitBag <= 0))) AND ((Entered <= 2) AND (Out <= 1))))
lola: processed formula length: 77
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 636831 markings, 2434151 edges, 3096145853857923072 markings/sec, 0 secs
lola: 1220025 markings, 4681596 edges, 116639 markings/sec, 5 secs
lola: 1784365 markings, 6862161 edges, 112868 markings/sec, 10 secs
lola: 2346783 markings, 9036223 edges, 112484 markings/sec, 15 secs
lola: 2907803 markings, 11205692 edges, 112204 markings/sec, 20 secs
lola: 3461958 markings, 13352296 edges, 110831 markings/sec, 25 secs
lola: 4010980 markings, 15478749 edges, 109804 markings/sec, 30 secs
lola: 4558486 markings, 17599792 edges, 109501 markings/sec, 35 secs
lola: 5106141 markings, 19720955 edges, 109531 markings/sec, 40 secs
lola: 5653677 markings, 21843157 edges, 109507 markings/sec, 45 secs
lola: 6200776 markings, 23962886 edges, 109420 markings/sec, 50 secs
lola: 6741827 markings, 26058826 edges, 108210 markings/sec, 55 secs
lola: 7281587 markings, 28150140 edges, 107952 markings/sec, 60 secs
lola: 7824112 markings, 30251170 edges, 108505 markings/sec, 65 secs
lola: 8362518 markings, 32338855 edges, 107681 markings/sec, 70 secs
lola: 8895815 markings, 34404670 edges, 106659 markings/sec, 75 secs
lola: 9428093 markings, 36468241 edges, 106456 markings/sec, 80 secs
lola: 9958444 markings, 38524332 edges, 106070 markings/sec, 85 secs
lola: 10487716 markings, 40574280 edges, 105854 markings/sec, 90 secs
lola: 11017376 markings, 42627749 edges, 105932 markings/sec, 95 secs
lola: 11550213 markings, 44691962 edges, 106567 markings/sec, 100 secs
lola: 12079867 markings, 46745537 edges, 105931 markings/sec, 105 secs
lola: 12613319 markings, 48813221 edges, 106690 markings/sec, 110 secs
lola: 13147888 markings, 50883511 edges, 106914 markings/sec, 115 secs
lola: 13681825 markings, 52953668 edges, 106787 markings/sec, 120 secs
lola: 14216357 markings, 55022431 edges, 106906 markings/sec, 125 secs
lola: 14749602 markings, 57089464 edges, 106649 markings/sec, 130 secs
lola: 15282382 markings, 59153823 edges, 106556 markings/sec, 135 secs
lola: 15814309 markings, 61213493 edges, 106385 markings/sec, 140 secs
lola: 16346350 markings, 63273875 edges, 106408 markings/sec, 145 secs
lola: 16875765 markings, 65324767 edges, 105883 markings/sec, 150 secs
lola: 17405985 markings, 67378615 edges, 106044 markings/sec, 155 secs
lola: 17936677 markings, 69432190 edges, 106138 markings/sec, 160 secs
lola: 18465990 markings, 71482446 edges, 105863 markings/sec, 165 secs
lola: 18997380 markings, 73540305 edges, 106278 markings/sec, 170 secs
lola: 19528886 markings, 75598780 edges, 106301 markings/sec, 175 secs
lola: 20062287 markings, 77663313 edges, 106680 markings/sec, 180 secs
lola: 20592906 markings, 79718227 edges, 106124 markings/sec, 185 secs
lola: 21123512 markings, 81772496 edges, 106121 markings/sec, 190 secs
lola: 21654982 markings, 83829627 edges, 106294 markings/sec, 195 secs
lola: 22184072 markings, 85877864 edges, 105818 markings/sec, 200 secs
lola: 22716391 markings, 87938738 edges, 106464 markings/sec, 205 secs
lola: 23250272 markings, 90006114 edges, 106776 markings/sec, 210 secs
lola: 23787304 markings, 92083485 edges, 107406 markings/sec, 215 secs
lola: 24321584 markings, 94152995 edges, 106856 markings/sec, 220 secs
lola: 24851750 markings, 96204665 edges, 106033 markings/sec, 225 secs
lola: 25380711 markings, 98252735 edges, 105792 markings/sec, 230 secs
lola: 25912100 markings, 100310172 edges, 106278 markings/sec, 235 secs
lola: 26442610 markings, 102362747 edges, 106102 markings/sec, 240 secs
lola: 26971086 markings, 104408440 edges, 105695 markings/sec, 245 secs
lola: 27500858 markings, 106457333 edges, 105954 markings/sec, 250 secs
lola: 28030092 markings, 108506706 edges, 105847 markings/sec, 255 secs
lola: 28562115 markings, 110565611 edges, 106405 markings/sec, 260 secs
lola: 29093166 markings, 112621005 edges, 106210 markings/sec, 265 secs
lola: 29624384 markings, 114677270 edges, 106244 markings/sec, 270 secs
lola: 30155598 markings, 116732968 edges, 106243 markings/sec, 275 secs
lola: 30686628 markings, 118788007 edges, 106206 markings/sec, 280 secs
lola: 31218146 markings, 120844157 edges, 106304 markings/sec, 285 secs
lola: 31750188 markings, 122902998 edges, 106408 markings/sec, 290 secs
lola: 32285315 markings, 124972827 edges, 107025 markings/sec, 295 secs
lola: 32821919 markings, 127048436 edges, 107321 markings/sec, 300 secs
lola: 33357713 markings, 129120835 edges, 107159 markings/sec, 305 secs
lola: 33893540 markings, 131192523 edges, 107165 markings/sec, 310 secs
lola: 34430349 markings, 133268507 edges, 107362 markings/sec, 315 secs
lola: 34969860 markings, 135355556 edges, 107902 markings/sec, 320 secs
lola: 35511983 markings, 137451719 edges, 108425 markings/sec, 325 secs
lola: 36052370 markings, 139539316 edges, 108077 markings/sec, 330 secs
lola: 36595022 markings, 141636719 edges, 108530 markings/sec, 335 secs
lola: 37136354 markings, 143728642 edges, 108266 markings/sec, 340 secs
lola: 37354072 markings, 144570692 edges, 43544 markings/sec, 345 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: unknown no yes no no yes yes yes no yes no no unknown no yes yes
lola: ========================================
FORMULA SwimmingPool-PT-08-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494936596827

--------------------
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="SwimmingPool-PT-08"
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/SwimmingPool-PT-08.tgz
mv SwimmingPool-PT-08 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is SwimmingPool-PT-08, 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 r078-ebro-149441008300174"
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 ;