Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is SwimmingPool-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008400184
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494935329110


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ SwimmingPool-PT-09 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-09-CTLFireability.task
lola: NOT((NOT((A (F (FIREABLE(RKey))) AND FIREABLE(Enter))) AND E (G (A (F (FIREABLE(RKey))))))) : E (F ((E (F (NOT FIREABLE(Enter))) AND (E (G (FIREABLE(RBag))) AND (FIREABLE(RKey) OR FIREABLE(GetB)))))) : A (F (FIREABLE(RBag))) : E (G (NOT FIREABLE(RelK))) : A (F (E ((FIREABLE(GetB) U FIREABLE(GetK2))))) : E (F ((E (F ((FIREABLE(RKey) OR FIREABLE(RelK)))) AND (A (G (FIREABLE(Enter))) AND (FIREABLE(GetK2) AND FIREABLE(GetB) AND NOT FIREABLE(RelK)))))) : NOT(A (F ((E (G (FIREABLE(RKey))) OR E (G (FIREABLE(GetB))))))) : (NOT(A (F (FIREABLE(RBag)))) AND E (G (A ((FIREABLE(Enter) U FIREABLE(RBag)))))) : A (F (FIREABLE(GetK2))) : A ((() U (A (F (FIREABLE(RelK))) OR FIREABLE(RBag)))) : (E ((E (F (FIREABLE(GetK))) U (FIREABLE(RBag) AND FIREABLE(Enter) AND FIREABLE(RBag)))) AND (((((FIREABLE(RelK) OR FIREABLE(GetK2)) AND NOT FIREABLE(RKey)) OR E (F (FIREABLE(RKey)))) OR FIREABLE(RBag)) AND ((A (G (FIREABLE(Enter))) OR FIREABLE(RKey)) OR ((NOT FIREABLE(RBag)) OR (NOT FIREABLE(RelK) AND NOT FIREABLE(Enter)))))) : E (G (A (F (FIREABLE(RBag))))) : (A (F (NOT(A (G (FIREABLE(Enter)))))) OR ((NOT(E (G (FIREABLE(RBag)))) OR FIREABLE(GetK2)) AND E (((FIREABLE(RBag) AND FIREABLE(RKey)) U (FIREABLE(RelK) OR FIREABLE(GetB)))))) : NOT(NOT(NOT(A (F (FIREABLE(RelK)))))) : E (F (A (G (FIREABLE(RBag))))) : NOT(NOT(A (F (A (F (FIREABLE(RelK)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT((A (F (FIREABLE(RKey))) AND FIREABLE(Enter))) AND E (G (A (F (FIREABLE(RKey)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(RKey)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(RKey))
lola: processed formula length: 24
lola: 17 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Enter)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Enter)
lola: processed formula length: 15
lola: 16 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: processed formula with 0 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F (NOT FIREABLE(Enter))) AND (E (G (FIREABLE(RBag))) AND (FIREABLE(RKey) OR FIREABLE(GetB))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U NOT FIREABLE(Enter)) AND (NOT(A(TRUE U NOT FIREABLE(RBag))) AND (FIREABLE(RKey) OR FIREABLE(GetB)))))
lola: processed formula length: 121
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(RBag))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(RelK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(RelK)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E ((FIREABLE(GetB) U FIREABLE(GetK2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(FIREABLE(GetB) U FIREABLE(GetK2)))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((FIREABLE(RKey) OR FIREABLE(RelK)))) AND (A (G (FIREABLE(Enter))) AND (FIREABLE(GetK2) AND FIREABLE(GetB) AND NOT FIREABLE(RelK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (FIREABLE(RKey) OR FIREABLE(RelK))) AND (NOT(E(TRUE U NOT FIREABLE(Enter))) AND (FIREABLE(GetK2) AND FIREABLE(GetB) AND NOT FIREABLE(RelK)))))
lola: processed formula length: 162
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 671820 markings, 3613178 edges, 2561584191154159616 markings/sec, 0 secs
lola: 1233171 markings, 6894510 edges, 112270 markings/sec, 5 secs
lola: 1788783 markings, 10157187 edges, 111122 markings/sec, 10 secs
lola: 2333961 markings, 13390325 edges, 109036 markings/sec, 15 secs
lola: 2841196 markings, 16440189 edges, 101447 markings/sec, 20 secs
lola: 3331881 markings, 19404791 edges, 98137 markings/sec, 25 secs
lola: 3820043 markings, 22366145 edges, 97632 markings/sec, 30 secs
lola: 4301059 markings, 25302100 edges, 96203 markings/sec, 35 secs
lola: 4785608 markings, 28256290 edges, 96910 markings/sec, 40 secs
lola: 5257421 markings, 31151694 edges, 94363 markings/sec, 45 secs
lola: 5727407 markings, 34043984 edges, 93997 markings/sec, 50 secs
lola: 6192145 markings, 36920800 edges, 92948 markings/sec, 55 secs
lola: 6658973 markings, 39795604 edges, 93366 markings/sec, 60 secs
lola: 7120269 markings, 42654423 edges, 92259 markings/sec, 65 secs
lola: 7577135 markings, 45477946 edges, 91373 markings/sec, 70 secs
lola: 8018562 markings, 48218739 edges, 88285 markings/sec, 75 secs
lola: 8450802 markings, 50896465 edges, 86448 markings/sec, 80 secs
lola: 8878434 markings, 53558314 edges, 85526 markings/sec, 85 secs
lola: 9302047 markings, 56202192 edges, 84723 markings/sec, 90 secs
lola: 9724985 markings, 58846985 edges, 84588 markings/sec, 95 secs
lola: 10150461 markings, 61499873 edges, 85095 markings/sec, 100 secs
lola: 10575108 markings, 64154312 edges, 84929 markings/sec, 105 secs
lola: 10995965 markings, 66793467 edges, 84171 markings/sec, 110 secs
lola: 11423058 markings, 69469633 edges, 85419 markings/sec, 115 secs
lola: 11848378 markings, 72140227 edges, 85064 markings/sec, 120 secs
lola: 12275268 markings, 74819589 edges, 85378 markings/sec, 125 secs
lola: 12702037 markings, 77495110 edges, 85354 markings/sec, 130 secs
lola: 13126297 markings, 80162292 edges, 84852 markings/sec, 135 secs
lola: 13549578 markings, 82826519 edges, 84656 markings/sec, 140 secs
lola: 13961093 markings, 85429858 edges, 82303 markings/sec, 145 secs
lola: 14377309 markings, 88055835 edges, 83243 markings/sec, 150 secs
lola: 14788798 markings, 90657660 edges, 82298 markings/sec, 155 secs
lola: 15201234 markings, 93262511 edges, 82487 markings/sec, 160 secs
lola: 15612420 markings, 95861754 edges, 82237 markings/sec, 165 secs
lola: 16022647 markings, 98453590 edges, 82045 markings/sec, 170 secs
lola: 16431822 markings, 101032518 edges, 81835 markings/sec, 175 secs
lola: 16838121 markings, 103605463 edges, 81260 markings/sec, 180 secs
lola: 17241561 markings, 106166814 edges, 80688 markings/sec, 185 secs
lola: 17646570 markings, 108736920 edges, 81002 markings/sec, 190 secs
lola: 18050234 markings, 111290911 edges, 80733 markings/sec, 195 secs
lola: 18455932 markings, 113861185 edges, 81140 markings/sec, 200 secs
lola: 18864352 markings, 116450220 edges, 81684 markings/sec, 205 secs
lola: 19275077 markings, 119048943 edges, 82145 markings/sec, 210 secs
lola: 19675463 markings, 121597385 edges, 80077 markings/sec, 215 secs
lola: 20073204 markings, 124133486 edges, 79548 markings/sec, 220 secs
lola: 20472450 markings, 126667073 edges, 79849 markings/sec, 225 secs
lola: 20865042 markings, 129163392 edges, 78518 markings/sec, 230 secs
lola: 21252847 markings, 131625717 edges, 77561 markings/sec, 235 secs
lola: 21651134 markings, 134159968 edges, 79657 markings/sec, 240 secs
lola: 22048731 markings, 136693453 edges, 79519 markings/sec, 245 secs
lola: 22446552 markings, 139228111 edges, 79564 markings/sec, 250 secs
lola: 22843534 markings, 141760155 edges, 79396 markings/sec, 255 secs
lola: 23238866 markings, 144286261 edges, 79066 markings/sec, 260 secs
lola: 23633484 markings, 146803883 edges, 78924 markings/sec, 265 secs
lola: 24028037 markings, 149320299 edges, 78911 markings/sec, 270 secs
lola: 24422326 markings, 151843826 edges, 78858 markings/sec, 275 secs
lola: 24811936 markings, 154334703 edges, 77922 markings/sec, 280 secs
lola: 25193405 markings, 156779474 edges, 76294 markings/sec, 285 secs
lola: 25580033 markings, 159243463 edges, 77326 markings/sec, 290 secs
lola: 25964393 markings, 161702209 edges, 76872 markings/sec, 295 secs
lola: 26349317 markings, 164163124 edges, 76985 markings/sec, 300 secs
lola: 26731661 markings, 166618150 edges, 76469 markings/sec, 305 secs
lola: 27113369 markings, 169067557 edges, 76342 markings/sec, 310 secs
lola: 27493834 markings, 171511861 edges, 76093 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((E (G (FIREABLE(RKey))) OR E (G (FIREABLE(GetB)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U NOT FIREABLE(RKey))) OR NOT(A(TRUE U NOT FIREABLE(GetB))))))
lola: processed formula length: 87
lola: 13 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 3 significant temporal operators and needs 13 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (FIREABLE(RBag)))) AND E (G (A ((FIREABLE(Enter) U FIREABLE(RBag))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(RBag)))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: lola: result: no
lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(GetK2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(GetK2))
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((() U (A (F (FIREABLE(RelK))) OR FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking CTL*
lola: check not yet implemented
lola: SUBRESULT
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((E (F (FIREABLE(GetK))) U (FIREABLE(RBag) AND FIREABLE(Enter) AND FIREABLE(RBag)))) AND (((((FIREABLE(RelK) OR FIREABLE(GetK2)) AND NOT FIREABLE(RKey)) OR E (F (FIREABLE(RKey)))) OR FIREABLE(RBag)) AND ((A (G (FIREABLE(Enter))) OR FIREABLE(RKey)) OR ((NOT FIREABLE(RBag)) OR (NOT FIREABLE(RelK) AND NOT FIREABLE(Enter))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F (FIREABLE(GetK))) U (FIREABLE(RBag) AND FIREABLE(Enter) AND FIREABLE(RBag))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U FIREABLE(GetK)) U (FIREABLE(RBag) AND FIREABLE(Enter) AND FIREABLE(RBag)))
lola: processed formula length: 85
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(RelK) OR FIREABLE(GetK2)) AND NOT FIREABLE(RKey))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(RelK) OR FIREABLE(GetK2)) AND NOT FIREABLE(RKey))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: processed formula with 0 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 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(RKey)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(Enter)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(RKey) OR ((NOT FIREABLE(RBag)) OR (NOT FIREABLE(RelK) AND NOT FIREABLE(Enter))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(RKey) OR ((NOT FIREABLE(RBag)) OR (NOT FIREABLE(RelK) AND NOT FIREABLE(Enter))))
lola: processed formula length: 91
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: processed formula with 0 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (FIREABLE(RBag)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U FIREABLE(RBag)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (NOT(A (G (FIREABLE(Enter)))))) OR ((NOT(E (G (FIREABLE(RBag)))) OR FIREABLE(GetK2)) AND E (((FIREABLE(RBag) AND FIREABLE(RKey)) U (FIREABLE(RelK) OR FIREABLE(GetB))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (NOT FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U NOT FIREABLE(Enter)))
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-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(A (F (FIREABLE(RelK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(RelK)))
lola: processed formula length: 29
lola: 11 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(RBag)))))
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 NOT FIREABLE(RBag))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (F (A (F (FIREABLE(RelK)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(RelK))
lola: processed formula length: 24
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLFireability.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: RESULT
lola:
SUMMARY: yes yes yes no yes unknown no no yes unknown yes yes yes no no yes
FORMULA SwimmingPool-PT-09-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494935651186

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test

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