About the Execution of LoLa for GPPP-PT-C0010N0000000100
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 GPPP-PT-C0010N0000000100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r218su-smll-146468021200497
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-0
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-1
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-15
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-2
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-3
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-4
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-5
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-6
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-7
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-8
FORMULA_NAME GPPP-PT-C0010N0000000100-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1464894230793
bkconf 3600
===========================================================================================
===========================================================================================
GPPP-PT-C0010N0000000100: translating Petri net model.pnml into LoLA format
GPPP-PT-C0010N0000000100: translating formula UpperBounds into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py UpperBounds.xml
touch formulae;
in benchkit_head lolaszeit 3539
UpperBounds @ GPPP-PT-C0010N0000000100
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-0 76 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-1 200 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-2 10 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-3 30 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-4 70 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-5 10 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-6 114 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-7 10 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-8 10 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-9 30 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-10 20 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-11 200 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-12 4 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-13 40 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-14 10 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA GPPP-PT-C0010N0000000100-UpperBounds-15 100 TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0010N0000000100-UpperBounds.task
lola: read: MAX(NADPH - 0) : MAX(NADplus - 0) : MAX(_1_3_BPG - 0) : MAX(b2 - 0) : MAX(c1 - 0) : MAX(Lac - 0) : MAX(ADP - 0) : MAX(DHAP - 0) : MAX(PEP - 0) : MAX(b2 - 0) : MAX(a1 - 0) : MAX(NADPplus - 0) : MAX(FBP - 0) : MAX(Gluc - 0) : MAX(_2PG - 0) : MAX(GSSG - 0)
lola: formula length: 253
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADPH - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 76
lola: The maximum value of the given expression is 76
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADplus - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 200
lola: The maximum value of the given expression is 200
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_1_3_BPG - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 10
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(b2 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 30
lola: The maximum value of the given expression is 30
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 70
lola: The maximum value of the given expression is 70
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Lac - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 10
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ADP - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 114
lola: The maximum value of the given expression is 114
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(DHAP - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 10
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(PEP - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 10
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(b2 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 30
lola: The maximum value of the given expression is 30
lola: ========================================
lola: subprocess 10 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a1 - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 20
lola: The maximum value of the given expression is 20
lola: ========================================
lola: subprocess 11 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(NADPplus - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 200
lola: The maximum value of the given expression is 200
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FBP - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 4
lola: The maximum value of the given expression is 4
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Gluc - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 40
lola: The maximum value of the given expression is 40
lola: ========================================
lola: subprocess 14 will run for 1602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(_2PG - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 10
lola: The maximum value of the given expression is 10
lola: ========================================
lola: subprocess 15 will run for 3173 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(GSSG - 0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: 100
lola: The maximum value of the given expression is 100
lola: RESULT
lola: summary: 76 200 10 30 70 10 114 10 10 30 20 200 4 40 10 100
lola: ========================================
BK_STOP 1464894614024
--------------------
content from stderr:
parsing of model.pnml complete
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="GPPP-PT-C0010N0000000100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 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 GPPP-PT-C0010N0000000100, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r218su-smll-146468021200497"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
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 ;