fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469100171
Last Updated
June 26, 2018

About the Execution of LoLA for MAPK-PT-040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15917.690 1122077.00 212825.00 943.50 T??T?T?T?FF?T??F normal

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 192K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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-040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100171
=====================================================================


--------------------
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-00
FORMULA_NAME MAPK-PT-040-CTLCardinality-01
FORMULA_NAME MAPK-PT-040-CTLCardinality-02
FORMULA_NAME MAPK-PT-040-CTLCardinality-03
FORMULA_NAME MAPK-PT-040-CTLCardinality-04
FORMULA_NAME MAPK-PT-040-CTLCardinality-05
FORMULA_NAME MAPK-PT-040-CTLCardinality-06
FORMULA_NAME MAPK-PT-040-CTLCardinality-07
FORMULA_NAME MAPK-PT-040-CTLCardinality-08
FORMULA_NAME MAPK-PT-040-CTLCardinality-09
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

=== Now, execution of the tool begins

BK_START 1527020076648

info: Time: 3600 - MCC
===========================================================================================
prep: translating MAPK-PT-040 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating MAPK-PT-040 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ MAPK-PT-040 @ 3570 seconds
lola: LoLA will run for 3570 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-040-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: always true
lola: E (F (E (X ((3 <= MEKPP))))) : ((RasGTP <= ERKP_MEKPP) OR E (F (A (G ((Phase2 <= ERKPP)))))) : (E (G (((RafP + 1 <= ERKP) AND ((1 <= ERKP) OR (3 <= MEKPP))))) OR E (F ((((ERK_MEKPP <= RafP_Phase1) OR (ERKP <= MEK_RafP)) AND (Raf <= 2))))) : A (G ((() OR A (G ((RasGTP <= Raf_RasGTP)))))) : (A (((2 <= RafP) U ((1 <= Raf) AND (2 <= ERK_MEKPP)))) OR (E (F (((3 <= ERK_MEKPP) AND (2 <= RasGTP)))) AND (((ERKP <= Phase1) OR (2 <= Raf) OR ((MEKPP <= MEKPP_Phase2) AND (1 <= MEKPP_Phase2))) OR A (G ((1 <= MEKP_Phase2)))))) : A (G (TRUE)) : A (G ((((RasGTP + 1 <= RafP_Phase1) AND ((MEK <= RafP) OR (2 <= ERKP_MEKPP))) OR E (F ((RafP_Phase1 <= RafP)))))) : E (X (E (((ERKP <= RafP) U (3 <= MEKPP_Phase2))))) : (E (X (E (F ((Phase2 <= MEKPP_Phase2))))) AND ((A (G ((Phase1 <= Phase2))) OR (1 <= ERKPP_Phase3)) OR (RafP_Phase1 <= 1))) : E (G (NOT(E (F ((3 <= ERKPP_Phase3)))))) : E (F (NOT(A (G (TRUE))))) : A (F (A (G (((1 <= Raf) OR (MEKP_Phase2 <= ERKP_MEKPP)))))) : E (F (A (X ((RasGTP + 1 <= ERKP_Phase3))))) : A (G (E (((MEKP_Phase2 <= Raf) U (2 <= MEKP_Phase2))))) : E (F (A (G ((3 <= Phase3))))) : NOT(E ((() U (Phase3 <= 1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file MAPK-PT-040-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: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-040-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file MAPK-PT-040-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: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-040-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA MAPK-PT-040-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (((ERKP <= RafP) U (3 <= MEKPP_Phase2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(E((ERKP <= RafP) U (3 <= MEKPP_Phase2)))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 510561 markings, 1152987 edges

FORMULA MAPK-PT-040-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((Phase2 <= MEKPP_Phase2))))) AND (A (G ((Phase1 <= Phase2))) OR ((1 <= ERKPP_Phase3) OR (RafP_Phase1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown yes unknown yes unknown unknown no unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 22424 KB
lola: time consumption: 298 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= MEKPP)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (3 <= MEKPP)
lola: processed formula length: 12
lola: 25 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 618 markings, 956 edges
lola: ========================================

FORMULA MAPK-PT-040-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((RasGTP + 1 <= ERKP_Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((RasGTP + 1 <= ERKP_Phase3)))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 2005 markings, 4733 edges
lola: ========================================

FORMULA MAPK-PT-040-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ERKPP_Phase3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((ERKPP_Phase3 <= 2)))
lola: processed formula length: 27
lola: 26 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (3 <= ERKPP_Phase3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to MAPK-PT-040-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 35 edges

FORMULA MAPK-PT-040-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 328 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Phase3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((2 <= Phase3)))
lola: processed formula length: 21
lola: 26 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (Phase3 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 94 markings, 122 edges
lola:
lola: ========================================
========================================
FORMULA MAPK-PT-040-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= Phase3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Phase3 <= 2)
lola: processed formula length: 13
lola: 26 rewrites
lola: closed formula file MAPK-PT-040-CTLCardinality.task
sara: try reading problem file MAPK-PT-040-CTLCardinality-7-0.sara.
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
sara: warning, failure of lp_solve (at job 586)

lola: 4280156 markings, 8063949 edges, 856031 markings/sec, 0 secs
lola: 8241566 markings, 15543286 edges, 792282 markings/sec, 5 secs
lola: 12133182 markings, 22899943 edges, 778323 markings/sec, 10 secs
lola: 15919847 markings, 30070887 edges, 757333 markings/sec, 15 secs
lola: 19809556 markings, 37419864 edges, 777942 markings/sec, 20 secs
lola: 23531640 markings, 44462825 edges, 744417 markings/sec, 25 secs
lola: 27184615 markings, 51384015 edges, 730595 markings/sec, 30 secs
lola: 30780510 markings, 58189674 edges, 719179 markings/sec, 35 secs
lola: 34597953 markings, 65390591 edges, 763489 markings/sec, 40 secs
lola: 38270397 markings, 72337192 edges, 734489 markings/sec, 45 secs
lola: 41989246 markings, 79372689 edges, 743770 markings/sec, 50 secs
lola: 45926655 markings, 86796524 edges, 787482 markings/sec, 55 secs
lola: 49661503 markings, 93857429 edges, 746970 markings/sec, 60 secs
lola: 53306138 markings, 100755924 edges, 728927 markings/sec, 65 secs
lola: 56910340 markings, 107560957 edges, 720840 markings/sec, 70 secs
lola: 60487837 markings, 114327814 edges, 715499 markings/sec, 75 secs
lola: 64052423 markings, 121069136 edges, 712917 markings/sec, 80 secs
lola: 67715551 markings, 127995089 edges, 732626 markings/sec, 85 secs
lola: 71274663 markings, 134730886 edges, 711822 markings/sec, 90 secs
lola: 74808731 markings, 141414431 edges, 706814 markings/sec, 95 secs
lola: 78432399 markings, 148251465 edges, 724734 markings/sec, 100 secs
lola: 81931958 markings, 154878304 edges, 699912 markings/sec, 105 secs
lola: 85488879 markings, 161616216 edges, 711384 markings/sec, 110 secs
lola: 89125291 markings, 168488418 edges, 727282 markings/sec, 115 secs
lola: 92692020 markings, 175237420 edges, 713346 markings/sec, 120 secs
lola: 96192980 markings, 181865583 edges, 700192 markings/sec, 125 secs
lola: 99907777 markings, 188887948 edges, 742959 markings/sec, 130 secs
lola: 103645963 markings, 195978717 edges, 747637 markings/sec, 135 secs
lola: 107402967 markings, 203103826 edges, 751401 markings/sec, 140 secs
lola: 111077508 markings, 210073483 edges, 734908 markings/sec, 145 secs
lola: 114758139 markings, 217064478 edges, 736126 markings/sec, 150 secs
lola: 118429276 markings, 224024222 edges, 734227 markings/sec, 155 secs
lola: 122080129 markings, 230949960 edges, 730171 markings/sec, 160 secs
lola: 125904737 markings, 238174711 edges, 764922 markings/sec, 165 secs
lola: 128226665 markings, 242581609 edges, 464386 markings/sec, 170 secs
lola: 128292581 markings, 242705397 edges, 13183 markings/sec, 175 secs

BK_STOP 1527021198725

--------------------
content from stderr:

Killed

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="/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-040.tgz
mv MAPK-PT-040 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-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 r112-csrt-152666469100171"
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 ;