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_DES-PT-20a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700265
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496452132689


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


checking for too many tokens
===========================================================================================
S_DES-PT-20a: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_DES-PT-20a @ 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: 347/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 152 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 177 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20a-CTLFireability.task
lola: E (F (E (F (FIREABLE(t49))))) : A (F (FIREABLE(t67))) : A (((FIREABLE(t110) OR FIREABLE(t35) OR NOT FIREABLE(t3) OR FIREABLE(t142)) U (((FIREABLE(t123) OR FIREABLE(t115)) AND (FIREABLE(t36) OR FIREABLE(t10))) AND E (G (FIREABLE(t13)))))) : A (G (NOT FIREABLE(t103))) : A (F ((A (F ((FIREABLE(t63) AND FIREABLE(t15)))) AND E (X ((FIREABLE(t112) AND FIREABLE(t111))))))) : NOT((A (F ((FIREABLE(t8) AND NOT FIREABLE(t125)))) AND (NOT(E (F (FIREABLE(t53)))) AND ((NOT FIREABLE(t97) OR NOT FIREABLE(t56)) OR A (G (FIREABLE(t122))))))) : A (G ((A (X ((FIREABLE(t72) OR FIREABLE(t54)))) OR A (F ((FIREABLE(t123) AND FIREABLE(t43))))))) : (E ((E (G (FIREABLE(t147))) U FIREABLE(t85))) OR NOT((A (G (NOT FIREABLE(t52))) OR A ((FIREABLE(t109) U FIREABLE(t82)))))) : NOT(A (F (A (F ((FIREABLE(t112) AND FIREABLE(t145))))))) : E (X ((E (F (FIREABLE(t142))) OR ((FIREABLE(t36) OR FIREABLE(t43)) AND (NOT FIREABLE(t43) OR FIREABLE(t151)))))) : (E (F (FIREABLE(t17))) AND A (F ((A (G (FIREABLE(t150))) OR E (G (FIREABLE(t53))))))) : (FIREABLE(t126) OR A (F (FIREABLE(t67)))) : A (F (A (G (A (F (FIREABLE(t28))))))) : (((E (F (NOT FIREABLE(t121))) AND A (G (NOT FIREABLE(t82)))) OR A (((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15)))) AND NOT((A ((FIREABLE(t71) U FIREABLE(t5))) OR FIREABLE(t100)))) : (E (G (NOT FIREABLE(t27))) OR (E (((FIREABLE(t47) OR FIREABLE(t118)) U (FIREABLE(t140) AND FIREABLE(t86)))) AND FIREABLE(t89))) : E (F (FIREABLE(t27)))
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 (F (E (F (FIREABLE(t49)))))
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 20 bytes per marking, with 24 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t67)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t67))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t110) OR FIREABLE(t35) OR NOT FIREABLE(t3) OR FIREABLE(t142)) U (((FIREABLE(t123) OR FIREABLE(t115)) AND (FIREABLE(t36) OR FIREABLE(t10))) AND E (G (FIREABLE(t13))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(t110) OR FIREABLE(t35) OR NOT FIREABLE(t3) OR FIREABLE(t142)) U (((FIREABLE(t123) OR FIREABLE(t115)) AND (FIREABLE(t36) OR FIREABLE(t10))) AND NOT(A(TRUE U NOT FIREABLE(t13)))))
lola: processed formula length: 194
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t103)))
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 20 bytes per marking, with 24 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((FIREABLE(t63) AND FIREABLE(t15)))) AND E (X ((FIREABLE(t112) AND FIREABLE(t111)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (FIREABLE(t63) AND FIREABLE(t15))) AND EX((FIREABLE(t112) AND FIREABLE(t111)))))
lola: processed formula length: 99
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((FIREABLE(t8) AND NOT FIREABLE(t125)))) AND (NOT(E (F (FIREABLE(t53)))) AND ((NOT FIREABLE(t97) OR NOT FIREABLE(t56)) OR A (G (FIREABLE(t122)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t8) OR FIREABLE(t125))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t8) AND NOT FIREABLE(t125))))
lola: processed formula length: 52
lola: 18 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t53)))
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 20 bytes per marking, with 24 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((FIREABLE(t72) OR FIREABLE(t54)))) OR A (F ((FIREABLE(t123) AND FIREABLE(t43)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(AX((FIREABLE(t72) OR FIREABLE(t54)))) AND NOT(A(TRUE U (FIREABLE(t123) AND FIREABLE(t43)))))))
lola: processed formula length: 113
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((E (G (FIREABLE(t147))) U FIREABLE(t85))) OR NOT((A (G (NOT FIREABLE(t52))) OR A ((FIREABLE(t109) U FIREABLE(t82))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G (FIREABLE(t147))) U FIREABLE(t85)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U NOT FIREABLE(t147))) U FIREABLE(t85))
lola: processed formula length: 52
lola: 11 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t52)))
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 20 bytes per marking, with 24 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 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t109) R NOT FIREABLE(t82)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(FIREABLE(t109) U FIREABLE(t82)))
lola: processed formula length: 38
lola: 11 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (F ((FIREABLE(t112) AND FIREABLE(t145)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t112) AND FIREABLE(t145))))
lola: processed formula length: 50
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((E (F (FIREABLE(t142))) OR ((FIREABLE(t36) OR FIREABLE(t43)) AND (NOT FIREABLE(t43) OR FIREABLE(t151))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t142)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U FIREABLE(t142)))
lola: processed formula length: 28
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 451734 markings, 3293309 edges, 90347 markings/sec, 0 secs
lola: 814764 markings, 6295767 edges, 72606 markings/sec, 5 secs
lola: 1200764 markings, 9432213 edges, 77200 markings/sec, 10 secs
lola: 1599767 markings, 12452260 edges, 79801 markings/sec, 15 secs
lola: 2021001 markings, 15335496 edges, 84247 markings/sec, 20 secs
lola: 2427566 markings, 18453171 edges, 81313 markings/sec, 25 secs
lola: 2788106 markings, 21405533 edges, 72108 markings/sec, 30 secs
lola: 3138993 markings, 24267935 edges, 70177 markings/sec, 35 secs
lola: 3516777 markings, 27184338 edges, 75557 markings/sec, 40 secs
lola: 3909942 markings, 30176822 edges, 78633 markings/sec, 45 secs
lola: 4257449 markings, 33021920 edges, 69501 markings/sec, 50 secs
lola: 4597491 markings, 35781522 edges, 68008 markings/sec, 55 secs
lola: 4961058 markings, 38586879 edges, 72713 markings/sec, 60 secs
lola: 5345051 markings, 41527317 edges, 76799 markings/sec, 65 secs
lola: 5684095 markings, 44314775 edges, 67809 markings/sec, 70 secs
lola: 6028216 markings, 47031487 edges, 68824 markings/sec, 75 secs
lola: 6358841 markings, 49710498 edges, 66125 markings/sec, 80 secs
lola: 6748218 markings, 52616399 edges, 77875 markings/sec, 85 secs
lola: 7073572 markings, 55358987 edges, 65071 markings/sec, 90 secs
lola: 7425069 markings, 58077603 edges, 70299 markings/sec, 95 secs
lola: 7733604 markings, 60699213 edges, 61707 markings/sec, 100 secs
lola: 8119431 markings, 63520619 edges, 77165 markings/sec, 105 secs
lola: 8457613 markings, 66232783 edges, 67636 markings/sec, 110 secs
lola: 8795585 markings, 68896983 edges, 67594 markings/sec, 115 secs
lola: 9088963 markings, 71449245 edges, 58676 markings/sec, 120 secs
lola: 9460016 markings, 74184354 edges, 74211 markings/sec, 125 secs
lola: 9814525 markings, 76876102 edges, 70902 markings/sec, 130 secs
lola: 10136716 markings, 79488401 edges, 64438 markings/sec, 135 secs
lola: 10450757 markings, 82042558 edges, 62808 markings/sec, 140 secs
lola: 10773810 markings, 84578558 edges, 64611 markings/sec, 145 secs
lola: 11134089 markings, 87283829 edges, 72056 markings/sec, 150 secs
lola: 11441076 markings, 89864547 edges, 61397 markings/sec, 155 secs
lola: 11771599 markings, 92421614 edges, 66105 markings/sec, 160 secs
lola: 12054056 markings, 94878125 edges, 56491 markings/sec, 165 secs
lola: 12405228 markings, 97476836 edges, 70234 markings/sec, 170 secs
lola: 12743786 markings, 100033618 edges, 67712 markings/sec, 175 secs
lola: 13050789 markings, 102544462 edges, 61401 markings/sec, 180 secs
lola: 13359194 markings, 104994040 edges, 61681 markings/sec, 185 secs
lola: 13643215 markings, 107394997 edges, 56804 markings/sec, 190 secs
lola: 13993469 markings, 109942222 edges, 70051 markings/sec, 195 secs
lola: 14296161 markings, 112390449 edges, 60538 markings/sec, 200 secs
lola: 14607475 markings, 114814886 edges, 62263 markings/sec, 205 secs
lola: 14887807 markings, 117179961 edges, 56066 markings/sec, 210 secs
lola: 15201313 markings, 119543396 edges, 62701 markings/sec, 215 secs
lola: 15526168 markings, 122007936 edges, 64971 markings/sec, 220 secs
lola: 15813573 markings, 124401304 edges, 57481 markings/sec, 225 secs
lola: 16117485 markings, 126777752 edges, 60782 markings/sec, 230 secs
lola: 16387716 markings, 129108757 edges, 54046 markings/sec, 235 secs
lola: 16706368 markings, 131461524 edges, 63730 markings/sec, 240 secs
lola: 17022261 markings, 133848568 edges, 63179 markings/sec, 245 secs
lola: 17300832 markings, 136186031 edges, 55714 markings/sec, 250 secs
lola: 17601563 markings, 138528248 edges, 60146 markings/sec, 255 secs
lola: 17865593 markings, 140817132 edges, 52806 markings/sec, 260 secs
lola: 18217071 markings, 143401780 edges, 70296 markings/sec, 265 secs
lola: 18602513 markings, 146350331 edges, 77088 markings/sec, 270 secs
lola: 18951179 markings, 149174195 edges, 69733 markings/sec, 275 secs
lola: 19281939 markings, 151918027 edges, 66152 markings/sec, 280 secs
lola: 19654471 markings, 154786189 edges, 74506 markings/sec, 285 secs
lola: 20046752 markings, 157759906 edges, 78456 markings/sec, 290 secs
lola: 20395843 markings, 160597965 edges, 69818 markings/sec, 295 secs
lola: 20730760 markings, 163353190 edges, 66983 markings/sec, 300 secs
lola: 21098727 markings, 166186450 edges, 73593 markings/sec, 305 secs
lola: 21491364 markings, 169171583 edges, 78527 markings/sec, 310 secs
lola: 21834696 markings, 171989607 edges, 68666 markings/sec, 315 secs
lola: 22174521 markings, 174727091 edges, 67965 markings/sec, 320 secs
lola: 22530778 markings, 177490352 edges, 71251 markings/sec, 325 secs
lola: 22920758 markings, 180477802 edges, 77996 markings/sec, 330 secs
lola: 23259311 markings, 183280625 edges, 67711 markings/sec, 335 secs
lola: 23611859 markings, 186043421 edges, 70510 markings/sec, 340 secs
lola: 23950169 markings, 188785151 edges, 67662 markings/sec, 345 secs
lola: 24352888 markings, 191808684 edges, 80544 markings/sec, 350 secs
lola: 24685616 markings, 194624077 edges, 66546 markings/sec, 355 secs
lola: 25046262 markings, 197410272 edges, 72129 markings/sec, 360 secs
lola: 25365515 markings, 200079749 edges, 63851 markings/sec, 365 secs
lola: 25760795 markings, 203075334 edges, 79056 markings/sec, 370 secs
lola: 26116591 markings, 205929945 edges, 71159 markings/sec, 375 secs
lola: 26454174 markings, 208709122 edges, 67517 markings/sec, 380 secs
lola: 26837237 markings, 211586266 edges, 76613 markings/sec, 385 secs
lola: 27195110 markings, 214614141 edges, 71575 markings/sec, 390 secs
lola: 27503668 markings, 217409428 edges, 61712 markings/sec, 395 secs
lola: 27796147 markings, 220089142 edges, 58496 markings/sec, 400 secs
lola: 28093180 markings, 222806530 edges, 59407 markings/sec, 405 secs
lola: 28324144 markings, 225413029 edges, 46193 markings/sec, 410 secs
lola: 28591476 markings, 228125036 edges, 53466 markings/sec, 415 secs
lola: 28844414 markings, 230596185 edges, 50588 markings/sec, 420 secs
lola: 29119861 markings, 233325944 edges, 55089 markings/sec, 425 secs
lola: 29383811 markings, 235887087 edges, 52790 markings/sec, 430 secs
lola: 29749617 markings, 238808105 edges, 73161 markings/sec, 435 secs
lola: 30078794 markings, 241752016 edges, 65835 markings/sec, 440 secs
lola: 30362289 markings, 244427442 edges, 56699 markings/sec, 445 secs
lola: 30648822 markings, 247028131 edges, 57307 markings/sec, 450 secs
lola: 31016705 markings, 250058714 edges, 73577 markings/sec, 455 secs
lola: 31413065 markings, 253127836 edges, 79272 markings/sec, 460 secs
lola: 31795630 markings, 256023906 edges, 76513 markings/sec, 465 secs
lola: 32195895 markings, 258929719 edges, 80053 markings/sec, 470 secs
lola: 32558114 markings, 261855821 edges, 72444 markings/sec, 475 secs
lola: 32905844 markings, 264780404 edges, 69546 markings/sec, 480 secs
lola: 33233344 markings, 267611018 edges, 65500 markings/sec, 485 secs
lola: 33525715 markings, 270296778 edges, 58474 markings/sec, 490 secs
lola: 33803017 markings, 273044322 edges, 55460 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t17))) AND A (F ((A (G (FIREABLE(t150))) OR E (G (FIREABLE(t53)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t17)))
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 20 bytes per marking, with 24 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: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G (FIREABLE(t150))) OR E (G (FIREABLE(t53))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U (NOT(E(TRUE U NOT FIREABLE(t150))) OR NOT(A(TRUE U NOT FIREABLE(t53)))))
lola: processed formula length: 81
lola: 5 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t126) OR A (F (FIREABLE(t67))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t126)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t126)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-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 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t67)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t67))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (A (F (FIREABLE(t28)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT(A(TRUE U FIREABLE(t28))))))
lola: processed formula length: 53
lola: 3 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F (NOT FIREABLE(t121))) AND A (G (NOT FIREABLE(t82)))) OR A (((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15)))) AND NOT((A ((FIREABLE(t71) U FIREABLE(t5))) OR FIREABLE(t100))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t121)))
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 20 bytes per marking, with 24 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 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t82)))
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 20 bytes per marking, with 24 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 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((FIREABLE(t124) AND FIREABLE(t122)) U FIREABLE(t15))
lola: processed formula length: 54
lola: 7 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (NOT FIREABLE(t27))) OR (E (((FIREABLE(t47) OR FIREABLE(t118)) U (FIREABLE(t140) AND FIREABLE(t86)))) AND FIREABLE(t89)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t27)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t27)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t27)))
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 20 bytes per marking, with 24 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: RESULT
lola:
SUMMARY: yes no no no no yes no yes yes unknown no no no no yes yes
lola: ========================================
FORMULA DES-PT-20a-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496452638463

--------------------
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_DES-PT-20a"
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_DES-PT-20a.tgz
mv S_DES-PT-20a 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_DES-PT-20a, 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 r098-ebro-149488455700265"
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 ;