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 QuasiCertifProtocol-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300096
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463700149767

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLFireability @ QuasiCertifProtocol-PT-10
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-1 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-3 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-9 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-LTLFireability-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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-LTLFireability.task
lola: read: AF (G (F (G (X (FIREABLE(malA4)))))) : A(F (FIREABLE(AgetTS)) U (((((((((((FIREABLE(malS1_0) OR FIREABLE(malS1_3)) OR FIREABLE(malS1_4)) OR FIREABLE(malS1_1)) OR FIREABLE(malS1_2)) OR FIREABLE(malS1_8)) OR FIREABLE(malS1_7)) OR FIREABLE(malS1_6)) OR FIREABLE(malS1_5)) OR FIREABLE(malS1_10)) OR FIREABLE(malS1_9)) U X (((((((((((FIREABLE(SsendTS_7) OR FIREABLE(SsendTS_8)) OR FIREABLE(SsendTS_9)) OR ... (shortened)
lola: formula length: 3699
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (X (FIREABLE(malA4))))
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 700 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 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (FIREABLE(AgetTS)) U ((FIREABLE(malS1_0) OR (FIREABLE(malS1_3) OR (FIREABLE(malS1_4) OR (FIREABLE(malS1_1) OR (FIREABLE(malS1_2) OR (FIREABLE(malS1_8) OR (FIREABLE(malS1_7) OR (FIREABLE(malS1_6) OR (FIREABLE(malS1_5) OR (FIREABLE(malS1_10) OR FIREABLE(malS1_9))))))))))) U X ((FIREABLE(SsendTS_7) OR (FIREABLE(SsendTS_8) OR (FIREABLE(SsendTS_9) OR (FIREABLE(SsendTS_10) OR (FIREABLE(SsendTS_3) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (G (FIREABLE(AgetTS)))))
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 700 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F ((FIREABLE(AackCS) U (FIREABLE(SackCS_10) OR (FIREABLE(SackCS_9) OR (FIREABLE(SackCS_8) OR (FIREABLE(SackCS_7) OR (FIREABLE(SackCS_6) OR (FIREABLE(SackCS_5) OR (FIREABLE(SackCS_4) OR (FIREABLE(SackCS_0) OR (FIREABLE(SackCS_1) OR (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3))))))))))))) U (G (FIREABLE(malA2)) U X (FIREABLE(AendCS))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (X (F (FIREABLE(AstartCS))))))
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 700 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 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (((FIREABLE(malS2_2) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_1) OR (FIREABLE(malS2_6) OR (FIREABLE(malS2_7) OR (FIREABLE(malS2_4) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_10) OR (FIREABLE(malS2_8) OR FIREABLE(malS2_9))))))))))) U G ((FIREABLE(CgenCertif_0) OR (FIREABLE(CgenCertif_4) OR (FIREABLE(CgenCertif_3) OR (FIREABLE(CgenCertif_2) OR (FIREABLE(CgenCertif_1) OR (FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (G (FIREABLE(AstartCS))) U G (X (F ((FIREABLE(SreqTS_10) OR (FIREABLE(SreqTS_8) OR (FIREABLE(SreqTS_9) OR (FIREABLE(SreqTS_6) OR (FIREABLE(SreqTS_7) OR (FIREABLE(SreqTS_4) OR (FIREABLE(SreqTS_5) OR (FIREABLE(SreqTS_2) OR (FIREABLE(SreqTS_3) OR (FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1)))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(AstartCS)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-LTLFireability.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 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(AreqCS)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-LTLFireability.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 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (X ((FIREABLE(malS2_2) OR (FIREABLE(malS2_3) OR (FIREABLE(malS2_0) OR (FIREABLE(malS2_1) OR (FIREABLE(malS2_6) OR (FIREABLE(malS2_7) OR (FIREABLE(malS2_4) OR (FIREABLE(malS2_5) OR (FIREABLE(malS2_10) OR (FIREABLE(malS2_8) OR FIREABLE(malS2_9)))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X ((F (FIREABLE(AgetTS)) U X (FIREABLE(malA1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (FIREABLE(malA3)))
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 700 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 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((FIREABLE(SreqTS_10) OR (FIREABLE(SreqTS_8) OR (FIREABLE(SreqTS_9) OR (FIREABLE(SreqTS_6) OR (FIREABLE(SreqTS_7) OR (FIREABLE(SreqTS_4) OR (FIREABLE(SreqTS_5) OR (FIREABLE(SreqTS_2) OR (FIREABLE(SreqTS_3) OR (FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1))))))))))) U G (F (X ((FIREABLE(malS4_0) OR (FIREABLE(malS4_1) OR (FIREABLE(malS4_2) OR (FIREABLE(malS4_3) OR (FIREABLE(malS4_4) OR (FIREABLE(malS4_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (F (FIREABLE(AgetTS))))
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 700 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 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(ScertCS_1) OR (FIREABLE(ScertCS_0) OR (FIREABLE(ScertCS_3) OR (FIREABLE(ScertCS_2) OR (FIREABLE(ScertCS_5) OR (FIREABLE(ScertCS_4) OR (FIREABLE(ScertCS_7) OR (FIREABLE(ScertCS_6) OR (FIREABLE(ScertCS_8) OR (FIREABLE(ScertCS_9) OR FIREABLE(ScertCS_10)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-LTLFireability.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 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((F ((FIREABLE(Sperform_8) OR (FIREABLE(Sperform_7) OR (FIREABLE(Sperform_6) OR (FIREABLE(Sperform_5) OR (FIREABLE(Sperform_4) OR (FIREABLE(Sperform_3) OR (FIREABLE(Sperform_2) OR (FIREABLE(Sperform_1) OR (FIREABLE(Sperform_0) OR (FIREABLE(Sperform_9) OR FIREABLE(Sperform_10)))))))))))) U X (FIREABLE(AreqTS))) U F (X ((FIREABLE(malS5_0) OR (FIREABLE(malS5_1) OR (FIREABLE(malS5_2) OR (FIREABLE(mal... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no unknown no unknown no unknown no no no unknown no no unknown no no unknown

BK_STOP 1463702359570

--------------------
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="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLFireability"
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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 QuasiCertifProtocol-PT-10, 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 r098kn-smll-146369140300096"
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 ;