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 S_CircadianClock-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194kn-qhx2-146444257100041
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465028327270

bkconf 3600
===========================================================================================
===========================================================================================
S_CircadianClock-PT-010000: translating formula LTLCardinality into LoLA format
S_CircadianClock-PT-010000: translating Petri net model.pnml into LoLA format
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py LTLCardinality.xml
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
touch formulae;


in benchkit_head lolaszeit 3540
LTLCardinality @ S_CircadianClock-PT-010000
FORMULA CircadianClock-PT-010000-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-3 CANNOT_COMPUTE
FORMULA CircadianClock-PT-010000-LTLCardinality-4 CANNOT_COMPUTE
FORMULA CircadianClock-PT-010000-LTLCardinality-5 CANNOT_COMPUTE
FORMULA CircadianClock-PT-010000-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-9 CANNOT_COMPUTE
FORMULA CircadianClock-PT-010000-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-12 CANNOT_COMPUTE
FORMULA CircadianClock-PT-010000-LTLCardinality-13 CANNOT_COMPUTE
FORMULA CircadianClock-PT-010000-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircadianClock-PT-010000-LTLCardinality-15 CANNOT_COMPUTE
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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-010000-LTLCardinality.task
lola: read: A(1 <= c_cap U mr <= c_cap) : AF (F (da_a <= a_cap)) : AF ((G (c_cap <= c) U X (dr <= ma_cap))) : AF (F (G (r_cap <= dr_a))) : AG (F (1 <= a_cap)) : AF (F (mr_cap <= a)) : A(r_cap <= da_a U F (mr <= c_cap)) : A2 <= r : A2 <= mr_cap : AG (X (X (F (mr <= da)))) : A3 <= c : Amr_cap <= mr : AX (F (X (F (a_cap <= ma)))) : AF (2 <= c) : Ac_cap <= r : AF (X (X (X (1 <= ma))))
lola: formula length: 371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-c_cap <= -1 U -c_cap + mr <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-c_cap <= -1 U -c_cap + mr <= 0)
lola: processed formula length: 34
lola: 86 rewrites
lola: formula mentions 2 of 14 places; total mentions: 3
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-a_cap + da_a <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -a_cap + da_a <= 0)
lola: processed formula length: 28
lola: 86 rewrites
lola: formula mentions 2 of 14 places; total mentions: 2
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((G (c_cap + -c <= 0) U X (-ma_cap + dr <= 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 28 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (r_cap + -dr_a <= 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 28 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 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-a_cap <= -1))
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 28 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: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (mr_cap + -a <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U mr_cap + -a <= 0)
lola: processed formula length: 26
lola: 86 rewrites
lola: formula mentions 2 of 14 places; total mentions: 2
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(r_cap + -da_a <= 0 U F (-c_cap + mr <= 0))
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 28 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 7 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -r <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -mr_cap <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-010000-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 406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (X (F (mr + -da <= 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 28 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: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -c <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-010000-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 530 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: mr_cap + -mr <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (X (F (a_cap + -ma <= 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 28 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-c <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -c <= -2)
lola: processed formula length: 18
lola: 86 rewrites
lola: formula mentions 1 of 14 places; total mentions: 1
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: c_cap + -r <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CircadianClock-PT-010000-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (X (X (-ma <= -1))))
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 28 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: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: yes yes yes unknown unknown unknown yes no yes unknown no no unknown unknown no unknown

BK_STOP 1465029779036

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_CircadianClock-PT-010000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/S_CircadianClock-PT-010000.tgz
mv S_CircadianClock-PT-010000 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 S_CircadianClock-PT-010000, 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 r194kn-qhx2-146444257100041"
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 ;