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 Raft-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140400165
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463730449708

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Raft-PT-05
FORMULA Raft-PT-05-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-05-CTLCardinality-1 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-2 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-3 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-4 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-5 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-05-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-05-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-9 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-05-CTLCardinality-11 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-05-CTLCardinality-13 CANNOT_COMPUTE
FORMULA Raft-PT-05-CTLCardinality-14 CANNOT_COMPUTE
FORMULA Raft-PT-05-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: 371/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 133 places, 238 transitions, 108 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 232 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-05-CTLCardinality.task
lola: read: E((!(1 <= p7) OR (p109 <= p114 OR p60 <= p31)) U 1 <= p117) : EG (AG ((p127 <= p14 OR p24 <= p132))) : E(AF (1 <= p115) U 2 <= p49) : E(!(!(p41 <= p72)) U AG (p55 <= p58)) : EF (!(!((p29 <= p47 AND 2 <= p116)))) : !((((2 <= p71 OR (3 <= p17 AND 2 <= p120)) OR EF (3 <= p86)) OR (EX (2 <= p37) AND (2 <= p29 AND (p82 <= p45 OR 1 <= p58))))) : (!((AG (p124 <= p55) AND !((1 <= p24 AND 1 <= p25)))) AND ... (shortened)
lola: formula length: 1010
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-p7 > -1 OR (-p114 + p109 <= 0 OR p60 + -p31 <= 0)) U -p117 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-p7 > -1 OR (-p114 + p109 <= 0 OR p60 + -p31 <= 0)) U -p117 <= -1)
lola: processed formula length: 69
lola: 286 rewrites
lola: formula mentions 6 of 133 places; total mentions: 6
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG ((-p14 + p127 <= 0 OR p24 + -p132 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !((-p14 + p127 <= 0 OR p24 + -p132 <= 0)))))))
lola: processed formula length: 70
lola: 287 rewrites
lola: formula mentions 4 of 133 places; total mentions: 4
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AF (-p115 <= -1) U -p49 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U -p115 <= -1) U -p49 <= -2)
lola: processed formula length: 37
lola: 287 rewrites
lola: formula mentions 2 of 133 places; total mentions: 2
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-p72 + p41 <= 0 U AG (p55 + -p58 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-p72 + p41 <= 0 U !(E(TRUE U !(p55 + -p58 <= 0))))
lola: processed formula length: 52
lola: 287 rewrites
lola: formula mentions 4 of 133 places; total mentions: 4
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p47 + p29 <= 0 AND -p116 <= -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 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p71 > -2 AND ((-p17 > -3 OR -p120 > -2) AND (AG (-p86 > -3) AND (AX (-p37 > -2) OR (-p29 > -2 OR (-p45 + p82 > 0 AND -p58 > -1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p71 > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p17 > -3 OR -p120 > -2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p86 > -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 432 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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF (-p55 + p124 > 0) OR (-p24 <= -1 AND -p25 <= -1)) AND (p65 + -p41 > 0 OR (p71 + -p77 > 0 OR ((-p81 > -1 AND (p69 + -p111 <= 0 OR -p77 <= -1)) OR AG ((-p83 <= -2 AND -p76 <= -2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p55 + p124 > 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 432 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 7 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: p65 + -p41 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: p71 + -p77 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p81 > -1 AND (p69 + -p111 <= 0 OR -p77 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EF ((p45 + -p74 <= 0 AND p95 + -p60 <= 0)) OR ((-p39 + p88 > 0 AND -p72 > -3) OR (p42 + -p114 > 0 AND (-p110 <= -1 AND -p100 <= -1)))) AND EF ((-p5 + p102 <= 0 AND (-p62 <= -1 AND p95 + -p57 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((p45 + -p74 <= 0 AND p95 + -p60 <= 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 432 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 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p5 + p102 <= 0 AND (-p62 <= -1 AND p95 + -p57 <= 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 432 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 8 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p105 <= -3)
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 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-p94 <= -1 OR -p37 + p104 <= 0) AND (-p78 + p4 <= 0 AND (p99 + -p42 <= 0 AND AG (p30 + -p71 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((-p94 <= -1 OR -p37 + p104 <= 0) AND (-p78 + p4 <= 0 AND (p99 + -p42 <= 0 AND !(E(TRUE U !(p30 + -p71 <= 0)))))))
lola: processed formula length: 123
lola: 287 rewrites
lola: formula mentions 9 of 133 places; total mentions: 9
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p15 > -1 AND (p31 + -p23 > 0 AND ((p95 + -p73 <= 0 OR -p47 + p107 <= 0) AND p74 + -p66 > 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 432 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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (p99 + -p86 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(p99 + -p86 > 0))))
lola: processed formula length: 40
lola: 287 rewrites
lola: formula mentions 2 of 133 places; total mentions: 2
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (p77 + -p100 <= 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 432 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 471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p100 > -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 432 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF (-p39 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U -p39 <= -3))
lola: processed formula length: 30
lola: 287 rewrites
lola: formula mentions 1 of 133 places; total mentions: 1
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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 611 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF ((p94 + -p7 <= 0 AND -p30 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U (p94 + -p7 <= 0 AND -p30 <= -3)))))
lola: processed formula length: 57
lola: 287 rewrites
lola: formula mentions 3 of 133 places; total mentions: 3
lola: closed formula file Raft-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 432 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: yes unknown unknown unknown unknown unknown yes yes unknown unknown yes unknown no unknown unknown unknown

BK_STOP 1463733711865

--------------------
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="Raft-PT-05"
export BK_EXAMINATION="CTLCardinality"
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/Raft-PT-05.tgz
mv Raft-PT-05 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 Raft-PT-05, 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 r098kn-smll-146369140400165"
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 ;