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 196K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K 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 7.6K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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-320, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527021080285

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-320 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-320 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ MAPK-PT-320 @ 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-320-CTLCardinality.task
lola: A (G (A (((MEKPP_Phase2 <= RasGTP) U (ERKPP_Phase3 <= Raf))))) : (NOT((E (G ((MEK <= MEKPP))) OR E (F ((3 <= MEKP_RafP))))) AND NOT((A (G ((3 <= MEKP))) AND ((3 <= RasGTP) OR (MEKPP_Phase2 <= ERKPP_Phase3) OR ((1 <= RafP) AND (MEKP_Phase2 <= Phase2)))))) : (NOT(((1 <= Phase3) AND A (G ((RafP_Phase1 <= RasGTP))))) AND (A (((MEKPP <= Raf_RasGTP) U (1 <= MEKP_Phase2))) OR (MEKPP <= MEKP))) : ((Raf_RasGTP <= ERKP_MEKPP) AND A (G ((2 <= ERK)))) : ((ERKPP_Phase3 <= ERK_MEKPP) AND (E (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP))) AND (MEKPP_Phase2 <= MEKP))) : E (((((MEK <= MEK_RafP) OR (MEKPP_Phase2 <= Raf_RasGTP)) AND (RafP_Phase1 <= 0)) U E (F ((RasGTP <= ERKP))))) : (E (F (((Phase3 <= ERK_MEKPP) AND (MEKP_RafP <= Phase1) AND (ERKP + 1 <= Phase3)))) AND ((E (F ((MEKPP_Phase2 <= ERKP))) OR E (X ((MEK <= MEK_RafP)))) OR (((ERKP_Phase3 <= Phase1) OR (Phase3 <= ERKP) OR (Phase2 <= ERKPP) OR (3 <= MEKP_RafP)) AND E (X ((2 <= MEKPP)))))) : E (F (E (X ((RasGTP <= 2))))) : NOT((A (G ((3 <= Phase1))) AND (A (F ((MEKP_RafP <= MEKP))) OR (((3 <= Phase1) OR (2 <= MEKP_RafP)) AND (ERKPP + 1 <= Raf))))) : A (G (((MEK_RafP <= ERKP_MEKPP) OR (MEKP_RafP + 1 <= Phase2)))) : E (F (A (G (((1 <= Phase1) OR (3 <= RafP_Phase1)))))) : A (F (A (G (((MEK <= Phase1) AND (ERKP_Phase3 <= Phase3)))))) : ((((RasGTP + 1 <= MEK_RafP) AND (ERKP_MEKPP + 1 <= Raf_RasGTP) AND (1 <= ERKP_Phase3)) OR ((1 <= ERK) AND (RafP <= Phase3))) AND (NOT(E (F ((Phase1 <= Phase2)))) OR (A (G ((2 <= MEK_RafP))) AND ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP))))) : E (F (NOT(A (X ((2 <= Phase1)))))) : E (G (E (((ERKP_Phase3 <= RafP_Phase1) U (3 <= ERKP_MEKPP))))) : A (F (E (F ((MEK <= RafP_Phase1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:473
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((Phase3 <= ERK_MEKPP) AND (MEKP_RafP <= Phase1) AND (ERKP + 1 <= Phase3)))) AND (E (F ((MEKPP_Phase2 <= ERKP))) OR (E (X ((MEK <= MEK_RafP))) OR (((ERKP_Phase3 <= Phase1) OR (Phase3 <= ERKP) OR (Phase2 <= ERKPP) OR (3 <= MEKP_RafP)) AND E (X ((2 <= MEKPP)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERKP_Phase3 <= Phase1) OR (Phase3 <= ERKP) OR (Phase2 <= ERKPP) OR (3 <= MEKP_RafP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERKP_Phase3 <= Phase1) OR (Phase3 <= ERKP) OR (Phase2 <= ERKPP) OR (3 <= MEKP_RafP))
lola: processed formula length: 89
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 4 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 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((MEKPP_Phase2 <= ERKP)))
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 <= ERKP)))
lola: processed formula length: 30
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: (MEKPP_Phase2 <= ERKP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-0.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file MAPK-PT-320-CTLCardinality-0.sara.
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Phase3 <= ERK_MEKPP) AND (MEKP_RafP <= Phase1) AND (ERKP + 1 <= Phase3))))
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 (((Phase3 <= ERK_MEKPP) AND (MEKP_RafP <= Phase1) AND (ERKP + 1 <= Phase3))))
lola: processed formula length: 82
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: ((Phase3 <= ERK_MEKPP) AND (MEKP_RafP <= Phase1) AND (ERKP + 1 <= Phase3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-2-0.sara

lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6760 markings, 11841 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((RasGTP <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (RasGTP <= 2)
lola: processed formula length: 13
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is reachable from some successor.
lola: 78 markings, 77 edges
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-7 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 (X (E (F ((Phase1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (Phase1 <= 1)
lola: processed formula length: 13
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--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 /EXEF
lola: The predicate is reachable from some successor.
lola: 717 markings, 954 edges
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((RasGTP <= ERKP)))
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 <= ERKP)))
lola: processed formula length: 24
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: (RasGTP <= ERKP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-320-CTLCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((MEK <= 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 ((MEK <= RafP_Phase1)))
lola: processed formula length: 28
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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 <= RafP_Phase1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-320-CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 481 markings, 639 edges
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-15 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 (((MEK_RafP <= ERKP_MEKPP) OR (MEKP_RafP + 1 <= 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 (((MEK_RafP <= ERKP_MEKPP) OR (MEKP_RafP + 1 <= Phase2))))
lola: processed formula length: 64
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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: ((ERKP_MEKPP + 1 <= MEK_RafP) AND (Phase2 <= MEKP_RafP))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-320-CTLCardinality-5-0.sara.

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

FORMULA MAPK-PT-320-CTLCardinality-9 TRUE 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 (A (G (((1 <= Phase1) OR (3 <= RafP_Phase1))))))
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: ((Phase1 <= 0) AND (RafP_Phase1 <= 2))
lola: processed formula length: 38
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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: 3565044 markings, 6389055 edges, 713009 markings/sec, 0 secs
lola: 6889382 markings, 12359455 edges, 664868 markings/sec, 5 secs
lola: 10195772 markings, 18280106 edges, 661278 markings/sec, 10 secs
lola: 13427414 markings, 24070526 edges, 646328 markings/sec, 15 secs
lola: 16637931 markings, 29850300 edges, 642103 markings/sec, 20 secs
lola: 19767440 markings, 35469255 edges, 625902 markings/sec, 25 secs
lola: 23113253 markings, 41474761 edges, 669163 markings/sec, 30 secs
lola: 26406887 markings, 47370990 edges, 658727 markings/sec, 35 secs
lola: 29587883 markings, 53066418 edges, 636199 markings/sec, 40 secs
lola: 33054060 markings, 59314618 edges, 693235 markings/sec, 45 secs
lola: 36416676 markings, 65354579 edges, 672523 markings/sec, 50 secs
lola: 39723337 markings, 71299446 edges, 661332 markings/sec, 55 secs
lola: 42964469 markings, 77123076 edges, 648226 markings/sec, 60 secs
lola: 46455124 markings, 83392653 edges, 698131 markings/sec, 65 secs
lola: 49949053 markings, 89671904 edges, 698786 markings/sec, 70 secs
lola: 53443337 markings, 95951351 edges, 698857 markings/sec, 75 secs
lola: 57057094 markings, 102440307 edges, 722751 markings/sec, 80 secs
lola: 60556222 markings, 108731496 edges, 699826 markings/sec, 85 secs
lola: 63978596 markings, 114912952 edges, 684475 markings/sec, 90 secs
lola: 67418692 markings, 121091282 edges, 688019 markings/sec, 95 secs
lola: 70825718 markings, 127219880 edges, 681405 markings/sec, 100 secs
lola: 74338459 markings, 133510566 edges, 702548 markings/sec, 105 secs
lola: 77681682 markings, 139502703 edges, 668645 markings/sec, 110 secs
lola: 81032813 markings, 145509396 edges, 670226 markings/sec, 115 secs
lola: 84358980 markings, 151532529 edges, 665233 markings/sec, 120 secs
lola: 87773719 markings, 157672257 edges, 682948 markings/sec, 125 secs
lola: 90828839 markings, 163208706 edges, 611024 markings/sec, 130 secs
lola: 93858973 markings, 168677456 edges, 606027 markings/sec, 135 secs
lola: 96907939 markings, 174168093 edges, 609793 markings/sec, 140 secs
lola: 100210660 markings, 180092018 edges, 660544 markings/sec, 145 secs
lola: 103576141 markings, 186147690 edges, 673096 markings/sec, 150 secs
lola: 106902454 markings, 192149489 edges, 665263 markings/sec, 155 secs
lola: 110290614 markings, 198247594 edges, 677632 markings/sec, 160 secs
lola: 113841364 markings, 204606249 edges, 710150 markings/sec, 165 secs
lola: 117229762 markings, 210679626 edges, 677680 markings/sec, 170 secs
lola: 120652635 markings, 216859916 edges, 684575 markings/sec, 175 secs
lola: 123988075 markings, 222844743 edges, 667088 markings/sec, 180 secs
lola: 127324674 markings, 228823374 edges, 667320 markings/sec, 185 secs
lola: 130502163 markings, 234527659 edges, 635498 markings/sec, 190 secs
lola: 133859533 markings, 240540268 edges, 671474 markings/sec, 195 secs
lola: 137127674 markings, 246439629 edges, 653628 markings/sec, 200 secs
lola: 140235733 markings, 252009591 edges, 621612 markings/sec, 205 secs
lola: 143478665 markings, 257827804 edges, 648586 markings/sec, 210 secs
lola: 147038259 markings, 264256462 edges, 711919 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((ERKP_Phase3 <= RafP_Phase1) U (3 <= ERKP_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((ERKP_Phase3 <= RafP_Phase1) U (3 <= ERKP_MEKPP)))))
lola: processed formula length: 71
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3535850 markings, 6241452 edges, 707170 markings/sec, 0 secs
lola: 6547740 markings, 11500533 edges, 602378 markings/sec, 5 secs
lola: 9586519 markings, 16808376 edges, 607756 markings/sec, 10 secs
lola: 13047821 markings, 22842646 edges, 692260 markings/sec, 15 secs
lola: 16193730 markings, 28335462 edges, 629182 markings/sec, 20 secs
lola: 19330379 markings, 33814139 edges, 627330 markings/sec, 25 secs
lola: 21962452 markings, 38401305 edges, 526415 markings/sec, 30 secs
lola: 24226841 markings, 42353955 edges, 452878 markings/sec, 35 secs
lola: 26588078 markings, 46477383 edges, 472247 markings/sec, 40 secs
lola: 29395239 markings, 51380719 edges, 561432 markings/sec, 45 secs
lola: 33007052 markings, 57676797 edges, 722363 markings/sec, 50 secs
lola: 36386775 markings, 63577437 edges, 675945 markings/sec, 55 secs
lola: 39706173 markings, 69375322 edges, 663880 markings/sec, 60 secs
lola: 42491681 markings, 74229874 edges, 557102 markings/sec, 65 secs
lola: 44881974 markings, 78402721 edges, 478059 markings/sec, 70 secs
lola: 47386338 markings, 82776317 edges, 500873 markings/sec, 75 secs
lola: 50552674 markings, 88351119 edges, 633267 markings/sec, 80 secs
lola: 53928968 markings, 94243473 edges, 675259 markings/sec, 85 secs
lola: 57216960 markings, 99985716 edges, 657598 markings/sec, 90 secs
lola: 60674048 markings, 106021297 edges, 691418 markings/sec, 95 secs
lola: 63542886 markings, 111020912 edges, 573768 markings/sec, 100 secs
lola: 65988887 markings, 115290706 edges, 489200 markings/sec, 105 secs
lola: 68450632 markings, 119589858 edges, 492349 markings/sec, 110 secs
lola: 71478543 markings, 124872714 edges, 605582 markings/sec, 115 secs
lola: 75213919 markings, 131390998 edges, 747075 markings/sec, 120 secs
lola: 78804572 markings, 137661722 edges, 718131 markings/sec, 125 secs
lola: 82490449 markings, 144108927 edges, 737175 markings/sec, 130 secs
lola: 85834380 markings, 149946696 edges, 668786 markings/sec, 135 secs
lola: 88943447 markings, 155376965 edges, 621813 markings/sec, 140 secs
lola: 91801052 markings, 160359011 edges, 571521 markings/sec, 145 secs
lola: 94223514 markings, 164587099 edges, 484492 markings/sec, 150 secs
lola: 96585409 markings, 168711515 edges, 472379 markings/sec, 155 secs
lola: 99110587 markings, 173122141 edges, 505036 markings/sec, 160 secs
lola: 101772117 markings, 177761090 edges, 532306 markings/sec, 165 secs
lola: 104051752 markings, 181740417 edges, 455927 markings/sec, 170 secs
lola: 106267647 markings, 185610150 edges, 443179 markings/sec, 175 secs
lola: 108740256 markings, 189929056 edges, 494522 markings/sec, 180 secs
lola: 112002693 markings, 195615464 edges, 652487 markings/sec, 185 secs
lola: 115019920 markings, 200881685 edges, 603445 markings/sec, 190 secs
lola: 118026583 markings, 206132467 edges, 601333 markings/sec, 195 secs
lola: 121221394 markings, 211705323 edges, 638962 markings/sec, 200 secs
lola: 124427694 markings, 217301108 edges, 641260 markings/sec, 205 secs
lola: 127514453 markings, 222691751 edges, 617352 markings/sec, 210 secs
lola: 130822142 markings, 228480201 edges, 661538 markings/sec, 215 secs
lola: 134131446 markings, 234256149 edges, 661861 markings/sec, 220 secs
lola: 134670357 markings, 235207901 edges, 107782 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((MEKPP_Phase2 <= RasGTP) U (ERKPP_Phase3 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((MEKPP_Phase2 <= RasGTP) U (ERKPP_Phase3 <= Raf)))))
lola: processed formula length: 71
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2014120 markings, 7070710 edges, 402824 markings/sec, 0 secs
lola: 3907347 markings, 13681973 edges, 378645 markings/sec, 5 secs
lola: 5785151 markings, 20240789 edges, 375561 markings/sec, 10 secs
lola: 7622861 markings, 26669126 edges, 367542 markings/sec, 15 secs
lola: 9466864 markings, 33134830 edges, 368801 markings/sec, 20 secs
lola: 11268617 markings, 39467632 edges, 360351 markings/sec, 25 secs
lola: 13285850 markings, 46552485 edges, 403447 markings/sec, 30 secs
lola: 15165756 markings, 53130996 edges, 375981 markings/sec, 35 secs
lola: 17022768 markings, 59616657 edges, 371402 markings/sec, 40 secs
lola: 18857591 markings, 66024454 edges, 366965 markings/sec, 45 secs
lola: 20647654 markings, 72278809 edges, 358013 markings/sec, 50 secs
lola: 22353238 markings, 78237275 edges, 341117 markings/sec, 55 secs
lola: 24165792 markings, 84570188 edges, 362511 markings/sec, 60 secs
lola: 25895119 markings, 90609888 edges, 345865 markings/sec, 65 secs
lola: 27661624 markings, 96781567 edges, 353301 markings/sec, 70 secs
lola: 29529680 markings, 103306944 edges, 373611 markings/sec, 75 secs
lola: 31256355 markings, 109351988 edges, 345335 markings/sec, 80 secs
lola: 32960861 markings, 115307276 edges, 340901 markings/sec, 85 secs
lola: 34667335 markings, 121270881 edges, 341295 markings/sec, 90 secs
lola: 36407436 markings, 127348603 edges, 348020 markings/sec, 95 secs
lola: 38182607 markings, 133546378 edges, 355034 markings/sec, 100 secs
lola: 39986305 markings, 139868588 edges, 360740 markings/sec, 105 secs
lola: 41768679 markings, 146093489 edges, 356475 markings/sec, 110 secs
lola: 43589937 markings, 152455800 edges, 364252 markings/sec, 115 secs
lola: 45473855 markings, 159035241 edges, 376784 markings/sec, 120 secs
lola: 47318538 markings, 165477595 edges, 368937 markings/sec, 125 secs
lola: 49154150 markings, 171887768 edges, 367122 markings/sec, 130 secs
lola: 51052460 markings, 178518507 edges, 379662 markings/sec, 135 secs
lola: 53022388 markings, 185397404 edges, 393986 markings/sec, 140 secs
lola: 54829523 markings, 191710179 edges, 361427 markings/sec, 145 secs
lola: 56605252 markings, 197911165 edges, 355146 markings/sec, 150 secs
lola: 58409372 markings, 204213574 edges, 360824 markings/sec, 155 secs
lola: 60232859 markings, 210583908 edges, 364697 markings/sec, 160 secs
lola: 62132466 markings, 217215992 edges, 379921 markings/sec, 165 secs
lola: 64159622 markings, 224310376 edges, 405431 markings/sec, 170 secs
lola: 66261938 markings, 231653727 edges, 420463 markings/sec, 175 secs
lola: 68199695 markings, 238448074 edges, 387551 markings/sec, 180 secs
lola: 70105209 markings, 245156966 edges, 381103 markings/sec, 185 secs
lola: 72069788 markings, 252026738 edges, 392916 markings/sec, 190 secs
lola: 74072234 markings, 259073204 edges, 400489 markings/sec, 195 secs
lola: 76062529 markings, 266036982 edges, 398059 markings/sec, 200 secs
lola: 77935907 markings, 272579028 edges, 374676 markings/sec, 205 secs
lola: 79863886 markings, 279313439 edges, 385596 markings/sec, 210 secs
lola: 81623362 markings, 285471410 edges, 351895 markings/sec, 215 secs
lola: 83308949 markings, 291356919 edges, 337117 markings/sec, 220 secs
lola: 85135663 markings, 297738679 edges, 365343 markings/sec, 225 secs
lola: 86883968 markings, 303845540 edges, 349661 markings/sec, 230 secs
lola: 88562143 markings, 309708682 edges, 335635 markings/sec, 235 secs
lola: 90275892 markings, 315695010 edges, 342750 markings/sec, 240 secs
lola: 92073841 markings, 321987890 edges, 359590 markings/sec, 245 secs
lola: 92952778 markings, 325058917 edges, 175787 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((Raf_RasGTP <= ERKP_MEKPP) AND A (G ((2 <= ERK))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Raf_RasGTP <= ERKP_MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Raf_RasGTP <= ERKP_MEKPP)
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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 10 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= ERK)))
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 ((2 <= ERK)))
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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: (ERK <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 484 markings, 722 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

========================================
FORMULA MAPK-PT-320-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((MEK <= Phase1) AND (ERKP_Phase3 <= Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((Phase1 + 1 <= MEK) OR (Phase3 + 1 <= ERKP_Phase3))
lola: processed formula length: 53
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 67134 markings, 166555 edges
lola:
FORMULA MAPK-PT-320-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERKPP_Phase3 <= ERK_MEKPP) AND (E (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP))) AND (MEKPP_Phase2 <= MEKP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MEKPP_Phase2 <= MEKP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEKPP_Phase2 <= MEKP)
lola: processed formula length: 22
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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 12 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ERKPP_Phase3 <= ERK_MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKPP_Phase3 <= ERK_MEKPP)
lola: processed formula length: 27
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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 13 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP)))
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 (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP)))
lola: processed formula length: 49
lola: 41 rewrites
lola: closed formula file MAPK-PT-320-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: (RasGTP <= ERKP_MEKPP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-320-CTLCardinality-13-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2923266 markings, 7273611 edges, 584653 markings/sec, 0 secs
lola: sara is running 5 secs || 5893114 markings, 14667144 edges, 593970 markings/sec, 5 secs
lola: sara is running 10 secs || 8793477 markings, 21890774 edges, 580073 markings/sec, 10 secs
lola: sara is running 15 secs || 11614029 markings, 28915254 edges, 564110 markings/sec, 15 secs
lola: sara is running 20 secs || 14406199 markings, 35863200 edges, 558434 markings/sec, 20 secs
lola: sara is running 25 secs || 17049516 markings, 42444368 edges, 528663 markings/sec, 25 secs
lola: sara is running 30 secs || 19789937 markings, 49264483 edges, 548084 markings/sec, 30 secs
lola: sara is running 35 secs || 22577434 markings, 56205488 edges, 557499 markings/sec, 35 secs
lola: sara is running 40 secs || 25242188 markings, 62847405 edges, 532951 markings/sec, 40 secs
lola: sara is running 45 secs || 27841468 markings, 69325090 edges, 519856 markings/sec, 45 secs
lola: sara is running 50 secs || 30256448 markings, 75335746 edges, 482996 markings/sec, 50 secs
lola: sara is running 55 secs || 32810311 markings, 81693842 edges, 510773 markings/sec, 55 secs
lola: sara is running 60 secs || 35487113 markings, 88368450 edges, 535360 markings/sec, 60 secs
lola: sara is running 65 secs || 38149448 markings, 95004233 edges, 532467 markings/sec, 65 secs
lola: sara is running 70 secs || 40886795 markings, 101828050 edges, 547469 markings/sec, 70 secs
lola: sara is running 75 secs || 43500141 markings, 108341471 edges, 522669 markings/sec, 75 secs
lola: sara is running 80 secs || 46309507 markings, 115343752 edges, 561873 markings/sec, 80 secs
lola: sara is running 85 secs || 49048804 markings, 122172087 edges, 547859 markings/sec, 85 secs
lola: sara is running 90 secs || 51737751 markings, 128872679 edges, 537789 markings/sec, 90 secs
lola: sara is running 95 secs || 54387909 markings, 135474857 edges, 530032 markings/sec, 95 secs
lola: sara is running 100 secs || 57106819 markings, 142252780 edges, 543782 markings/sec, 100 secs
lola: sara is running 105 secs || 59764736 markings, 148878860 edges, 531583 markings/sec, 105 secs
lola: sara is running 110 secs || 62466851 markings, 155611088 edges, 540423 markings/sec, 110 secs
lola: sara is running 115 secs || 65193852 markings, 162404010 edges, 545400 markings/sec, 115 secs
lola: sara is running 120 secs || 67897619 markings, 169142531 edges, 540753 markings/sec, 120 secs
lola: sara is running 125 secs || 70549932 markings, 175749318 edges, 530463 markings/sec, 125 secs
lola: sara is running 130 secs || 73198967 markings, 182343864 edges, 529807 markings/sec, 130 secs
lola: sara is running 135 secs || 75813956 markings, 188859680 edges, 522998 markings/sec, 135 secs
lola: sara is running 140 secs || 78539315 markings, 195653378 edges, 545072 markings/sec, 140 secs
lola: sara is running 145 secs || 81274510 markings, 202473485 edges, 547039 markings/sec, 145 secs
lola: sara is running 150 secs || 83973594 markings, 209197875 edges, 539817 markings/sec, 150 secs
lola: sara is running 155 secs || 86565324 markings, 215654373 edges, 518346 markings/sec, 155 secs
lola: sara is running 160 secs || 89119103 markings, 222011514 edges, 510756 markings/sec, 160 secs
lola: sara is running 165 secs || 91737445 markings, 228534864 edges, 523668 markings/sec, 165 secs
lola: sara is running 170 secs || 94360526 markings, 235073149 edges, 524616 markings/sec, 170 secs
lola: sara is running 175 secs || 97040536 markings, 241756016 edges, 536002 markings/sec, 175 secs
lola: sara is running 180 secs || 99603077 markings, 248142694 edges, 512508 markings/sec, 180 secs
lola: sara is running 185 secs || 102298915 markings, 254864727 edges, 539168 markings/sec, 185 secs
lola: sara is running 190 secs || 104901812 markings, 261353863 edges, 520579 markings/sec, 190 secs
lola: sara is running 195 secs || 107566970 markings, 268000677 edges, 533032 markings/sec, 195 secs
lola: sara is running 200 secs || 110209840 markings, 274589130 edges, 528574 markings/sec, 200 secs
lola: sara is running 205 secs || 112955142 markings, 281427136 edges, 549060 markings/sec, 205 secs
lola: sara is running 210 secs || 115642472 markings, 288111943 edges, 537466 markings/sec, 210 secs
lola: sara is running 215 secs || 118264583 markings, 294643557 edges, 524422 markings/sec, 215 secs
lola: sara is running 220 secs || 120875448 markings, 301150292 edges, 522173 markings/sec, 220 secs
lola: sara is running 225 secs || 123346244 markings, 307313041 edges, 494159 markings/sec, 225 secs
lola: sara is running 230 secs || 125694395 markings, 313166437 edges, 469630 markings/sec, 230 secs
lola: sara is running 235 secs || 128082868 markings, 319120193 edges, 477695 markings/sec, 235 secs
lola: sara is running 240 secs || 130350829 markings, 324774068 edges, 453592 markings/sec, 240 secs
lola: sara is running 245 secs || 132682234 markings, 330586494 edges, 466281 markings/sec, 245 secs
lola: sara is running 250 secs || 134390880 markings, 334845736 edges, 341729 markings/sec, 250 secs
lola: sara is running 255 secs || 134410127 markings, 334893778 edges, 3849 markings/sec, 255 secs
lola: sara is running 260 secs || 134439340 markings, 334966747 edges, 5843 markings/sec, 260 secs
lola: sara is running 265 secs || 134470163 markings, 335043767 edges, 6165 markings/sec, 265 secs
lola: sara is running 270 secs || 134484838 markings, 335080421 edges, 2935 markings/sec, 270 secs
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 12 will run for 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((Phase1 <= 2))) OR (E (G ((MEKP + 1 <= MEKP_RafP))) AND (((Phase1 <= 2) AND (MEKP_RafP <= 1)) OR (Raf <= ERKPP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Phase1 <= 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 ((Phase1 <= 2)))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: (Phase1 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 715 markings, 951 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((Phase3 <= 0) OR E (F ((RasGTP + 1 <= RafP_Phase1)))) AND (A (((MEKPP <= Raf_RasGTP) U (1 <= MEKP_Phase2))) OR (MEKPP <= MEKP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 858 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MEKPP <= MEKP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEKPP <= MEKP)
lola: processed formula length: 15
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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 14 will run for 1287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Phase3 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Phase3 <= 0)
lola: processed formula length: 13
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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 15 will run for 2575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((RasGTP + 1 <= 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 ((RasGTP + 1 <= RafP_Phase1)))
lola: processed formula length: 35
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: (RasGTP + 1 <= RafP_Phase1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 84 markings, 84 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((RasGTP + 1 <= MEK_RafP) AND (ERKP_MEKPP + 1 <= Raf_RasGTP) AND (1 <= ERKP_Phase3)) OR ((1 <= ERK) AND (RafP <= Phase3))) AND (A (G ((Phase2 + 1 <= Phase1))) OR (A (G ((2 <= MEK_RafP))) AND ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP))
lola: processed formula length: 49
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 2 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 2575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= MEK_RafP)))
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 ((2 <= MEK_RafP)))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((RasGTP + 1 <= MEK_RafP) AND (ERKP_MEKPP + 1 <= Raf_RasGTP) AND (1 <= ERKP_Phase3)) OR ((1 <= ERK) AND (RafP <= Phase3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((RasGTP + 1 <= MEK_RafP) AND (ERKP_MEKPP + 1 <= Raf_RasGTP) AND (1 <= ERKP_Phase3)) OR ((1 <= ERK) AND (RafP <= Phase3)))
lola: processed formula length: 124
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((MEKPP + 1 <= MEK))) AND (A (G ((MEKP_RafP <= 2))) AND (E (F ((MEKP <= 2))) OR ((RasGTP <= 2) AND (ERKPP_Phase3 + 1 <= MEKPP_Phase2) AND ((RafP <= 0) OR (Phase2 + 1 <= MEKP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((MEKP <= 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 ((MEKP <= 2)))
lola: processed formula length: 19
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((MEKPP + 1 <= MEK)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (MEK <= MEKPP)
lola: processed formula length: 14
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= Phase1) OR (3 <= RafP_Phase1))))))
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: ((Phase1 <= 0) AND (RafP_Phase1 <= 2))
lola: processed formula length: 38
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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: 3529968 markings, 6326300 edges, 705994 markings/sec, 0 secs
lola: 6960106 markings, 12486104 edges, 686028 markings/sec, 5 secs
lola: 10354892 markings, 18564777 edges, 678957 markings/sec, 10 secs
lola: 13704559 markings, 24566677 edges, 669933 markings/sec, 15 secs
lola: 16977690 markings, 30470721 edges, 654626 markings/sec, 20 secs
lola: 20140046 markings, 36136320 edges, 632471 markings/sec, 25 secs
lola: 23514930 markings, 42193643 edges, 674977 markings/sec, 30 secs
lola: 26828783 markings, 48126367 edges, 662771 markings/sec, 35 secs
lola: 30142017 markings, 54059749 edges, 662647 markings/sec, 40 secs
lola: 33799530 markings, 60655692 edges, 731503 markings/sec, 45 secs
lola: 37266332 markings, 66884471 edges, 693360 markings/sec, 50 secs
lola: 40717706 markings, 73082470 edges, 690275 markings/sec, 55 secs
lola: 44132376 markings, 79221480 edges, 682934 markings/sec, 60 secs
lola: 47751744 markings, 85723522 edges, 723874 markings/sec, 65 secs
lola: 51022479 markings, 91598100 edges, 654147 markings/sec, 70 secs
lola: 54236009 markings, 97372967 edges, 642706 markings/sec, 75 secs
lola: 57423363 markings, 103102426 edges, 637471 markings/sec, 80 secs
lola: 60536845 markings, 108696659 edges, 622696 markings/sec, 85 secs
lola: 63635900 markings, 114299121 edges, 619811 markings/sec, 90 secs
lola: 66874637 markings, 120113712 edges, 647747 markings/sec, 95 secs
lola: 70429184 markings, 126504532 edges, 710909 markings/sec, 100 secs
lola: 74063752 markings, 133018666 edges, 726914 markings/sec, 105 secs
lola: 77580971 markings, 139321653 edges, 703444 markings/sec, 110 secs
lola: 81003724 markings, 145457307 edges, 684551 markings/sec, 115 secs
lola: 84383272 markings, 151575978 edges, 675910 markings/sec, 120 secs
lola: 87843650 markings, 157797358 edges, 692076 markings/sec, 125 secs
lola: 91280305 markings, 164029104 edges, 687331 markings/sec, 130 secs
lola: 94709953 markings, 170215361 edges, 685930 markings/sec, 135 secs
lola: 98159762 markings, 176409284 edges, 689962 markings/sec, 140 secs
lola: 101596187 markings, 182584492 edges, 687285 markings/sec, 145 secs
lola: 105057806 markings, 188819875 edges, 692324 markings/sec, 150 secs
lola: 108525948 markings, 195064306 edges, 693628 markings/sec, 155 secs
lola: 112106203 markings, 201497965 edges, 716051 markings/sec, 160 secs
lola: 115554119 markings, 207679427 edges, 689583 markings/sec, 165 secs
lola: 119036046 markings, 213950147 edges, 696385 markings/sec, 170 secs
lola: 122494400 markings, 220160884 edges, 691671 markings/sec, 175 secs
lola: 125840469 markings, 226161745 edges, 669214 markings/sec, 180 secs
lola: 129204806 markings, 232205133 edges, 672867 markings/sec, 185 secs
lola: 132590376 markings, 238268135 edges, 677114 markings/sec, 190 secs
lola: 135961729 markings, 244336176 edges, 674271 markings/sec, 195 secs
lola: 139376292 markings, 250470862 edges, 682913 markings/sec, 200 secs
lola: 142829074 markings, 256664852 edges, 690556 markings/sec, 205 secs
lola: 146725578 markings, 263696670 edges, 779301 markings/sec, 210 secs
lola: 149529626 markings, 268803329 edges, 560810 markings/sec, 215 secs
lola: 149547567 markings, 268836077 edges, 3588 markings/sec, 220 secs
lola: 149573802 markings, 268883959 edges, 5247 markings/sec, 225 secs
lola: 149593345 markings, 268919450 edges, 3909 markings/sec, 230 secs
lola: 149609243 markings, 268948031 edges, 3180 markings/sec, 235 secs
lola: 149650988 markings, 269022973 edges, 8349 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-320-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: E (G (E (((ERKP_Phase3 <= RafP_Phase1) U (3 <= ERKP_MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E((ERKP_Phase3 <= RafP_Phase1) U (3 <= ERKP_MEKPP)))))
lola: processed formula length: 71
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3757805 markings, 6628948 edges, 751561 markings/sec, 0 secs
lola: 7303270 markings, 12820101 edges, 709093 markings/sec, 5 secs
lola: 11044549 markings, 19347443 edges, 748256 markings/sec, 10 secs
lola: 14725001 markings, 25770700 edges, 736090 markings/sec, 15 secs
lola: 17961879 markings, 31423673 edges, 647376 markings/sec, 20 secs
lola: 20996728 markings, 36716517 edges, 606970 markings/sec, 25 secs
lola: 23464652 markings, 41023231 edges, 493585 markings/sec, 30 secs
lola: 25853122 markings, 45193790 edges, 477694 markings/sec, 35 secs
lola: 28404794 markings, 49650706 edges, 510334 markings/sec, 40 secs
lola: 31827993 markings, 55619544 edges, 684640 markings/sec, 45 secs
lola: 35496603 markings, 62023009 edges, 733722 markings/sec, 50 secs
lola: 39017927 markings, 68173042 edges, 704265 markings/sec, 55 secs
lola: 42183274 markings, 73691683 edges, 633069 markings/sec, 60 secs
lola: 44836909 markings, 78324769 edges, 530727 markings/sec, 65 secs
lola: 47515399 markings, 83001762 edges, 535698 markings/sec, 70 secs
lola: 50869347 markings, 88903404 edges, 670790 markings/sec, 75 secs
lola: 54420194 markings, 95101244 edges, 710169 markings/sec, 80 secs
lola: 57839789 markings, 101073624 edges, 683919 markings/sec, 85 secs
lola: 61429984 markings, 107336999 edges, 718039 markings/sec, 90 secs
lola: 64241849 markings, 112240740 edges, 562373 markings/sec, 95 secs
lola: 66767102 markings, 116649677 edges, 505051 markings/sec, 100 secs
lola: 69438345 markings, 121315046 edges, 534249 markings/sec, 105 secs
lola: 73117342 markings, 127731147 edges, 735799 markings/sec, 110 secs
lola: 76678395 markings, 133948214 edges, 712211 markings/sec, 115 secs
lola: 80190245 markings, 140100147 edges, 702370 markings/sec, 120 secs
lola: 83713727 markings, 146244021 edges, 704696 markings/sec, 125 secs
lola: 86920333 markings, 151843298 edges, 641321 markings/sec, 130 secs
lola: 90249740 markings, 157655066 edges, 665881 markings/sec, 135 secs
lola: 93114063 markings, 162650306 edges, 572865 markings/sec, 140 secs
lola: 95724449 markings, 167207963 edges, 522077 markings/sec, 145 secs
lola: 98457771 markings, 171981842 edges, 546664 markings/sec, 150 secs
lola: 101395682 markings, 177104173 edges, 587582 markings/sec, 155 secs
lola: 103927255 markings, 181523095 edges, 506315 markings/sec, 160 secs
lola: 106430570 markings, 185894642 edges, 500663 markings/sec, 165 secs
lola: 109358535 markings, 191008183 edges, 585593 markings/sec, 170 secs
lola: 113000385 markings, 197356214 edges, 728370 markings/sec, 175 secs
lola: 116423577 markings, 203332758 edges, 684638 markings/sec, 180 secs
lola: 119930912 markings, 209459028 edges, 701467 markings/sec, 185 secs
lola: 123790385 markings, 216188460 edges, 771895 markings/sec, 190 secs
lola: 127480471 markings, 222632411 edges, 738017 markings/sec, 195 secs
lola: 131285445 markings, 229288442 edges, 760995 markings/sec, 200 secs
lola: 134587693 markings, 235053331 edges, 660450 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-320-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (A (((MEKPP_Phase2 <= RasGTP) U (ERKPP_Phase3 <= Raf)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((MEKPP_Phase2 <= RasGTP) U (ERKPP_Phase3 <= Raf)))))
lola: processed formula length: 71
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2369575 markings, 8312441 edges, 473915 markings/sec, 0 secs
lola: 4512693 markings, 15796637 edges, 428624 markings/sec, 5 secs
lola: 6692439 markings, 23421136 edges, 435949 markings/sec, 10 secs
lola: 8744116 markings, 30585214 edges, 410335 markings/sec, 15 secs
lola: 10719242 markings, 37522597 edges, 395025 markings/sec, 20 secs
lola: 12867618 markings, 45091356 edges, 429675 markings/sec, 25 secs
lola: 14983949 markings, 52495353 edges, 423266 markings/sec, 30 secs
lola: 17090711 markings, 59853588 edges, 421352 markings/sec, 35 secs
lola: 19133338 markings, 66988830 edges, 408525 markings/sec, 40 secs
lola: 21170184 markings, 74104786 edges, 407369 markings/sec, 45 secs
lola: 23158804 markings, 81051830 edges, 397724 markings/sec, 50 secs
lola: 25248036 markings, 88349242 edges, 417846 markings/sec, 55 secs
lola: 27337709 markings, 95649273 edges, 417935 markings/sec, 60 secs
lola: 29503280 markings, 103214539 edges, 433114 markings/sec, 65 secs
lola: 31527160 markings, 110299058 edges, 404776 markings/sec, 70 secs
lola: 33493301 markings, 117169582 edges, 393228 markings/sec, 75 secs
lola: 35436954 markings, 123959263 edges, 388731 markings/sec, 80 secs
lola: 37483031 markings, 131102427 edges, 409215 markings/sec, 85 secs
lola: 39543891 markings, 138311599 edges, 412172 markings/sec, 90 secs
lola: 41553454 markings, 145343161 edges, 401913 markings/sec, 95 secs
lola: 43593798 markings, 152469259 edges, 408069 markings/sec, 100 secs
lola: 45554907 markings, 159318286 edges, 392222 markings/sec, 105 secs
lola: 47500524 markings, 166112371 edges, 389123 markings/sec, 110 secs
lola: 49404426 markings, 172761068 edges, 380780 markings/sec, 115 secs
lola: 51405474 markings, 179751052 edges, 400210 markings/sec, 120 secs
lola: 53426228 markings, 186808820 edges, 404151 markings/sec, 125 secs
lola: 55310193 markings, 193388847 edges, 376793 markings/sec, 130 secs
lola: 57265965 markings, 200220279 edges, 391154 markings/sec, 135 secs
lola: 59270304 markings, 207221628 edges, 400868 markings/sec, 140 secs
lola: 61208305 markings, 213988903 edges, 387600 markings/sec, 145 secs
lola: 63264513 markings, 221170587 edges, 411242 markings/sec, 150 secs
lola: 65459904 markings, 228852803 edges, 439078 markings/sec, 155 secs
lola: 67545843 markings, 236151112 edges, 417188 markings/sec, 160 secs
lola: 69503265 markings, 243040626 edges, 391484 markings/sec, 165 secs
lola: 71500377 markings, 250028497 edges, 399422 markings/sec, 170 secs
lola: 73535477 markings, 257173964 edges, 407020 markings/sec, 175 secs
lola: 75596454 markings, 264408583 edges, 412195 markings/sec, 180 secs
lola: 77639204 markings, 271544282 edges, 408550 markings/sec, 185 secs
lola: 79768687 markings, 278980654 edges, 425897 markings/sec, 190 secs
lola: 81787069 markings, 286043421 edges, 403676 markings/sec, 195 secs
lola: 83699676 markings, 292721406 edges, 382521 markings/sec, 200 secs
lola: 85687544 markings, 299666613 edges, 397574 markings/sec, 205 secs
lola: 87647805 markings, 306513513 edges, 392052 markings/sec, 210 secs
lola: 89562994 markings, 313203952 edges, 383038 markings/sec, 215 secs
lola: 91501079 markings, 319987477 edges, 387617 markings/sec, 220 secs
lola: 92963564 markings, 325096636 edges, 292497 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA MAPK-PT-320-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((ERKPP_Phase3 <= ERK_MEKPP) AND (E (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP))) AND (MEKPP_Phase2 <= MEKP)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (MEKPP_Phase2 <= MEKP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MEKPP_Phase2 <= MEKP)
lola: processed formula length: 22
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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: (ERKPP_Phase3 <= ERK_MEKPP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKPP_Phase3 <= ERK_MEKPP)
lola: processed formula length: 27
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-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: E (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP)))
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 (((MEKP <= MEK_RafP) U (RasGTP <= ERKP_MEKPP)))
lola: processed formula length: 49
lola: 41 rewrites
lola: closed formula file MAPK-PT-320-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: (RasGTP <= ERKP_MEKPP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-21-0.sara
lola: state equation: calling and running sara
sara: try reading problem file MAPK-PT-320-CTLCardinality-21-0.sara.

lola: state equation 0: solution produced
lola: sara is running 0 secs || 2909140 markings, 7238338 edges, 581828 markings/sec, 0 secs
lola: sara is running 5 secs || 5906904 markings, 14701519 edges, 599553 markings/sec, 5 secs
lola: sara is running 10 secs || 8896086 markings, 22146227 edges, 597836 markings/sec, 10 secs
lola: sara is running 15 secs || 11713916 markings, 29164677 edges, 563566 markings/sec, 15 secs
lola: sara is running 20 secs || 14521471 markings, 36149928 edges, 561511 markings/sec, 20 secs
lola: sara is running 25 secs || 17327430 markings, 43135676 edges, 561192 markings/sec, 25 secs
lola: sara is running 30 secs || 20156827 markings, 50177169 edges, 565879 markings/sec, 30 secs
lola: sara is running 35 secs || 23056553 markings, 57397357 edges, 579945 markings/sec, 35 secs
lola: sara is running 40 secs || 25987429 markings, 64706712 edges, 586175 markings/sec, 40 secs
lola: sara is running 45 secs || 28851212 markings, 71836785 edges, 572757 markings/sec, 45 secs
lola: sara is running 50 secs || 31586511 markings, 78645026 edges, 547060 markings/sec, 50 secs
lola: sara is running 55 secs || 34436459 markings, 85748413 edges, 569990 markings/sec, 55 secs
lola: sara is running 60 secs || 37307293 markings, 92908282 edges, 574167 markings/sec, 60 secs
lola: sara is running 65 secs || 40172311 markings, 100047276 edges, 573004 markings/sec, 65 secs
lola: sara is running 70 secs || 42947159 markings, 106962676 edges, 554970 markings/sec, 70 secs
lola: sara is running 75 secs || 45814085 markings, 114109362 edges, 573385 markings/sec, 75 secs
lola: sara is running 80 secs || 48580278 markings, 121004497 edges, 553239 markings/sec, 80 secs
lola: sara is running 85 secs || 51432999 markings, 128113506 edges, 570544 markings/sec, 85 secs
lola: sara is running 90 secs || 53993637 markings, 134491715 edges, 512128 markings/sec, 90 secs
lola: sara is running 95 secs || 56606280 markings, 141004775 edges, 522529 markings/sec, 95 secs
lola: sara is running 100 secs || 59189635 markings, 147446123 edges, 516671 markings/sec, 100 secs
lola: sara is running 105 secs || 61760980 markings, 153850743 edges, 514269 markings/sec, 105 secs
lola: sara is running 110 secs || 64430655 markings, 160504545 edges, 533935 markings/sec, 110 secs
lola: sara is running 115 secs || 67033384 markings, 166990571 edges, 520546 markings/sec, 115 secs
lola: sara is running 120 secs || 69592470 markings, 173362554 edges, 511817 markings/sec, 120 secs
lola: sara is running 125 secs || 72198793 markings, 179852473 edges, 521265 markings/sec, 125 secs
lola: sara is running 130 secs || 74998284 markings, 186827559 edges, 559898 markings/sec, 130 secs
lola: sara is running 135 secs || 77799019 markings, 193807954 edges, 560147 markings/sec, 135 secs
lola: sara is running 140 secs || 80570303 markings, 200717360 edges, 554257 markings/sec, 140 secs
lola: sara is running 145 secs || 83237482 markings, 207367021 edges, 533436 markings/sec, 145 secs
lola: sara is running 150 secs || 85912601 markings, 214027476 edges, 535024 markings/sec, 150 secs
lola: sara is running 155 secs || 88581411 markings, 220671939 edges, 533762 markings/sec, 155 secs
lola: sara is running 160 secs || 91340572 markings, 227547702 edges, 551832 markings/sec, 160 secs
lola: sara is running 165 secs || 94046620 markings, 234291242 edges, 541210 markings/sec, 165 secs
lola: sara is running 170 secs || 96820529 markings, 241206680 edges, 554782 markings/sec, 170 secs
lola: sara is running 175 secs || 99252934 markings, 247271737 edges, 486481 markings/sec, 175 secs
lola: sara is running 180 secs || 101658896 markings, 253269003 edges, 481192 markings/sec, 180 secs
lola: sara is running 185 secs || 104094727 markings, 259343936 edges, 487166 markings/sec, 185 secs
lola: sara is running 190 secs || 106657932 markings, 265734958 edges, 512641 markings/sec, 190 secs
lola: sara is running 195 secs || 109374090 markings, 272505024 edges, 543232 markings/sec, 195 secs
lola: sara is running 200 secs || 112133423 markings, 279379623 edges, 551867 markings/sec, 200 secs
lola: sara is running 205 secs || 114927485 markings, 286333289 edges, 558812 markings/sec, 205 secs
lola: sara is running 210 secs || 117645718 markings, 293102070 edges, 543647 markings/sec, 210 secs
lola: sara is running 215 secs || 120515917 markings, 300254889 edges, 574040 markings/sec, 215 secs
lola: sara is running 220 secs || 123244186 markings, 307058450 edges, 545654 markings/sec, 220 secs
lola: sara is running 225 secs || 125872605 markings, 313610273 edges, 525684 markings/sec, 225 secs
lola: sara is running 230 secs || 128603570 markings, 320419051 edges, 546193 markings/sec, 230 secs
lola: sara is running 235 secs || 131218407 markings, 326937149 edges, 522967 markings/sec, 235 secs
lola: sara is running 240 secs || 133761271 markings, 333276321 edges, 508573 markings/sec, 240 secs
lola: sara is running 245 secs || 134405076 markings, 334881130 edges, 128761 markings/sec, 245 secs
lola: sara is running 250 secs || 134419513 markings, 334917219 edges, 2887 markings/sec, 250 secs
lola: sara is running 255 secs || 134460955 markings, 335020715 edges, 8288 markings/sec, 255 secs
lola: sara is running 260 secs || 134497960 markings, 335113171 edges, 7401 markings/sec, 260 secs
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: ========================================
FORMULA MAPK-PT-320-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: ((((RasGTP + 1 <= MEK_RafP) AND (ERKP_MEKPP + 1 <= Raf_RasGTP) AND (1 <= ERKP_Phase3)) OR ((1 <= ERK) AND (RafP <= Phase3))) AND (A (G ((Phase2 + 1 <= Phase1))) OR (A (G ((2 <= MEK_RafP))) AND ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ERKP_MEKPP <= 1) OR (RasGTP + 1 <= MEKP_RafP))
lola: processed formula length: 49
lola: 38 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: processed formula with 2 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: ...considering subproblem: A (G ((2 <= MEK_RafP)))
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 ((2 <= MEK_RafP)))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: ========================================
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: The predicate is not invariant.
lola: formula 0: (MEK_RafP <= 1)
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((Phase2 + 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:695
lola: processed formula: A (G ((Phase2 + 1 <= Phase1)))
lola: processed formula length: 30
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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:695
lola: formula 0: (Phase1 <= Phase2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-22-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: 241 markings, 319 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA MAPK-PT-320-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((MEKPP + 1 <= MEK))) AND (A (G ((MEKP_RafP <= 2))) AND (E (F ((MEKP <= 2))) OR ((RasGTP <= 2) AND (ERKPP_Phase3 + 1 <= MEKPP_Phase2) AND ((RafP <= 0) OR (Phase2 + 1 <= MEKP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F ((MEKP <= 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 ((MEKP <= 2)))
lola: processed formula length: 19
lola: 39 rewrites
lola: closed formula file MAPK-PT-320-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((MEKP_RafP <= 2)))
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:695
lola: processed formula: A (G ((MEKP_RafP <= 2)))
lola: processed formula length: 24
lola: 40 rewrites
lola: closed formula file MAPK-PT-320-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:695
lola: formula 0: (3 <= MEKP_RafP)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-22-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 702 markings, 1055 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA MAPK-PT-320-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: unknown no yes no unknown yes yes yes yes yes unknown no no yes unknown yes
lola:
preliminary result: unknown no yes no unknown yes yes yes yes yes unknown no no yes unknown yes
lola: memory consumption: 22568 KB
lola: time consumption: 1953 seconds

BK_STOP 1527023033130

--------------------
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-320"
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-320.tgz
mv MAPK-PT-320 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-320, 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-152666469200192"
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 ;