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

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496564118958


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


checking for too many tokens
===========================================================================================
S_SwimmingPool-PT-09: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SwimmingPool-PT-09 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-09-CTLCardinality.task
lola: E ((((WaitBag <= Bags) AND (WaitBag <= 2)) U ((Cabins + 1 <= WaitBag) AND (3 <= WaitBag)))) : NOT(E (F (((Cabins <= 0) AND (3 <= InBath))))) : E ((((Undress <= 0)) U ((3 <= Dress)))) : NOT(E (G (A (F ((1 <= WaitBag)))))) : A (G ((((Bags + 1 <= Undress) OR (Dress + 1 <= Bags)) OR E (F ((Bags <= WaitBag)))))) : A (F (A (G (((3 <= Bags) OR (2 <= InBath)))))) : E (F (A (G ((Cabins + 1 <= WaitBag))))) : A (G ((E (G ((3 <= Bags))) AND ((Out <= Dress) OR (Bags <= Out) OR ((2 <= Entered) AND (Dress <= WaitBag)))))) : E (F (E (F ((Cabins + 1 <= Dressed))))) : (A (G (((Entered <= Bags) AND (1 <= Dressed)))) OR E ((((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag)))) : E ((A (G ((WaitBag <= Bags))) U (Bags <= Dress))) : ((A (((3 <= Bags) U (1 <= Undress))) OR ((Dressed <= WaitBag) AND ((3 <= Dressed) OR (2 <= WaitBag)))) OR A (G (((Undress <= 1) OR (InBath <= Dressed))))) : (NOT((E (X ((3 <= Entered))) OR ((Bags + 1 <= Undress) AND (Undress + 1 <= InBath)))) AND A (G (A (G ((3 <= Cabins)))))) : A (G (A (F ((3 <= Out))))) : (E ((((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath)))) OR ((((Out + 1 <= Dress)) OR E (F ((3 <= Cabins)))) AND E (X (((2 <= Cabins) AND (Cabins <= InBath)))))) : E (F ((Bags + 1 <= Cabins)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((WaitBag <= Bags) AND (WaitBag <= 2)) U ((Cabins + 1 <= WaitBag) AND (3 <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((WaitBag <= Bags) AND (WaitBag <= 2)) U ((Cabins + 1 <= WaitBag) AND (3 <= WaitBag)))
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((Cabins <= 0) AND (3 <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((Undress <= 0)) U ((3 <= Dress))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((Undress <= 0)) U ((3 <= Dress)))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((1 <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= WaitBag))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((Bags + 1 <= Undress) OR (Dress + 1 <= Bags)) OR E (F ((Bags <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((Undress <= Bags) AND (Bags <= Dress)) AND NOT(E(TRUE U (Bags <= WaitBag))))))
lola: processed formula length: 93
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2214369 markings, 3612077 edges, 3096159597753270272 markings/sec, 0 secs
lola: 4282676 markings, 7029923 edges, 413661 markings/sec, 5 secs
lola: 5361836 markings, 10744312 edges, 215832 markings/sec, 10 secs
lola: 5362545 markings, 14568204 edges, 142 markings/sec, 15 secs
lola: 5838477 markings, 18412276 edges, 95186 markings/sec, 20 secs
lola: 8034112 markings, 22057305 edges, 439127 markings/sec, 25 secs
lola: 9048845 markings, 24659381 edges, 202947 markings/sec, 30 secs
lola: 9049702 markings, 28176943 edges, 171 markings/sec, 35 secs
lola: 10129826 markings, 31690752 edges, 216025 markings/sec, 40 secs
lola: 11925056 markings, 34949001 edges, 359046 markings/sec, 45 secs
lola: 13583483 markings, 38158609 edges, 331685 markings/sec, 50 secs
lola: 15098681 markings, 41320511 edges, 303040 markings/sec, 55 secs
lola: 16515157 markings, 44450545 edges, 283295 markings/sec, 60 secs
lola: 17808682 markings, 47520836 edges, 258705 markings/sec, 65 secs
lola: 19060895 markings, 50567840 edges, 250443 markings/sec, 70 secs
lola: 20317455 markings, 53623611 edges, 251312 markings/sec, 75 secs
lola: 21516908 markings, 56623414 edges, 239891 markings/sec, 80 secs
lola: 22736804 markings, 59633967 edges, 243979 markings/sec, 85 secs
lola: 24015399 markings, 62658036 edges, 255719 markings/sec, 90 secs
lola: 25330905 markings, 65709001 edges, 263101 markings/sec, 95 secs
lola: 26633196 markings, 68764978 edges, 260458 markings/sec, 100 secs
lola: 28052417 markings, 71901973 edges, 283844 markings/sec, 105 secs
lola: 29441528 markings, 75037471 edges, 277822 markings/sec, 110 secs
lola: 30889784 markings, 78249441 edges, 289651 markings/sec, 115 secs
lola: 32381342 markings, 81532822 edges, 298312 markings/sec, 120 secs
lola: 33945325 markings, 84983303 edges, 312797 markings/sec, 125 secs
lola: 33970158 markings, 88017019 edges, 4967 markings/sec, 130 secs
lola: 33977772 markings, 90853219 edges, 1523 markings/sec, 135 secs
lola: 33981791 markings, 93636240 edges, 804 markings/sec, 140 secs
lola: 33984261 markings, 96400206 edges, 494 markings/sec, 145 secs
lola: 33986196 markings, 99150802 edges, 387 markings/sec, 150 secs
lola: 33987436 markings, 101854227 edges, 248 markings/sec, 155 secs
lola: 33987494 markings, 104553344 edges, 12 markings/sec, 160 secs
lola: 33987555 markings, 107030244 edges, 12 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= Bags) OR (2 <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U ((Bags <= 2) AND (InBath <= 1)))))
lola: processed formula length: 56
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2386639 markings, 3896440 edges, 2199487249458921472 markings/sec, 0 secs
lola: 4601242 markings, 7557700 edges, 442921 markings/sec, 5 secs
lola: 6745660 markings, 11109965 edges, 428884 markings/sec, 10 secs
lola: 8877984 markings, 14644824 edges, 426465 markings/sec, 15 secs
lola: 10998286 markings, 18161849 edges, 424060 markings/sec, 20 secs
lola: 13126038 markings, 21691764 edges, 425550 markings/sec, 25 secs
lola: 15251287 markings, 25216428 edges, 425050 markings/sec, 30 secs
lola: 17365123 markings, 28723734 edges, 422767 markings/sec, 35 secs
lola: 19471715 markings, 32220978 edges, 421318 markings/sec, 40 secs
lola: 21591476 markings, 35739870 edges, 423952 markings/sec, 45 secs
lola: 23709855 markings, 39258359 edges, 423676 markings/sec, 50 secs
lola: 25823284 markings, 42770609 edges, 422686 markings/sec, 55 secs
lola: 27948499 markings, 46306484 edges, 425043 markings/sec, 60 secs
lola: 30060116 markings, 49825393 edges, 422323 markings/sec, 65 secs
lola: 32182592 markings, 53370949 edges, 424495 markings/sec, 70 secs
lola: 33951914 markings, 57001373 edges, 353864 markings/sec, 75 secs
lola: 33969292 markings, 60030449 edges, 3476 markings/sec, 80 secs
lola: 33975818 markings, 62938930 edges, 1305 markings/sec, 85 secs
lola: 33979447 markings, 65813812 edges, 726 markings/sec, 90 secs
lola: 33981812 markings, 68662009 edges, 473 markings/sec, 95 secs
lola: 33983672 markings, 71484246 edges, 372 markings/sec, 100 secs
lola: 33985429 markings, 74303384 edges, 351 markings/sec, 105 secs
lola: 33986875 markings, 77129255 edges, 289 markings/sec, 110 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Cabins + 1 <= WaitBag)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (WaitBag <= Cabins))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 803913 markings, 2771165 edges, 3224733188970512384 markings/sec, 0 secs
lola: 1707205 markings, 5716393 edges, 180658 markings/sec, 5 secs
lola: 2631589 markings, 8680761 edges, 184877 markings/sec, 10 secs
lola: 3535549 markings, 11591965 edges, 180792 markings/sec, 15 secs
lola: 4433323 markings, 14481694 edges, 179555 markings/sec, 20 secs
lola: 5342056 markings, 17381727 edges, 181747 markings/sec, 25 secs
lola: 6229607 markings, 20232430 edges, 177510 markings/sec, 30 secs
lola: 7124803 markings, 23091599 edges, 179039 markings/sec, 35 secs
lola: 8019920 markings, 25948524 edges, 179023 markings/sec, 40 secs
lola: 8924097 markings, 28816760 edges, 180835 markings/sec, 45 secs
lola: 9797484 markings, 31622652 edges, 174677 markings/sec, 50 secs
lola: 10673668 markings, 34438140 edges, 175237 markings/sec, 55 secs
lola: 11568153 markings, 37280850 edges, 178897 markings/sec, 60 secs
lola: 12449806 markings, 40107673 edges, 176331 markings/sec, 65 secs
lola: 13343659 markings, 42953692 edges, 178771 markings/sec, 70 secs
lola: 14239446 markings, 45800194 edges, 179157 markings/sec, 75 secs
lola: 15107963 markings, 48595699 edges, 173703 markings/sec, 80 secs
lola: 15997628 markings, 51429800 edges, 177933 markings/sec, 85 secs
lola: 16878632 markings, 54240329 edges, 176201 markings/sec, 90 secs
lola: 17755691 markings, 57041042 edges, 175412 markings/sec, 95 secs
lola: 18633382 markings, 59850510 edges, 175538 markings/sec, 100 secs
lola: 19518854 markings, 62679443 edges, 177094 markings/sec, 105 secs
lola: 20409161 markings, 65519183 edges, 178061 markings/sec, 110 secs
lola: 21293223 markings, 68353015 edges, 176812 markings/sec, 115 secs
lola: 22179105 markings, 71184465 edges, 177176 markings/sec, 120 secs
lola: 23066574 markings, 74018878 edges, 177494 markings/sec, 125 secs
lola: 23964597 markings, 76874860 edges, 179605 markings/sec, 130 secs
lola: 24838944 markings, 79681038 edges, 174869 markings/sec, 135 secs
lola: 25730935 markings, 82522419 edges, 178398 markings/sec, 140 secs
lola: 26616012 markings, 85347609 edges, 177015 markings/sec, 145 secs
lola: 27504083 markings, 88179995 edges, 177614 markings/sec, 150 secs
lola: 28383431 markings, 90990937 edges, 175870 markings/sec, 155 secs
lola: 29273987 markings, 93820120 edges, 178111 markings/sec, 160 secs
lola: 30172992 markings, 96668036 edges, 179801 markings/sec, 165 secs
lola: 31072456 markings, 99515754 edges, 179893 markings/sec, 170 secs
lola: 32000743 markings, 102421522 edges, 185657 markings/sec, 175 secs
lola: 32936532 markings, 105339741 edges, 187158 markings/sec, 180 secs
lola: 33900602 markings, 108305517 edges, 192814 markings/sec, 185 secs
lola: 34897471 markings, 111329921 edges, 199374 markings/sec, 190 secs
lola: 35991098 markings, 114543467 edges, 218725 markings/sec, 195 secs
lola: 37307480 markings, 118242057 edges, 263276 markings/sec, 200 secs
lola: 37566784 markings, 121199158 edges, 51861 markings/sec, 205 secs
lola: 37803334 markings, 124043866 edges, 47310 markings/sec, 210 secs
lola: 38033849 markings, 126863887 edges, 46103 markings/sec, 215 secs
lola: 38262069 markings, 129681357 edges, 45644 markings/sec, 220 secs
lola: 38490388 markings, 132510030 edges, 45664 markings/sec, 225 secs
lola: 38717929 markings, 135336355 edges, 45508 markings/sec, 230 secs
lola: 38945360 markings, 138161671 edges, 45486 markings/sec, 235 secs
lola: 39172270 markings, 140980978 edges, 45382 markings/sec, 240 secs
lola: 39400664 markings, 143819836 edges, 45679 markings/sec, 245 secs
lola: 39631021 markings, 146693952 edges, 46071 markings/sec, 250 secs
lola: 39868225 markings, 149697401 edges, 47441 markings/sec, 255 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (G ((3 <= Bags))) AND ((Out <= Dress) OR (Bags <= Out) OR ((2 <= Entered) AND (Dress <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((3 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (Bags <= 2))))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 857553 markings, 2965643 edges, 171511 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: E (F (E (F ((Cabins + 1 <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-8.sara
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((Entered <= Bags) AND (1 <= Dressed)))) OR E ((((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Entered <= Bags) AND (1 <= Dressed))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running saralola:
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((Bags <= Out) AND (2 <= Out)) U (Cabins + 1 <= WaitBag))
lola: processed formula length: 59
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((WaitBag <= Bags))) U (Bags <= Dress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (Bags + 1 <= WaitBag))) U (Bags <= Dress))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= Bags) U (1 <= Undress))) OR ((Dressed <= WaitBag) AND ((3 <= Dressed) OR (2 <= WaitBag)))) OR A (G (((Undress <= 1) OR (InBath <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Bags) U (1 <= Undress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((3 <= Bags) U (1 <= Undress))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (X ((3 <= Entered))) OR ((Bags + 1 <= Undress) AND (Undress + 1 <= InBath)))) AND A (G (A (G ((3 <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Entered <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((Entered <= 2))
lola: processed formula length: 18
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 993 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Undress <= Bags) OR (InBath <= Undress))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Undress <= Bags) OR (InBath <= Undress))
lola: processed formula length: 43
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Cabins)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULT
state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-14.saralola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 993 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: state equation: calling and running sara
lola: ========================================
...considering subproblem: A (G (A (F ((3 <= Out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= Out)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-14.sara.
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath)))) OR ((((Out + 1 <= Dress)) OR E (F ((3 <= Cabins)))) AND E (X (((2 <= Cabins) AND (Cabins <= InBath))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: place or transition ordering is non-deterministic
lola: processed formula: E(((3 <= Dress) OR (InBath <= Dressed)) U ((1 <= Dress) OR (2 <= InBath)))
lola: processed formula length: 76
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 2980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Out + 1 <= Dress))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Out + 1 <= Dress))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================

lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= Cabins) AND (Cabins <= InBath))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= Cabins) AND (Cabins <= InBath)))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2980 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Bags + 1 <= Cabins)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-15.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no no yes yes no yes no no no yes
FORMULA SwimmingPool-PT-09-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496564678230

--------------------
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-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_SwimmingPool-PT-09.tgz
mv S_SwimmingPool-PT-09 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SwimmingPool-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r158-ebro-149443464100183"
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 ;