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 DLCshifumi-PT-3b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309300472
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494644390493


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLFireability @ DLCshifumi-PT-3b @ 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: 16669/65536 symbol table entries, 5526 collisions
lola: preprocessing...
lola: finding significant places
lola: 7058 places, 9611 transitions, 6776 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12409 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-3b-CTLFireability.task
lola: E (X (A (F (E (X (FIREABLE(t6716))))))) : A (G (E (G (E (F (FIREABLE(t7998))))))) : A (X (E (F (A (X (FIREABLE(t5759))))))) : E (F (FIREABLE(t8762))) : ((A (F ((FIREABLE(t619) AND (FIREABLE(t928) OR FIREABLE(t3843))))) OR A (F (E (F (FIREABLE(t6892)))))) AND E (F (FIREABLE(t97)))) : A (X (E (G ((FIREABLE(t5) OR NOT FIREABLE(t3939)))))) : NOT(A ((A (F (FIREABLE(t3106))) U A (G (FIREABLE(t7415)))))) : (((FIREABLE(t8886) OR FIREABLE(t4814) OR (FIREABLE(t461) AND FIREABLE(t7275)) OR (FIREABLE(t9393) AND FIREABLE(t7703) AND FIREABLE(t8938)) OR (NOT FIREABLE(t8698) AND FIREABLE(t7538))) OR ((E (F (FIREABLE(t7624))) OR FIREABLE(t1563)) OR A (G (NOT FIREABLE(t9157))))) OR E (G (E (G ((FIREABLE(t5773) OR FIREABLE(t7670))))))) : NOT(NOT((E (F (FIREABLE(t7408))) AND NOT(E (X (FIREABLE(t7505))))))) : A (X (A (F ((FIREABLE(t4779) AND NOT FIREABLE(t8479)))))) : A (F (A ((NOT FIREABLE(t2627) U (FIREABLE(t5442) AND FIREABLE(t4082)))))) : NOT((FIREABLE(t8307) OR (E (F ((FIREABLE(t8028) AND FIREABLE(t7137)))) OR (A (F (FIREABLE(t4343))) OR FIREABLE(t8960))))) : A (F (FIREABLE(t776))) : (NOT(A (((FIREABLE(t526) OR FIREABLE(t276)) U NOT FIREABLE(t8324)))) OR E (X (E (F (FIREABLE(t2144)))))) : E (F (FIREABLE(t5794))) : E (F (E (((FIREABLE(t4564) OR FIREABLE(t8509)) U (FIREABLE(t8347) OR FIREABLE(t6553))))))
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 (X (A (F (E (X (FIREABLE(t6716)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U EX(FIREABLE(t6716))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G (E (F (FIREABLE(t7998)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U NOT(E(TRUE U FIREABLE(t7998))))))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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: 110187 markings, 126043 edges, 3689348869717491712 markings/sec, 0 secs
lola: 217321 markings, 250564 edges, 21427 markings/sec, 5 secs
lola: 324302 markings, 374789 edges, 21396 markings/sec, 10 secs
lola: 430836 markings, 498938 edges, 21307 markings/sec, 15 secs
lola: 540319 markings, 626222 edges, 21897 markings/sec, 20 secs
lola: 649203 markings, 752752 edges, 21777 markings/sec, 25 secs
lola: 757931 markings, 879026 edges, 21746 markings/sec, 30 secs
lola: 867076 markings, 1006148 edges, 21829 markings/sec, 35 secs
lola: 976056 markings, 1132956 edges, 21796 markings/sec, 40 secs
lola: 1085672 markings, 1259896 edges, 21923 markings/sec, 45 secs
lola: 1195121 markings, 1386549 edges, 21890 markings/sec, 50 secs
lola: 1304008 markings, 1512692 edges, 21777 markings/sec, 55 secs
lola: 1413417 markings, 1639655 edges, 21882 markings/sec, 60 secs
lola: 1523070 markings, 1766990 edges, 21931 markings/sec, 65 secs
lola: 1631425 markings, 1892397 edges, 21671 markings/sec, 70 secs
lola: 1737924 markings, 2015376 edges, 21300 markings/sec, 75 secs
lola: 1844303 markings, 2138751 edges, 21276 markings/sec, 80 secs
lola: 1950430 markings, 2261974 edges, 21225 markings/sec, 85 secs
lola: 2056774 markings, 2385603 edges, 21269 markings/sec, 90 secs
lola: 2164088 markings, 2510010 edges, 21463 markings/sec, 95 secs
lola: 2271622 markings, 2635275 edges, 21507 markings/sec, 100 secs
lola: 2379149 markings, 2760172 edges, 21505 markings/sec, 105 secs
lola: 2486023 markings, 2884179 edges, 21375 markings/sec, 110 secs
lola: 2593188 markings, 3008550 edges, 21433 markings/sec, 115 secs
lola: 2699954 markings, 3132777 edges, 21353 markings/sec, 120 secs
lola: 2806972 markings, 3257365 edges, 21404 markings/sec, 125 secs
lola: 2913718 markings, 3381297 edges, 21349 markings/sec, 130 secs
lola: 3020271 markings, 3504904 edges, 21311 markings/sec, 135 secs
lola: 3127113 markings, 3628875 edges, 21368 markings/sec, 140 secs
lola: 3234388 markings, 3753468 edges, 21455 markings/sec, 145 secs
lola: 3341635 markings, 3877740 edges, 21449 markings/sec, 150 secs
lola: 3448904 markings, 4002349 edges, 21454 markings/sec, 155 secs
lola: 3556185 markings, 4126870 edges, 21456 markings/sec, 160 secs
lola: 3663108 markings, 4251205 edges, 21385 markings/sec, 165 secs
lola: 3769613 markings, 4375076 edges, 21301 markings/sec, 170 secs
lola: 3876573 markings, 4499397 edges, 21392 markings/sec, 175 secs
lola: 3983192 markings, 4622977 edges, 21324 markings/sec, 180 secs
lola: 4090107 markings, 4747127 edges, 21383 markings/sec, 185 secs
lola: 4197429 markings, 4871684 edges, 21464 markings/sec, 190 secs
lola: 4305097 markings, 4996739 edges, 21534 markings/sec, 195 secs
lola: 4414916 markings, 5124165 edges, 21964 markings/sec, 200 secs
lola: 4523441 markings, 5249846 edges, 21705 markings/sec, 205 secs
lola: 4626708 markings, 5369528 edges, 20653 markings/sec, 210 secs
lola: 4730914 markings, 5490234 edges, 20841 markings/sec, 215 secs
lola: 4835277 markings, 5611419 edges, 20873 markings/sec, 220 secs
lola: 4939389 markings, 5732451 edges, 20822 markings/sec, 225 secs
lola: 5044082 markings, 5854015 edges, 20939 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (A (X (FIREABLE(t5759)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U AX(FIREABLE(t5759))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 80686 markings, 90478 edges, 3689348869717491712 markings/sec, 0 secs
lola: 161324 markings, 181241 edges, 16128 markings/sec, 5 secs
lola: 242355 markings, 272432 edges, 16206 markings/sec, 10 secs
lola: 322345 markings, 362433 edges, 15998 markings/sec, 15 secs
lola: 402222 markings, 452422 edges, 15975 markings/sec, 20 secs
lola: 482602 markings, 543032 edges, 16076 markings/sec, 25 secs
lola: 562944 markings, 633383 edges, 16068 markings/sec, 30 secs
lola: 643402 markings, 723920 edges, 16092 markings/sec, 35 secs
lola: 723850 markings, 814501 edges, 16090 markings/sec, 40 secs
lola: 804695 markings, 905443 edges, 16169 markings/sec, 45 secs
lola: 885233 markings, 996047 edges, 16108 markings/sec, 50 secs
lola: 966021 markings, 1086905 edges, 16158 markings/sec, 55 secs
lola: 1046810 markings, 1177837 edges, 16158 markings/sec, 60 secs
lola: 1127633 markings, 1268706 edges, 16165 markings/sec, 65 secs
lola: 1208397 markings, 1359572 edges, 16153 markings/sec, 70 secs
lola: 1289757 markings, 1451111 edges, 16272 markings/sec, 75 secs
lola: 1369105 markings, 1540338 edges, 15870 markings/sec, 80 secs
lola: 1450530 markings, 1631916 edges, 16285 markings/sec, 85 secs
lola: 1531944 markings, 1723530 edges, 16283 markings/sec, 90 secs
lola: 1613398 markings, 1815035 edges, 16291 markings/sec, 95 secs
lola: 1693966 markings, 1905699 edges, 16114 markings/sec, 100 secs
lola: 1774203 markings, 1995871 edges, 16047 markings/sec, 105 secs
lola: 1855159 markings, 2086782 edges, 16191 markings/sec, 110 secs
lola: 1935595 markings, 2177203 edges, 16087 markings/sec, 115 secs
lola: 2015578 markings, 2267302 edges, 15997 markings/sec, 120 secs
lola: 2095658 markings, 2357739 edges, 16016 markings/sec, 125 secs
lola: 2173413 markings, 2445423 edges, 15551 markings/sec, 130 secs
lola: 2253436 markings, 2535623 edges, 16005 markings/sec, 135 secs
lola: 2333248 markings, 2626041 edges, 15962 markings/sec, 140 secs
lola: 2413220 markings, 2716129 edges, 15994 markings/sec, 145 secs
lola: 2493052 markings, 2806347 edges, 15966 markings/sec, 150 secs
lola: 2572551 markings, 2896406 edges, 15900 markings/sec, 155 secs
lola: 2652178 markings, 2986239 edges, 15925 markings/sec, 160 secs
lola: 2731595 markings, 3076032 edges, 15883 markings/sec, 165 secs
lola: 2811235 markings, 3165932 edges, 15928 markings/sec, 170 secs
lola: 2891290 markings, 3255991 edges, 16011 markings/sec, 175 secs
lola: 2970792 markings, 3345769 edges, 15900 markings/sec, 180 secs
lola: 3050759 markings, 3435997 edges, 15993 markings/sec, 185 secs
lola: 3130437 markings, 3525857 edges, 15936 markings/sec, 190 secs
lola: 3210234 markings, 3615777 edges, 15959 markings/sec, 195 secs
lola: 3290042 markings, 3705765 edges, 15962 markings/sec, 200 secs
lola: 3369180 markings, 3795362 edges, 15828 markings/sec, 205 secs
lola: 3448712 markings, 3885206 edges, 15906 markings/sec, 210 secs
lola: 3528300 markings, 3975247 edges, 15918 markings/sec, 215 secs
lola: 3607275 markings, 4064473 edges, 15795 markings/sec, 220 secs
lola: 3686745 markings, 4154103 edges, 15894 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t8762)))
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 848 bytes per marking, with 8 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 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((FIREABLE(t619) AND (FIREABLE(t928) OR FIREABLE(t3843))))) OR A (F (E (F (FIREABLE(t6892)))))) AND E (F (FIREABLE(t97))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t619) AND (FIREABLE(t928) OR FIREABLE(t3843)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(t619) AND (FIREABLE(t928) OR FIREABLE(t3843))))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (FIREABLE(t6892)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U FIREABLE(t6892)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t97)))
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 848 bytes per marking, with 8 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((FIREABLE(t5) OR NOT FIREABLE(t3939))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (NOT FIREABLE(t5) AND FIREABLE(t3939)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 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 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((A (F (FIREABLE(t3106))) U A (G (FIREABLE(t7415))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(A(TRUE U FIREABLE(t3106)) U NOT(E(TRUE U NOT FIREABLE(t7415)))))
lola: processed formula length: 70
lola: 13 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((FIREABLE(t8886) OR FIREABLE(t4814) OR (FIREABLE(t461) AND FIREABLE(t7275)) OR (FIREABLE(t9393) AND FIREABLE(t7703) AND FIREABLE(t8938)) OR (NOT FIREABLE(t8698) AND FIREABLE(t7538))) OR ((E (F (FIREABLE(t7624))) OR FIREABLE(t1563)) OR A (G (NOT FIREABLE(t9157))))) OR E (G (E (G ((FIREABLE(t5773) OR FIREABLE(t7670)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t8886) OR FIREABLE(t4814) OR (FIREABLE(t461) AND FIREABLE(t7275)) OR (FIREABLE(t9393) AND FIREABLE(t7703) AND FIREABLE(t8938)) OR (NOT FIREABLE(t8698) AND FIREABLE(t7538)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t8886) OR FIREABLE(t4814) OR (FIREABLE(t461) AND FIREABLE(t7275)) OR (FIREABLE(t9393) AND FIREABLE(t7703) AND FIREABLE(t8938)) OR (NOT FIREABLE(t8698) AND FIREABLE(t7538)))
lola: processed formula length: 186
lola: 4 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-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 8 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7624)))
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 848 bytes per marking, with 8 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: SUBRESULT========================================

lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (F (FIREABLE(t7408))) AND NOT(E (X (FIREABLE(t7505)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7408)))
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 848 bytes per marking, with 8 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 9 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(t7505)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT FIREABLE(t7505))
lola: processed formula length: 23
lola: 18 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(t4779) AND NOT FIREABLE(t8479))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (FIREABLE(t4779) AND NOT FIREABLE(t8479))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 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 10 will run for 511 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A ((NOT FIREABLE(t2627) U (FIREABLE(t5442) AND FIREABLE(t4082))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A(NOT FIREABLE(t2627) U (FIREABLE(t5442) AND FIREABLE(t4082))))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 11 will run for 613 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((FIREABLE(t8307) OR (E (F ((FIREABLE(t8028) AND FIREABLE(t7137)))) OR (A (F (FIREABLE(t4343))) OR FIREABLE(t8960)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 613 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t8307)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t8307)
lola: processed formula length: 19
lola: 11 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-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: subprocess 12 will run for 766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t8028) OR NOT FIREABLE(t7137))))
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 848 bytes per marking, with 8 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 766 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t776)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t776))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 13 will run for 1022 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((FIREABLE(t526) OR FIREABLE(t276)) U NOT FIREABLE(t8324)))) OR E (X (E (F (FIREABLE(t2144))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1022 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(t526) AND NOT FIREABLE(t276)) R FIREABLE(t8324)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((FIREABLE(t526) OR FIREABLE(t276)) U NOT FIREABLE(t8324)))
lola: processed formula length: 65
lola: 7 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 1533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t2144)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U FIREABLE(t2144)))
lola: processed formula length: 29
lola: 6 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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 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: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5794)))
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 848 bytes per marking, with 8 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 15 will run for 3067 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (((FIREABLE(t4564) OR FIREABLE(t8509)) U (FIREABLE(t8347) OR FIREABLE(t6553))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E((FIREABLE(t4564) OR FIREABLE(t8509)) U (FIREABLE(t8347) OR FIREABLE(t6553))))
lola: processed formula length: 90
lola: 2 rewrites
lola: formula mentions 0 of 7058 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-3b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 848 bytes per marking, with 8 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: 115483 markings, 132104 edges, 3221684243226689536 markings/sec, 0 secs
lola: 230601 markings, 262695 edges, 23024 markings/sec, 5 secs
lola: 345089 markings, 392742 edges, 22898 markings/sec, 10 secs
lola: 459097 markings, 522330 edges, 22802 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: no unknown unknown yes yes yes yes yes yes no no no no yes yes yes
lola: ========================================
FORMULA DLCshifumi-PT-3b-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494644886824

--------------------
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="DLCshifumi-PT-3b"
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/DLCshifumi-PT-3b.tgz
mv DLCshifumi-PT-3b 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 DLCshifumi-PT-3b, 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 r018-ebro-149436309300472"
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 ;