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 Eratosthenes-PT-500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050kn-smll-146358762600050
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463595566021

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ Eratosthenes-PT-500
FORMULA Eratosthenes-PT-500-LTLCardinality-0 CANNOT_COMPUTE
FORMULA Eratosthenes-PT-500-LTLCardinality-1 CANNOT_COMPUTE
FORMULA Eratosthenes-PT-500-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-3 CANNOT_COMPUTE
FORMULA Eratosthenes-PT-500-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-6 CANNOT_COMPUTE
FORMULA Eratosthenes-PT-500-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-10 CANNOT_COMPUTE
FORMULA Eratosthenes-PT-500-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Eratosthenes-PT-500-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: 2690/65536 symbol table entries, 58 collisions
lola: preprocessing...
lola: finding significant places
lola: 499 places, 2191 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2438 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-500-LTLCardinality.task
lola: read: AG (F (p465 <= p269)) : AG ((X (p299 <= p150) U X (p77 <= p175))) : A(p75 <= p72 U G (X (1 <= p213))) : A(F (X (p258 <= p78)) U (2 <= p367 U 3 <= p109)) : AF (F (F (X (3 <= p463)))) : AG (p173 <= p460) : AG ((G (2 <= p382) U p102 <= p239)) : AX (p68 <= p85) : A3 <= p407 : A(F (F (3 <= p112)) U G (G (2 <= p199))) : AX (X (F (F (p21 <= p90)))) : AG (2 <= p101) : Ap94 <= p12 : A1 <= p494 : AG (1 <= p... (shortened)
lola: formula length: 436
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 (-p269 + p465 <= 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 52 bytes per marking, with 12 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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((p299 + -p150 <= 0 U -p175 + p77 <= 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 52 bytes per marking, with 12 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 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-p72 + p75 <= 0 U G (X (-p213 <= -1)))
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 52 bytes per marking, with 12 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 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (X (p258 + -p78 <= 0)) U (-p367 <= -2 U -p109 <= -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 52 bytes per marking, with 12 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 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (-p463 <= -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 52 bytes per marking, with 12 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 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (p173 + -p460 <= 0)
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 52 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((G (-p382 <= -2) U -p239 + p102 <= 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 52 bytes per marking, with 12 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 7 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (p68 + -p85 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(p68 + -p85 <= 0)
lola: processed formula length: 19
lola: 92 rewrites
lola: formula mentions 2 of 499 places; total mentions: 2
lola: closed formula file Eratosthenes-PT-500-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p407 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Eratosthenes-PT-500-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 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (-p112 <= -3) U G (G (-p199 <= -2)))
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 52 bytes per marking, with 12 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 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (p21 + -p90 <= 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 52 bytes per marking, with 12 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 11 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p101 <= -2)
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 52 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p12 + p94 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Eratosthenes-PT-500-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p494 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Eratosthenes-PT-500-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p271 <= -1)
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 52 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (F (-p101 + p413 <= 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 52 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: time limit reached - aborting
lola: preliminary result: unknown unknown no unknown no no unknown no no no unknown no yes yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA

BK_STOP 1463599106134

--------------------
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="Eratosthenes-PT-500"
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/Eratosthenes-PT-500.tgz
mv Eratosthenes-PT-500 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 Eratosthenes-PT-500, 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 r050kn-smll-146358762600050"
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 ;