fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r138-smll-149479231700207
Last Updated
June 27, 2017

About the Execution of LoLA for S_QuasiCertifProtocol-COL-10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2686.060 396958.00 488043.00 1216.00 FTTFTTTTTFFTFTTT normal

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-3254
Executing tool lola
Input is S_QuasiCertifProtocol-COL-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231700207
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-10-ReachabilityFireability-0
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-1
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-15
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-2
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-3
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-4
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-5
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-6
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-7
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-8
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1496366999737


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-COL-10: translating COL formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
ReachabilityFireability @ S_QuasiCertifProtocol-COL-10 @ 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16) AND NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12)))) : E (F ((FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164)))) : A (G ((FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR NOT FIREABLE(t82) OR (NOT FIREABLE(t81) AND NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72) AND NOT FIREABLE(t71) AND NOT FIREABLE(t152))))) : E (F ((NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t118) AND NOT FIREABLE(t117) AND NOT FIREABLE(t116) AND NOT FIREABLE(t59) AND (FIREABLE(t82) OR (FIREABLE(t175) AND (FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35)))) AND (FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153))))) : E (F (((FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138) OR FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130)) AND FIREABLE(t57) AND FIREABLE(t59) AND NOT FIREABLE(t175)))) : E (F (FIREABLE(t34))) : A (G ((((NOT FIREABLE(t115) AND NOT FIREABLE(t114) AND NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111) AND NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108) AND NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105)) OR (NOT FIREABLE(t163) AND NOT FIREABLE(t162) AND NOT FIREABLE(t161) AND NOT FIREABLE(t160) AND NOT FIREABLE(t159) AND NOT FIREABLE(t158) AND NOT FIREABLE(t157) AND NOT FIREABLE(t156) AND NOT FIREABLE(t155) AND NOT FIREABLE(t154) AND NOT FIREABLE(t153)) OR NOT FIREABLE(t128)) AND NOT FIREABLE(t128)))) : E (F (FIREABLE(t82))) : E (F ((FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23)))) : A (G (((NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)) OR (NOT FIREABLE(t81) AND NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72) AND NOT FIREABLE(t71)) OR ((FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46)) AND (FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35))) OR ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)) AND (FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153))) OR ((FIREABLE(t129) OR FIREABLE(t128)) AND (FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35))) OR FIREABLE(t0)))) : A (G ((NOT FIREABLE(t34) OR NOT FIREABLE(t128) OR FIREABLE(t152) OR (FIREABLE(t128) AND FIREABLE(t34) AND (FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))) OR NOT FIREABLE(t175)))) : A (G ((((FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164)) AND FIREABLE(t0) AND (FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35)) AND (FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120) OR FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117) OR FIREABLE(t116))) OR (FIREABLE(t127) AND FIREABLE(t175) AND (FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71))) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR (NOT FIREABLE(t140) AND NOT FIREABLE(t139) AND NOT FIREABLE(t138) AND NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132) AND NOT FIREABLE(t131) AND NOT FIREABLE(t130) AND NOT FIREABLE(t81) AND NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75) AND NOT FIREABLE(t74) AND NOT FIREABLE(t73) AND NOT FIREABLE(t72) AND NOT FIREABLE(t71))))) : A (G (((NOT FIREABLE(t163) AND NOT FIREABLE(t162) AND NOT FIREABLE(t161) AND NOT FIREABLE(t160) AND NOT FIREABLE(t159) AND NOT FIREABLE(t158) AND NOT FIREABLE(t157) AND NOT FIREABLE(t156) AND NOT FIREABLE(t155) AND NOT FIREABLE(t154) AND NOT FIREABLE(t153)) OR NOT FIREABLE(t129) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) AND NOT FIREABLE(t86) AND NOT FIREABLE(t85) AND NOT FIREABLE(t84) AND NOT FIREABLE(t83)) OR NOT FIREABLE(t58)))) : E (F ((NOT FIREABLE(t163) AND NOT FIREABLE(t162) AND NOT FIREABLE(t161) AND NOT FIREABLE(t160) AND NOT FIREABLE(t159) AND NOT FIREABLE(t158) AND NOT FIREABLE(t157) AND NOT FIREABLE(t156) AND NOT FIREABLE(t155) AND NOT FIREABLE(t154) AND NOT FIREABLE(t153) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT FIREABLE(t98) AND NOT FIREABLE(t97) AND NOT FIREABLE(t96) AND NOT FIREABLE(t95) AND NOT FIREABLE(t94) AND (FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12))))) : A (G ((NOT FIREABLE(t34) OR NOT FIREABLE(t57) OR ((FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153)) AND (FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105)) AND FIREABLE(t127)) OR ((FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)) AND FIREABLE(t175))))) : E (F (((FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t82) OR FIREABLE(t128) OR ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)) AND FIREABLE(t127))) AND (FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t22) AND NOT FIREABLE(t21) AND NOT FIREABLE(t20) AND NOT FIREABLE(t19) AND NOT FIREABLE(t18) AND NOT FIREABLE(t17) AND NOT FIREABLE(t16) AND NOT FIREABLE(t15) AND NOT FIREABLE(t14) AND NOT FIREABLE(t13) AND NOT FIREABLE(t12))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================state equation: calling and running sara

lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability.sara.
sara: 39: error near '': syntax error, unexpected $end, expecting NFILE
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
lola: sara not yet started (preprocessing) || 559302 markings, 2406394 edges, 111860 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1075740 markings, 4769735 edges, 103288 markings/sec, 5 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 1540422 markings, 7052104 edges, 92936 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 2075270 markings, 9440597 edges, 106970 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2539519 markings, 11652488 edges, 92850 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2947360 markings, 13779752 edges, 81568 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 3489824 markings, 16268031 edges, 108493 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 4025413 markings, 18677870 edges, 107118 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 4499314 markings, 20966952 edges, 94780 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 4992001 markings, 23224201 edges, 98537 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 5452237 markings, 25380987 edges, 92047 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 5872959 markings, 27499910 edges, 84144 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t118) AND NOT FIREABLE(t117) AND NOT FIREABLE(t116) AND NOT FIREABLE(t59) AND (FIREABLE(t82) OR (FIREABLE(t175) AND (FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 382581 markings, 2437060 edges, 76516 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 742316 markings, 4862938 edges, 71947 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1126772 markings, 7182294 edges, 76891 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1434666 markings, 9641842 edges, 61579 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1773545 markings, 11955767 edges, 67776 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2147643 markings, 14258843 edges, 74820 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2487447 markings, 16731488 edges, 67961 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2767224 markings, 19066174 edges, 55955 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3009987 markings, 21406598 edges, 48553 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3570014 markings, 24086120 edges, 112005 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 4111631 markings, 26559062 edges, 108323 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 4583678 markings, 28893673 edges, 94409 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 5110153 markings, 31229174 edges, 105295 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 5576385 markings, 33454795 edges, 93246 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 5995666 markings, 35637092 edges, 83856 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138) OR FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130)) AND FIREABLE(t57) AND FIREABLE(t59) AND NOT FIREABLE(t175))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 55 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t34)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running saralola:
The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t115) AND NOT FIREABLE(t114) AND NOT FIREABLE(t113) AND NOT FIREABLE(t112) AND NOT FIREABLE(t111) AND NOT FIREABLE(t110) AND NOT FIREABLE(t109) AND NOT FIREABLE(t108) AND NOT FIREABLE(t107) AND NOT FIREABLE(t106) AND NOT FIREABLE(t105)) OR (NOT FIREABLE(t163) AND NOT FIREABLE(t162) AND NOT FIREABLE(t161) AND NOT FIREABLE(t160) AND NOT FIREABLE(t159) AND NOT FIREABLE(t158) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t82)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-7.sara
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 132 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23)) OR (NOT FIREABLE(t81) AND NOT FIREABLE(t80) AND NOT FIREABLE(t79) AND NOT FIREABLE(t78) AND NOT FIREABLE(t77) AND NOT FIREABLE(t76) AND NOT FIREABLE(t75... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained

lola: sara not yet started (preprocessing) || 821631 markings, 2254610 edges, 164326 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1547594 markings, 4463968 edges, 145193 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 2193922 markings, 6608947 edges, 129266 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 2712599 markings, 8702162 edges, 103735 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 3105089 markings, 10905855 edges, 78498 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 3470881 markings, 13121141 edges, 73158 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 3791341 markings, 15342283 edges, 64092 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 4248360 markings, 17392484 edges, 91404 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 4557459 markings, 19649041 edges, 61820 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 4901278 markings, 21682795 edges, 68764 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 5173602 markings, 23884042 edges, 54465 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 5454557 markings, 26352148 edges, 56191 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 6085381 markings, 28570064 edges, 126165 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 6654136 markings, 30769902 edges, 113751 markings/sec, 65 secs
lola: sara not yet started (preprocessing) || 7302995 markings, 32936936 edges, 129772 markings/sec, 70 secs
lola: sara not yet started (preprocessing) || 7693986 markings, 35228949 edges, 78198 markings/sec, 75 secs
lola: sara not yet started (preprocessing) || 8129810 markings, 37629700 edges, 87165 markings/sec, 80 secs
lola: sara not yet started (preprocessing) || 8539417 markings, 39985607 edges, 81921 markings/sec, 85 secs
lola: sara not yet started (preprocessing) || 8919818 markings, 42297235 edges, 76080 markings/sec, 90 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t34) OR NOT FIREABLE(t128) OR FIREABLE(t152) OR (FIREABLE(t128) AND FIREABLE(t34) AND (FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 597904 markings, 2570473 edges, 119581 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 1136851 markings, 5044039 edges, 107789 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1629485 markings, 7408919 edges, 98527 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 2139181 markings, 9744251 edges, 101939 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 2603079 markings, 11970711 edges, 92780 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 3013467 markings, 14165654 edges, 82078 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164)) AND FIREABLE(t0) AND (FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t163) AND NOT FIREABLE(t162) AND NOT FIREABLE(t161) AND NOT FIREABLE(t160) AND NOT FIREABLE(t159) AND NOT FIREABLE(t158) AND NOT FIREABLE(t157) AND NOT FIREABLE(t156) AND NOT FIREABLE(t155) AND NOT FIREABLE(t154) AND NOT FIREABLE(t153)) OR NOT FIREABLE(t129) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 726 literals and 121 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1090 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t163) AND NOT FIREABLE(t162) AND NOT FIREABLE(t161) AND NOT FIREABLE(t160) AND NOT FIREABLE(t159) AND NOT FIREABLE(t158) AND NOT FIREABLE(t157) AND NOT FIREABLE(t156) AND NOT FIREABLE(t155) AND NOT FIREABLE(t154) AND NOT FIREABLE(t153) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(t99) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: sara not yet started (preprocessing) || 465732 markings, 2723886 edges, 93146 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 844435 markings, 5298053 edges, 75741 markings/sec, 5 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 1207393 markings, 7813264 edges, 72592 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1590196 markings, 10408765 edges, 76561 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1922482 markings, 12874446 edges, 66457 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2240699 markings, 15355654 edges, 63643 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2589971 markings, 17834016 edges, 69854 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2928740 markings, 20343402 edges, 67754 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 3243035 markings, 22753683 edges, 62859 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3539196 markings, 25083928 edges, 59232 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 3818885 markings, 27368979 edges, 55938 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 4082964 markings, 29626665 edges, 52816 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 4329047 markings, 31877007 edges, 49217 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1602 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t34) OR NOT FIREABLE(t57) OR ((FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153)) AND (FIREABLE(t115) OR FIREABLE(t114) OR FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 155666 literals and 8194 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 560511 markings, 2398373 edges, 112102 markings/sec, 0 secs
lola: sara is running 5 secs || 1076110 markings, 4751174 edges, 103120 markings/sec, 5 secs
lola: sara is running 10 secs || 1531428 markings, 7009913 edges, 91064 markings/sec, 10 secs
lola: sara is running 15 secs || 2072297 markings, 9406875 edges, 108174 markings/sec, 15 secs
lola: sara is running 20 secs || 2539849 markings, 11639237 edges, 93510 markings/sec, 20 secs
lola: sara is running 25 secs || 2951337 markings, 13782302 edges, 82298 markings/sec, 25 secs
lola: sara is running 30 secs || 3505660 markings, 16323910 edges, 110865 markings/sec, 30 secs
lola: sara is running 35 secs || 4050736 markings, 18779012 edges, 109015 markings/sec, 35 secs
lola: sara is running 40 secs || 4530127 markings, 21115326 edges, 95878 markings/sec, 40 secs
lola: sara is running 45 secs || 5041737 markings, 23427317 edges, 102322 markings/sec, 45 secs
lola: sara is running 50 secs || 5507368 markings, 25631305 edges, 93126 markings/sec, 50 secs
lola: sara is running 55 secs || 5926989 markings, 27771843 edges, 83924 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3143 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t82) OR FIREABLE(t128) OR ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: RESULT
lola:
SUMMARY: no yes yes no no yes no yes yes yes yes no yes yes yes yes
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496367396695

--------------------
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_QuasiCertifProtocol-COL-10"
export BK_EXAMINATION="ReachabilityFireability"
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_QuasiCertifProtocol-COL-10.tgz
mv S_QuasiCertifProtocol-COL-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_QuasiCertifProtocol-COL-10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-149479231700207"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;