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 ERK-PT-100000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264200381
=====================================================================

--------------------
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 ERK-PT-100000-CTLCardinality-0
FORMULA_NAME ERK-PT-100000-CTLCardinality-1
FORMULA_NAME ERK-PT-100000-CTLCardinality-10
FORMULA_NAME ERK-PT-100000-CTLCardinality-11
FORMULA_NAME ERK-PT-100000-CTLCardinality-12
FORMULA_NAME ERK-PT-100000-CTLCardinality-13
FORMULA_NAME ERK-PT-100000-CTLCardinality-14
FORMULA_NAME ERK-PT-100000-CTLCardinality-15
FORMULA_NAME ERK-PT-100000-CTLCardinality-2
FORMULA_NAME ERK-PT-100000-CTLCardinality-3
FORMULA_NAME ERK-PT-100000-CTLCardinality-4
FORMULA_NAME ERK-PT-100000-CTLCardinality-5
FORMULA_NAME ERK-PT-100000-CTLCardinality-6
FORMULA_NAME ERK-PT-100000-CTLCardinality-7
FORMULA_NAME ERK-PT-100000-CTLCardinality-8
FORMULA_NAME ERK-PT-100000-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494699906366


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ ERK-PT-100000 @ 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: 22/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from ERK-PT-100000-CTLCardinality.task
lola: (A (G (((Raf1Star_RKIP_ERKPP <= 1) OR (Raf1Star_RKIP + 1 <= ERK)))) OR (2 <= MEKPP_ERK)) : (E (F (((ERKPP <= RP) AND (Raf1Star_RKIP <= ERK) AND (RP <= 2)))) OR (A (G (((MEKPP <= RKIP) AND (Raf1Star <= MEKPP)))) AND (((RP <= 2) OR (Raf1Star_RKIP_ERKPP <= 1)) AND ((RKIPP <= 2) OR (MEKPP_ERK <= 1))))) : A (G (TRUE)) : A ((((1 <= Raf1Star_RKIP_ERKPP) AND (RKIP <= Raf1Star_RKIP)) U A (G (TRUE)))) : A (G ((RKIPP_RP <= RP))) : A (F (E (F ((ERK + 1 <= MEKPP_ERK))))) : A (G ((E (X (TRUE)) OR E (G ((ERK <= MEKPP_ERK)))))) : A (G ((A (G ((1 <= MEKPP))) OR E (G ((ERK <= RKIP)))))) : E (((RKIPP_RP <= RKIPP) U ((2 <= RKIP) AND (ERK + 1 <= RKIPP_RP)))) : NOT((A (F ((1 <= RKIPP))) OR NOT(E (F ((RKIP <= ERKPP)))))) : A (G (NOT(A (G ((2 <= MEKPP)))))) : NOT(E (F (((RP <= RKIPP_RP) AND (ERK <= ERKPP) AND (RKIPP + 1 <= MEKPP_ERK))))) : A (G ((1 <= ERK))) : A (G (E (F (((2 <= RKIP) AND (2 <= RKIP)))))) : (E (F (((MEKPP_ERK <= 0) AND (3 <= Raf1Star_RKIP_ERKPP)))) AND E (F ((Raf1Star <= RKIPP)))) : (A (F (A (F ((RKIPP_RP <= Raf1Star_RKIP))))) AND E ((((2 <= RKIP) AND (2 <= RP)) U (ERK <= 0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((Raf1Star_RKIP_ERKPP <= 1) OR (Raf1Star_RKIP + 1 <= ERK)))) OR (2 <= MEKPP_ERK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((Raf1Star_RKIP_ERKPP <= 1) OR (Raf1Star_RKIP + 1 <= ERK))))
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 24 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 ERK-PT-100000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= MEKPP_ERK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MEKPP_ERK)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((ERKPP <= RP) AND (Raf1Star_RKIP <= ERK) AND (RP <= 2)))) OR (A (G (((MEKPP <= RKIP) AND (Raf1Star <= MEKPP)))) AND (((RP <= 2) OR (Raf1Star_RKIP_ERKPP <= 1)) AND ((RKIPP <= 2) OR (MEKPP_ERK <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((ERKPP <= RP) AND (Raf1Star_RKIP <= ERK) AND (RP <= 2))))
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 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ERK-PT-100000-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.tasklola:
========================================
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Raf1Star_RKIP_ERKPP) AND (RKIP <= Raf1Star_RKIP)) U A (G (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((RKIPP_RP <= RP)))
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 24 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 ERK-PT-100000-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((ERK + 1 <= MEKPP_ERK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: A(TRUE U E(TRUE U (ERK + 1 <= MEKPP_ERK)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (TRUE)) OR E (G ((ERK <= MEKPP_ERK))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: lola: ========================================
6 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((1 <= MEKPP))) OR E (G ((ERK <= RKIP))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (MEKPP <= 0)) AND A(TRUE U (RKIP + 1 <= ERK)))))
lola: processed formula length: 71
lola: 8 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5321377 markings, 12347111 edges, 2505789473602666496 markings/sec, 0 secs
lola: 10130905 markings, 24367812 edges, 961906 markings/sec, 5 secs
lola: 14954820 markings, 36425025 edges, 964783 markings/sec, 10 secs
lola: 19699940 markings, 48286926 edges, 949024 markings/sec, 15 secs
lola: 24313276 markings, 59817446 edges, 922667 markings/sec, 20 secs
lola: 28925390 markings, 71345163 edges, 922423 markings/sec, 25 secs
lola: 33508615 markings, 82803179 edges, 916645 markings/sec, 30 secs
lola: 38105832 markings, 94294686 edges, 919443 markings/sec, 35 secs
lola: 42649369 markings, 105653161 edges, 908707 markings/sec, 40 secs
lola: 47164891 markings, 116940989 edges, 903104 markings/sec, 45 secs
lola: 51661622 markings, 128182121 edges, 899346 markings/sec, 50 secs
lola: 56121018 markings, 139327542 edges, 891879 markings/sec, 55 secs
lola: 60519375 markings, 150324692 edges, 879671 markings/sec, 60 secs
lola: 64949528 markings, 161396429 edges, 886031 markings/sec, 65 secs
lola: 69410302 markings, 172547734 edges, 892155 markings/sec, 70 secs
lola: 73796082 markings, 183514361 edges, 877156 markings/sec, 75 secs
lola: 78094970 markings, 194259166 edges, 859778 markings/sec, 80 secs
lola: 82426425 markings, 205084737 edges, 866291 markings/sec, 85 secs
lola: 86776222 markings, 215961307 edges, 869959 markings/sec, 90 secs
lola: 91132929 markings, 226849384 edges, 871341 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((RKIPP_RP <= RKIPP) U ((2 <= RKIP) AND (ERK + 1 <= RKIPP_RP))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((RKIPP_RP <= RKIPP) U ((2 <= RKIP) AND (ERK + 1 <= RKIPP_RP)))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 9 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((1 <= RKIPP))) OR NOT(E (F ((RKIP <= ERKPP))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((RKIPP <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= RKIPP)))
lola: processed formula length: 27
lola: 12 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((RKIP <= ERKPP)))
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 24 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 ERK-PT-100000-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (G ((2 <= MEKPP))))))
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 (MEKPP <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 4306094 markings, 9004220 edges, 3689348869717491712 markings/sec, 0 secs
lola: 7402455 markings, 16740625 edges, 619272 markings/sec, 5 secs
lola: 10438017 markings, 24325813 edges, 607112 markings/sec, 10 secs
lola: 13525806 markings, 32041757 edges, 617558 markings/sec, 15 secs
lola: 16599280 markings, 39723002 edges, 614695 markings/sec, 20 secs
lola: 19646084 markings, 47336508 edges, 609361 markings/sec, 25 secs
lola: 22663205 markings, 54876284 edges, 603424 markings/sec, 30 secs
lola: 25749415 markings, 62591588 edges, 617242 markings/sec, 35 secs
lola: 28845588 markings, 70329386 edges, 619235 markings/sec, 40 secs
lola: 31919843 markings, 78012486 edges, 614851 markings/sec, 45 secs
lola: 35032852 markings, 85791970 edges, 622602 markings/sec, 50 secs
lola: 38036192 markings, 93301054 edges, 600668 markings/sec, 55 secs
lola: 41064613 markings, 100870008 edges, 605684 markings/sec, 60 secs
lola: 44099945 markings, 108454489 edges, 607066 markings/sec, 65 secs
lola: 46539910 markings, 114554529 edges, 487993 markings/sec, 70 secs
lola: 49622714 markings, 122259232 edges, 616561 markings/sec, 75 secs
lola: 52532896 markings, 129533945 edges, 582036 markings/sec, 80 secs
lola: 54828493 markings, 135273394 edges, 459119 markings/sec, 85 secs
lola: 57818478 markings, 142745831 edges, 597997 markings/sec, 90 secs
lola: 60854867 markings, 150335509 edges, 607278 markings/sec, 95 secs
lola: 64009797 markings, 158220515 edges, 630986 markings/sec, 100 secs
lola: 67100983 markings, 165949209 edges, 618237 markings/sec, 105 secs
lola: 70027902 markings, 173265479 edges, 585384 markings/sec, 110 secs
lola: 73077740 markings, 180885553 edges, 609968 markings/sec, 115 secs
lola: 76114326 markings, 188476546 edges, 607317 markings/sec, 120 secs
lola: 79143209 markings, 196049244 edges, 605777 markings/sec, 125 secs
lola: 82134846 markings, 203524813 edges, 598327 markings/sec, 130 secs
lola: 85117402 markings, 210981310 edges, 596511 markings/sec, 135 secs
lola: 88185323 markings, 218650573 edges, 613584 markings/sec, 140 secs
lola: 90453041 markings, 224320320 edges, 453544 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((RP <= RKIPP_RP) AND (ERK <= ERKPP) AND (RKIPP + 1 <= MEKPP_ERK)))))
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 24 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ERK-PT-100000-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 819 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= ERK)))
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 24 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 ERK-PT-100000-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= RKIP) AND (2 <= RKIP))))))
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 ((2 <= RKIP) AND (2 <= RKIP))))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: 4434785 markings, 12843509 edges, 3689348869717491712 markings/sec, 0 secs
lola: 8553294 markings, 24706570 edges, 823702 markings/sec, 5 secs
lola: 12112684 markings, 35740189 edges, 711878 markings/sec, 10 secs
lola: 15670145 markings, 46815183 edges, 711492 markings/sec, 15 secs
lola: 19312662 markings, 58138147 edges, 728503 markings/sec, 20 secs
lola: 22719421 markings, 68858440 edges, 681352 markings/sec, 25 secs
lola: 25715316 markings, 77962435 edges, 599179 markings/sec, 30 secs
lola: 29012389 markings, 88255046 edges, 659415 markings/sec, 35 secs
lola: 32633174 markings, 99400136 edges, 724157 markings/sec, 40 secs
lola: 36154566 markings, 110286842 edges, 704278 markings/sec, 45 secs
lola: 39009440 markings, 119193227 edges, 570975 markings/sec, 50 secs
lola: 42417584 markings, 129747277 edges, 681629 markings/sec, 55 secs
lola: 45940974 markings, 140629728 edges, 704678 markings/sec, 60 secs
lola: 49264993 markings, 151172454 edges, 664804 markings/sec, 65 secs
lola: 52746538 markings, 161983280 edges, 696309 markings/sec, 70 secs
lola: 56383874 markings, 173059656 edges, 727467 markings/sec, 75 secs
lola: 59893758 markings, 183913280 edges, 701977 markings/sec, 80 secs
lola: 63582027 markings, 195157940 edges, 737654 markings/sec, 85 secs
lola: 67082534 markings, 206010142 edges, 700101 markings/sec, 90 secs
lola: 70537723 markings, 216622323 edges, 691038 markings/sec, 95 secs
lola: 73849825 markings, 226905785 edges, 662420 markings/sec, 100 secs
lola: 77386367 markings, 237780603 edges, 707308 markings/sec, 105 secs
lola: 80794712 markings, 248335457 edges, 681669 markings/sec, 110 secs
lola: 84136908 markings, 258502436 edges, 668439 markings/sec, 115 secs
lola: 87532090 markings, 268909797 edges, 679036 markings/sec, 120 secs
lola: 90778226 markings, 279177680 edges, 649227 markings/sec, 125 secs
lola: 94302410 markings, 289822985 edges, 704837 markings/sec, 130 secs
lola: 97380634 markings, 299374952 edges, 615645 markings/sec, 135 secs
lola: 100877682 markings, 310142883 edges, 699410 markings/sec, 140 secs
lola: 104185121 markings, 320399814 edges, 661488 markings/sec, 145 secs
lola: 107395300 markings, 330266379 edges, 642036 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((MEKPP_ERK <= 0) AND (3 <= Raf1Star_RKIP_ERKPP)))) AND E (F ((Raf1Star <= RKIPP))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1559 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((MEKPP_ERK <= 0) AND (3 <= Raf1Star_RKIP_ERKPP))))
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 24 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 ERK-PT-100000-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-14.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3119 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Raf1Star <= RKIPP)))
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 24 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 ERK-PT-100000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file ERK-PT-100000-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3119 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((RKIPP_RP <= Raf1Star_RKIP))))) AND E ((((2 <= RKIP) AND (2 <= RP)) U (ERK <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 15 will run for 3119 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((RKIPP_RP <= Raf1Star_RKIP)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (RKIPP_RP <= Raf1Star_RKIP))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 11 places; total mentions: 0
lola: closed formula file ERK-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: ========================================
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: RESULT
lola:
SUMMARY: no yes yes yes no yes yes unknown yes yes unknown no no unknown yes unknown
FORMULA ERK-PT-100000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ERK-PT-100000-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494700328011

--------------------
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="ERK-PT-100000"
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/ERK-PT-100000.tgz
mv ERK-PT-100000 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 ERK-PT-100000, 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 r028-blw3-149440264200381"
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 ;