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 NeoElection-PT-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363810900104
=====================================================================

--------------------
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 NeoElection-COL-5-LTLCardinality-0
FORMULA_NAME NeoElection-COL-5-LTLCardinality-1
FORMULA_NAME NeoElection-COL-5-LTLCardinality-10
FORMULA_NAME NeoElection-COL-5-LTLCardinality-11
FORMULA_NAME NeoElection-COL-5-LTLCardinality-12
FORMULA_NAME NeoElection-COL-5-LTLCardinality-13
FORMULA_NAME NeoElection-COL-5-LTLCardinality-14
FORMULA_NAME NeoElection-COL-5-LTLCardinality-15
FORMULA_NAME NeoElection-COL-5-LTLCardinality-2
FORMULA_NAME NeoElection-COL-5-LTLCardinality-3
FORMULA_NAME NeoElection-COL-5-LTLCardinality-4
FORMULA_NAME NeoElection-COL-5-LTLCardinality-5
FORMULA_NAME NeoElection-COL-5-LTLCardinality-6
FORMULA_NAME NeoElection-COL-5-LTLCardinality-7
FORMULA_NAME NeoElection-COL-5-LTLCardinality-8
FORMULA_NAME NeoElection-COL-5-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463653081884

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ NeoElection-PT-5
FORMULA NeoElection-COL-5-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-1 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-3 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-12 CANNOT_COMPUTE
FORMULA NeoElection-COL-5-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA NeoElection-COL-5-LTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 7764/65536 symbol table entries, 409 collisions
lola: preprocessing...
lola: finding significant places
lola: 3090 places, 4674 transitions, 810 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1524 transition conflict sets
lola: TASK
lola: reading formula from NeoElection-COL-5-LTLCardinality.task
lola: read: AG (G (F (F (2 <= P-electionInit_0 + P-electionInit_1 + P-electionInit_2 + P-electionInit_3 + P-electionInit_4 + P-electionInit_5)))) : AG ((G (2 <= P-network_0_0_AskP_0 + P-network_0_0_AskP_1 + P-network_0_0_AskP_2 + P-network_0_0_AskP_3 + P-network_0_0_AskP_4 + P-network_0_0_AskP_5 + P-network_0_0_AnsP_0 + P-network_0_0_AnsP_1 + P-network_0_0_AnsP_2 + P-network_0_0_AnsP_3 + P-network_0_0_AnsP_4 ... (shortened)
lola: formula length: 248149
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (F (-P-electionInit_5 + -P-electionInit_3 + -P-electionInit_2 + -P-electionInit_0 + -P-electionInit_1 + -P-electionInit_4 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((G (-P-network_3_0_RI_5 + -P-network_3_0_RI_4 + -P-network_3_0_RI_3 + -P-network_3_0_RI_2 + -P-network_3_0_RI_1 + -P-network_2_2_AnnP_1 + -P-network_5_1_AskP_5 + -P-network_5_1_AskP_4 + -P-network_5_1_AskP_3 + -P-network_5_1_AskP_2 + -P-network_5_1_AskP_1 + -P-network_2_2_AnnP_2 + -P-network_2_2_AnnP_3 + -P-network_2_2_AnnP_4 + -P-network_2_2_AnnP_5 + -P-network_1_1_RI_5 + -P-network_1_1_RI_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (X (P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-poll__networl_3_5_RI_1 + P-poll__networl_3_5_RI_0 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1_0_AskP_5 + P-poll__networl_1_0_AskP_4 + P-pol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (P-crashed_0 + P-crashed_1 + P-crashed_2 + P-crashed_3 + P-crashed_4 + P-crashed_5 + -P-dead_0 + -P-dead_1 + -P-dead_2 + -P-dead_3 + -P-dead_4 + -P-dead_5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (F (-P-electedSecondary_0 + -P-electedSecondary_1 + -P-electedSecondary_2 + -P-electedSecondary_3 + -P-electedSecondary_4 + -P-electedSecondary_5 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (-P-electedPrimary_0 + -P-electedPrimary_1 + -P-electedPrimary_2 + -P-electedPrimary_3 + -P-electedPrimary_4 + -P-electedPrimary_5 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 + -P-poll__pollEnd_4 + -P-poll__pollEnd_5 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-5-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (-P-masterState_1_T_5 + -P-masterState_3_F_5 + -P-masterState_0_F_5 + -P-masterState_5_F_5 + -P-masterState_2_F_5 + -P-masterState_4_F_5 + -P-masterState_2_T_0 + -P-masterState_2_T_1 + -P-masterState_2_T_2 + -P-masterState_2_T_3 + -P-masterState_2_T_4 + -P-masterState_2_T_5 + -P-masterState_4_F_4 + -P-masterState_4_F_3 + -P-masterState_4_F_2 + -P-masterState_4_F_1 + -P-masterState_4_F_0 + -P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: P-startNeg__broadcasting_1_5 + P-startNeg__broadcasting_1_4 + P-startNeg__broadcasting_0_5 + P-startNeg__broadcasting_0_4 + -P-electedPrimary_0 + -P-electedPrimary_1 + -P-electedPrimary_2 + -P-electedPrimary_3 + -P-electedPrimary_4 + -P-electedPrimary_5 + P-startNeg__broadcasting_5_5 + P-startNeg__broadcasting_5_4 + P-startNeg__broadcasting_5_3 + P-startNeg__broadcasting_5_2 + P-startNeg__broadcas... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-5-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (P-stage_1_PRIM + P-stage_0_NEG + P-stage_5_NEG + P-stage_4_SEC + P-stage_3_PRIM + P-stage_2_NEG + P-stage_0_PRIM + P-stage_5_PRIM + P-stage_4_NEG + P-stage_2_PRIM + P-stage_1_NEG + P-stage_0_SEC + P-stage_3_SEC + P-stage_1_SEC + -P-poll__pollEnd_0 + -P-poll__pollEnd_1 + -P-poll__pollEnd_2 + -P-poll__pollEnd_3 + -P-poll__pollEnd_4 + -P-poll__pollEnd_5 + P-stage_4_PRIM + P-stage_5_SEC + P-... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -P-polling_5 + -P-polling_4 + -P-polling_3 + -P-polling_2 + -P-polling_1 + -P-polling_0 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file NeoElection-COL-5-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (X (-P-electedSecondary_0 + -P-electedSecondary_1 + -P-electedSecondary_2 + -P-electedSecondary_3 + -P-electedSecondary_4 + -P-electedSecondary_5 <= -3)) U F (-P-electedSecondary_0 + -P-electedSecondary_1 + -P-electedSecondary_2 + -P-electedSecondary_3 + -P-electedSecondary_4 + -P-electedSecondary_5 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-poll__networl_3_5_RI_1 + P-poll__networl_3_5_RI_0 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 + P-poll__networl_3_2_AI_2 + P-poll__networl_3_2_AI_1 + P-poll__networl_3_2_AI_0 + P-poll__networl_1_0_AskP_5 + P-poll__networl_1_0_AskP_4 + P-poll__ne... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (-P-poll__handlingMessage_5 + -P-poll__handlingMessage_4 + -P-poll__handlingMessage_3 + -P-poll__handlingMessage_2 + P-poll__pollEnd_0 + P-poll__pollEnd_1 + P-poll__pollEnd_2 + P-poll__pollEnd_3 + P-poll__pollEnd_4 + P-poll__pollEnd_5 + -P-poll__handlingMessage_0 + -P-poll__handlingMessage_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 14 will run for 998 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (-P-poll__networl_3_5_RI_5 + -P-poll__networl_3_5_RI_4 + -P-poll__networl_3_5_RI_3 + -P-poll__networl_3_5_RI_2 + -P-poll__networl_3_5_RI_1 + -P-poll__networl_3_5_RI_0 + -P-poll__networl_3_2_AI_5 + -P-poll__networl_3_2_AI_4 + -P-poll__networl_3_2_AI_3 + -P-poll__networl_3_2_AI_2 + -P-poll__networl_3_2_AI_1 + -P-poll__networl_3_2_AI_0 + -P-poll__networl_1_0_AskP_5 + -P-poll__networl_1_0_AskP_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 1997 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((-P-electedSecondary_0 + -P-electedSecondary_1 + -P-electedSecondary_2 + -P-electedSecondary_3 + -P-electedSecondary_4 + -P-electedSecondary_5 <= -2 U P-poll__networl_3_5_RI_5 + P-poll__networl_3_5_RI_4 + P-poll__networl_3_5_RI_3 + P-poll__networl_3_5_RI_2 + P-poll__networl_3_5_RI_1 + P-poll__networl_3_5_RI_0 + P-poll__networl_3_2_AI_5 + P-poll__networl_3_2_AI_4 + P-poll__networl_3_2_AI_3 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: RESULT
lola: summary: no unknown no unknown no no no yes yes no no no unknown yes no no

BK_STOP 1463654624919

--------------------
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="NeoElection-PT-5"
export BK_EXAMINATION="LTLCardinality"
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/NeoElection-PT-5.tgz
mv NeoElection-PT-5 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 NeoElection-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r074kn-smll-146363810900104"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;