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

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

=== Now, execution of the tool begins

BK_START 1494935874223


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ SwimmingPool-PT-10 @ 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-10-CTLCardinality.task
lola: A (G ((A (F ((2 <= Dressed))) OR ((Dress <= Bags) OR (Out <= Undress) OR (1 <= InBath))))) : A ((((Cabins <= 1)) U A (F ((1 <= WaitBag))))) : NOT((E (((Entered <= Undress) U (1 <= WaitBag))) OR NOT(A (G ((2 <= Cabins)))))) : E ((() U A (G ((3 <= Bags))))) : A ((A (X ((3 <= Out))) U (1 <= Dressed))) : E (G (A (((3 <= Entered) U (WaitBag <= Undress))))) : A (F (((Cabins + 1 <= WaitBag) OR (Bags + 1 <= Cabins) OR ((InBath <= 0) AND (InBath + 1 <= Undress))))) : E (F ((Out <= 0))) : E (F (A (G ((Undress + 1 <= Bags))))) : (E (F (((3 <= Bags) AND (1 <= Out) AND (Out <= InBath) AND (Dress <= Dressed)))) OR (((Entered + 1 <= InBath) AND (InBath + 1 <= Dressed) AND (Undress <= Cabins)) AND E (((3 <= Bags) U (Dress <= WaitBag))))) : A (F (E (F ((Out <= WaitBag))))) : NOT(((3 <= Dressed) OR (E (F ((1 <= Undress))) AND A (F ((1 <= Dressed)))))) : A (G (((Cabins <= Out) AND (InBath + 1 <= Out)))) : E ((((WaitBag + 1 <= Dressed) OR (WaitBag + 1 <= Dressed)) U E (G ((Dress <= Dressed))))) : (((Undress <= 0) AND A (G (TRUE))) AND (WaitBag <= Entered)) : A (F (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: A (G ((A (F ((2 <= Dressed))) OR ((Dress <= Bags) OR (Out <= Undress) OR (1 <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (2 <= Dressed))) AND ((Bags + 1 <= Dress) AND (Undress + 1 <= Out) AND (InBath <= 0)))))
lola: processed formula length: 115
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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: 858679 markings, 3557698 edges, 3108142075472773120 markings/sec, 0 secs
lola: 1635884 markings, 7021275 edges, 155441 markings/sec, 5 secs
lola: 2387392 markings, 10384516 edges, 150302 markings/sec, 10 secs
lola: 3111587 markings, 13678750 edges, 144839 markings/sec, 15 secs
lola: 3824773 markings, 16928188 edges, 142637 markings/sec, 20 secs
lola: 4452948 markings, 19808060 edges, 125635 markings/sec, 25 secs
lola: 5065733 markings, 22613734 edges, 122557 markings/sec, 30 secs
lola: 5673045 markings, 25405338 edges, 121462 markings/sec, 35 secs
lola: 6273891 markings, 28175492 edges, 120169 markings/sec, 40 secs
lola: 6872585 markings, 30947755 edges, 119739 markings/sec, 45 secs
lola: 7465724 markings, 33689142 edges, 118628 markings/sec, 50 secs
lola: 8053862 markings, 36414418 edges, 117628 markings/sec, 55 secs
lola: 8645350 markings, 39153981 edges, 118298 markings/sec, 60 secs
lola: 9237115 markings, 41892600 edges, 118353 markings/sec, 65 secs
lola: 9828029 markings, 44640951 edges, 118183 markings/sec, 70 secs
lola: 10404327 markings, 47346031 edges, 115260 markings/sec, 75 secs
lola: 10984874 markings, 50060898 edges, 116109 markings/sec, 80 secs
lola: 11558434 markings, 52744833 edges, 114712 markings/sec, 85 secs
lola: 12130153 markings, 55421281 edges, 114344 markings/sec, 90 secs
lola: 12701592 markings, 58084740 edges, 114288 markings/sec, 95 secs
lola: 13227877 markings, 60546685 edges, 105257 markings/sec, 100 secs
lola: 13745398 markings, 62978741 edges, 103504 markings/sec, 105 secs
lola: 14291594 markings, 65533795 edges, 109239 markings/sec, 110 secs
lola: 14857853 markings, 68177574 edges, 113252 markings/sec, 115 secs
lola: 15422972 markings, 70822861 edges, 113024 markings/sec, 120 secs
lola: 15972360 markings, 73404760 edges, 109878 markings/sec, 125 secs
lola: 16525414 markings, 76008943 edges, 110611 markings/sec, 130 secs
lola: 17081936 markings, 78639338 edges, 111304 markings/sec, 135 secs
lola: 17637968 markings, 81261609 edges, 111206 markings/sec, 140 secs
lola: 18192141 markings, 83879768 edges, 110835 markings/sec, 145 secs
lola: 18747637 markings, 86502343 edges, 111099 markings/sec, 150 secs
lola: 19299599 markings, 89111998 edges, 110392 markings/sec, 155 secs
lola: 19846230 markings, 91699829 edges, 109326 markings/sec, 160 secs
lola: 20398129 markings, 94302121 edges, 110380 markings/sec, 165 secs
lola: 20945364 markings, 96880075 edges, 109447 markings/sec, 170 secs
lola: 21485657 markings, 99444269 edges, 108059 markings/sec, 175 secs
lola: 22031228 markings, 102019684 edges, 109114 markings/sec, 180 secs
lola: 22570822 markings, 104583284 edges, 107919 markings/sec, 185 secs
lola: 23109352 markings, 107138621 edges, 107706 markings/sec, 190 secs
lola: 23651836 markings, 109705741 edges, 108497 markings/sec, 195 secs
lola: 24194289 markings, 112283795 edges, 108491 markings/sec, 200 secs
lola: 24689046 markings, 114624082 edges, 98951 markings/sec, 205 secs
lola: 25221630 markings, 117146931 edges, 106517 markings/sec, 210 secs
lola: 25708926 markings, 119453731 edges, 97459 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 ((((Cabins <= 1)) U A (F ((1 <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((Cabins <= 1)) U A(TRUE U (1 <= WaitBag)))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((Entered <= Undress) U (1 <= WaitBag))) OR NOT(A (G ((2 <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((Undress + 1 <= Entered) R (WaitBag <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((Entered <= Undress) U (1 <= WaitBag)))
lola: processed formula length: 45
lola: 14 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 3 will run for 255 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: 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: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((() U A (G ((3 <= Bags)))))
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 (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-10-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: 1391337 markings, 4463147 edges, 2731635209261809664 markings/sec, 0 secs
lola: 2066244 markings, 8054636 edges, 134981 markings/sec, 5 secs
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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((3 <= Out))) U (1 <= Dressed)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((3 <= Out)) U (1 <= Dressed))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= Entered) U (WaitBag <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= Entered) U (WaitBag <= Undress)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((Cabins + 1 <= WaitBag) OR (Bags + 1 <= Cabins) OR ((InBath <= 0) AND (InBath + 1 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((Cabins + 1 <= WaitBag) OR (Bags + 1 <= Cabins) OR ((InBath <= 0) AND (InBath + 1 <= Undress))))
lola: processed formula length: 108
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 7 will run for 367 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: lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Undress + 1 <= Bags)))))
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 (Bags <= Undress))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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: 798363 markings, 2817184 edges, 2287652688843767808 markings/sec, 0 secs
lola: 1540505 markings, 5474089 edges, 148428 markings/sec, 5 secs
lola: 2266114 markings, 8072023 edges, 145122 markings/sec, 10 secs
lola: 2989298 markings, 10665113 edges, 144637 markings/sec, 15 secs
lola: 3704263 markings, 13236015 edges, 142993 markings/sec, 20 secs
lola: 4426061 markings, 15826165 edges, 144360 markings/sec, 25 secs
lola: 5147902 markings, 18415918 edges, 144368 markings/sec, 30 secs
lola: 5873271 markings, 21008118 edges, 145074 markings/sec, 35 secs
lola: 6589448 markings, 23575341 edges, 143235 markings/sec, 40 secs
lola: 7315615 markings, 26170735 edges, 145233 markings/sec, 45 secs
lola: 8036250 markings, 28749778 edges, 144127 markings/sec, 50 secs
lola: 8754914 markings, 31325571 edges, 143733 markings/sec, 55 secs
lola: 9487605 markings, 33928226 edges, 146538 markings/sec, 60 secs
lola: 10218573 markings, 36527250 edges, 146194 markings/sec, 65 secs
lola: 10946213 markings, 39122583 edges, 145528 markings/sec, 70 secs
lola: 11663426 markings, 41688002 edges, 143443 markings/sec, 75 secs
lola: 12401254 markings, 44293073 edges, 147566 markings/sec, 80 secs
lola: 13130755 markings, 46880595 edges, 145900 markings/sec, 85 secs
lola: 13861316 markings, 49468637 edges, 146112 markings/sec, 90 secs
lola: 14578175 markings, 52028553 edges, 143372 markings/sec, 95 secs
lola: 15305041 markings, 54603542 edges, 145373 markings/sec, 100 secs
lola: 16040261 markings, 57186997 edges, 147044 markings/sec, 105 secs
lola: 16771477 markings, 59750032 edges, 146243 markings/sec, 110 secs
lola: 17499412 markings, 62294960 edges, 145587 markings/sec, 115 secs
lola: 18218570 markings, 64838097 edges, 143832 markings/sec, 120 secs
lola: 18961949 markings, 67437432 edges, 148676 markings/sec, 125 secs
lola: 19701579 markings, 70029821 edges, 147926 markings/sec, 130 secs
lola: 20447032 markings, 72634859 edges, 149091 markings/sec, 135 secs
lola: 21187415 markings, 75223775 edges, 148077 markings/sec, 140 secs
lola: 21947096 markings, 77847129 edges, 151936 markings/sec, 145 secs
lola: 22686678 markings, 80431662 edges, 147916 markings/sec, 150 secs
lola: 23446841 markings, 83057323 edges, 152033 markings/sec, 155 secs
lola: 24197178 markings, 85663367 edges, 150067 markings/sec, 160 secs
lola: 24969063 markings, 88300018 edges, 154377 markings/sec, 165 secs
lola: 25704764 markings, 90852671 edges, 147140 markings/sec, 170 secs
lola: 26451022 markings, 93412011 edges, 149252 markings/sec, 175 secs
lola: 27202021 markings, 95978835 edges, 150200 markings/sec, 180 secs
lola: 27962488 markings, 98568348 edges, 152093 markings/sec, 185 secs
lola: 28707252 markings, 101131901 edges, 148953 markings/sec, 190 secs
lola: 29497959 markings, 103772228 edges, 158141 markings/sec, 195 secs
lola: 30255066 markings, 106354379 edges, 151421 markings/sec, 200 secs
lola: 31005923 markings, 108923362 edges, 150171 markings/sec, 205 secs
lola: 31791999 markings, 111548743 edges, 157215 markings/sec, 210 secs
lola: 32584937 markings, 114239425 edges, 158588 markings/sec, 215 secs
lola: 33393213 markings, 116942709 edges, 161655 markings/sec, 220 secs
lola: 34179720 markings, 119575894 edges, 157301 markings/sec, 225 secs
lola: 34972890 markings, 122243540 edges, 158634 markings/sec, 230 secs
lola: 35789963 markings, 124966638 edges, 163415 markings/sec, 235 secs
lola: 36620620 markings, 127725890 edges, 166131 markings/sec, 240 secs
lola: 37459034 markings, 130501723 edges, 167683 markings/sec, 245 secs
lola: 38293616 markings, 133276463 edges, 166916 markings/sec, 250 secs
lola: 39105943 markings, 135956194 edges, 162465 markings/sec, 255 secs
lola: 39941610 markings, 138693834 edges, 167133 markings/sec, 260 secs
lola: 40766366 markings, 141415676 edges, 164951 markings/sec, 265 secs
lola: 41632288 markings, 144249462 edges, 173184 markings/sec, 270 secs
lola: 42498120 markings, 147086411 edges, 173166 markings/sec, 275 secs
lola: 43377413 markings, 149953906 edges, 175859 markings/sec, 280 secs
lola: 44272347 markings, 152849832 edges, 178987 markings/sec, 285 secs
lola: 45154109 markings, 155718093 edges, 176352 markings/sec, 290 secs
lola: 46049853 markings, 158612998 edges, 179149 markings/sec, 295 secs
lola: 46954640 markings, 161528682 edges, 180957 markings/sec, 300 secs
lola: 47860762 markings, 164443141 edges, 181224 markings/sec, 305 secs
lola: 48779676 markings, 167390895 edges, 183783 markings/sec, 310 secs
lola: 49694921 markings, 170331194 edges, 183049 markings/sec, 315 secs
lola: 50632741 markings, 173324902 edges, 187564 markings/sec, 320 secs
lola: 51484274 markings, 176489871 edges, 170307 markings/sec, 325 secs
lola: 51506580 markings, 179435649 edges, 4461 markings/sec, 330 secs
lola: 51516555 markings, 182183177 edges, 1995 markings/sec, 335 secs
lola: 51521804 markings, 184680368 edges, 1050 markings/sec, 340 secs
lola: 51524966 markings, 186951117 edges, 632 markings/sec, 345 secs
lola: 51527453 markings, 189192918 edges, 497 markings/sec, 350 secs
lola: 51529550 markings, 191532263 edges, 419 markings/sec, 355 secs
lola: 51531077 markings, 193765262 edges, 305 markings/sec, 360 secs
lola: 51532541 markings, 195946402 edges, 293 markings/sec, 365 secs
lola: 51533935 markings, 198122454 edges, 279 markings/sec, 370 secs
lola: 51535126 markings, 200252010 edges, 238 markings/sec, 375 secs
lola: 51536214 markings, 202386661 edges, 218 markings/sec, 380 secs
lola: 51537285 markings, 204545465 edges, 214 markings/sec, 385 secs
lola: 51538258 markings, 206709318 edges, 195 markings/sec, 390 secs
lola: 51539107 markings, 208923010 edges, 170 markings/sec, 395 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= Bags) AND (1 <= Out) AND (Out <= InBath) AND (Dress <= Dressed)))) OR (((Entered + 1 <= InBath) AND (InBath + 1 <= Dressed) AND (Undress <= Cabins)) AND E (((3 <= Bags) U (Dress <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Bags) AND (1 <= Out) AND (Out <= InBath) AND (Dress <= Dressed))))
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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 483 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (F (E (F ((Out <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Out <= WaitBag)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 11 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((3 <= Dressed) OR (E (F ((1 <= Undress))) AND A (F ((1 <= Dressed))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Dressed <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= 2)
lola: processed formula length: 14
lola: 9 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 12 will run for 725 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Undress <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: state equation: write sara problem file to SwimmingPool-PT-10-CTLCardinality-12.sara
subprocess 13 will run for 967 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((Dressed <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= Dressed)))
lola: processed formula length: 29
lola: 11 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 725 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((Cabins <= Out) AND (InBath + 1 <= Out))))
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: state equation: write sara problem file to SwimmingPool-PT-10-CTLCardinality-12.sara
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 13 will run for 967 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((WaitBag + 1 <= Dressed) OR (WaitBag + 1 <= Dressed)) U E (G ((Dress <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((WaitBag + 1 <= Dressed) OR (WaitBag + 1 <= Dressed)) U NOT(A(TRUE U (Dressed + 1 <= Dress))))
lola: processed formula length: 98
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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-10-CTLCardinality-12.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 14 will run for 1451 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Undress <= 0) AND A (G (TRUE))) AND (WaitBag <= Entered))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Undress <= 0) AND (WaitBag <= Entered))
lola: processed formula length: 41
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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 15 will run for 2902 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((Bags + 1 <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Bags + 1 <= Cabins)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-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: 1688827 markings, 3649632 edges, 2731980181035024384 markings/sec, 0 secs
lola: 3098977 markings, 6836264 edges, 282030 markings/sec, 5 secs
lola: 4414129 markings, 9852265 edges, 263030 markings/sec, 10 secs
lola: 5669968 markings, 12770014 edges, 251168 markings/sec, 15 secs
lola: 6906863 markings, 15645741 edges, 247379 markings/sec, 20 secs
lola: 8106785 markings, 18450022 edges, 239984 markings/sec, 25 secs
lola: 9265014 markings, 21166273 edges, 231646 markings/sec, 30 secs
lola: 10411641 markings, 23863321 edges, 229325 markings/sec, 35 secs
lola: 11554066 markings, 26561112 edges, 228485 markings/sec, 40 secs
lola: 12677961 markings, 29223271 edges, 224779 markings/sec, 45 secs
lola: 13785804 markings, 31852860 edges, 221569 markings/sec, 50 secs
lola: 14874681 markings, 34433746 edges, 217775 markings/sec, 55 secs
lola: 15962837 markings, 37028777 edges, 217631 markings/sec, 60 secs
lola: 17018636 markings, 39547032 edges, 211160 markings/sec, 65 secs
lola: 18087676 markings, 42099329 edges, 213808 markings/sec, 70 secs
lola: 19144414 markings, 44620080 edges, 211348 markings/sec, 75 secs
lola: 20216088 markings, 47183714 edges, 214335 markings/sec, 80 secs
lola: 21290054 markings, 49754827 edges, 214793 markings/sec, 85 secs
lola: 22351841 markings, 52295663 edges, 212357 markings/sec, 90 secs
lola: 23419672 markings, 54861911 edges, 213566 markings/sec, 95 secs
lola: 24471030 markings, 57387301 edges, 210272 markings/sec, 100 secs
lola: 25559482 markings, 60000890 edges, 217690 markings/sec, 105 secs
lola: 26645047 markings, 62610386 edges, 217113 markings/sec, 110 secs
lola: 27710470 markings, 65172907 edges, 213085 markings/sec, 115 secs
lola: 28769579 markings, 67722604 edges, 211822 markings/sec, 120 secs
lola: 29818735 markings, 70247696 edges, 209831 markings/sec, 125 secs
lola: 30872100 markings, 72793560 edges, 210673 markings/sec, 130 secs
lola: 31916519 markings, 75315575 edges, 208884 markings/sec, 135 secs
lola: 32936682 markings, 77777964 edges, 204033 markings/sec, 140 secs
lola: 33954566 markings, 80236122 edges, 203577 markings/sec, 145 secs
lola: 34989025 markings, 82735046 edges, 206892 markings/sec, 150 secs
lola: 36017009 markings, 85214795 edges, 205597 markings/sec, 155 secs
lola: 37030066 markings, 87665084 edges, 202611 markings/sec, 160 secs
lola: 38053024 markings, 90140350 edges, 204592 markings/sec, 165 secs
lola: 39068918 markings, 92599403 edges, 203179 markings/sec, 170 secs
lola: 40082937 markings, 95056964 edges, 202804 markings/sec, 175 secs
lola: 41097886 markings, 97519929 edges, 202990 markings/sec, 180 secs
lola: 42098022 markings, 99940855 edges, 200027 markings/sec, 185 secs
lola: 43117781 markings, 102410875 edges, 203952 markings/sec, 190 secs
lola: 44127357 markings, 104855547 edges, 201915 markings/sec, 195 secs
lola: 45140726 markings, 107314955 edges, 202674 markings/sec, 200 secs
lola: 46147859 markings, 109760194 edges, 201427 markings/sec, 205 secs
lola: 47138798 markings, 112164807 edges, 198188 markings/sec, 210 secs
lola: 48125957 markings, 114559494 edges, 197432 markings/sec, 215 secs
lola: 49127451 markings, 116998490 edges, 200299 markings/sec, 220 secs
lola: 50143800 markings, 119466062 edges, 203270 markings/sec, 225 secs
lola: 51150405 markings, 121913979 edges, 201321 markings/sec, 230 secs
lola: 52173244 markings, 124405187 edges, 204568 markings/sec, 235 secs
lola: 53197479 markings, 126893046 edges, 204847 markings/sec, 240 secs
lola: 54233087 markings, 129411734 edges, 207122 markings/sec, 245 secs
lola: 55252027 markings, 131892055 edges, 203788 markings/sec, 250 secs
lola: 56295304 markings, 134428444 edges, 208655 markings/sec, 255 secs
lola: 57340154 markings, 136971218 edges, 208970 markings/sec, 260 secs
lola: 58382834 markings, 139509180 edges, 208536 markings/sec, 265 secs
lola: 59428682 markings, 142057314 edges, 209170 markings/sec, 270 secs
lola: 60484426 markings, 144632584 edges, 211149 markings/sec, 275 secs
lola: 61536988 markings, 147195209 edges, 210512 markings/sec, 280 secs
lola: 62579836 markings, 149738344 edges, 208570 markings/sec, 285 secs
lola: 63642792 markings, 152331783 edges, 212591 markings/sec, 290 secs
lola: 64704104 markings, 154917919 edges, 212262 markings/sec, 295 secs
lola: 65757337 markings, 157486280 edges, 210647 markings/sec, 300 secs
lola: 66815053 markings, 160062101 edges, 211543 markings/sec, 305 secs
lola: 67882811 markings, 162664776 edges, 213552 markings/sec, 310 secs
lola: 68948542 markings, 165269744 edges, 213146 markings/sec, 315 secs
lola: 70020438 markings, 167886159 edges, 214379 markings/sec, 320 secs
lola: 71081167 markings, 170469701 edges, 212146 markings/sec, 325 secs
lola: 72115308 markings, 172990527 edges, 206828 markings/sec, 330 secs
lola: 73193049 markings, 175621495 edges, 215548 markings/sec, 335 secs
lola: 74265871 markings, 178237598 edges, 214564 markings/sec, 340 secs
lola: 75333266 markings, 180846581 edges, 213479 markings/sec, 345 secs
lola: 76388079 markings, 183422405 edges, 210963 markings/sec, 350 secs
lola: 77471255 markings, 186068068 edges, 216635 markings/sec, 355 secs
lola: 78545122 markings, 188690850 edges, 214773 markings/sec, 360 secs
lola: 79611016 markings, 191297230 edges, 213179 markings/sec, 365 secs
lola: 80665620 markings, 193868129 edges, 210921 markings/sec, 370 secs
lola: 81741522 markings, 196498393 edges, 215180 markings/sec, 375 secs
lola: 82800233 markings, 199085234 edges, 211742 markings/sec, 380 secs
lola: 83860900 markings, 201679209 edges, 212133 markings/sec, 385 secs
lola: 84898108 markings, 204214444 edges, 207442 markings/sec, 390 secs
lola: 85958300 markings, 206805529 edges, 212038 markings/sec, 395 secs
lola: 87013429 markings, 209386200 edges, 211026 markings/sec, 400 secs
lola: 88063257 markings, 211954862 edges, 209966 markings/sec, 405 secs
lola: 89129370 markings, 214564167 edges, 213223 markings/sec, 410 secs
lola: 90188372 markings, 217152817 edges, 211800 markings/sec, 415 secs
lola: 91218841 markings, 219669670 edges, 206094 markings/sec, 420 secs
lola: 92280850 markings, 222264052 edges, 212402 markings/sec, 425 secs
lola: 93351361 markings, 224883821 edges, 214102 markings/sec, 430 secs
lola: 94424602 markings, 227510402 edges, 214648 markings/sec, 435 secs
lola: 95465035 markings, 230054376 edges, 208087 markings/sec, 440 secs
lola: 96540219 markings, 232683110 edges, 215037 markings/sec, 445 secs
lola: 97617295 markings, 235317276 edges, 215415 markings/sec, 450 secs
lola: 98698834 markings, 237963670 edges, 216308 markings/sec, 455 secs
lola: 99768922 markings, 240579533 edges, 214018 markings/sec, 460 secs
lola: 100849370 markings, 243219639 edges, 216090 markings/sec, 465 secs
lola: 101920628 markings, 245841953 edges, 214252 markings/sec, 470 secs
lola: 102975487 markings, 248422764 edges, 210972 markings/sec, 475 secs
lola: 104025451 markings, 250991314 edges, 209993 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown yes no no no no yes yes no yes yes no no no yes unknown
FORMULA SwimmingPool-PT-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494937000679

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