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)
......
=====================================================================
Generated by BenchKit 2-3254
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 r038-blw7-149440484700210
=====================================================================

--------------------
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-0
FORMULA_NAME MAPK-PT-320-CTLCardinality-1
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
FORMULA_NAME MAPK-PT-320-CTLCardinality-2
FORMULA_NAME MAPK-PT-320-CTLCardinality-3
FORMULA_NAME MAPK-PT-320-CTLCardinality-4
FORMULA_NAME MAPK-PT-320-CTLCardinality-5
FORMULA_NAME MAPK-PT-320-CTLCardinality-6
FORMULA_NAME MAPK-PT-320-CTLCardinality-7
FORMULA_NAME MAPK-PT-320-CTLCardinality-8
FORMULA_NAME MAPK-PT-320-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494630120724


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ MAPK-PT-320 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 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: 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: E (F (((RasGTP <= MEKP_Phase2) AND E (X ((ERKPP_Phase3 <= Phase1)))))) : A (G (((1 <= MEKPP_Phase2) OR (1 <= Raf)))) : (((ERKPP <= Raf_RasGTP) AND E (((ERKP <= MEKPP) U (Phase1 <= MEK_RafP)))) OR A (F (A (F ((1 <= ERKP_MEKPP)))))) : A (G ((E (F ((MEKP_RafP <= MEKP))) AND (ERKP <= RasGTP)))) : A (G ((((ERKPP_Phase3 <= 2) OR (Phase2 + 1 <= Raf)) AND ((Phase2 <= RafP_Phase1) OR (1 <= RasGTP) OR (MEKP_RafP <= Phase3))))) : A (G ((((2 <= ERK) AND (2 <= ERK) AND (RafP_Phase1 + 1 <= RasGTP)) OR (RafP_Phase1 <= MEKPP_Phase2)))) : (NOT(A (((2 <= Phase1) U (ERKPP_Phase3 <= RasGTP)))) OR ((((Raf_RasGTP + 1 <= ERKPP_Phase3)) OR A (G ((2 <= MEK)))) AND E (F (((MEKP <= ERKPP) OR (2 <= MEKPP_Phase2)))))) : E (F (NOT(A (X ((3 <= Phase3)))))) : E (F (E (F (FALSE)))) : A (G ((1 <= Phase2))) : NOT(NOT(E (F (((Phase2 <= RafP_Phase1) AND (2 <= MEKP)))))) : A (G (E (F ((ERKP_MEKPP + 1 <= RasGTP))))) : E ((((MEK_RafP <= 2) AND (Raf_RasGTP <= 1)) U ((MEKPP <= 2) AND (MEK + 1 <= ERKP_Phase3)))) : A (G (E (X ((ERKPP_Phase3 <= 1))))) : E (F (A (X ((Raf <= MEKP))))) : A (G ((E (F ((MEKPP_Phase2 <= RafP_Phase1))) OR ((2 <= MEKP_RafP) AND (3 <= MEKPP) AND (3 <= Raf_RasGTP)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((RasGTP <= MEKP_Phase2) AND E (X ((ERKPP_Phase3 <= Phase1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((RasGTP <= MEKP_Phase2) AND EX((ERKPP_Phase3 <= Phase1))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= MEKPP_Phase2) OR (1 <= Raf))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ERKPP <= Raf_RasGTP) AND E (((ERKP <= MEKPP) U (Phase1 <= MEK_RafP)))) OR A (F (A (F ((1 <= ERKP_MEKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (ERKPP <= Raf_RasGTP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ERKPP <= Raf_RasGTP)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((ERKP <= MEKPP) U (Phase1 <= MEK_RafP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((ERKP <= MEKPP) U (Phase1 <= MEK_RafP))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: 5343808 markings, 9747037 edges, 3224733188970512384 markings/sec, 0 secs
lola: 10608377 markings, 18932928 edges, 1052914 markings/sec, 5 secs
lola: 15677981 markings, 27876288 edges, 1013921 markings/sec, 10 secs
lola: 20566176 markings, 36538992 edges, 977639 markings/sec, 15 secs
lola: 25278347 markings, 45142005 edges, 942434 markings/sec, 20 secs
lola: 30386387 markings, 54040820 edges, 1021608 markings/sec, 25 secs
lola: 35042171 markings, 62372769 edges, 931157 markings/sec, 30 secs
lola: 39545420 markings, 70564136 edges, 900650 markings/sec, 35 secs
lola: 44073106 markings, 78767499 edges, 905537 markings/sec, 40 secs
lola: 48693591 markings, 87174061 edges, 924097 markings/sec, 45 secs
lola: 53516941 markings, 95711788 edges, 964670 markings/sec, 50 secs
lola: 58189636 markings, 104059474 edges, 934539 markings/sec, 55 secs
lola: 62741488 markings, 112247316 edges, 910370 markings/sec, 60 secs
lola: 67033979 markings, 120244643 edges, 858498 markings/sec, 65 secs
lola: 71294967 markings, 128255565 edges, 852198 markings/sec, 70 secs
lola: 75753847 markings, 136346733 edges, 891776 markings/sec, 75 secs
lola: 80537169 markings, 144785622 edges, 956664 markings/sec, 80 secs
lola: 84938950 markings, 152851397 edges, 880356 markings/sec, 85 secs
lola: 89609288 markings, 161214738 edges, 934068 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= ERKP_MEKPP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= ERKP_MEKPP))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ================================================================================

lola: ...considering subproblem: A (G ((E (F ((MEKP_RafP <= MEKP))) AND (ERKP <= RasGTP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((MEKP_RafP <= MEKP)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (MEKP_RafP <= MEKP)))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: 3162551 markings, 11634838 edges, 3096159597753270272 markings/sec, 0 secs
lola: 6156590 markings, 22672690 edges, 598808 markings/sec, 5 secs
lola: 9321935 markings, 33827132 edges, 633069 markings/sec, 10 secs
lola: 12406856 markings, 45326381 edges, 616984 markings/sec, 15 secs
lola: 15021894 markings, 55470282 edges, 523008 markings/sec, 20 secs
lola: 18092844 markings, 66486609 edges, 614190 markings/sec, 25 secs
lola: 21050088 markings, 77392932 edges, 591449 markings/sec, 30 secs
lola: 23841600 markings, 87722507 edges, 558302 markings/sec, 35 secs
lola: 26859167 markings, 98838550 edges, 603513 markings/sec, 40 secs
lola: 29853666 markings, 109731991 edges, 598900 markings/sec, 45 secs
lola: 32552365 markings, 120024281 edges, 539740 markings/sec, 50 secs
lola: 35342769 markings, 130780725 edges, 558081 markings/sec, 55 secs
lola: 38082404 markings, 140925908 edges, 547927 markings/sec, 60 secs
lola: 40806681 markings, 151448759 edges, 544855 markings/sec, 65 secs
lola: 43554445 markings, 161783294 edges, 549553 markings/sec, 70 secs
lola: 46122592 markings, 171721005 edges, 513629 markings/sec, 75 secs
lola: 48765502 markings, 181832990 edges, 528582 markings/sec, 80 secs
lola: 51305934 markings, 191430259 edges, 508086 markings/sec, 85 secs
lola: 53992027 markings, 201330090 edges, 537219 markings/sec, 90 secs
lola: 57000986 markings, 211840836 edges, 601792 markings/sec, 95 secs
lola: 59840281 markings, 222334819 edges, 567859 markings/sec, 100 secs
lola: 62931138 markings, 233708510 edges, 618171 markings/sec, 105 secs
lola: 65829041 markings, 244406916 edges, 579581 markings/sec, 110 secs
lola: 68822488 markings, 255065647 edges, 598689 markings/sec, 115 secs
lola: 71827025 markings, 266136604 edges, 600907 markings/sec, 120 secs
lola: 74811085 markings, 277136509 edges, 596812 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKP <= RasGTP)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((ERKPP_Phase3 <= 2) OR (Phase2 + 1 <= Raf)) AND ((Phase2 <= RafP_Phase1) OR (1 <= RasGTP) OR (MEKP_RafP <= Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= ERK) AND (2 <= ERK) AND (RafP_Phase1 + 1 <= RasGTP)) OR (RafP_Phase1 <= MEKPP_Phase2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((2 <= Phase1) U (ERKPP_Phase3 <= RasGTP)))) OR ((((Raf_RasGTP + 1 <= ERKPP_Phase3)) OR A (G ((2 <= MEK)))) AND E (F (((MEKP <= ERKPP) OR (2 <= MEKPP_Phase2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((Phase1 <= 1) R (RasGTP + 1 <= ERKPP_Phase3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((2 <= Phase1) U (ERKPP_Phase3 <= RasGTP)))
lola: processed formula length: 48
lola: 7 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Raf_RasGTP + 1 <= ERKPP_Phase3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Raf_RasGTP + 1 <= ERKPP_Phase3))
lola: processed formula length: 34
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
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: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= MEK)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-8.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (X ((3 <= Phase3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((Phase3 <= 2)))
lola: processed formula length: 27
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file MAPK-PT-320-CTLCardinality-5.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-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: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Phase2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-9.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: ========================================
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F (((Phase2 <= RafP_Phase1) AND (2 <= MEKP))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-320-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((ERKP_MEKPP + 1 <= RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (ERKP_MEKPP + 1 <= RasGTP)))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: 3312100 markings, 11603012 edges, 662420 markings/sec, 0 secs
lola: 6580477 markings, 23030600 edges, 653675 markings/sec, 5 secs
lola: 9720152 markings, 34019289 edges, 627935 markings/sec, 10 secs
lola: 12802648 markings, 44864215 edges, 616499 markings/sec, 15 secs
lola: 16046250 markings, 56205750 edges, 648720 markings/sec, 20 secs
lola: 19088276 markings, 66831092 edges, 608405 markings/sec, 25 secs
lola: 21972357 markings, 76906145 edges, 576816 markings/sec, 30 secs
lola: 24935593 markings, 87258433 edges, 592647 markings/sec, 35 secs
lola: 27841240 markings, 97409707 edges, 581129 markings/sec, 40 secs
lola: 30762741 markings, 107627382 edges, 584300 markings/sec, 45 secs
lola: 33550304 markings, 117368493 edges, 557513 markings/sec, 50 secs
lola: 36311232 markings, 127012882 edges, 552186 markings/sec, 55 secs
lola: 39444914 markings, 137966150 edges, 626736 markings/sec, 60 secs
lola: 42569676 markings, 148892794 edges, 624952 markings/sec, 65 secs
lola: 45551987 markings, 159308469 edges, 596462 markings/sec, 70 secs
lola: 48345270 markings, 169063550 edges, 558657 markings/sec, 75 secs
lola: 51125522 markings, 178773775 edges, 556050 markings/sec, 80 secs
lola: 54046814 markings, 188976343 edges, 584258 markings/sec, 85 secs
lola: 56810163 markings, 198627371 edges, 552670 markings/sec, 90 secs
lola: 59544073 markings, 208178897 edges, 546782 markings/sec, 95 secs
lola: 62266153 markings, 217682951 edges, 544416 markings/sec, 100 secs
lola: 65293094 markings, 228269432 edges, 605388 markings/sec, 105 secs
lola: 68108889 markings, 238131179 edges, 563159 markings/sec, 110 secs
lola: 70793586 markings, 247561558 edges, 536939 markings/sec, 115 secs
lola: 73791737 markings, 258094894 edges, 599630 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((MEK_RafP <= 2) AND (Raf_RasGTP <= 1)) U ((MEKPP <= 2) AND (MEK + 1 <= ERKP_Phase3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((MEK_RafP <= 2) AND (Raf_RasGTP <= 1)) U ((MEKPP <= 2) AND (MEK + 1 <= ERKP_Phase3)))
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: subprocess 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((ERKPP_Phase3 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((ERKPP_Phase3 <= 1)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: 3792557 markings, 9489119 edges, 758511 markings/sec, 0 secs
lola: 7384422 markings, 18453390 edges, 718373 markings/sec, 5 secs
lola: 10810411 markings, 27030959 edges, 685198 markings/sec, 10 secs
lola: 14381088 markings, 35995442 edges, 714135 markings/sec, 15 secs
lola: 17969813 markings, 44953798 edges, 717745 markings/sec, 20 secs
lola: 21249553 markings, 53132753 edges, 655948 markings/sec, 25 secs
lola: 24535401 markings, 61326025 edges, 657170 markings/sec, 30 secs
lola: 27786203 markings, 69430870 edges, 650160 markings/sec, 35 secs
lola: 31033946 markings, 77542122 edges, 649549 markings/sec, 40 secs
lola: 34136684 markings, 85280158 edges, 620548 markings/sec, 45 secs
lola: 37360003 markings, 93313208 edges, 644664 markings/sec, 50 secs
lola: 40858671 markings, 102057992 edges, 699734 markings/sec, 55 secs
lola: 44244959 markings, 110497161 edges, 677258 markings/sec, 60 secs
lola: 47444093 markings, 118471562 edges, 639827 markings/sec, 65 secs
lola: 50495032 markings, 126076747 edges, 610188 markings/sec, 70 secs
lola: 53725905 markings, 134128523 edges, 646175 markings/sec, 75 secs
lola: 56813395 markings, 141825241 edges, 617498 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((Raf <= MEKP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((Raf <= MEKP)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3718999 markings, 9305690 edges, 3689348869717491712 markings/sec, 0 secs
lola: 7240897 markings, 18095809 edges, 704380 markings/sec, 5 secs
lola: 10693245 markings, 26738285 edges, 690470 markings/sec, 10 secs
lola: 14262827 markings, 35700187 edges, 713916 markings/sec, 15 secs
lola: 17895459 markings, 44768809 edges, 726526 markings/sec, 20 secs
lola: 21188611 markings, 52980690 edges, 658630 markings/sec, 25 secs
lola: 24408505 markings, 61010094 edges, 643979 markings/sec, 30 secs
lola: 27677701 markings, 69160063 edges, 653839 markings/sec, 35 secs
lola: 30959472 markings, 77355889 edges, 656354 markings/sec, 40 secs
lola: 34086955 markings, 85156586 edges, 625497 markings/sec, 45 secs
lola: 37335124 markings, 93251122 edges, 649634 markings/sec, 50 secs
lola: 40860135 markings, 102061337 edges, 705002 markings/sec, 55 secs
lola: 44283678 markings, 110593633 edges, 684709 markings/sec, 60 secs
lola: 47513884 markings, 118645182 edges, 646041 markings/sec, 65 secs
lola: 50593659 markings, 126322224 edges, 615955 markings/sec, 70 secs
lola: 53840868 markings, 134415515 edges, 649442 markings/sec, 75 secs
lola: 56928808 markings, 142112734 edges, 617588 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((MEKPP_Phase2 <= RafP_Phase1))) OR ((2 <= MEKP_RafP) AND (3 <= MEKPP) AND (3 <= Raf_RasGTP)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (MEKPP_Phase2 <= RafP_Phase1))) AND ((MEKP_RafP <= 1) OR (MEKPP <= 2) OR (Raf_RasGTP <= 2)))))
lola: processed formula length: 123
lola: 4 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
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: 3356973 markings, 11762973 edges, 3224733188970512384 markings/sec, 0 secs
lola: 6594694 markings, 23086245 edges, 647544 markings/sec, 5 secs
lola: 9687567 markings, 34058709 edges, 618575 markings/sec, 10 secs
lola: 12710024 markings, 44812187 edges, 604491 markings/sec, 15 secs
lola: 15962304 markings, 56186804 edges, 650456 markings/sec, 20 secs
lola: 18944657 markings, 66863299 edges, 596471 markings/sec, 25 secs
lola: 21829013 markings, 76941240 edges, 576871 markings/sec, 30 secs
lola: 24784371 markings, 87267895 edges, 591072 markings/sec, 35 secs
lola: 27663992 markings, 97472750 edges, 575924 markings/sec, 40 secs
lola: 30536160 markings, 107781040 edges, 574434 markings/sec, 45 secs
lola: 33277510 markings, 117620392 edges, 548270 markings/sec, 50 secs
lola: 35795541 markings, 127515547 edges, 503606 markings/sec, 55 secs
lola: 38732295 markings, 138030502 edges, 587351 markings/sec, 60 secs
lola: 41859434 markings, 148978913 edges, 625428 markings/sec, 65 secs
lola: 44784020 markings, 159600954 edges, 584917 markings/sec, 70 secs
lola: 47534108 markings, 169611560 edges, 550018 markings/sec, 75 secs
lola: 50147193 markings, 179145471 edges, 522617 markings/sec, 80 secs
lola: 52977561 markings, 189435693 edges, 566074 markings/sec, 85 secs
lola: 55716045 markings, 199002331 edges, 547697 markings/sec, 90 secs
lola: 58436664 markings, 208674262 edges, 544124 markings/sec, 95 secs
lola: 61161554 markings, 218284444 edges, 544978 markings/sec, 100 secs
lola: 63899069 markings, 228138084 edges, 547503 markings/sec, 105 secs
lola: 66715141 markings, 238825066 edges, 563214 markings/sec, 110 secs
lola: 69334779 markings, 248186812 edges, 523928 markings/sec, 115 secs
lola: 71847467 markings, 257815113 edges, 502538 markings/sec, 120 secs
lola: 75064098 markings, 269126254 edges, 643326 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown no no no no yes no no yes unknown yes unknown unknown unknown
FORMULA MAPK-PT-320-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494630782977

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
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 r038-blw7-149440484700210"
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 ;