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

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

=== Now, execution of the tool begins

BK_START 1463737760371

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBLF-PT-S06J06T06
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-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: 11440/65536 symbol table entries, 6628 collisions
lola: preprocessing...
lola: finding significant places
lola: 700 places, 10740 transitions, 642 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3155 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: read: AG (G (F (3 <= Try_Check_Sources_E_6 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_1))) : A(F (X (1 <= BlockedTasks)) U (3 <= MarkerWrite U 2 <= NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2)) : A3 <= Abort_C... (shortened)
lola: formula length: 4466
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 (G (F (-Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_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 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2568 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: A(F (X (-BlockedTasks <= -1)) U (-MarkerWrite <= -3 U -NotifyEventSourceAddedB_6 + -NotifyEventSourceAddedB_5 + -NotifyEventSourceAddedB_4 + -NotifyEventSourceAddedB_3 + -NotifyEventSourceAddedB_2 + -NotifyEventSourceAddedB_1 <= -2))
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 2568 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 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Abort_Check_Sources_E_6 + -Abort_Check_Sources_E_5 + -Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_Check_Sources_E_2 + -Abort_Check_Sources_E_1 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 <= -2 U -P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_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 2568 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 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (-NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 + ProcessingEvt_6 + ProcessingEvt_5 + ProcessingEvt_4 + ProcessingEvt_3 + ProcessingEvt_2 + ProcessingEvt_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 2568 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 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (-ScheduleTaskB_6 + -ScheduleTaskB_5 + -ScheduleTaskB_4 + -ScheduleTaskB_3 + -ScheduleTaskB_2 + -ScheduleTaskB_1 + EnablePollingE_6 + EnablePollingE_5 + EnablePollingE_4 + EnablePollingE_3 + EnablePollingE_2 + EnablePollingE_1 <= 0)) U -P_1725_6 + -P_1725_5 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= -3)
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 2568 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (G (-P_1726 <= -3))))
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 2568 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 7 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (-P_1727 <= -1)) U F (X (-P_1160_6 + -P_1160_2 + -P_1160_1 + -P_1160_3 + -P_1160_4 + -P_1160_5 + ORB_Lock <= 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 2568 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 8 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -NotifyEventJobQueuedE_6 + -NotifyEventJobQueuedE_5 + -NotifyEventJobQueuedE_4 + -NotifyEventJobQueuedE_3 + -NotifyEventJobQueuedE_2 + -NotifyEventJobQueuedE_1 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.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 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-RunB_6 + -RunB_5 + -RunB_4 + -RunB_3 + -RunB_2 + -RunB_1 + EnablePollingB_6 + EnablePollingB_5 + EnablePollingB_4 + EnablePollingB_3 + EnablePollingB_2 + EnablePollingB_1 <= 0 U -TryAllocateOneTaskE_6 + -TryAllocateOneTaskE_5 + -TryAllocateOneTaskE_4 + -TryAllocateOneTaskE_3 + -TryAllocateOneTaskE_2 + -TryAllocateOneTaskE_1 <= -3) U -cIdleTasks <= -3)
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 2568 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 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-CreatedJobs_6_6 + -CreatedJobs_6_5 + -CreatedJobs_6_4 + -CreatedJobs_6_3 + -CreatedJobs_6_2 + -CreatedJobs_6_1 + -CreatedJobs_5_6 + -CreatedJobs_5_5 + -CreatedJobs_5_4 + -CreatedJobs_5_3 + -CreatedJobs_5_2 + -CreatedJobs_5_1 + -CreatedJobs_4_6 + -CreatedJobs_4_5 + -CreatedJobs_4_4 + -CreatedJobs_4_3 + -CreatedJobs_4_2 + -CreatedJobs_4_1 + -CreatedJobs_3_6 + -CreatedJobs_3_5 + -CreatedJobs_3_4 +... (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 2568 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 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (G (FetchJobB_6 + FetchJobB_5 + FetchJobB_4 + FetchJobB_3 + FetchJobB_2 + FetchJobB_1 + -ProcessingEvt_6 + -ProcessingEvt_5 + -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_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 2568 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 <= -2 U -NotifyEventSourceAddedB_6 + -NotifyEventSourceAddedB_5 + -NotifyEventSourceAddedB_4 + -NotifyEventSourceAddedB_3 + -NotifyEventSourceAddedB_2 + -NotifyEventSourceAddedB_1 <= -3) U -P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 <= -1)
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 2568 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 850 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (X (-AbourtToModifySrc_6 + -AbourtToModifySrc_5 + -AbourtToModifySrc_4 + -AbourtToModifySrc_3 + -AbourtToModifySrc_2 + -AbourtToModifySrc_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 2568 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 1275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (F (-P_1158_6 + -P_1158_5 + -P_1158_4 + -P_1158_3 + -P_1158_2 + -P_1158_1 <= -1)))
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 2568 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 15 will run for 2550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (G (-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_6_6 + -DisablePollingE_6_5 + -DisablePollingE_6_4 + -DisablePollingE_6_3 + -DisablePollingE_6_... (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 2568 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: RESULT
lola: summary: no no no yes no unknown no yes no no no unknown no no no no
lola: ========================================

BK_STOP 1463738751692

--------------------
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-S06J06T06"
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-S06J06T06.tgz
mv PolyORBLF-PT-S06J06T06 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-S06J06T06, 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-146369089000806"
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 ;