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 PolyORBLF-PT-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089000770
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463731931610

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBLF-PT-S06J04T04
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-15 TRUE 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: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: read: AG (F (F (X (ScheduleTaskE_Check_4 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_1 <= P_1727)))) : AFetchJobE_3_4 + FetchJobE_1_1 + FetchJobE_4_2 + FetchJobE_1_3 + FetchJobE_3_2 + FetchJobE_2_4 + FetchJobE_1_0 + FetchJobE_4_4 + FetchJobE_2_2 + FetchJobE_4_3 + FetchJobE_2_0 + FetchJobE_1_2 + FetchJobE_4_1 + FetchJobE_1_4 + FetchJobE_2_3 + FetchJobE_3_1 + FetchJobE_3_0 + Fetc... (shortened)
lola: formula length: 4411
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (-P_1727 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_1 <= 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 1616 bytes per marking, with 0 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 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -CanInjectEvent + FetchJobE_4_4 + FetchJobE_4_3 + FetchJobE_4_2 + FetchJobE_4_1 + FetchJobE_4_0 + FetchJobE_3_4 + FetchJobE_3_3 + FetchJobE_3_2 + FetchJobE_3_1 + FetchJobE_3_0 + FetchJobE_2_4 + FetchJobE_2_3 + FetchJobE_2_2 + FetchJobE_2_1 + FetchJobE_2_0 + FetchJobE_1_4 + FetchJobE_1_3 + FetchJobE_1_2 + FetchJobE_1_1 + FetchJobE_1_0 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_Check_Sources_E_2 + -Abort_Check_Sources_E_1 <= -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 1616 bytes per marking, with 0 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 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (F (-MarkerRead <= -3)) U F (-ORB_Lock <= -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 1616 bytes per marking, with 0 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -PollingAbort + QueueJobB_4_4 + QueueJobB_4_3 + QueueJobB_4_2 + QueueJobB_4_1 + QueueJobB_4_0 + QueueJobB_3_4 + QueueJobB_3_3 + QueueJobB_3_2 + QueueJobB_3_1 + QueueJobB_3_0 + QueueJobB_2_4 + QueueJobB_2_3 + QueueJobB_2_2 + QueueJobB_2_1 + QueueJobB_2_0 + QueueJobB_1_4 + QueueJobB_1_3 + QueueJobB_1_2 + QueueJobB_1_1 + QueueJobB_1_0 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(IsMonitoring + -TryAllocateOneTaskE_4 + -TryAllocateOneTaskE_3 + -TryAllocateOneTaskE_2 + -TryAllocateOneTaskE_1 <= 0 U G (P_1716 + -P_1158_4 + -P_1158_3 + -P_1158_2 + -P_1158_1 <= 0))
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 1616 bytes per marking, with 0 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 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_1 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J04T04-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 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (MarkerWrite + -Abort_Check_Sources_B_4 + -Abort_Check_Sources_B_3 + -Abort_Check_Sources_B_2 + -Abort_Check_Sources_B_1 <= 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 1616 bytes per marking, with 0 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((F (-ScheduleTaskE_Idle_4 + AvailableJobId_0 + AvailableJobId_1 + AvailableJobId_2 + AvailableJobId_3 + AvailableJobId_4 + -ScheduleTaskE_Idle_3 + -ScheduleTaskE_Idle_2 + -ScheduleTaskE_Idle_1 <= 0) U -NotifyEventEndOfCheckSourcesB_4 + -NotifyEventEndOfCheckSourcesB_3 + -NotifyEventEndOfCheckSourcesB_2 + -NotifyEventEndOfCheckSourcesB_1 + Idle_4 + Idle_3 + Idle_2 + Idle_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 1616 bytes per marking, with 0 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 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-EnablePollingE_4 + -EnablePollingE_3 + -EnablePollingE_2 + -EnablePollingE_1 + RunB_4 + RunB_3 + RunB_2 + RunB_1 <= 0 U X (ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_2_... (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 1616 bytes per marking, with 0 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 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (-CanInjectEvent + IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4 <= 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 1616 bytes per marking, with 0 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 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (-P_1093 <= -3) U (-DisablePollingE_1_1 + -DisablePollingE_1_2 + -DisablePollingE_1_3 + -DisablePollingE_1_4 + -DisablePollingE_1_5 + -DisablePollingE_1_6 + -DisablePollingE_2_1 + -DisablePollingE_2_2 + -DisablePollingE_2_3 + -DisablePollingE_2_4 + -DisablePollingE_2_5 + -DisablePollingE_2_6 + -DisablePollingE_4_6 + -DisablePollingE_4_5 + -DisablePollingE_4_4 + -DisablePollingE_4_3 + -DisableP... (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 1616 bytes per marking, with 0 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 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 + Perform_Work_E_4 + Perform_Work_E_3 + Perform_Work_E_2 + Perform_Work_E_1 <= 0 U G (-Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 <= -3)))
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 1616 bytes per marking, with 0 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 13 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X ((-IsMonitoring + ScheduleTaskB_4 + ScheduleTaskB_3 + ScheduleTaskB_2 + ScheduleTaskB_1 <= 0 U DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + DataOnSrc_6 + -MarkerRead <= 0)))
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 1616 bytes per marking, with 0 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 14 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (-PollingAbort + P_1717 <= 0)) U F (X (-NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_4_4 + -NotifyEventJobQueuedB_4_3 + -NotifyEventJobQueuedB_4_2 + -NotifyEventJobQueuedB_4_1 + -NotifyEventJobQueuedB_4_0 + -NotifyEventJobQueuedB_3_4 + -NotifyEventJobQueuedB_3_3 + -Notif... (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 1616 bytes per marking, with 0 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 15 will run for 3531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + P_2318_4 + P_2318_3 + P_2318_2 + P_2318_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 1616 bytes per marking, with 0 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: RESULT
lola: summary: no yes no no yes no no no no yes no no no no yes yes
lola: ========================================

BK_STOP 1463731942002

--------------------
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="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 PolyORBLF-PT-S06J04T04, 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 r086kn-ebro-146369089000770"
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 ;