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 DLCround-PT-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961900348
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496543456403


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


checking for too many tokens
===========================================================================================
DLCround-PT-11a: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLFireability @ DLCround-PT-11a @ 3540 seconds
----- 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: 3370/65536 symbol table entries, 452 collisions
lola: preprocessing...
lola: finding significant places
lola: 377 places, 2993 transitions, 133 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2646 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-11a-LTLFireability.task
lola: A (F (G (G (X (F (FIREABLE(t1125))))))) : A (FIREABLE(t514)) : A (F ((G (X (FIREABLE(t378))) U G (FIREABLE(t77))))) : A ((G (X (X (FIREABLE(t2514)))) U FIREABLE(t985))) : A (F (G (F (F (X (FIREABLE(t817))))))) : A ((X (F (FIREABLE(t1312))) U (G (FIREABLE(t347)) U X (FIREABLE(t1215))))) : A (F (X (FIREABLE(t627)))) : A (F (X (X (FIREABLE(t505))))) : A (((X (FIREABLE(t153)) U FIREABLE(t1110)) U FIREABLE(t2262))) : A (G (FIREABLE(t1893))) : A (FIREABLE(t1028)) : A (F ((G (G (FIREABLE(t2826))) U (FIREABLE(t753) U FIREABLE(t909))))) : A (FIREABLE(t1706)) : A (G (G (F (G (FIREABLE(t2477)))))) : A (G ((FIREABLE(t520) U G (X (FIREABLE(t737)))))) : A (FIREABLE(t74))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (X (F (FIREABLE(t1125)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (X (F (FIREABLE(t1125)))))))
lola: processed formula: A (F (G (G (X (F (FIREABLE(t1125)))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 102008 markings, 4905979 edges, 20402 markings/sec, 0 secs
lola: 205012 markings, 9945161 edges, 20601 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t514))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t514)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G (X (FIREABLE(t378))) U G (FIREABLE(t77)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (X (FIREABLE(t378))) U G (FIREABLE(t77)))))
lola: processed formula: A (F ((G (X (FIREABLE(t378))) U G (FIREABLE(t77)))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X (X (FIREABLE(t2514)))) U FIREABLE(t985)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X (X (FIREABLE(t2514)))) U FIREABLE(t985)))
lola: processed formula: A ((G (X (X (FIREABLE(t2514)))) U FIREABLE(t985)))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (F (X (FIREABLE(t817)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (FIREABLE(t817)))))
lola: processed formula: A (G (F (X (FIREABLE(t817)))))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F (FIREABLE(t1312))) U (G (FIREABLE(t347)) U X (FIREABLE(t1215)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F (FIREABLE(t1312))) U (G (FIREABLE(t347)) U X (FIREABLE(t1215)))))
lola: processed formula: A ((X (F (FIREABLE(t1312))) U (G (FIREABLE(t347)) U X (FIREABLE(t1215)))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (FIREABLE(t627))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (FIREABLE(t627))))
lola: processed formula: A (F (X (FIREABLE(t627))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (FIREABLE(t505)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (FIREABLE(t505)))))
lola: processed formula: A (F (X (X (FIREABLE(t505)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((X (FIREABLE(t153)) U FIREABLE(t1110)) U FIREABLE(t2262)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (FIREABLE(t153)) U FIREABLE(t1110)) U FIREABLE(t2262)))
lola: processed formula: A (((X (FIREABLE(t153)) U FIREABLE(t1110)) U FIREABLE(t2262)))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t1893)))
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 20 bytes per marking, with 27 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t1028))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1028)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G (G (FIREABLE(t2826))) U (FIREABLE(t753) U FIREABLE(t909)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (G (FIREABLE(t2826))) U (FIREABLE(t753) U FIREABLE(t909)))))
lola: processed formula: A (F ((G (G (FIREABLE(t2826))) U (FIREABLE(t753) U FIREABLE(t909)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t1706))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t1706)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G (FIREABLE(t2477))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t2477))))
lola: processed formula: A (F (G (FIREABLE(t2477))))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t520) U G (X (FIREABLE(t737))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((FIREABLE(t520) U G (X (FIREABLE(t737))))))
lola: processed formula: A (G ((FIREABLE(t520) U G (X (FIREABLE(t737))))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 15 will run for 3525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(t74))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t74)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 377 places; total mentions: 0
lola: closed formula file DLCround-PT-11a-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
FORMULA DLCround-PT-11a-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-11a-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496543471816

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

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