About the Execution of LoLA for MAPK-PT-080
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)
.................................................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is MAPK-PT-080, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100177
=====================================================================
--------------------
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 MAPK-PT-080-UpperBounds-00
FORMULA_NAME MAPK-PT-080-UpperBounds-01
FORMULA_NAME MAPK-PT-080-UpperBounds-02
FORMULA_NAME MAPK-PT-080-UpperBounds-03
FORMULA_NAME MAPK-PT-080-UpperBounds-04
FORMULA_NAME MAPK-PT-080-UpperBounds-05
FORMULA_NAME MAPK-PT-080-UpperBounds-06
FORMULA_NAME MAPK-PT-080-UpperBounds-07
FORMULA_NAME MAPK-PT-080-UpperBounds-08
FORMULA_NAME MAPK-PT-080-UpperBounds-09
FORMULA_NAME MAPK-PT-080-UpperBounds-10
FORMULA_NAME MAPK-PT-080-UpperBounds-11
FORMULA_NAME MAPK-PT-080-UpperBounds-12
FORMULA_NAME MAPK-PT-080-UpperBounds-13
FORMULA_NAME MAPK-PT-080-UpperBounds-14
FORMULA_NAME MAPK-PT-080-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527020214859
info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-080 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-080 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ MAPK-PT-080 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 704
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-UpperBounds.task
lola: MAX(Raf_RasGTP) : MAX(ERKP_MEKPP) : MAX(MEKP_RafP) : MAX(Raf) : MAX(MEKP) : MAX(ERKPP_Phase3) : MAX(MEKP) : MAX(ERKPP_Phase3) : MAX(Phase1) : MAX(Phase1) : MAX(RasGTP) : MAX(MEK) : MAX(MEKPP) : MAX(ERKP_MEKPP) : MAX(MEKP_RafP) : MAX(MEKPP_Phase2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Raf_RasGTP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Raf_RasGTP)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 21 markings, 20 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-0 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ERKP_MEKPP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ERKP_MEKPP)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 52688 markings, 89822 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-1 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEKP_RafP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEKP_RafP)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: 3664521 markings, 6355778 edges, 732904 markings/sec, 0 secs
lola: 7204312 markings, 12567021 edges, 707958 markings/sec, 5 secs
lola: 10917337 markings, 19066318 edges, 742605 markings/sec, 10 secs
lola: 14709125 markings, 25648590 edges, 758358 markings/sec, 15 secs
lola: 18352639 markings, 31978477 edges, 728703 markings/sec, 20 secs
lola: 21870635 markings, 38078140 edges, 703599 markings/sec, 25 secs
lola: 25243064 markings, 43943985 edges, 674486 markings/sec, 30 secs
lola: 28705221 markings, 49972731 edges, 692431 markings/sec, 35 secs
lola: 32346748 markings, 56307743 edges, 728305 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 34224992 markings, 59580739 edges
FORMULA MAPK-PT-080-UpperBounds-2 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Raf)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Raf)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 80
lola: SUBRESULT
lola: result: 80
lola: produced by: state space
lola: The maximum value of the given expression is 80
lola: 0 markings, 0 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-3 80 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEKP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEKP)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 83 markings, 82 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-4 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ERKPP_Phase3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ERKPP_Phase3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 60
lola: SUBRESULT
lola: result: 60
lola: produced by: state space
lola: The maximum value of the given expression is 60
lola: 425 markings, 662 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-5 60 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEKP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEKP)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 83 markings, 82 edges
FORMULA MAPK-PT-080-UpperBounds-6 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ERKPP_Phase3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ERKPP_Phase3)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 60
lola: SUBRESULT
lola: result: 60
lola: produced by: state space
lola: The maximum value of the given expression is 60
lola: 425 markings, 662 edges
FORMULA MAPK-PT-080-UpperBounds-7 60 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Phase1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Phase1)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 60
lola: SUBRESULT
lola: result: 60
lola: produced by: state space
lola: The maximum value of the given expression is 60
lola: 0 markings, 0 edges
FORMULA MAPK-PT-080-UpperBounds-8 60 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Phase1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Phase1)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 60
lola: SUBRESULT
lola: result: 60
lola: produced by: state space
lola: The maximum value of the given expression is 60
lola: 0 markings, 0 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-9 60 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(RasGTP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(RasGTP)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 20
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 0 markings, 0 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-10 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEK)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEK)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 0 markings, 0 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-11 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEKPP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEKPP)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 1441 markings, 2257 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-12 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ERKP_MEKPP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ERKP_MEKPP)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 52688 markings, 89822 edges
FORMULA MAPK-PT-080-UpperBounds-13 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEKP_RafP)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEKP_RafP)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: 3958748 markings, 6865540 edges, 791750 markings/sec, 0 secs
lola: 7669230 markings, 13376503 edges, 742096 markings/sec, 5 secs
lola: 11372846 markings, 19856513 edges, 740723 markings/sec, 10 secs
lola: 15334426 markings, 26734053 edges, 792316 markings/sec, 15 secs
lola: 19163244 markings, 33384134 edges, 765764 markings/sec, 20 secs
lola: 22897755 markings, 39857906 edges, 746902 markings/sec, 25 secs
lola: 26485117 markings, 46098471 edges, 717472 markings/sec, 30 secs
lola: 30219169 markings, 52600638 edges, 746810 markings/sec, 35 secs
lola: 34043371 markings, 59264824 edges, 764840 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 34224992 markings, 59580739 edges
lola:
========================================
FORMULA MAPK-PT-080-UpperBounds-14 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(MEKPP_Phase2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(MEKPP_Phase2)
lola: processed formula length: 17
lola: 0 rewrites
lola: closed formula file MAPK-PT-080-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 40
lola: SUBRESULT
lola: result: 40
lola: produced by: state space
lola: The maximum value of the given expression is 40
lola: 1481 markings, 2297 edges
lola: ========================================
FORMULA MAPK-PT-080-UpperBounds-15 40 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 20 40 40 80 40 60 40 60 60 60 20 40 40 40 40 40
lola:
preliminary result: 20 40 40 80 40 60 40 60 60 60 20 40 40 40 40 40
lola: memory consumption: 17948 KB
lola: time consumption: 93 seconds
BK_STOP 1527020308388
--------------------
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="UpperBounds"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-080.tgz
mv MAPK-PT-080 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is MAPK-PT-080, 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 r112-csrt-152666469100177"
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 ;