fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r136-qhx2-152673578700028
Last Updated
June 26, 2018

About the Execution of LoLA for QuasiCertifProtocol-COL-10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
545.670 3600000.00 301648.00 9717.20 TTFTTTFFTTFTFTFT 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)
........................
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 72K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700028
=====================================================================

--------------------
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-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-09
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

=== Now, execution of the tool begins

BK_START 1526909292209

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-10 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityFireability @ QuasiCertifProtocol-COL-10 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 17600
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: E (F (((NOT FIREABLE(t36) AND (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(t36) OR FIREABLE(t83)) AND (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(t152))) OR FIREABLE(t128)))) : E (F (FIREABLE(t128))) : A (G (((NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63) AND NOT FIREABLE(t62) AND NOT FIREABLE(t61) AND 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)) OR NOT FIREABLE(t128)))) : E (F ((FIREABLE(t127) OR 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)))) : E (F ((FIREABLE(t82) 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)))) : E (F (FIREABLE(t22))) : A (G ((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(t152) OR FIREABLE(t94) 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)))) : A (G ((NOT FIREABLE(t164) OR FIREABLE(t83) 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(t152)))) : A (G ((FIREABLE(t94) 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(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) OR FIREABLE(t11) 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)) OR NOT FIREABLE(t129) OR NOT FIREABLE(t22) OR FIREABLE(t34) 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)))) : A (G (())) : E (F ((FIREABLE(t83) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38)) AND FIREABLE(t35) AND (FIREABLE(t94) 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)) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38))))) : A (G (((NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)) OR NOT FIREABLE(t129)))) : A (G ((FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR (NOT FIREABLE(t105) 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 FIREABLE(t49)) OR (NOT FIREABLE(t82) 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))))) : E (F ((((FIREABLE(t23) OR FIREABLE(t36) 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 (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR 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(t116) OR 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(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) OR FIREABLE(t11)) AND (FIREABLE(t34) 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(t163)) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR 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(t83) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0))))))) : A (G ((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(t152)))) : E (F ((NOT FIREABLE(t82) 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(t105) 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 (FIREABLE(t116) OR 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)) AND NOT FIREABLE(t23))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.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: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t22)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t22)))
lola: processed formula length: 21
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t22)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t128)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t128)))
lola: processed formula length: 22
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(t128)
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t127) OR 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))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t127) OR 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))))
lola: processed formula length: 214
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t127) OR 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))
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t82) 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))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t82) 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))))
lola: processed formula length: 203
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t82) 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))
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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(t152))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((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(t152))))
lola: processed formula length: 214
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (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(t152))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-4-0.sara.
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)) OR NOT FIREABLE(t129))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)) OR NOT FIREABLE(t129))))
lola: processed formula length: 262
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((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) OR FIREABLE(t0)) AND FIREABLE(t129))
lola: state equation: Generated DNF with 33 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-6-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-6-0.sara.
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t164) OR FIREABLE(t83) 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(t152))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((NOT FIREABLE(t164) OR FIREABLE(t83) 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(t152))))
lola: processed formula length: 255
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(t164) AND NOT FIREABLE(t83) 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(t152))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((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(t152) OR FIREABLE(t94) 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 FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((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(t152) OR FIREABLE(t94) 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 FIRE... (shortened)
lola: processed formula length: 412
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: (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(t152) AND NOT FIREABLE(t94) AND 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))
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63) AND NOT FIREABLE(t62) AND NOT FIREABLE(t61) AND 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((NOT FIREABLE(t71) AND NOT FIREABLE(t70) AND NOT FIREABLE(t69) AND NOT FIREABLE(t68) AND NOT FIREABLE(t67) AND NOT FIREABLE(t66) AND NOT FIREABLE(t65) AND NOT FIREABLE(t64) AND NOT FIREABLE(t63) AND NOT FIREABLE(t62) AND NOT FIREABLE(t61) AND 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... (shortened)
lola: processed formula length: 525
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR 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(t128))
lola: state equation: Generated DNF with 308 literals and 22 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-9-0.sara
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t83) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38)) AND FIREABLE(t35) AND (FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(t83) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38)) AND FIREABLE(t35) AND (FIREABLE(t94) OR FIREABLE(t93) OR FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86... (shortened)
lola: processed formula length: 641
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(t83) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38)) AND FIREABLE(t35) AND (FIREABLE(t94) 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)) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t36) AND (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(t36) OR FIREABLE(t83)) AND (FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((NOT FIREABLE(t36) AND (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(t36) OR FIREABLE(t83)) AND (FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREAB... (shortened)
lola: processed formula length: 508
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((NOT FIREABLE(t36) AND (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(t36) OR FIREABLE(t83)) AND (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(t152))) OR FIREABLE(t128))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR (NOT FIREABLE(t105) 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 N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR (NOT FIREABLE(t105) 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 N... (shortened)
lola: processed formula length: 726
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t151) AND NOT FIREABLE(t150) AND NOT FIREABLE(t149) AND NOT FIREABLE(t148) AND NOT FIREABLE(t147) AND NOT FIREABLE(t146) AND NOT FIREABLE(t145) AND NOT FIREABLE(t144) AND NOT FIREABLE(t143) AND NOT FIREABLE(t142) AND NOT FIREABLE(t141) AND (FIREABLE(t105) OR 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 NOT FIREABLE(t49)) AND (FIREABLE(t82) 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)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t82) 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(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((NOT FIREABLE(t82) 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(t105) AND NOT FIREABLE(t104) AND NOT FIREABLE(t103) AND NOT FIREABLE(t102) AND NOT FIREABLE(t101) AND NOT FIREABLE(t100) AND NOT FIREABLE(... (shortened)
lola: processed formula length: 728
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (NOT FIREABLE(t82) 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(t105) 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 (FIREABLE(t116) OR 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)) AND NOT FIREABLE(t23))
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 378704 markings, 1635518 edges, 75741 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 744660 markings, 3299916 edges, 73191 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1112561 markings, 4950281 edges, 73580 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1452883 markings, 6594616 edges, 68064 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1806035 markings, 8213609 edges, 70630 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2156299 markings, 9832978 edges, 70053 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2486391 markings, 11415773 edges, 66018 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2803591 markings, 13009614 edges, 63440 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3043357 markings, 14382316 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t94) 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(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) OR FIREABLE(t11) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t94) 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(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) OR FIREABLE(t11) O... (shortened)
lola: processed formula length: 899
lola: 5 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t94) AND 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(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) AND NOT FIREABLE(t11) AND (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(t129) AND FIREABLE(t22) AND NOT FIREABLE(t34) AND 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))
lola: sara not yet started (preprocessing) || 381672 markings, 1624473 edges, 76334 markings/sec, 0 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 746481 markings, 3283115 edges, 72962 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 1113992 markings, 4939100 edges, 73502 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1455137 markings, 6579126 edges, 68229 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1811636 markings, 8217806 edges, 71300 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2171707 markings, 9877760 edges, 72014 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2506100 markings, 11480203 edges, 66879 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2818563 markings, 13061652 edges, 62493 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3049273 markings, 14388221 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t23) OR FIREABLE(t36) 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 (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((FIREABLE(t23) OR FIREABLE(t36) 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 (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE... (shortened)
lola: processed formula length: 1582
lola: 4 rewrites
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((FIREABLE(t23) OR FIREABLE(t36) 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 (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR 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(t116) OR 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(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) OR FIREABLE(t11)) AND (FIREABLE(t34) 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(t163)) AND (FIREABLE(t48) OR FIREABLE(t47) OR FIREABLE(t46) OR 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(t83) OR (NOT FIREABLE(t10) AND NOT FIREABLE(t9) AND NOT FIREABLE(t8) AND NOT FIREABLE(t7) AND NOT FIREABLE(t6) AND NOT FIREABLE(t5) AND NOT FIREABLE(t4) AND NOT FIREABLE(t3) AND NOT FIREABLE(t2) AND NOT FIREABLE(t1) AND NOT FIREABLE(t0)))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges

FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no no yes yes no yes no yes no yes
lola:
preliminary result: yes yes no yes yes yes no no yes yes no yes no yes no yes
lola: memory consumption: 15264 KB
lola: time consumption: 90 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="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/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is 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 r136-qhx2-152673578700028"
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 ;