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.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100166
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527019747747

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-020 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ MAPK-PT-020 @ 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-020-ReachabilityCardinality.task
lola: always true
lola: A (G (((3 <= ERKP_Phase3) OR (3 <= ERK) OR (ERK_MEKPP <= 0) OR (((Phase2 <= ERK_MEKPP) OR (MEKPP <= ERKP_Phase3)) AND (2 <= ERKPP))))) : A (G ((RasGTP <= Phase2))) : E (F (((ERKPP <= 2) AND (Phase2 <= 0) AND (Phase1 <= RafP_Phase1)))) : E (F ((MEK <= 2))) : E (F (((3 <= ERKP_MEKPP) AND (3 <= ERKPP)))) : E (F ((((3 <= Phase1) OR ((ERKPP <= Phase1) AND (Phase2 <= Phase1))) AND (2 <= ERKP_MEKPP)))) : A (G ((MEKP <= Phase1))) : E (F (((3 <= RafP) AND (MEKP_Phase2 <= MEKP_RafP) AND (Phase2 <= ERKPP_Phase3) AND (((MEK <= MEKPP) AND (3 <= MEK_RafP)) OR (MEK_RafP <= MEKP_RafP))))) : E (F (((3 <= ERK_MEKPP) OR ((3 <= ERKPP) AND (1 <= Raf_RasGTP))))) : E (F ((Phase1 + 1 <= RasGTP))) : A (G ((RafP_Phase1 + 1 <= Phase1))) : A (G (((3 <= ERKP_Phase3) OR (3 <= Phase1) OR (ERKPP_Phase3 <= ERKP) OR (3 <= MEKPP_Phase2)))) : E (F ((((RasGTP <= RafP) OR (2 <= Raf_RasGTP) OR (ERKPP_Phase3 <= MEKPP_Phase2) OR (Raf_RasGTP <= ERKPP)) AND (2 <= ERKPP)))) : E (F (((MEKPP_Phase2 <= RafP_Phase1) AND (Phase1 <= ERKPP) AND (RasGTP <= Phase1) AND (RasGTP <= 0)))) : A (G (((Phase2 <= 1) OR (MEKPP <= 0) OR ((RafP_Phase1 <= ERK) AND ((MEKPP_Phase2 <= Raf) OR (3 <= ERKP_MEKPP)))))) : E (F (()))
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: 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: 3 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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-020-ReachabilityCardinality-15 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: E (F ((MEK <= 2)))
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 ((MEK <= 2)))
lola: processed formula length: 18
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: (MEK <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-0.sara
lola: The predicate is reachable.
lola: 18 markings, 24 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= ERKP_MEKPP) AND (3 <= ERKPP))))
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 (((3 <= ERKP_MEKPP) AND (3 <= ERKPP))))
lola: processed formula length: 44
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((3 <= ERKP_MEKPP) AND (3 <= ERKPP))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 153 markings, 234 edges

FORMULA MAPK-PT-020-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((MEKP <= Phase1)))
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 ((MEKP <= Phase1)))
lola: processed formula length: 24
lola: 5 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: (Phase1 + 1 <= MEKP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 67 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-6 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 ((Phase1 + 1 <= RasGTP)))
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 ((Phase1 + 1 <= RasGTP)))
lola: processed formula length: 30
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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)sara: try reading problem file MAPK-PT-020-ReachabilityCardinality-3-0.sara.

lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (Phase1 + 1 <= RasGTP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 44 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-9 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 ((RafP_Phase1 + 1 <= Phase1)))
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 ((RafP_Phase1 + 1 <= Phase1)))
lola: processed formula length: 35
lola: 5 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: (Phase1 <= RafP_Phase1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 31 edges

FORMULA MAPK-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((RasGTP <= Phase2)))
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 ((RasGTP <= Phase2)))
lola: processed formula length: 26
lola: 5 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: (Phase2 + 1 <= RasGTP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 59 markings, 83 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-1 FALSE 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: E (F (((3 <= ERK_MEKPP) OR ((3 <= ERKPP) AND (1 <= Raf_RasGTP)))))
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 (((3 <= ERK_MEKPP) OR ((3 <= ERKPP) AND (1 <= Raf_RasGTP)))))sara:
try reading problem file MAPK-PT-020-ReachabilityCardinality-6-0.sara.lola: processed formula length: 67
lola:
4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((3 <= ERK_MEKPP) OR ((3 <= ERKPP) AND (1 <= Raf_RasGTP)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-7-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 60 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-8 TRUE 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: E (F ((((3 <= Phase1) OR ((ERKPP <= Phase1) AND (Phase2 <= Phase1))) AND (2 <= ERKP_MEKPP))))
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 ((((3 <= Phase1) OR ((ERKPP <= Phase1) AND (Phase2 <= Phase1))) AND (2 <= ERKP_MEKPP))))
lola: processed formula length: 94
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: (((3 <= Phase1) OR ((ERKPP <= Phase1) AND (Phase2 <= Phase1))) AND (2 <= ERKP_MEKPP))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 106 markings, 157 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-5 TRUE 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: E (F (((ERKPP <= 2) AND (Phase2 <= 0) AND (Phase1 <= RafP_Phase1))))
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 (((ERKPP <= 2) AND (Phase2 <= 0) AND (Phase1 <= RafP_Phase1))))
lola: processed formula length: 68
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((ERKPP <= 2) AND (Phase2 <= 0) AND (Phase1 <= RafP_Phase1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 70 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-2 TRUE 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 (((MEKPP_Phase2 <= RafP_Phase1) AND (Phase1 <= ERKPP) AND (RasGTP <= Phase1) AND (RasGTP <= 0))))
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 (((MEKPP_Phase2 <= RafP_Phase1) AND (Phase1 <= ERKPP) AND (RasGTP <= Phase1) AND (RasGTP <= 0))))
lola: processed formula length: 102
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((MEKPP_Phase2 <= RafP_Phase1) AND (Phase1 <= ERKPP) AND (RasGTP <= Phase1) AND (RasGTP <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: state equation: calling and running sara
51 markings, 60 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-13 TRUE 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: ========================================
sara: try reading problem file MAPK-PT-020-ReachabilityCardinality-10-0.sara.
lola: ...considering subproblem: A (G (((3 <= ERKP_Phase3) OR (3 <= Phase1) OR (ERKPP_Phase3 <= ERKP) OR (3 <= MEKPP_Phase2))))
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 (((3 <= ERKP_Phase3) OR (3 <= Phase1) OR (ERKPP_Phase3 <= ERKP) OR (3 <= MEKPP_Phase2))))
lola: processed formula length: 97
lola: 5 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((ERKP_Phase3 <= 2) AND (Phase1 <= 2) AND (ERKP + 1 <= ERKPP_Phase3) AND (MEKPP_Phase2 <= 2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-11-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: 49 markings, 63 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-11 FALSE 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 (((3 <= ERKP_Phase3) OR (3 <= ERK) OR (ERK_MEKPP <= 0) OR (((Phase2 <= ERK_MEKPP) OR (MEKPP <= ERKP_Phase3)) AND (2 <= ERKPP)))))
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 (((3 <= ERKP_Phase3) OR (3 <= ERK) OR (ERK_MEKPP <= 0) OR (((Phase2 <= ERK_MEKPP) OR (MEKPP <= ERKP_Phase3)) AND (2 <= ERKPP)))))
lola: processed formula length: 138
lola: 5 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((ERKP_Phase3 <= 2) AND (ERK <= 2) AND (1 <= ERK_MEKPP) AND (((ERK_MEKPP + 1 <= Phase2) AND (ERKP_Phase3 + 1 <= MEKPP)) OR (ERKPP <= 1)))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-12-0.sara
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara
32 markings, 44 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-0 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 ((((RasGTP <= RafP) OR (2 <= Raf_RasGTP) OR (ERKPP_Phase3 <= MEKPP_Phase2) OR (Raf_RasGTP <= ERKPP)) AND (2 <= ERKPP))))
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 ((((RasGTP <= RafP) OR (2 <= Raf_RasGTP) OR (ERKPP_Phase3 <= MEKPP_Phase2) OR (Raf_RasGTP <= ERKPP)) AND (2 <= ERKPP))))
lola: processed formula length: 128
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: (((RasGTP <= RafP) OR (2 <= Raf_RasGTP) OR (ERKPP_Phase3 <= MEKPP_Phase2) OR (Raf_RasGTP <= ERKPP)) AND (2 <= ERKPP))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 22 edges
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-13-0.sara
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Phase2 <= 1) OR (MEKPP <= 0) OR ((RafP_Phase1 <= ERK) AND ((MEKPP_Phase2 <= Raf) OR (3 <= ERKP_MEKPP))))))
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 (((Phase2 <= 1) OR (MEKPP <= 0) OR ((RafP_Phase1 <= ERK) AND ((MEKPP_Phase2 <= Raf) OR (3 <= ERKP_MEKPP))))))
lola: processed formula length: 117
lola: 5 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((2 <= Phase2) AND (1 <= MEKPP) AND ((ERK + 1 <= RafP_Phase1) OR ((Raf + 1 <= MEKPP_Phase2) AND (ERKP_MEKPP <= 2))))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 38 markings, 53 edges
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-14-0.sara
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= RafP) AND (MEKP_Phase2 <= MEKP_RafP) AND (Phase2 <= ERKPP_Phase3) AND (((MEK <= MEKPP) AND (3 <= MEK_RafP)) OR (MEK_RafP <= MEKP_RafP)))))
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 (((3 <= RafP) AND (MEKP_Phase2 <= MEKP_RafP) AND (Phase2 <= ERKPP_Phase3) AND (((MEK <= MEKPP) AND (3 <= MEK_RafP)) OR (MEK_RafP <= MEKP_RafP)))))
lola: processed formula length: 152
lola: 4 rewrites
lola: closed formula file MAPK-PT-020-ReachabilityCardinality.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: ((3 <= RafP) AND (MEKP_Phase2 <= MEKP_RafP) AND (Phase2 <= ERKPP_Phase3) AND (((MEK <= MEKPP) AND (3 <= MEK_RafP)) OR (MEK_RafP <= MEKP_RafP)))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-ReachabilityCardinality-15-0.sara
sara: try reading problem file MAPK-PT-020-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 347 markings, 521 edges
lola: ========================================

FORMULA MAPK-PT-020-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes yes no yes yes yes no no yes yes no no
lola:
preliminary result: no no yes yes yes yes no yes yes yes no no yes yes no no
lola: memory consumption: 24272 KB
lola: time consumption: 1 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="MAPK-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
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-020.tgz
mv MAPK-PT-020 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-020, examination is ReachabilityCardinality"
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-152666469100166"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;