fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r158-ebro-149443464100194
Last Updated
June 27, 2017

About the Execution of LoLA for S_SwimmingPool-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13813.520 506567.00 508423.00 105.10 TFFTFFFTFFFTFFF? normal

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 S_SwimmingPool-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100194
=====================================================================


--------------------
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 1496564739384


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


checking for too many tokens
===========================================================================================
S_SwimmingPool-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_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: 1661925 markings, 4247426 edges, 332385 markings/sec, 0 secs
lola: 2912923 markings, 8095487 edges, 250200 markings/sec, 5 secs
lola: 4088088 markings, 11776969 edges, 235033 markings/sec, 10 secs
lola: 5237136 markings, 15392397 edges, 229810 markings/sec, 15 secs
lola: 6328883 markings, 18935665 edges, 218349 markings/sec, 20 secs
lola: 7370624 markings, 22304995 edges, 208348 markings/sec, 25 secs
lola: 8312353 markings, 25397599 edges, 188346 markings/sec, 30 secs
lola: 9242782 markings, 28477375 edges, 186086 markings/sec, 35 secs
lola: 10184322 markings, 31567903 edges, 188308 markings/sec, 40 secs
lola: 11110001 markings, 34647549 edges, 185136 markings/sec, 45 secs
lola: 12022054 markings, 37683358 edges, 182411 markings/sec, 50 secs
lola: 12941386 markings, 40737918 edges, 183866 markings/sec, 55 secs
lola: 13860641 markings, 43804424 edges, 183851 markings/sec, 60 secs
lola: 14762427 markings, 46823318 edges, 180357 markings/sec, 65 secs
lola: 15644465 markings, 49822488 edges, 176408 markings/sec, 70 secs
lola: 16537106 markings, 52830268 edges, 178528 markings/sec, 75 secs
lola: 17425639 markings, 55836129 edges, 177707 markings/sec, 80 secs
lola: 18310421 markings, 58824270 edges, 176956 markings/sec, 85 secs
lola: 19197951 markings, 61843612 edges, 177506 markings/sec, 90 secs
lola: 20055404 markings, 64815175 edges, 171491 markings/sec, 95 secs
lola: 20917443 markings, 67777231 edges, 172408 markings/sec, 100 secs
lola: 21768690 markings, 70726600 edges, 170249 markings/sec, 105 secs
lola: 22615861 markings, 73643834 edges, 169434 markings/sec, 110 secs
lola: 23462546 markings, 76562250 edges, 169337 markings/sec, 115 secs
lola: 24304286 markings, 79469275 edges, 168348 markings/sec, 120 secs
lola: 25153702 markings, 82387518 edges, 169883 markings/sec, 125 secs
lola: 26003831 markings, 85294134 edges, 170026 markings/sec, 130 secs
lola: 26838346 markings, 88188584 edges, 166903 markings/sec, 135 secs
lola: 27671378 markings, 91074400 edges, 166606 markings/sec, 140 secs
lola: 28513436 markings, 93974197 edges, 168412 markings/sec, 145 secs
lola: 29340441 markings, 96847625 edges, 165401 markings/sec, 150 secs
lola: 30183674 markings, 99744479 edges, 168647 markings/sec, 155 secs
lola: 31011129 markings, 102624796 edges, 165491 markings/sec, 160 secs
lola: 31822619 markings, 105478179 edges, 162298 markings/sec, 165 secs
lola: 32641482 markings, 108350884 edges, 163773 markings/sec, 170 secs
lola: 33455778 markings, 111218999 edges, 162859 markings/sec, 175 secs
lola: 34267301 markings, 114081836 edges, 162305 markings/sec, 180 secs
lola: 35034994 markings, 116761318 edges, 153539 markings/sec, 185 secs
lola: 35733700 markings, 119243238 edges, 139741 markings/sec, 190 secs
lola: 36440702 markings, 121743153 edges, 141400 markings/sec, 195 secs
lola: 37150520 markings, 124245259 edges, 141964 markings/sec, 200 secs
lola: 37865168 markings, 126775470 edges, 142930 markings/sec, 205 secs
lola: 38577899 markings, 129295005 edges, 142546 markings/sec, 210 secs
lola: 39293788 markings, 131826345 edges, 143178 markings/sec, 215 secs
lola: 40021935 markings, 134391570 edges, 145629 markings/sec, 220 secs
lola: 40798082 markings, 137135448 edges, 155229 markings/sec, 225 secs
lola: 41577784 markings, 139874052 edges, 155940 markings/sec, 230 secs
lola: 42347409 markings, 142578447 edges, 153925 markings/sec, 235 secs
lola: 43120443 markings, 145302540 edges, 154607 markings/sec, 240 secs
lola: 43885987 markings, 148016800 edges, 153109 markings/sec, 245 secs
lola: 44649358 markings, 150726622 edges, 152674 markings/sec, 250 secs
lola: 45416609 markings, 153454589 edges, 153450 markings/sec, 255 secs
lola: 46185850 markings, 156181673 edges, 153848 markings/sec, 260 secs
lola: 46951508 markings, 158908134 edges, 153132 markings/sec, 265 secs
lola: 47726377 markings, 161634567 edges, 154974 markings/sec, 270 secs
lola: 48490170 markings, 164369136 edges, 152759 markings/sec, 275 secs
lola: 49257181 markings, 167087099 edges, 153402 markings/sec, 280 secs
lola: 50029729 markings, 169810677 edges, 154510 markings/sec, 285 secs
lola: 50796021 markings, 172529001 edges, 153258 markings/sec, 290 secs
lola: 51560133 markings, 175247589 edges, 152822 markings/sec, 295 secs
lola: 52317620 markings, 177928763 edges, 151497 markings/sec, 300 secs
lola: 53078576 markings, 180644316 edges, 152191 markings/sec, 305 secs
lola: 53842063 markings, 183380596 edges, 152697 markings/sec, 310 secs
lola: 54609486 markings, 186110636 edges, 153485 markings/sec, 315 secs
lola: 55383555 markings, 188860594 edges, 154814 markings/sec, 320 secs
lola: 56153196 markings, 191592683 edges, 153928 markings/sec, 325 secs
lola: 56923240 markings, 194321343 edges, 154009 markings/sec, 330 secs
lola: 57698078 markings, 197057781 edges, 154968 markings/sec, 335 secs
lola: 58469345 markings, 199779638 edges, 154253 markings/sec, 340 secs
lola: 59238119 markings, 202499120 edges, 153755 markings/sec, 345 secs
lola: 60016811 markings, 205241200 edges, 155738 markings/sec, 350 secs
lola: 60786063 markings, 207973702 edges, 153850 markings/sec, 355 secs
lola: 61561854 markings, 210712764 edges, 155158 markings/sec, 360 secs
lola: 62331169 markings, 213443956 edges, 153863 markings/sec, 365 secs
lola: 63097025 markings, 216171435 edges, 153171 markings/sec, 370 secs
lola: 63863409 markings, 218883515 edges, 153277 markings/sec, 375 secs
lola: 64628388 markings, 221596802 edges, 152996 markings/sec, 380 secs
lola: 65394073 markings, 224314359 edges, 153137 markings/sec, 385 secs
lola: 66119803 markings, 226898488 edges, 145146 markings/sec, 390 secs
lola: 66871435 markings, 229592723 edges, 150326 markings/sec, 395 secs
lola: 67629060 markings, 232311750 edges, 151525 markings/sec, 400 secs
lola: 68399521 markings, 235055110 edges, 154092 markings/sec, 405 secs
lola: 69177511 markings, 237815846 edges, 155598 markings/sec, 410 secs
lola: 69937479 markings, 240548791 edges, 151994 markings/sec, 415 secs
lola: 70703597 markings, 243265378 edges, 153224 markings/sec, 420 secs
lola: 71467592 markings, 245987177 edges, 152799 markings/sec, 425 secs
lola: 72222606 markings, 248688937 edges, 151003 markings/sec, 430 secs
lola: 72973217 markings, 251388028 edges, 150122 markings/sec, 435 secs
lola: 73723720 markings, 254080803 edges, 150101 markings/sec, 440 secs
lola: 74487051 markings, 256806453 edges, 152666 markings/sec, 445 secs
lola: 75246998 markings, 259518411 edges, 151989 markings/sec, 450 secs
lola: 76014894 markings, 262270967 edges, 153579 markings/sec, 455 secs
lola: 76777177 markings, 265004749 edges, 152457 markings/sec, 460 secs
lola: 77535250 markings, 267737423 edges, 151615 markings/sec, 465 secs
lola: 78293551 markings, 270457357 edges, 151660 markings/sec, 470 secs
lola: 79045274 markings, 273168597 edges, 150345 markings/sec, 475 secs
lola: 79801673 markings, 275889544 edges, 151280 markings/sec, 480 secs
lola: 80549822 markings, 278574526 edges, 149630 markings/sec, 485 secs
lola: 81304940 markings, 281295597 edges, 151024 markings/sec, 490 secs
lola: 82056264 markings, 284007328 edges, 150265 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 1496565245951

--------------------
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="S_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/S_SwimmingPool-PT-10.tgz
mv S_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 S_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 r158-ebro-149443464100194"
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 ;