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-040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000318
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463610926360

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ MAPK-PT-040
FORMULA MAPK-PT-040-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-3 CANNOT_COMPUTE
FORMULA MAPK-PT-040-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-6 CANNOT_COMPUTE
FORMULA MAPK-PT-040-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-8 CANNOT_COMPUTE
FORMULA MAPK-PT-040-CTLCardinality-9 CANNOT_COMPUTE
FORMULA MAPK-PT-040-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-040-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-040-CTLCardinality.task
lola: read: AG (MEKPP <= ERK) : AF (EF ((MEKP <= Phase1 AND 3 <= MEKPP))) : (EF (EX (3 <= MEKPP_Phase2)) OR (((Phase3 <= RasGTP OR !(2 <= ERKP)) AND (MEK <= RafP_Phase1 AND !(ERK <= Raf))) OR (((1 <= MEKP_RafP AND 2 <= MEK_RafP) AND (3 <= ERKP_Phase3 AND 1 <= Raf)) AND 3 <= ERKP_Phase3))) : E(!((RafP <= RasGTP AND 1 <= ERKP)) U AF (2 <= ERKP_Phase3)) : !(AG (((3 <= MEK_RafP AND Phase3 <= RafP_Phase1) OR (Phas... (shortened)
lola: formula length: 1058
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (MEKPP + -ERK <= 0)
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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF ((-Phase1 + MEKP <= 0 AND -MEKPP <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (-Phase1 + MEKP <= 0 AND -MEKPP <= -3)))
lola: processed formula length: 58
lola: 220 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-040-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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (EX (-MEKPP_Phase2 <= -3)) OR (((-RasGTP + Phase3 <= 0 OR -ERKP > -2) AND (MEK + -RafP_Phase1 <= 0 AND ERK + -Raf > 0)) OR (-MEKP_RafP <= -1 AND (-MEK_RafP <= -2 AND (-ERKP_Phase3 <= -3 AND (-Raf <= -1 AND -ERKP_Phase3 <= -3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (-MEKPP_Phase2 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(-MEKPP_Phase2 <= -3))
lola: processed formula length: 33
lola: 220 rewrites
lola: formula mentions 1 of 22 places; total mentions: 1
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((RafP + -RasGTP > 0 OR -ERKP > -1) U AF (-ERKP_Phase3 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((RafP + -RasGTP > 0 OR -ERKP > -1) U A(TRUE U -ERKP_Phase3 <= -2))
lola: processed formula length: 68
lola: 220 rewrites
lola: formula mentions 4 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-040-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 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-MEK_RafP > -3 OR -RafP_Phase1 + Phase3 > 0) AND (-MEK + Phase2 > 0 AND -Phase1 > -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 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EX (MEKP + -MEKPP_Phase2 <= 0) U AX (-ERK_MEKPP <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(MEKP + -MEKPP_Phase2 <= 0) U AX(-ERK_MEKPP <= -1))
lola: processed formula length: 55
lola: 221 rewrites
lola: formula mentions 3 of 22 places; total mentions: 3
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AF (-Raf_RasGTP <= -3) AND EG (-MEKP_RafP <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(TRUE U -Raf_RasGTP <= -3) AND !(A(TRUE U !(-MEKP_RafP <= -3)))))
lola: processed formula length: 76
lola: 221 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-040-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 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (MEK + -ERK_MEKPP <= 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 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ERKP_Phase3 <= -2 OR (-ERKP <= -2 OR (-ERK_MEKPP + RafP_Phase1 > 0 OR ERKP_MEKPP + -Phase3 <= 0))))
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: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (MEKP_RafP + -Phase1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U MEKP_RafP + -Phase1 > 0))
lola: processed formula length: 43
lola: 220 rewrites
lola: formula mentions 2 of 22 places; total mentions: 2
lola: closed formula file MAPK-PT-040-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 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Phase2 + -MEKPP <= 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 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Phase2 > -2 AND -MEKP_Phase2 > -1) R -Raf_RasGTP + Phase2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((-Phase2 > -2 AND -MEKP_Phase2 > -1)) U !(-Raf_RasGTP + Phase2 > 0)))
lola: processed formula length: 75
lola: 219 rewrites
lola: formula mentions 3 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-040-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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-ERKPP_Phase3 > -2 OR -ERKP_Phase3 + Phase1 > 0))
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 13 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EG (MEK + -MEKP_RafP <= 0) U EF (MEK + -MEKP_Phase2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(A(TRUE U !(MEK + -MEKP_RafP <= 0))) U E(TRUE U MEK + -MEKP_Phase2 <= 0))
lola: processed formula length: 76
lola: 221 rewrites
lola: formula mentions 3 of 22 places; total mentions: 4
lola: closed formula file MAPK-PT-040-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 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((MEK + -MEKP <= 0 AND -ERKP_MEKPP + Phase1 <= 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 15 will run for 2878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((EF (-Phase1 <= -2) OR (-MEK_RafP > -1 AND (Phase2 + -ERK <= 0 OR -MEKPP <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((E(TRUE U -Phase1 <= -2) OR (-MEK_RafP > -1 AND (Phase2 + -ERK <= 0 OR -MEKPP <= -1))))))
lola: processed formula length: 102
lola: 220 rewrites
lola: formula mentions 5 of 22 places; total mentions: 5
lola: closed formula file MAPK-PT-040-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: RESULT
lola: summary: no yes yes unknown yes yes unknown yes unknown unknown yes no no yes yes unknown

BK_STOP 1463611727910

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