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 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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 1.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPK-PT-040, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100175
=====================================================================

--------------------
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 MAPK-PT-040-ReachabilityFireability-00
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-01
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-02
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-03
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-04
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-05
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-06
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-07
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-08
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-09
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-10
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-11
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-12
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-13
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-14
FORMULA_NAME MAPK-PT-040-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527020191165

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-040 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-040 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ MAPK-PT-040 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-040-ReachabilityFireability.task
lola: E (F ((FIREABLE(k11) AND FIREABLE(k4) AND NOT FIREABLE(k22) AND (FIREABLE(k23) OR FIREABLE(k24)) AND FIREABLE(k16) AND FIREABLE(k18) AND FIREABLE(k29)))) : A (G ((FIREABLE(k27) OR FIREABLE(k1) OR NOT FIREABLE(k7) OR (FIREABLE(k3) AND FIREABLE(k30)) OR FIREABLE(k23) OR ((NOT FIREABLE(k22) OR NOT FIREABLE(k9)) AND NOT FIREABLE(k22))))) : A (G ((NOT FIREABLE(k27) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k9)) OR (NOT FIREABLE(k28) AND NOT FIREABLE(k30)) OR NOT FIREABLE(k5)))) : E (F ((NOT FIREABLE(k15) AND NOT FIREABLE(k1) AND FIREABLE(k18) AND (NOT FIREABLE(k17) OR NOT FIREABLE(k16) OR FIREABLE(k24))))) : A (G ((NOT FIREABLE(k22) OR NOT FIREABLE(k18) OR FIREABLE(k11) OR NOT FIREABLE(k21)))) : E (F (())) : A (G (())) : A (G ((NOT FIREABLE(k27) OR (FIREABLE(k26) AND (NOT FIREABLE(k17) OR NOT FIREABLE(k4)))))) : E (F ((NOT FIREABLE(k4) AND NOT FIREABLE(k5) AND (NOT FIREABLE(k6) OR FIREABLE(k12)) AND FIREABLE(k6)))) : A (G ((NOT FIREABLE(k15) OR NOT FIREABLE(k20) OR NOT FIREABLE(k23) OR NOT FIREABLE(k9) OR ((FIREABLE(k18) OR NOT FIREABLE(k27)) AND FIREABLE(k19))))) : E (F ((FIREABLE(k23) AND FIREABLE(k26)))) : E (F ((NOT FIREABLE(k23) AND NOT FIREABLE(k1) AND FIREABLE(k4) AND FIREABLE(k22)))) : A (G ((NOT FIREABLE(k12) OR NOT FIREABLE(k27) OR NOT FIREABLE(k28) OR FIREABLE(k22) OR NOT FIREABLE(k15)))) : E (F ((NOT FIREABLE(k2) AND (FIREABLE(k1) OR FIREABLE(k22) OR (FIREABLE(k15) AND FIREABLE(k18))) AND ((FIREABLE(k22) AND (FIREABLE(k22) OR FIREABLE(k4))) OR ((FIREABLE(k27) OR FIREABLE(k20)) AND FIREABLE(k19)))))) : A (G ((NOT FIREABLE(k2) AND NOT FIREABLE(k17) AND FIREABLE(k11) AND (FIREABLE(k22) OR ((FIREABLE(k4) OR FIREABLE(k12)) AND NOT FIREABLE(k22)))))) : A (G (((FIREABLE(k20) OR FIREABLE(k21) OR FIREABLE(k23) OR FIREABLE(k11)) AND FIREABLE(k15) AND FIREABLE(k30) AND (FIREABLE(k10) OR FIREABLE(k12)) AND FIREABLE(k12))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: closed formula file MAPK-PT-040-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-5 FALSE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: closed formula file MAPK-PT-040-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 MAPK-PT-040-ReachabilityFireability-6 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(k23) AND FIREABLE(k26))))
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(k23) AND FIREABLE(k26))))
lola: processed formula length: 41
lola: 7 rewrites
lola: closed formula file MAPK-PT-040-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(k23) AND FIREABLE(k26))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-040-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: 15 markings, 17 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-10 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: A (G ((NOT FIREABLE(k27) OR (FIREABLE(k26) AND (NOT FIREABLE(k17) OR NOT FIREABLE(k4))))))
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(k27) OR (FIREABLE(k26) AND (NOT FIREABLE(k17) OR NOT FIREABLE(k4))))))
lola: processed formula length: 92
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 117 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-7 FALSE 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 ((NOT FIREABLE(k4) AND NOT FIREABLE(k5) AND (NOT FIREABLE(k6) OR FIREABLE(k12)) AND FIREABLE(k6))))
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(k4) AND NOT FIREABLE(k5) AND (NOT FIREABLE(k6) OR FIREABLE(k12)) AND FIREABLE(k6))))
lola: processed formula length: 105
lola: 7 rewrites
lola: closed formula file MAPK-PT-040-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(k4) AND NOT FIREABLE(k5) AND (NOT FIREABLE(k6) OR FIREABLE(k12)) AND FIREABLE(k6))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-8 FALSE 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 ((NOT FIREABLE(k22) OR NOT FIREABLE(k18) OR FIREABLE(k11) OR NOT FIREABLE(k21))))
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(k22) OR NOT FIREABLE(k18) OR FIREABLE(k11) OR NOT FIREABLE(k21))))
lola: processed formula length: 89
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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(k22) AND FIREABLE(k18) AND NOT FIREABLE(k11) AND FIREABLE(k21))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 121 edges
lola: state equation: write sara problem file to MAPK-PT-040-ReachabilityFireability-5-0.sara

FORMULA MAPK-PT-040-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(k23) AND NOT FIREABLE(k1) AND FIREABLE(k4) AND FIREABLE(k22))))
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(k23) AND NOT FIREABLE(k1) AND FIREABLE(k4) AND FIREABLE(k22))))
lola: processed formula length: 83
lola: 7 rewrites
lola: closed formula file MAPK-PT-040-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(k23) AND NOT FIREABLE(k1) AND FIREABLE(k4) AND FIREABLE(k22))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-040-ReachabilityFireability-6-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: 21 markings, 21 edges
lola: ========================================

FORMULA MAPK-PT-040-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(k12) OR NOT FIREABLE(k27) OR NOT FIREABLE(k28) OR FIREABLE(k22) OR NOT FIREABLE(k15))))
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(k12) OR NOT FIREABLE(k27) OR NOT FIREABLE(k28) OR FIREABLE(k22) OR NOT FIREABLE(k15))))
lola: processed formula length: 111
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 195 markings, 238 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-12 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 ((NOT FIREABLE(k27) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k9)) OR (NOT FIREABLE(k28) AND NOT FIREABLE(k30)) OR NOT FIREABLE(k5))))
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(k27) OR (NOT FIREABLE(k26) AND NOT FIREABLE(k9)) OR (NOT FIREABLE(k28) AND NOT FIREABLE(k30)) OR NOT FIREABLE(k5))))
lola: processed formula length: 139
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 81 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(k15) AND NOT FIREABLE(k1) AND FIREABLE(k18) AND (NOT FIREABLE(k17) OR NOT FIREABLE(k16) OR FIREABLE(k24)))))
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(k15) AND NOT FIREABLE(k1) AND FIREABLE(k18) AND (NOT FIREABLE(k17) OR NOT FIREABLE(k16) OR FIREABLE(k24)))))
lola: processed formula length: 130
lola: 7 rewrites
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k2) AND NOT FIREABLE(k17) AND FIREABLE(k11) AND (FIREABLE(k22) OR ((FIREABLE(k4) OR FIREABLE(k12)) AND NOT FIREABLE(k22))))))
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(k2) AND NOT FIREABLE(k17) AND FIREABLE(k11) AND (FIREABLE(k22) OR ((FIREABLE(k4) OR FIREABLE(k12)) AND NOT FIREABLE(k22))))))
lola: processed formula length: 147
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(k15) OR NOT FIREABLE(k20) OR NOT FIREABLE(k23) OR NOT FIREABLE(k9) OR ((FIREABLE(k18) OR NOT FIREABLE(k27)) AND FIREABLE(k19)))))
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(k15) OR NOT FIREABLE(k20) OR NOT FIREABLE(k23) OR NOT FIREABLE(k9) OR ((FIREABLE(k18) OR NOT FIREABLE(k27)) AND FIREABLE(k19)))))
lola: processed formula length: 154
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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(k15) AND FIREABLE(k20) AND FIREABLE(k23) AND FIREABLE(k9) AND ((NOT FIREABLE(k18) AND FIREABLE(k27)) OR NOT FIREABLE(k19)))
lola: state equation: Generated DNF with 16 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-040-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-040-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1101 markings, 1647 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
subprocess 12 will run for 892 seconds at most (--localtimelimit=0)lola: ========================================

lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(k11) AND FIREABLE(k4) AND NOT FIREABLE(k22) AND (FIREABLE(k23) OR FIREABLE(k24)) AND FIREABLE(k16) AND FIREABLE(k18) AND FIREABLE(k29))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: sara: try reading problem file MAPK-PT-040-ReachabilityFireability-5-0.sara.
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(k11) AND FIREABLE(k4) AND NOT FIREABLE(k22) AND (FIREABLE(k23) OR FIREABLE(k24)) AND FIREABLE(k16) AND FIREABLE(k18) AND FIREABLE(k29))))
lola: processed formula length: 154
lola: 7 rewrites
lola: closed formula file MAPK-PT-040-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(k11) AND FIREABLE(k4) AND NOT FIREABLE(k22) AND (FIREABLE(k23) OR FIREABLE(k24)) AND FIREABLE(k16) AND FIREABLE(k18) AND FIREABLE(k29))
lola: state equation: Generated DNF with 36 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-040-ReachabilityFireability-12-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: 268 markings, 402 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(k27) OR FIREABLE(k1) OR NOT FIREABLE(k7) OR (FIREABLE(k3) AND FIREABLE(k30)) OR FIREABLE(k23) OR ((NOT FIREABLE(k22) OR NOT FIREABLE(k9)) AND NOT FIREABLE(k22)))))
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(k27) OR FIREABLE(k1) OR NOT FIREABLE(k7) OR (FIREABLE(k3) AND FIREABLE(k30)) OR FIREABLE(k23) OR ((NOT FIREABLE(k22) OR NOT FIREABLE(k9)) AND NOT FIREABLE(k22)))))
lola: processed formula length: 185
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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(k27) AND NOT FIREABLE(k1) AND FIREABLE(k7) AND (NOT FIREABLE(k3) OR NOT FIREABLE(k30)) AND NOT FIREABLE(k23) AND ((FIREABLE(k22) AND FIREABLE(k9)) OR FIREABLE(k22)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 68 literals and 8 conjunctive subformulas
lola: The predicate is not invariant.
lola: 24 markings, 24 edges
lola: state equation: write sara problem file to MAPK-PT-040-ReachabilityFireability-13-0.sara
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(k20) OR FIREABLE(k21) OR FIREABLE(k23) OR FIREABLE(k11)) AND FIREABLE(k15) AND FIREABLE(k30) AND (FIREABLE(k10) OR FIREABLE(k12)) AND FIREABLE(k12))))
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(k20) OR FIREABLE(k21) OR FIREABLE(k23) OR FIREABLE(k11)) AND FIREABLE(k15) AND FIREABLE(k30) AND (FIREABLE(k10) OR FIREABLE(k12)) AND FIREABLE(k12))))
lola: processed formula length: 171
lola: 8 rewrites
lola: closed formula file MAPK-PT-040-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(k20) AND NOT FIREABLE(k21) AND NOT FIREABLE(k23) AND NOT FIREABLE(k11)) OR NOT FIREABLE(k15) OR NOT FIREABLE(k30) OR (NOT FIREABLE(k10) AND NOT FIREABLE(k12)) OR NOT FIREABLE(k12))
lola: state equation: Generated DNF with 11 literals and 6 conjunctive subformulas

lola: state equation: write sara problem file to MAPK-PT-040-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(k2) AND (FIREABLE(k1) OR FIREABLE(k22) OR (FIREABLE(k15) AND FIREABLE(k18))) AND ((FIREABLE(k22) AND (FIREABLE(k22) OR FIREABLE(k4))) OR ((FIREABLE(k27) OR FIREABLE(k20)) AND FIREABLE(k19))))))
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(k2) AND (FIREABLE(k1) OR FIREABLE(k22) OR (FIREABLE(k15) AND FIREABLE(k18))) AND ((FIREABLE(k22) AND (FIREABLE(k22) OR FIREABLE(k4))) OR ((FIREABLE(k27) OR FIREABLE(k20)) AND FIREABLE(k19))))))
lola: processed formula length: 218
lola: 7 rewrites
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 12 edges
lola: ========================================

FORMULA MAPK-PT-040-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes no no no yes yes no yes no no
lola:
preliminary result: yes no no yes no no yes no no no yes yes no yes no no
lola: memory consumption: 14296 KB
lola: time consumption: 0 seconds

BK_STOP 1527020191518

--------------------
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="MAPK-PT-040"
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/MAPK-PT-040.tgz
mv MAPK-PT-040 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 MAPK-PT-040, 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 r112-csrt-152666469100175"
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 ;