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-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008400183
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494935319498


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SwimmingPool-PT-09 @ 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-09-CTLCardinality.task
lola: E ((((WaitBag <= Bags) AND (WaitBag <= 2)) U ((Cabins + 1 <= WaitBag) AND (3 <= WaitBag)))) : NOT(E (F (((Cabins <= 0) AND (3 <= InBath))))) : E ((((Undress <= 0)) U ((3 <= Dress)))) : NOT(E (G (A (F ((1 <= WaitBag)))))) : A (G ((((Bags + 1 <= Undress) OR (Dress + 1 <= Bags)) OR E (F ((Bags <= WaitBag)))))) : A (F (A (G (((3 <= Bags) OR (2 <= InBath)))))) : E (F (A (G ((Cabins + 1 <= WaitBag))))) : A (G ((E (G ((3 <= Bags))) AND ((Out <= Dress) OR (Bags <= Out) OR ((2 <= Entered) AND (Dress <= WaitBag)))))) : E (F (E (F ((Cabins + 1 <= Dressed))))) : (A (G (((Entered <= Bags) AND (1 <= Dressed)))) OR E ((((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag)))) : E ((A (G ((WaitBag <= Bags))) U (Bags <= Dress))) : ((A (((3 <= Bags) U (1 <= Undress))) OR ((Dressed <= WaitBag) AND ((3 <= Dressed) OR (2 <= WaitBag)))) OR A (G (((Undress <= 1) OR (InBath <= Dressed))))) : (NOT((E (X ((3 <= Entered))) OR ((Bags + 1 <= Undress) AND (Undress + 1 <= InBath)))) AND A (G (A (G ((3 <= Cabins)))))) : A (G (A (F ((3 <= Out))))) : (E ((((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath)))) OR ((((Out + 1 <= Dress)) OR E (F ((3 <= Cabins)))) AND E (X (((2 <= Cabins) AND (Cabins <= InBath)))))) : E (F ((Bags + 1 <= Cabins)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((WaitBag <= Bags) AND (WaitBag <= 2)) U ((Cabins + 1 <= WaitBag) AND (3 <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((WaitBag <= Bags) AND (WaitBag <= 2)) U ((Cabins + 1 <= WaitBag) AND (3 <= WaitBag)))
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((Cabins <= 0) AND (3 <= InBath)))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((Undress <= 0)) U ((3 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((Undress <= 0)) U ((3 <= Dress)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((1 <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= WaitBag))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((Bags + 1 <= Undress) OR (Dress + 1 <= Bags)) OR E (F ((Bags <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((Undress <= Bags) AND (Bags <= Dress)) AND NOT(E(TRUE U (Bags <= WaitBag))))))
lola: processed formula length: 93
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 2228997 markings, 3636157 edges, 3109001618687787008 markings/sec, 0 secs
lola: 4326341 markings, 7102243 edges, 419469 markings/sec, 5 secs
lola: 5361845 markings, 10789105 edges, 207101 markings/sec, 10 secs
lola: 5362539 markings, 14532158 edges, 139 markings/sec, 15 secs
lola: 5782081 markings, 18315075 edges, 83908 markings/sec, 20 secs
lola: 7950667 markings, 21919051 edges, 433717 markings/sec, 25 secs
lola: 9048812 markings, 24491898 edges, 219629 markings/sec, 30 secs
lola: 9049635 markings, 28016023 edges, 165 markings/sec, 35 secs
lola: 10045836 markings, 31550087 edges, 199240 markings/sec, 40 secs
lola: 11878016 markings, 34844467 edges, 366436 markings/sec, 45 secs
lola: 13535458 markings, 38066510 edges, 331488 markings/sec, 50 secs
lola: 15052773 markings, 41235250 edges, 303463 markings/sec, 55 secs
lola: 16468377 markings, 44365085 edges, 283121 markings/sec, 60 secs
lola: 17774573 markings, 47434848 edges, 261239 markings/sec, 65 secs
lola: 19018309 markings, 50477662 edges, 248747 markings/sec, 70 secs
lola: 20285178 markings, 53533357 edges, 253374 markings/sec, 75 secs
lola: 21452284 markings, 56514670 edges, 233421 markings/sec, 80 secs
lola: 22692368 markings, 59530370 edges, 248017 markings/sec, 85 secs
lola: 23976280 markings, 62549555 edges, 256782 markings/sec, 90 secs
lola: 25291523 markings, 65596385 edges, 263049 markings/sec, 95 secs
lola: 26602085 markings, 68652377 edges, 262112 markings/sec, 100 secs
lola: 27996078 markings, 71777691 edges, 278799 markings/sec, 105 secs
lola: 29383289 markings, 74909259 edges, 277442 markings/sec, 110 secs
lola: 30822220 markings, 78114304 edges, 287786 markings/sec, 115 secs
lola: 32329246 markings, 81412956 edges, 301405 markings/sec, 120 secs
lola: 33899102 markings, 84831506 edges, 313971 markings/sec, 125 secs
lola: 33969718 markings, 87867400 edges, 14123 markings/sec, 130 secs
lola: 33977450 markings, 90693047 edges, 1546 markings/sec, 135 secs
lola: 33981619 markings, 93458148 edges, 834 markings/sec, 140 secs
lola: 33984142 markings, 96200678 edges, 505 markings/sec, 145 secs
lola: 33986049 markings, 98925235 edges, 381 markings/sec, 150 secs
lola: 33987430 markings, 101625649 edges, 276 markings/sec, 155 secs
lola: 33987491 markings, 104319600 edges, 12 markings/sec, 160 secs
lola: 33987555 markings, 107030244 edges, 13 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= Bags) OR (2 <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((Bags <= 2) AND (InBath <= 1)))))
lola: processed formula length: 56
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 2370098 markings, 3869131 edges, 2287652688843767808 markings/sec, 0 secs
lola: 4592234 markings, 7542855 edges, 444427 markings/sec, 5 secs
lola: 6766003 markings, 11143572 edges, 434754 markings/sec, 10 secs
lola: 8926754 markings, 14725576 edges, 432150 markings/sec, 15 secs
lola: 11072413 markings, 18284534 edges, 429132 markings/sec, 20 secs
lola: 13213498 markings, 21836710 edges, 428217 markings/sec, 25 secs
lola: 15351539 markings, 25383028 edges, 427608 markings/sec, 30 secs
lola: 17475966 markings, 28907508 edges, 424885 markings/sec, 35 secs
lola: 19588054 markings, 32413939 edges, 422418 markings/sec, 40 secs
lola: 21709906 markings, 35936324 edges, 424370 markings/sec, 45 secs
lola: 23830520 markings, 39458970 edges, 424123 markings/sec, 50 secs
lola: 25956846 markings, 42992822 edges, 425265 markings/sec, 55 secs
lola: 28085865 markings, 46535534 edges, 425804 markings/sec, 60 secs
lola: 30208163 markings, 50072133 edges, 424460 markings/sec, 65 secs
lola: 32333716 markings, 53624061 edges, 425111 markings/sec, 70 secs
lola: 33954188 markings, 57226590 edges, 324094 markings/sec, 75 secs
lola: 33969869 markings, 60250007 edges, 3136 markings/sec, 80 secs
lola: 33976143 markings, 63151636 edges, 1255 markings/sec, 85 secs
lola: 33979636 markings, 66020527 edges, 699 markings/sec, 90 secs
lola: 33981959 markings, 68858065 edges, 465 markings/sec, 95 secs
lola: 33983825 markings, 71684587 edges, 373 markings/sec, 100 secs
lola: 33985532 markings, 74508007 edges, 341 markings/sec, 105 secs
lola: 33986953 markings, 77332235 edges, 284 markings/sec, 110 secs
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 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Cabins + 1 <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (WaitBag <= Cabins))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 822132 markings, 2835794 edges, 2199487249458921472 markings/sec, 0 secs
lola: 1728999 markings, 5791172 edges, 181373 markings/sec, 5 secs
lola: 2656297 markings, 8765754 edges, 185460 markings/sec, 10 secs
lola: 3569526 markings, 11700358 edges, 182646 markings/sec, 15 secs
lola: 4468503 markings, 14598333 edges, 179795 markings/sec, 20 secs
lola: 5386556 markings, 17522212 edges, 183611 markings/sec, 25 secs
lola: 6278660 markings, 20386829 edges, 178421 markings/sec, 30 secs
lola: 7173298 markings, 23251270 edges, 178928 markings/sec, 35 secs
lola: 8071090 markings, 26113242 edges, 179558 markings/sec, 40 secs
lola: 8975281 markings, 28983694 edges, 180838 markings/sec, 45 secs
lola: 9858595 markings, 31820130 edges, 176663 markings/sec, 50 secs
lola: 10745341 markings, 34659131 edges, 177349 markings/sec, 55 secs
lola: 11648158 markings, 37527947 edges, 180563 markings/sec, 60 secs
lola: 12519720 markings, 40336480 edges, 174312 markings/sec, 65 secs
lola: 13423340 markings, 43205366 edges, 180724 markings/sec, 70 secs
lola: 14317697 markings, 46051175 edges, 178871 markings/sec, 75 secs
lola: 15197258 markings, 48874176 edges, 175912 markings/sec, 80 secs
lola: 16086102 markings, 51709715 edges, 177769 markings/sec, 85 secs
lola: 16971397 markings, 54531071 edges, 177059 markings/sec, 90 secs
lola: 17844764 markings, 57327397 edges, 174673 markings/sec, 95 secs
lola: 18722652 markings, 60138573 edges, 175578 markings/sec, 100 secs
lola: 19602277 markings, 62951060 edges, 175925 markings/sec, 105 secs
lola: 20480039 markings, 65750891 edges, 175552 markings/sec, 110 secs
lola: 21359788 markings, 68562115 edges, 175950 markings/sec, 115 secs
lola: 22230246 markings, 71349314 edges, 174092 markings/sec, 120 secs
lola: 23106310 markings, 74147392 edges, 175213 markings/sec, 125 secs
lola: 23998631 markings, 76979577 edges, 178464 markings/sec, 130 secs
lola: 24870062 markings, 79778651 edges, 174286 markings/sec, 135 secs
lola: 25758961 markings, 82614931 edges, 177780 markings/sec, 140 secs
lola: 26647825 markings, 85449102 edges, 177773 markings/sec, 145 secs
lola: 27538725 markings, 88286588 edges, 178180 markings/sec, 150 secs
lola: 28414157 markings, 91085808 edges, 175086 markings/sec, 155 secs
lola: 29300192 markings, 93903800 edges, 177207 markings/sec, 160 secs
lola: 30195310 markings, 96742186 edges, 179024 markings/sec, 165 secs
lola: 31096466 markings, 99590646 edges, 180231 markings/sec, 170 secs
lola: 32023264 markings, 102487998 edges, 185360 markings/sec, 175 secs
lola: 32950305 markings, 105383082 edges, 185408 markings/sec, 180 secs
lola: 33909073 markings, 108332475 edges, 191754 markings/sec, 185 secs
lola: 34899882 markings, 111336459 edges, 198162 markings/sec, 190 secs
lola: 35984936 markings, 114526607 edges, 217011 markings/sec, 195 secs
lola: 37302246 markings, 118190420 edges, 263462 markings/sec, 200 secs
lola: 37561827 markings, 121140039 edges, 51916 markings/sec, 205 secs
lola: 37798127 markings, 123980605 edges, 47260 markings/sec, 210 secs
lola: 38027613 markings, 126787588 edges, 45897 markings/sec, 215 secs
lola: 38256403 markings, 129610694 edges, 45758 markings/sec, 220 secs
lola: 38485841 markings, 132454488 edges, 45888 markings/sec, 225 secs
lola: 38712251 markings, 135265158 edges, 45282 markings/sec, 230 secs
lola: 38937679 markings, 138065624 edges, 45086 markings/sec, 235 secs
lola: 39162980 markings, 140866189 edges, 45060 markings/sec, 240 secs
lola: 39389507 markings, 143682452 edges, 45305 markings/sec, 245 secs
lola: 39617914 markings, 146529657 edges, 45681 markings/sec, 250 secs
lola: 39852490 markings, 149489687 edges, 46915 markings/sec, 255 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((3 <= Bags))) AND ((Out <= Dress) OR (Bags <= Out) OR ((2 <= Entered) AND (Dress <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((3 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (Bags <= 2))))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 854205 markings, 2954033 edges, 170841 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((Cabins + 1 <= Dressed)))))
lola: 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: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((Entered <= Bags) AND (1 <= Dressed)))) OR E ((((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Entered <= Bags) AND (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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-9.sara
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E(((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag))
lola: processed formula length: 59
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((WaitBag <= Bags))) U (Bags <= Dress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (Bags + 1 <= WaitBag))) U (Bags <= Dress))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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).
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

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 596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= Bags) U (1 <= Undress))) OR ((Dressed <= WaitBag) AND ((3 <= Dressed) OR (2 <= WaitBag)))) OR A (G (((Undress <= 1) OR (InBath <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Bags) U (1 <= Undress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((3 <= Bags) U (1 <= Undress))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (X ((3 <= Entered))) OR ((Bags + 1 <= Undress) AND (Undress + 1 <= InBath)))) AND A (G (A (G ((3 <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Entered <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((Entered <= 2))
lola: processed formula length: 18
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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 13 will run for 993 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Undress <= Bags) OR (InBath <= Undress))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Undress <= Bags) OR (InBath <= Undress))
lola: processed formula length: 43
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULT
state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-14.saralola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: state equation: calling and running sara========================================

lola: subprocess 13 will run for 993 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= Out)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-14.sara.
lola: ...considering subproblem: (E ((((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath)))) OR ((((Out + 1 <= Dress)) OR E (F ((3 <= Cabins)))) AND E (X (((2 <= Cabins) AND (Cabins <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
sara: lola: place or transition ordering is non-deterministic
========================================
lola: ...considering subproblem: E ((((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath)))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: ========================================
lola: subprocess 15 will run for 2980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Out + 1 <= Dress))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Out + 1 <= Dress))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= Cabins) AND (Cabins <= InBath))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= Cabins) AND (Cabins <= InBath)))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 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 15 will run for 2980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Bags + 1 <= Cabins)))
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-09-CTLCardinality-15.sara
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no no yes yes no yes no no no yes
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA SwimmingPool-PT-09-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494935879092

--------------------
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-09"
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-09.tgz
mv SwimmingPool-PT-09 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-09, 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-149441008400183"
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 ;