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-3254
Executing tool lola
Input is S_HypercubeGrid-PT-C4K3P3B12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649700012
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496346829285


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_HypercubeGrid-PT-C4K3P3B12: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_HypercubeGrid-PT-C4K3P3B12: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_HypercubeGrid-PT-C4K3P3B12 @ 3540 seconds
Makefile:224: recipe for target 'verify' failed
----- Start make result stdout -----
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: 7857/65536 symbol table entries, 1827 collisions
lola: preprocessing...
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6345 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: (NOT(E (X ((1 <= pi_d3_n1_2_1_1_1)))) AND E (F (((pil_d4_n1_1_3_1_4 <= 2) AND (pi_d4_n1_2_2_1_3 + 1 <= po_d1_n1_4_3_3_1))))) : A (X (((pb_d2_n1_2_1_3_2 <= 1) OR A (X ((2 <= pb_d4_n1_3_3_2_3)))))) : (A (F ((1 <= pb_d1_n2_3_1_3_3))) AND A (F (E (G ((3 <= pi_d3_n1_3_2_4_1)))))) : A (G (A (F (((pb_d1_n1_2_1_2_3 <= pi_d1_n1_4_2_1_1) OR (pi_d3_n1_3_3_1_1 <= pol_d4_n1_1_3_1_1)))))) : A (G (NOT(A (F ((3 <= pol_d2_n1_2_1_1_3)))))) : NOT(E ((((2 <= pb_d3_n1_2_3_1_3) OR (2 <= pb_d2_n2_2_2_2_3)) U ((2 <= pil_d2_n1_1_3_2_2) AND (3 <= po_d1_n1_4_3_2_1))))) : (E (F (((pol_d3_n1_1_2_2_3 <= 2) OR (pb_d3_n1_2_1_3_3 <= 2)))) AND (((3 <= pb_d1_n2_2_2_3_2) OR (((3 <= pi_d4_n1_3_1_3_1) OR (pb_d3_n2_3_3_3_2 <= pb_d3_n1_2_2_3_3)) AND (3 <= po_d1_n1_4_2_1_3))) AND E (F (((3 <= pb_d3_n2_3_1_3_1) AND (3 <= pol_d2_n1_3_3_1_2)))))) : NOT(A (G (A (X ((2 <= pb_d4_n2_2_3_3_3)))))) : A (G ((((pi_d2_n1_1_2_2_1 <= 2) OR (pil_d2_n1_1_4_3_2 + 1 <= pi_d3_n1_3_1_4_3)) OR E (G ((2 <= pil_d2_n1_1_1_3_1)))))) : (NOT(A (G ((po_d3_n1_2_3_4_2 <= 2)))) OR ((((pil_d1_n1_4_2_2_1 <= po_d4_n1_3_3_3_4) AND (pb_d4_n2_2_3_1_2 <= po_d4_n1_2_2_3_1)) OR ((2 <= pil_d1_n1_4_3_2_2) AND (po_d2_n1_3_1_3_1 <= po_d4_n1_3_3_1_4)) OR (((2 <= pb_d2_n2_3_2_1_2) OR (pil_d4_n1_3_2_2_4 <= pil_d3_n1_3_1_3_2)) AND (pb_d1_n2_1_1_3_2 + 1 <= pol_d2_n1_2_3_3_1))) OR A (G ((pb_d1_n2_3_3_2_2 + 1 <= pol_d3_n1_3_3_2_1))))) : E (X ((((pol_d3_n1_1_1_2_2 + 1 <= pil_d2_n1_1_2_3_3) OR ((pbl_2_1_3_3 <= po_d4_n1_3_3_3_3) AND (pb_d2_n1_3_3_2_2 <= po_d3_n1_3_1_4_3))) AND A (G ((1 <= pbl_3_3_1_2)))))) : A ((E (F ((pol_d3_n1_1_1_1_1 <= pol_d4_n1_2_2_1_4))) U E (G ((1 <= pb_d1_n1_1_3_3_1))))) : A (F ((A (X ((3 <= pb_d3_n1_2_2_1_2))) AND ((3 <= pol_d2_n1_3_3_3_1) AND (2 <= pi_d4_n1_1_3_2_1) AND ((1 <= pi_d3_n1_1_1_4_3) OR (3 <= pb_d4_n1_3_2_1_1)))))) : E (((pil_d2_n1_1_3_2_3 <= pol_d4_n1_3_1_2_4) U A (X ((1 <= pi_d1_n1_4_2_2_3))))) : NOT((A (((pol_d3_n1_2_1_1_3 <= pb_d2_n1_3_3_3_1) U (3 <= pb_d2_n1_2_2_3_3))) AND E (((1 <= pb_d4_n2_3_1_2_2) U (2 <= po_d3_n1_2_2_4_2))))) : (A (X (E (F ((2 <= pil_d2_n1_1_1_1_3))))) OR (pil_d1_n1_3_2_3_1 <= pi_d3_n1_1_3_4_2))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (X ((1 <= pi_d3_n1_2_1_1_1)))) AND E (F (((pil_d4_n1_1_3_1_4 <= 2) AND (pi_d4_n1_2_2_1_3 + 1 <= po_d1_n1_4_3_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pi_d3_n1_2_1_1_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((pi_d3_n1_2_1_1_1 <= 0))
lola: processed formula length: 27
lola: 4 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d4_n1_1_3_1_4 <= 2) AND (pi_d4_n1_2_2_1_3 + 1 <= po_d1_n1_4_3_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C4K3P3B12-CTLCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((pb_d2_n1_2_1_3_2 <= 1) OR A (X ((2 <= pb_d4_n1_3_3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(((pb_d2_n1_2_1_3_2 <= 1) OR AX((2 <= pb_d4_n1_3_3_2_3))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= pb_d1_n2_3_1_3_3))) AND A (F (E (G ((3 <= pi_d3_n1_3_2_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= pb_d1_n2_3_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= pb_d1_n2_3_1_3_3))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((3 <= pi_d3_n1_3_2_4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (pi_d3_n1_3_2_4_1 <= 2))))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((pb_d1_n1_2_1_2_3 <= pi_d1_n1_4_2_1_1) OR (pi_d3_n1_3_3_1_1 <= pol_d4_n1_1_3_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((pb_d1_n1_2_1_2_3 <= pi_d1_n1_4_2_1_1) OR (pi_d3_n1_3_3_1_1 <= pol_d4_n1_1_3_1_1))))))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 416247 markings, 937734 edges, 2169827236104896512 markings/sec, 0 secs
lola: 886494 markings, 1992164 edges, 94049 markings/sec, 5 secs
lola: 1410238 markings, 3180267 edges, 104749 markings/sec, 10 secs
lola: 1891117 markings, 4301223 edges, 96176 markings/sec, 15 secs
lola: 2398126 markings, 5483055 edges, 101402 markings/sec, 20 secs
lola: 2872471 markings, 6586791 edges, 94869 markings/sec, 25 secs
lola: 3360055 markings, 7721397 edges, 97517 markings/sec, 30 secs
lola: 3876506 markings, 8927876 edges, 103290 markings/sec, 35 secs
lola: 4424196 markings, 10201893 edges, 109538 markings/sec, 40 secs
lola: 4931352 markings, 11379303 edges, 101431 markings/sec, 45 secs
lola: 5476251 markings, 12644342 edges, 108980 markings/sec, 50 secs
lola: 5968760 markings, 13789594 edges, 98502 markings/sec, 55 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (F ((3 <= pol_d2_n1_2_1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (3 <= pol_d2_n1_2_1_1_3))))
lola: processed formula length: 49
lola: 7 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 288641 markings, 938701 edges, 2976971162912817152 markings/sec, 0 secs
lola: 561121 markings, 1825426 edges, 54496 markings/sec, 5 secs
lola: 840589 markings, 2729670 edges, 55894 markings/sec, 10 secs
lola: 1127346 markings, 3687892 edges, 57351 markings/sec, 15 secs
lola: 1440691 markings, 4716866 edges, 62669 markings/sec, 20 secs
lola: 1787356 markings, 5844905 edges, 69333 markings/sec, 25 secs
lola: 2112701 markings, 6915981 edges, 65069 markings/sec, 30 secs
lola: 2428867 markings, 7959495 edges, 63233 markings/sec, 35 secs
lola: 2755284 markings, 9035158 edges, 65283 markings/sec, 40 secs
lola: 3048371 markings, 10002998 edges, 58617 markings/sec, 45 secs
lola: 3374046 markings, 11079042 edges, 65135 markings/sec, 50 secs
lola: 3736344 markings, 12272954 edges, 72460 markings/sec, 55 secs
lola: 4095758 markings, 13456044 edges, 71883 markings/sec, 60 secs
lola: 4466680 markings, 14677261 edges, 74184 markings/sec, 65 secs
lola: 4811313 markings, 15815992 edges, 68927 markings/sec, 70 secs
lola: 5178370 markings, 17024096 edges, 73411 markings/sec, 75 secs
lola: 5498564 markings, 18080979 edges, 64039 markings/sec, 80 secs
lola: 5830868 markings, 19177683 edges, 66461 markings/sec, 85 secs
lola: 6052768 markings, 19988580 edges, 44380 markings/sec, 90 secs
Killed
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496346991064

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

----- Start make prepare stderr -----
----- Start make result stderr -----
make: [verify] Error 137 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_HypercubeGrid-PT-C4K3P3B12"
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/S_HypercubeGrid-PT-C4K3P3B12.tgz
mv S_HypercubeGrid-PT-C4K3P3B12 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_HypercubeGrid-PT-C4K3P3B12, 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 r118-blw7-149441649700012"
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 ;