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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008400194
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494935957068


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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-LTLCardinality.task
lola: A ((Dressed <= WaitBag)) : A (G (X (G (G ((Undress <= InBath)))))) : A ((Bags <= Entered)) : A (G (X (G ((1 <= Undress))))) : A (G (G (G (G ((Entered <= Cabins)))))) : A (F ((F ((Dressed <= Dress)) U (WaitBag <= Bags)))) : A (F (G (((1 <= Dress) U (Cabins <= Dressed))))) : A ((F (F ((2 <= Undress))) U X (F ((Out <= Cabins))))) : A ((F (G ((Dressed <= Cabins))) U X (G ((WaitBag <= Undress))))) : A (X (G (X (F ((1 <= Undress)))))) : A (G (G (F (F ((WaitBag <= InBath)))))) : A (F (X (((Entered <= Undress) U (3 <= Bags))))) : A (X ((G ((WaitBag <= Entered)) U G ((1 <= InBath))))) : A (X (F (F ((3 <= Undress))))) : A (G (X ((1 <= Cabins)))) : A (X ((X ((3 <= Bags)) U (3 <= Out))))
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 ((Dressed <= WaitBag))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Dressed <= WaitBag)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (G ((Undress <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (G ((Undress <= InBath))))))
lola: processed formula: A (G (X (G (G ((Undress <= InBath))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Bags <= Entered))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Bags <= Entered)
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((1 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G ((1 <= Undress)))))
lola: processed formula: A (G (X (G ((1 <= Undress)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((Entered <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G (G ((Entered <= Cabins))))))
lola: processed formula: A (G (G (G (G ((Entered <= Cabins))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((Dressed <= Dress)) U (WaitBag <= Bags))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((Dressed <= Dress)) U (WaitBag <= Bags))))
lola: processed formula: A (F ((F ((Dressed <= Dress)) U (WaitBag <= Bags))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= Dress) U (Cabins <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((1 <= Dress) U (Cabins <= Dressed)))))
lola: processed formula: A (F (G (((1 <= Dress) U (Cabins <= Dressed)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= Undress))) U X (F ((Out <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= Undress)) U X (F ((Out <= Cabins)))))
lola: processed formula: A ((F ((2 <= Undress)) U X (F ((Out <= Cabins)))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((Dressed <= Cabins))) U X (G ((WaitBag <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((Dressed <= Cabins))) U X (G ((WaitBag <= Undress)))))
lola: processed formula: A ((F (G ((Dressed <= Cabins))) U X (G ((WaitBag <= Undress)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((1 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (X (F ((1 <= Undress))))))
lola: processed formula: A (X (G (X (F ((1 <= Undress))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1615610 markings, 4114274 edges, 323122 markings/sec, 0 secs
lola: 2855319 markings, 7911175 edges, 247942 markings/sec, 5 secs
lola: 4008452 markings, 11528728 edges, 230627 markings/sec, 10 secs
lola: 5149385 markings, 15112109 edges, 228187 markings/sec, 15 secs
lola: 6229098 markings, 18618556 edges, 215943 markings/sec, 20 secs
lola: 7309788 markings, 22101140 edges, 216138 markings/sec, 25 secs
lola: 8346558 markings, 25509825 edges, 207354 markings/sec, 30 secs
lola: 9355433 markings, 28847236 edges, 201775 markings/sec, 35 secs
lola: 10373182 markings, 32200978 edges, 203550 markings/sec, 40 secs
lola: 11373425 markings, 35517271 edges, 200049 markings/sec, 45 secs
lola: 12357888 markings, 38798043 edges, 196893 markings/sec, 50 secs
lola: 13343517 markings, 42068414 edges, 197126 markings/sec, 55 secs
lola: 14305912 markings, 45303875 edges, 192479 markings/sec, 60 secs
lola: 15262265 markings, 48508966 edges, 191271 markings/sec, 65 secs
lola: 16192136 markings, 51667084 edges, 185974 markings/sec, 70 secs
lola: 17133726 markings, 54840781 edges, 188318 markings/sec, 75 secs
lola: 18063629 markings, 57991351 edges, 185981 markings/sec, 80 secs
lola: 18997559 markings, 61154731 edges, 186786 markings/sec, 85 secs
lola: 19912658 markings, 64312475 edges, 183020 markings/sec, 90 secs
lola: 20829774 markings, 67472492 edges, 183423 markings/sec, 95 secs
lola: 21738771 markings, 70623361 edges, 181799 markings/sec, 100 secs
lola: 22649818 markings, 73762821 edges, 182209 markings/sec, 105 secs
lola: 23556354 markings, 76893804 edges, 181307 markings/sec, 110 secs
lola: 24471372 markings, 80041105 edges, 183004 markings/sec, 115 secs
lola: 25383202 markings, 83167546 edges, 182366 markings/sec, 120 secs
lola: 26290414 markings, 86286257 edges, 181442 markings/sec, 125 secs
lola: 27191972 markings, 89410109 edges, 180312 markings/sec, 130 secs
lola: 28098533 markings, 92539406 edges, 181312 markings/sec, 135 secs
lola: 28974313 markings, 95578071 edges, 175156 markings/sec, 140 secs
lola: 29777784 markings, 98345786 edges, 160694 markings/sec, 145 secs
lola: 30638613 markings, 101328170 edges, 172166 markings/sec, 150 secs
lola: 31517391 markings, 104409285 edges, 175756 markings/sec, 155 secs
lola: 32376495 markings, 107417228 edges, 171821 markings/sec, 160 secs
lola: 33241413 markings, 110464215 edges, 172984 markings/sec, 165 secs
lola: 34102221 markings, 113514122 edges, 172162 markings/sec, 170 secs
lola: 34913166 markings, 116333311 edges, 162189 markings/sec, 175 secs
lola: 35770581 markings, 119371654 edges, 171483 markings/sec, 180 secs
lola: 36629745 markings, 122411205 edges, 171833 markings/sec, 185 secs
lola: 37494246 markings, 125457011 edges, 172900 markings/sec, 190 secs
lola: 38355399 markings, 128502442 edges, 172231 markings/sec, 195 secs
lola: 39209493 markings, 131527396 edges, 170819 markings/sec, 200 secs
lola: 40065232 markings, 134543030 edges, 171148 markings/sec, 205 secs
lola: 40921559 markings, 137569307 edges, 171265 markings/sec, 210 secs
lola: 41777299 markings, 140578857 edges, 171148 markings/sec, 215 secs
lola: 42633428 markings, 143588851 edges, 171226 markings/sec, 220 secs
lola: 43478576 markings, 146585996 edges, 169030 markings/sec, 225 secs
lola: 44327359 markings, 149584431 edges, 169757 markings/sec, 230 secs
lola: 45171064 markings, 152571669 edges, 168741 markings/sec, 235 secs
lola: 45996994 markings, 155506412 edges, 165186 markings/sec, 240 secs
lola: 46836387 markings, 158493767 edges, 167879 markings/sec, 245 secs
lola: 47681438 markings, 161474552 edges, 169010 markings/sec, 250 secs
lola: 48515879 markings, 164461088 edges, 166888 markings/sec, 255 secs
lola: 49359903 markings, 167451466 edges, 168805 markings/sec, 260 secs
lola: 50205570 markings, 170439139 edges, 169133 markings/sec, 265 secs
lola: 51042480 markings, 173410606 edges, 167382 markings/sec, 270 secs
lola: 51881548 markings, 176382414 edges, 167814 markings/sec, 275 secs
lola: 52714880 markings, 179343520 edges, 166666 markings/sec, 280 secs
lola: 53539867 markings, 182296268 edges, 164997 markings/sec, 285 secs
lola: 54371897 markings, 185266046 edges, 166406 markings/sec, 290 secs
lola: 55208428 markings, 188237673 edges, 167306 markings/sec, 295 secs
lola: 56041477 markings, 191191711 edges, 166610 markings/sec, 300 secs
lola: 56865954 markings, 194116580 edges, 164895 markings/sec, 305 secs
lola: 57702187 markings, 197072136 edges, 167247 markings/sec, 310 secs
lola: 58537239 markings, 200012747 edges, 167010 markings/sec, 315 secs
lola: 59368424 markings, 202957033 edges, 166237 markings/sec, 320 secs
lola: 60202459 markings, 205909859 edges, 166807 markings/sec, 325 secs
lola: 61037267 markings, 208856905 edges, 166962 markings/sec, 330 secs
lola: 61868629 markings, 211808067 edges, 166272 markings/sec, 335 secs
lola: 62697384 markings, 214742652 edges, 165751 markings/sec, 340 secs
lola: 63523417 markings, 217679174 edges, 165207 markings/sec, 345 secs
lola: 64353481 markings, 220605698 edges, 166013 markings/sec, 350 secs
lola: 65173570 markings, 223529601 edges, 164018 markings/sec, 355 secs
lola: 65994868 markings, 226452213 edges, 164260 markings/sec, 360 secs
lola: 66803714 markings, 229354088 edges, 161769 markings/sec, 365 secs
lola: 67611289 markings, 232248452 edges, 161515 markings/sec, 370 secs
lola: 68428173 markings, 235157936 edges, 163377 markings/sec, 375 secs
lola: 69250325 markings, 238070981 edges, 164430 markings/sec, 380 secs
lola: 70056515 markings, 240963163 edges, 161238 markings/sec, 385 secs
lola: 70872078 markings, 243862067 edges, 163113 markings/sec, 390 secs
lola: 71688610 markings, 246778561 edges, 163306 markings/sec, 395 secs
lola: 72501092 markings, 249697509 edges, 162496 markings/sec, 400 secs
lola: 73312311 markings, 252604590 edges, 162244 markings/sec, 405 secs
lola: 74132635 markings, 255522727 edges, 164065 markings/sec, 410 secs
lola: 74943735 markings, 258431279 edges, 162220 markings/sec, 415 secs
lola: 75754412 markings, 261335730 edges, 162135 markings/sec, 420 secs
lola: 76562400 markings, 264236157 edges, 161598 markings/sec, 425 secs
lola: 77363026 markings, 267124496 edges, 160125 markings/sec, 430 secs
lola: 78173062 markings, 270023896 edges, 162007 markings/sec, 435 secs
lola: 78974319 markings, 272909497 edges, 160251 markings/sec, 440 secs
lola: 79780209 markings, 275811497 edges, 161178 markings/sec, 445 secs
lola: 80587221 markings, 278709179 edges, 161402 markings/sec, 450 secs
lola: 81389227 markings, 281598382 edges, 160401 markings/sec, 455 secs
lola: 82185739 markings, 284474250 edges, 159302 markings/sec, 460 secs
lola: 82978377 markings, 287336770 edges, 158528 markings/sec, 465 secs
lola: 83774078 markings, 290204137 edges, 159140 markings/sec, 470 secs
lola: 84574741 markings, 293095426 edges, 160133 markings/sec, 475 secs
lola: 85374957 markings, 295984422 edges, 160043 markings/sec, 480 secs
lola: 86174388 markings, 298851960 edges, 159886 markings/sec, 485 secs
lola: 86969455 markings, 301722949 edges, 159013 markings/sec, 490 secs
lola: 87772603 markings, 304614775 edges, 160630 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (F ((WaitBag <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F ((WaitBag <= InBath)))))
lola: processed formula: A (G (G (F ((WaitBag <= InBath)))))
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((Entered <= Undress) U (3 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((Entered <= Undress) U (3 <= Bags)))))
lola: processed formula: A (F (X (((Entered <= Undress) U (3 <= Bags)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((WaitBag <= Entered)) U G ((1 <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((WaitBag <= Entered)) U G ((1 <= InBath)))))
lola: processed formula: A (X ((G ((WaitBag <= Entered)) U G ((1 <= InBath)))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((3 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= Undress))))
lola: processed formula: A (X (F ((3 <= Undress))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((1 <= Cabins))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((1 <= Cabins))))
lola: processed formula: A (G (X ((1 <= Cabins))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= Bags)) U (3 <= Out))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= Bags)) U (3 <= Out))))
lola: processed formula: A (X ((X ((3 <= Bags)) U (3 <= Out))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no unknown no yes no no no yes
lola: ========================================
FORMULA SwimmingPool-PT-10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494936463438

--------------------
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="LTLCardinality"
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 LTLCardinality"
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-149441008400194"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;