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-2979
Executing tool lola
Input is MAPK-PT-080, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000327
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463611732383

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ MAPK-PT-080
FORMULA MAPK-PT-080-CTLCardinality-0 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-3 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-5 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-6 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-8 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-11 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-080-CTLCardinality-14 CANNOT_COMPUTE
FORMULA MAPK-PT-080-CTLCardinality-15 CANNOT_COMPUTE
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-080-CTLCardinality.task
lola: read: (EF (AX (3 <= ERKPP_Phase3)) OR ((((1 <= Phase3 AND MEK <= MEKPP_Phase2) OR (2 <= MEKP_RafP OR 2 <= RasGTP)) OR AG (3 <= MEKP)) AND (!((2 <= RasGTP AND RasGTP <= Phase1)) AND (!(MEKPP_Phase2 <= Phase2) OR (Phase3 <= Phase2 OR 3 <= ERKPP))))) : !(EF (((Phase1 <= RasGTP AND ERKP_MEKPP <= ERKP) AND 2 <= Phase1))) : EF ((3 <= ERKP AND !((1 <= MEK_RafP AND RafP <= Raf_RasGTP)))) : AG ((ERKP_Phase3 <= R... (shortened)
lola: formula length: 1248
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (AX (-ERKPP_Phase3 <= -3)) OR (((-Phase3 <= -1 AND MEK + -MEKPP_Phase2 <= 0) OR (-MEKP_RafP <= -2 OR (-RasGTP <= -2 OR AG (-MEKP <= -3)))) AND ((-RasGTP > -2 OR RasGTP + -Phase1 > 0) AND (-Phase2 + MEKPP_Phase2 > 0 OR (-Phase2 + Phase3 <= 0 OR -ERKPP <= -3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AX (-ERKPP_Phase3 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(-ERKPP_Phase3 <= -3))
lola: processed formula length: 33
lola: 229 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Phase3 <= -1 AND MEK + -MEKPP_Phase2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -MEKP_RafP <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -RasGTP <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-RasGTP > -2 OR RasGTP + -Phase1 > 0) AND (-Phase2 + MEKPP_Phase2 > 0 OR (-Phase2 + Phase3 <= 0 OR -ERKPP <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-RasGTP + Phase1 > 0 OR (ERKP_MEKPP + -ERKP > 0 OR -Phase1 > -2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-ERKP <= -3 AND (-MEK_RafP > -1 OR -Raf_RasGTP + RafP > 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Raf_RasGTP + ERKP_Phase3 <= 0 OR EF (-Phase2 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((-Raf_RasGTP + ERKP_Phase3 <= 0 OR E(TRUE U -Phase2 <= -2)))))
lola: processed formula length: 75
lola: 229 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-RafP_Phase1 > -1 AND (-ERKP + MEKP > 0 AND ((-RafP_Phase1 <= -1 OR -MEK_RafP <= -2) AND -Phase3 > -2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(ERKPP_Phase3 + -MEK <= 0 U AG (-ERKP + ERKP_Phase3 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(ERKPP_Phase3 + -MEK <= 0 U !(E(TRUE U !(-ERKP + ERKP_Phase3 <= 0))))
lola: processed formula length: 70
lola: 229 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EF (-ERK <= -1)) OR -RafP_Phase1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-ERK <= -1))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -ERK <= -1))))
lola: processed formula length: 36
lola: 229 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -RafP_Phase1 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file MAPK-PT-080-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AF (ERKPP_Phase3 + -Raf_RasGTP <= 0) U (-MEKP_RafP <= -3 OR (-ERKP_MEKPP <= -2 OR -MEKPP_Phase2 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U ERKPP_Phase3 + -Raf_RasGTP <= 0) U (-MEKP_RafP <= -3 OR (-ERKP_MEKPP <= -2 OR -MEKPP_Phase2 <= -2)))
lola: processed formula length: 111
lola: 229 rewrites
lola: formula mentions 5 of 22 places; total mentions: 5
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AX (-MEK + MEKPP <= 0) AND EF (-RasGTP + Raf <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((AX(-MEK + MEKPP <= 0) AND E(TRUE U -RasGTP + Raf <= 0)))))
lola: processed formula length: 72
lola: 230 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-MEKP <= -1 AND (-ERK + Raf <= 0 AND -ERK <= -1))) OR E((-ERKP + ERK <= 0 AND -ERKPP_Phase3 + Phase3 <= 0) U -Phase3 > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-MEKP <= -1 AND (-ERK + Raf <= 0 AND -ERK <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ERKPP > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AX (-RasGTP + Raf > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX(-RasGTP + Raf > 0))))
lola: processed formula length: 37
lola: 229 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-MEK > -1 AND (-RafP + Phase1 <= 0 AND (-MEKPP <= -2 AND (-ERKP_MEKPP <= -3 AND -MEK_RafP + MEKPP_Phase2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 911 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((AG (MEKP_RafP + -RasGTP <= 0) OR (ERKPP_Phase3 + -Phase1 <= 0 AND (-MEK <= -3 AND -MEKP_RafP + Phase3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((!(E(TRUE U !(MEKP_RafP + -RasGTP <= 0))) OR (ERKPP_Phase3 + -Phase1 <= 0 AND (-MEK <= -3 AND -MEKP_RafP + Phase3 <= 0))))))
lola: processed formula length: 137
lola: 229 rewrites
lola: formula mentions 6 of 22 places; total mentions: 7
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (Raf_RasGTP + -Phase1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U Raf_RasGTP + -Phase1 > 0))))
lola: processed formula length: 50
lola: 229 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX ((-ERKP_MEKPP + Phase1 <= 0 AND -MEKP_RafP <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((-ERKP_MEKPP + Phase1 <= 0 AND -MEKP_RafP <= -3)))
lola: processed formula length: 62
lola: 229 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-080-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown no yes unknown yes unknown unknown yes unknown yes no unknown yes no unknown unknown

BK_STOP 1463612866182

--------------------
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-080"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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-080.tgz
mv MAPK-PT-080 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is MAPK-PT-080, 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 r062kn-blw3-146358897000327"
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 ;