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

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


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 CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ 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-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 235 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 235 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 294 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: 679968 markings, 3661777 edges, 2011911252955103232 markings/sec, 0 secs
lola: 1258433 markings, 7042454 edges, 115693 markings/sec, 5 secs
lola: 1818439 markings, 10333457 edges, 112001 markings/sec, 10 secs
lola: 2363164 markings, 13565685 edges, 108945 markings/sec, 15 secs
lola: 2871960 markings, 16625305 edges, 101759 markings/sec, 20 secs
lola: 3389592 markings, 19760216 edges, 103526 markings/sec, 25 secs
lola: 3905276 markings, 22885019 edges, 103137 markings/sec, 30 secs
lola: 4412204 markings, 25978049 edges, 101386 markings/sec, 35 secs
lola: 4912772 markings, 29036484 edges, 100114 markings/sec, 40 secs
lola: 5405007 markings, 32062852 edges, 98447 markings/sec, 45 secs
lola: 5895332 markings, 35076143 edges, 98065 markings/sec, 50 secs
lola: 6379696 markings, 38069015 edges, 96873 markings/sec, 55 secs
lola: 6857710 markings, 41027417 edges, 95603 markings/sec, 60 secs
lola: 7333119 markings, 43972264 edges, 95082 markings/sec, 65 secs
lola: 7770422 markings, 46679571 edges, 87461 markings/sec, 70 secs
lola: 8215384 markings, 49437550 edges, 88992 markings/sec, 75 secs
lola: 8676048 markings, 52297846 edges, 92133 markings/sec, 80 secs
lola: 9136466 markings, 55172409 edges, 92084 markings/sec, 85 secs
lola: 9595037 markings, 58035061 edges, 91714 markings/sec, 90 secs
lola: 10053782 markings, 60894328 edges, 91749 markings/sec, 95 secs
lola: 10508460 markings, 63740941 edges, 90936 markings/sec, 100 secs
lola: 10961744 markings, 66578171 edges, 90657 markings/sec, 105 secs
lola: 11412604 markings, 69404177 edges, 90172 markings/sec, 110 secs
lola: 11860732 markings, 72216620 edges, 89626 markings/sec, 115 secs
lola: 12308170 markings, 75024220 edges, 89488 markings/sec, 120 secs
lola: 12756207 markings, 77838366 edges, 89607 markings/sec, 125 secs
lola: 13205337 markings, 80656566 edges, 89826 markings/sec, 130 secs
lola: 13646570 markings, 83440497 edges, 88247 markings/sec, 135 secs
lola: 14089146 markings, 86235589 edges, 88515 markings/sec, 140 secs
lola: 14527507 markings, 89007855 edges, 87672 markings/sec, 145 secs
lola: 14967718 markings, 91788934 edges, 88042 markings/sec, 150 secs
lola: 15406084 markings, 94560922 edges, 87673 markings/sec, 155 secs
lola: 15843951 markings, 97321719 edges, 87573 markings/sec, 160 secs
lola: 16275834 markings, 100051039 edges, 86377 markings/sec, 165 secs
lola: 16706334 markings, 102768603 edges, 86100 markings/sec, 170 secs
lola: 17132132 markings, 105474044 edges, 85160 markings/sec, 175 secs
lola: 17560244 markings, 108190302 edges, 85622 markings/sec, 180 secs
lola: 17990050 markings, 110909412 edges, 85961 markings/sec, 185 secs
lola: 18419956 markings, 113633233 edges, 85981 markings/sec, 190 secs
lola: 18850019 markings, 116359390 edges, 86013 markings/sec, 195 secs
lola: 19279148 markings, 119074004 edges, 85826 markings/sec, 200 secs
lola: 19703374 markings, 121777019 edges, 84845 markings/sec, 205 secs
lola: 20127492 markings, 124478174 edges, 84824 markings/sec, 210 secs
lola: 20552156 markings, 127173687 edges, 84933 markings/sec, 215 secs
lola: 20974839 markings, 129862401 edges, 84537 markings/sec, 220 secs
lola: 21398880 markings, 132553600 edges, 84808 markings/sec, 225 secs
lola: 21819301 markings, 135230501 edges, 84084 markings/sec, 230 secs
lola: 22241255 markings, 137916909 edges, 84391 markings/sec, 235 secs
lola: 22660427 markings, 140593261 edges, 83834 markings/sec, 240 secs
lola: 23078503 markings, 143264194 edges, 83615 markings/sec, 245 secs
lola: 23497510 markings, 145935942 edges, 83801 markings/sec, 250 secs
lola: 23915879 markings, 148604164 edges, 83674 markings/sec, 255 secs
lola: 24332689 markings, 151268930 edges, 83362 markings/sec, 260 secs
lola: 24749464 markings, 153935108 edges, 83355 markings/sec, 265 secs
lola: 25164739 markings, 156594764 edges, 83055 markings/sec, 270 secs
lola: 25582070 markings, 159256574 edges, 83466 markings/sec, 275 secs
lola: 25996260 markings, 161908479 edges, 82838 markings/sec, 280 secs
lola: 26409968 markings, 164552422 edges, 82742 markings/sec, 285 secs
lola: 26821286 markings, 167195776 edges, 82264 markings/sec, 290 secs
lola: 27231543 markings, 169826958 edges, 82051 markings/sec, 295 secs
lola: 27640970 markings, 172456025 edges, 81885 markings/sec, 300 secs
lola: 28046858 markings, 175066921 edges, 81178 markings/sec, 305 secs
lola: 28455086 markings, 177687790 edges, 81646 markings/sec, 310 secs
lola: 28864602 markings, 180319140 edges, 81903 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
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: ========================================
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 1072 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(NOT(A (F (FIREABLE(RelK))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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 3217 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: RESULT
lola:
SUMMARY: yes yes yes no yes unknown no no yes unknown yes yes yes no no yes
lola: ========================================
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 1496564454215

--------------------
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="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/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 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 r158-ebro-149443464100184"
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 ;