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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100164
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527019660344

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ 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-CTLCardinality.task
lola: LP says that atomic proposition is always true: (MEK <= Phase2)
lola: LP says that atomic proposition is always true: (ERK_MEKPP <= Phase3)
lola: always true
lola: always true
lola: A (G ((ERKPP <= 1))) : NOT(E (G (A (G (TRUE))))) : ((MEKP <= 2) AND (E (F (((2 <= ERK_MEKPP) AND (MEKP <= Raf)))) AND A (G (TRUE)))) : (E (G (E (F ((1 <= MEKP_RafP))))) AND NOT(A (G (((1 <= MEK) OR (Raf <= Phase3)))))) : NOT(E (F (A (G ((Phase1 <= MEKPP_Phase2)))))) : E (((2 <= Phase2) U ((3 <= RafP_Phase1) AND (2 <= Phase3) AND (Phase1 <= 0)))) : (((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2)) OR (((Phase2 + 1 <= ERK)) AND E (F (((MEK <= MEK_RafP) AND (2 <= RasGTP)))))) : E ((((Phase1 <= Raf_RasGTP) OR (MEKPP <= ERKP) OR (Phase3 <= 2)) U (3 <= ERKPP))) : E (F (A (G ((2 <= ERK_MEKPP))))) : (A (X (A (F ((MEKPP <= RasGTP))))) AND A (G ((ERKPP <= Raf)))) : (E (G (A (G ((1 <= Raf))))) OR (A (X (((Phase1 <= MEKP_RafP) OR (RasGTP <= MEKPP_Phase2)))) OR (3 <= ERKP_MEKPP))) : A (G (E (X ((Phase2 <= ERK))))) : E (((ERKPP_Phase3 <= RafP) U E (X ((3 <= ERKP_MEKPP))))) : E (F (FALSE)) : E ((((RasGTP <= MEK) OR (ERK_MEKPP <= MEKPP) OR (Phase1 <= 0)) U (Raf <= 2))) : E (F (A (X (((1 <= ERKPP_Phase3) AND (2 <= ERKPP_Phase3))))))
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: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
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: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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-CTLCardinality-1 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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-CTLCardinality-13 FALSE 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: (A (G ((1 <= Raf))) OR (A (X (((Phase1 <= MEKP_RafP) OR (RasGTP <= MEKPP_Phase2)))) OR (3 <= ERKP_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= ERKP_MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ERKP_MEKPP)
lola: processed formula length: 17
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Raf)))
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 ((1 <= Raf)))
lola: processed formula length: 18
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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: (Raf <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-CTLCardinality-3-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: 36 markings, 50 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Phase1 <= MEKP_RafP) OR (RasGTP <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((Phase1 <= MEKP_RafP) OR (RasGTP <= MEKPP_Phase2)))
lola: processed formula length: 56
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-10 FALSE 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 (E (X ((Phase2 <= ERK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((Phase2 <= ERK)))))
lola: processed formula length: 39
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 591 markings, 1326 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-11 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 (((ERKPP_Phase3 <= RafP) U E (X ((3 <= ERKP_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((ERKPP_Phase3 <= RafP) U EX((3 <= ERKP_MEKPP)))
lola: processed formula length: 49
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1787311 markings, 4256141 edges, 357462 markings/sec, 0 secs
lola: 3539252 markings, 8414630 edges, 350388 markings/sec, 5 secs
lola: 5267468 markings, 12526055 edges, 345643 markings/sec, 10 secs
lola: 6919558 markings, 16452084 edges, 330418 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7705694 markings, 18323414 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((MEKPP <= RasGTP))))) AND A (G ((ERKPP <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKPP <= Raf)))
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 ((ERKPP <= Raf)))
lola: processed formula length: 22
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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: 61 markings, 89 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= ERKPP_Phase3) AND (2 <= ERKPP_Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX(((1 <= ERKPP_Phase3) AND (2 <= ERKPP_Phase3))))
lola: processed formula length: 59
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 136153 markings, 325382 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKPP <= 1)))
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 ((ERKPP <= 1)))
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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: 17 markings, 22 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((2 <= ERK_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (ERK_MEKPP <= 1)
lola: processed formula length: 16
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3469144 markings, 8292688 edges, 693829 markings/sec, 0 secs
lola: 6920367 markings, 16558972 edges, 690245 markings/sec, 5 secs
lola: 10326053 markings, 24727673 edges, 681137 markings/sec, 10 secs
lola: 13712563 markings, 32842657 edges, 677302 markings/sec, 15 secs
lola: 16975239 markings, 40682410 edges, 652535 markings/sec, 20 secs
lola: 20284545 markings, 48648623 edges, 661861 markings/sec, 25 secs
lola: 23608177 markings, 56634850 edges, 664726 markings/sec, 30 secs
lola: 26943959 markings, 64633750 edges, 667156 markings/sec, 35 secs
lola: 30199594 markings, 72438644 edges, 651127 markings/sec, 40 secs
lola: 33311288 markings, 79927976 edges, 622339 markings/sec, 45 secs
lola: 36450096 markings, 87482964 edges, 627762 markings/sec, 50 secs
lola: 39527622 markings, 94898709 edges, 615505 markings/sec, 55 secs
lola: 42366223 markings, 101753982 edges, 567720 markings/sec, 60 secs
lola: 45343344 markings, 108905714 edges, 595424 markings/sec, 65 secs
lola: 48558248 markings, 116624466 edges, 642981 markings/sec, 70 secs
lola: 51491756 markings, 123717377 edges, 586702 markings/sec, 75 secs
lola: 54527291 markings, 131048533 edges, 607107 markings/sec, 80 secs
lola: 57664936 markings, 138592257 edges, 627529 markings/sec, 85 secs
lola: 60683273 markings, 145878746 edges, 603667 markings/sec, 90 secs
lola: 63641554 markings, 153053846 edges, 591656 markings/sec, 95 secs
lola: 66695426 markings, 160453119 edges, 610774 markings/sec, 100 secs
lola: 69860444 markings, 168072554 edges, 633004 markings/sec, 105 secs
lola: 72910402 markings, 175425191 edges, 609992 markings/sec, 110 secs
lola: 75987029 markings, 182826843 edges, 615325 markings/sec, 115 secs
lola: 79042808 markings, 190195054 edges, 611156 markings/sec, 120 secs
lola: 82060421 markings, 197511741 edges, 603523 markings/sec, 125 secs
lola: 85077034 markings, 204792289 edges, 603323 markings/sec, 130 secs
lola: 88124820 markings, 212140617 edges, 609557 markings/sec, 135 secs
lola: 91117989 markings, 219384330 edges, 598634 markings/sec, 140 secs
lola: 94170098 markings, 226746213 edges, 610422 markings/sec, 145 secs
lola: 97156528 markings, 233957956 edges, 597286 markings/sec, 150 secs
lola: 100048147 markings, 240962335 edges, 578324 markings/sec, 155 secs
lola: 103040307 markings, 248182265 edges, 598432 markings/sec, 160 secs
lola: 105899634 markings, 255135553 edges, 571865 markings/sec, 165 secs
lola: 108800643 markings, 262145669 edges, 580202 markings/sec, 170 secs
lola: 109763034 markings, 264466670 edges, 192478 markings/sec, 175 secs
lola: 109772887 markings, 264490310 edges, 1971 markings/sec, 180 secs
lola: 109805550 markings, 264568441 edges, 6533 markings/sec, 185 secs
lola: 109816299 markings, 264594399 edges, 2150 markings/sec, 190 secs
lola: 109825317 markings, 264615733 edges, 1804 markings/sec, 195 secs
lola: 109851853 markings, 264679227 edges, 5307 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((MEKPP_Phase2 + 1 <= Phase1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (MEKPP_Phase2 + 1 <= Phase1)
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3735278 markings, 8921890 edges, 747056 markings/sec, 0 secs
lola: 7116667 markings, 17012386 edges, 676278 markings/sec, 5 secs
lola: 10399425 markings, 24872674 edges, 656552 markings/sec, 10 secs
lola: 13712236 markings, 32812789 edges, 662562 markings/sec, 15 secs
lola: 17025569 markings, 40746578 edges, 662667 markings/sec, 20 secs
lola: 20324562 markings, 48668284 edges, 659799 markings/sec, 25 secs
lola: 23606266 markings, 56528718 edges, 656341 markings/sec, 30 secs
lola: 26802092 markings, 64218171 edges, 639165 markings/sec, 35 secs
lola: 30219224 markings, 72385876 edges, 683426 markings/sec, 40 secs
lola: 33376287 markings, 79983360 edges, 631413 markings/sec, 45 secs
lola: 36535442 markings, 87599929 edges, 631831 markings/sec, 50 secs
lola: 39750029 markings, 95320795 edges, 642917 markings/sec, 55 secs
lola: 42949773 markings, 103004651 edges, 639949 markings/sec, 60 secs
lola: 46135496 markings, 110665965 edges, 637145 markings/sec, 65 secs
lola: 49200536 markings, 118054624 edges, 613008 markings/sec, 70 secs
lola: 52305098 markings, 125522837 edges, 620912 markings/sec, 75 secs
lola: 55328328 markings, 132812354 edges, 604646 markings/sec, 80 secs
lola: 58441279 markings, 140310372 edges, 622590 markings/sec, 85 secs
lola: 61468741 markings, 147604598 edges, 605492 markings/sec, 90 secs
lola: 64507455 markings, 154914866 edges, 607743 markings/sec, 95 secs
lola: 67557050 markings, 162247503 edges, 609919 markings/sec, 100 secs
lola: 70545849 markings, 169461517 edges, 597760 markings/sec, 105 secs
lola: 73621187 markings, 176864404 edges, 615068 markings/sec, 110 secs
lola: 76606574 markings, 184081730 edges, 597077 markings/sec, 115 secs
lola: 79534973 markings, 191151316 edges, 585680 markings/sec, 120 secs
lola: 82610311 markings, 198531565 edges, 615068 markings/sec, 125 secs
lola: 85485129 markings, 205457515 edges, 574964 markings/sec, 130 secs
lola: 88458804 markings, 212607051 edges, 594735 markings/sec, 135 secs
lola: 91349204 markings, 219595445 edges, 578080 markings/sec, 140 secs
lola: 94425924 markings, 226986176 edges, 615344 markings/sec, 145 secs
lola: 97255586 markings, 233837849 edges, 565932 markings/sec, 150 secs
lola: 100059925 markings, 240627281 edges, 560868 markings/sec, 155 secs
lola: 103010254 markings, 247724867 edges, 590066 markings/sec, 160 secs
lola: 105868288 markings, 254624775 edges, 571607 markings/sec, 165 secs
lola: 108710569 markings, 261504783 edges, 568456 markings/sec, 170 secs
lola: 109721062 markings, 263953175 edges, 202099 markings/sec, 175 secs
lola: 109731640 markings, 263974126 edges, 2116 markings/sec, 180 secs
lola: 109768114 markings, 264061372 edges, 7295 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((MEKP <= 2) AND E (F (((2 <= ERK_MEKPP) AND (MEKP <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MEKP <= 2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEKP <= 2)
lola: processed formula length: 11
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 11 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= ERK_MEKPP) AND (MEKP <= Raf))))
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 (((2 <= ERK_MEKPP) AND (MEKP <= Raf))))
lola: processed formula length: 44
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 241 markings, 390 edges
lola: formula 0: ((2 <= ERK_MEKPP) AND (MEKP <= Raf))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

lola: ========================================
FORMULA MAPK-PT-020-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= Phase2) U ((3 <= RafP_Phase1) AND (2 <= Phase3) AND (Phase1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((2 <= Phase2) U ((3 <= RafP_Phase1) AND (2 <= Phase3) AND (Phase1 <= 0))))
lola: processed formula length: 78
lola: 25 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= RafP_Phase1) AND (2 <= Phase3) AND (Phase1 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-020-CTLCardinality-11-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2986452 markings, 7124970 edges, 597290 markings/sec, 0 secs
lola: sara is running 5 secs || 5903155 markings, 14101658 edges, 583341 markings/sec, 5 secs
lola: sara is running 10 secs || 8751554 markings, 20918423 edges, 569680 markings/sec, 10 secs
lola: sara is running 15 secs || 11637612 markings, 27828173 edges, 577212 markings/sec, 15 secs
lola: sara is running 20 secs || 14430637 markings, 34528883 edges, 558605 markings/sec, 20 secs
lola: sara is running 25 secs || 17209861 markings, 41182671 edges, 555845 markings/sec, 25 secs
lola: sara is running 30 secs || 20024358 markings, 47953035 edges, 562899 markings/sec, 30 secs
lola: sara is running 35 secs || 22703327 markings, 54399002 edges, 535794 markings/sec, 35 secs
lola: sara is running 40 secs || 25460325 markings, 61002366 edges, 551400 markings/sec, 40 secs
lola: sara is running 45 secs || 28069267 markings, 67274007 edges, 521788 markings/sec, 45 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 28582114 markings, 68504479 edges

FORMULA MAPK-PT-020-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((RasGTP <= MEK) OR (ERK_MEKPP <= MEKPP) OR (Phase1 <= 0)) U (Raf <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((RasGTP <= MEK) OR (ERK_MEKPP <= MEKPP) OR (Phase1 <= 0)) U (Raf <= 2)))
lola: processed formula length: 79
lola: 25 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (Raf <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-020-CTLCardinality-12-0.sara.

lola: ========================================
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 355584 markings, 848403 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1030 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((Phase1 <= Raf_RasGTP) OR (MEKPP <= ERKP) OR (Phase3 <= 2)) U (3 <= ERKPP)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((Phase1 <= Raf_RasGTP) OR (MEKPP <= ERKP) OR (Phase3 <= 2)) U (3 <= ERKPP)))
lola: processed formula length: 83
lola: 25 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (3 <= ERKPP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-020-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-020-CTLCardinality-13-0.sara.
sara: warning, failure of lp_solve (at job 240)

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 321602 markings, 850190 edges
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2)) OR (((Phase2 + 1 <= ERK)) AND E (F (((MEK <= MEK_RafP) AND (2 <= RasGTP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Phase2 + 1 <= ERK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Phase2 + 1 <= ERK))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 15 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2))
lola: processed formula length: 46
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((1 <= MEKP_RafP))))) AND E (F (((MEK <= 0) AND (Phase3 + 1 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((MEK <= 0) AND (Phase3 + 1 <= Raf))))
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 <= 0) AND (Phase3 + 1 <= Raf))))
lola: processed formula length: 44
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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 <= 0) AND (Phase3 + 1 <= Raf))
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: 22 markings, 30 edges
lola: state equation: write sara problem file to MAPK-PT-020-CTLCardinality-15-0.sara
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((2 <= ERK_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: ========================================
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (ERK_MEKPP <= 1)
lola: processed formula length: 16
lola: 24 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3583759 markings, 8566039 edges, 716752 markings/sec, 0 secs
lola: 6966041 markings, 16668819 edges, 676456 markings/sec, 5 secs
lola: 10291938 markings, 24645932 edges, 665179 markings/sec, 10 secs
lola: 13652120 markings, 32697215 edges, 672036 markings/sec, 15 secs
lola: 16892602 markings, 40483028 edges, 648096 markings/sec, 20 secs
lola: 20091614 markings, 48185104 edges, 639802 markings/sec, 25 secs
lola: 23274904 markings, 55834047 edges, 636658 markings/sec, 30 secs
lola: 26442371 markings, 63433313 edges, 633493 markings/sec, 35 secs
lola: 29638838 markings, 71095795 edges, 639293 markings/sec, 40 secs
lola: 32798924 markings, 78691992 edges, 632017 markings/sec, 45 secs
lola: 35900893 markings, 86159045 edges, 620394 markings/sec, 50 secs
lola: 38958606 markings, 93532997 edges, 611543 markings/sec, 55 secs
lola: 41986156 markings, 100833025 edges, 605510 markings/sec, 60 secs
lola: 45048375 markings, 108201064 edges, 612444 markings/sec, 65 secs
lola: 48197252 markings, 115753923 edges, 629775 markings/sec, 70 secs
lola: 51163166 markings, 122927826 edges, 593183 markings/sec, 75 secs
lola: 54214107 markings, 130296761 edges, 610188 markings/sec, 80 secs
lola: 57445469 markings, 138064356 edges, 646272 markings/sec, 85 secs
lola: 60572767 markings, 145613204 edges, 625460 markings/sec, 90 secs
lola: 63663589 markings, 153107120 edges, 618164 markings/sec, 95 secs
lola: 66598443 markings, 160215615 edges, 586971 markings/sec, 100 secs
lola: 69599913 markings, 167447160 edges, 600294 markings/sec, 105 secs
lola: 72720420 markings, 174970746 edges, 624101 markings/sec, 110 secs
lola: 75988000 markings, 182829111 edges, 653516 markings/sec, 115 secs
lola: 79206200 markings, 190594938 edges, 643640 markings/sec, 120 secs
lola: 82375867 markings, 198269086 edges, 633933 markings/sec, 125 secs
lola: 85521926 markings, 205861817 edges, 629212 markings/sec, 130 secs
lola: 88739504 markings, 213640741 edges, 643516 markings/sec, 135 secs
lola: 91997349 markings, 221498363 edges, 651569 markings/sec, 140 secs
lola: 95248457 markings, 229358752 edges, 650222 markings/sec, 145 secs
lola: 98494715 markings, 237198271 edges, 649252 markings/sec, 150 secs
lola: 101583516 markings, 244671554 edges, 617760 markings/sec, 155 secs
lola: 104762767 markings, 252368481 edges, 635850 markings/sec, 160 secs
lola: 107962632 markings, 260111410 edges, 639973 markings/sec, 165 secs
lola: 109767247 markings, 264476714 edges, 360923 markings/sec, 170 secs
lola: 109805097 markings, 264567325 edges, 7570 markings/sec, 175 secs
lola: 109827421 markings, 264621055 edges, 4465 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-020-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((MEKPP_Phase2 + 1 <= Phase1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (MEKPP_Phase2 + 1 <= Phase1)
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 3834693 markings, 9159015 edges, 766939 markings/sec, 0 secs
lola: 7471177 markings, 17859356 edges, 727297 markings/sec, 5 secs
lola: 10970008 markings, 26240242 edges, 699766 markings/sec, 10 secs
lola: 14496357 markings, 34685389 edges, 705270 markings/sec, 15 secs
lola: 17889545 markings, 42823835 edges, 678638 markings/sec, 20 secs
lola: 21290404 markings, 50976163 edges, 680172 markings/sec, 25 secs
lola: 24629510 markings, 58992610 edges, 667821 markings/sec, 30 secs
lola: 28019371 markings, 67124983 edges, 677972 markings/sec, 35 secs
lola: 31423841 markings, 75287735 edges, 680894 markings/sec, 40 secs
lola: 34687462 markings, 83148966 edges, 652724 markings/sec, 45 secs
lola: 37861628 markings, 90787854 edges, 634833 markings/sec, 50 secs
lola: 40992765 markings, 98299489 edges, 626227 markings/sec, 55 secs
lola: 44053673 markings, 105664239 edges, 612182 markings/sec, 60 secs
lola: 47128174 markings, 113054637 edges, 614900 markings/sec, 65 secs
lola: 50103654 markings, 120236507 edges, 595096 markings/sec, 70 secs
lola: 53157820 markings, 127565577 edges, 610833 markings/sec, 75 secs
lola: 56083797 markings, 134640500 edges, 585195 markings/sec, 80 secs
lola: 59066586 markings, 141828354 edges, 596558 markings/sec, 85 secs
lola: 62094885 markings, 149106199 edges, 605660 markings/sec, 90 secs
lola: 65018769 markings, 156142367 edges, 584777 markings/sec, 95 secs
lola: 67929432 markings, 163150295 edges, 582133 markings/sec, 100 secs
lola: 71011713 markings, 170582242 edges, 616456 markings/sec, 105 secs
lola: 74188747 markings, 178230344 edges, 635407 markings/sec, 110 secs
lola: 77334321 markings, 185846227 edges, 629115 markings/sec, 115 secs
lola: 80472123 markings, 193414512 edges, 627560 markings/sec, 120 secs
lola: 83731790 markings, 201233390 edges, 651933 markings/sec, 125 secs
lola: 86854573 markings, 208756692 edges, 624557 markings/sec, 130 secs
lola: 90027380 markings, 216409951 edges, 634561 markings/sec, 135 secs
lola: 93159364 markings, 223956110 edges, 626397 markings/sec, 140 secs
lola: 96268874 markings, 231425665 edges, 621902 markings/sec, 145 secs
lola: 99229937 markings, 238607405 edges, 592213 markings/sec, 150 secs
lola: 102237150 markings, 245862002 edges, 601443 markings/sec, 155 secs
lola: 105131464 markings, 252860278 edges, 578863 markings/sec, 160 secs
lola: 108021655 markings, 259853536 edges, 578038 markings/sec, 165 secs
lola: 109722761 markings, 263952582 edges, 340221 markings/sec, 170 secs
lola: 109752395 markings, 264023522 edges, 5927 markings/sec, 175 secs
lola: 109781301 markings, 264092993 edges, 5781 markings/sec, 180 secs
lola: 109803274 markings, 264146000 edges, 4395 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-020-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2)) OR (((Phase2 + 1 <= ERK)) AND E (F (((MEK <= MEK_RafP) AND (2 <= RasGTP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((Phase2 + 1 <= ERK))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Phase2 + 1 <= ERK))
lola: processed formula length: 21
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ========================================
lola: ...considering subproblem: ((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((MEKPP + 1 <= Phase3) AND (1 <= MEKP_Phase2))
lola: processed formula length: 46
lola: 22 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((MEK <= MEK_RafP) AND (2 <= 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 (((MEK <= MEK_RafP) AND (2 <= RasGTP))))
lola: processed formula length: 45
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 27 edges
lola: formula 0: ((MEK <= MEK_RafP) AND (2 <= RasGTP))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((1 <= MEKP_RafP))))) AND E (F (((MEK <= 0) AND (Phase3 + 1 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((MEK <= 0) AND (Phase3 + 1 <= Raf))))
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 <= 0) AND (Phase3 + 1 <= Raf))))
lola: processed formula length: 44
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.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 <= 0) AND (Phase3 + 1 <= Raf))
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: 22 markings, 30 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (1 <= MEKP_RafP)
lola: processed formula length: 16
lola: 23 rewrites
lola: closed formula file MAPK-PT-020-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 275 markings, 606 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-020-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes unknown yes yes yes unknown no no no yes no yes yes
lola:
preliminary result: no no yes yes unknown yes yes yes unknown no no no yes no yes yes
lola: memory consumption: 20064 KB
lola: time consumption: 864 seconds

BK_STOP 1527021049742

--------------------
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="CTLCardinality"
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 CTLCardinality"
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-152666469100164"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;