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-2265
Executing tool marcie
Input is S_CSRepetitions-COL-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r120st-ebro-143297419400126
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433155805609

Model: S_CSRepetitions-COL-03
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

Unfolding complete |P|=58|T|=81|A|=279
Time for unfolding: 0m0sec

(NrP: 58 NrTr: 81 NrArc: 279)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m6sec


RS generation: 0m36sec


-> reachability set: #nodes 17244 (1.7e+04) #states 134,074,721 (8)



starting MCC model checker
--------------------------

checking: AG [~ [~ [[1<=clientSending | serverAnwering<=clientWaiting]]]]
normalized: ~ [E [true U ~ [[1<=clientSending | serverAnwering<=clientWaiting]]]]

abstracting: (serverAnwering<=clientWaiting) states: 0

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-0CANNOT_COMPUTE

MC time: 4m37sec

checking: AG [requestBufferSlots<=requestBufferSlots]
normalized: ~ [E [true U ~ [requestBufferSlots<=requestBufferSlots]]]

abstracting: (requestBufferSlots<=requestBufferSlots) states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m31sec

checking: AG [[1<=requestBufferSlots | 2<=requestBuffer]]
normalized: ~ [E [true U ~ [[1<=requestBufferSlots | 2<=requestBuffer]]]]


FORMULA CSRepetitions-COL-03-ReachabilityCardinality-2CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [~ [[requestBufferSlots<=clientSending & [2<=clientSending & 1<=serverAnwering]]]]
normalized: ~ [E [true U [[2<=clientSending & 1<=serverAnwering] & requestBufferSlots<=clientSending]]]

abstracting: (requestBufferSlots<=clientSending) states: 0

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-3CANNOT_COMPUTE

MC time: 4m38sec

checking: AG [~ [[[3<=serverAnwering | 2<=requestBuffer] & ~ [requestBuffer<=requestBuffer]]]]
normalized: ~ [E [true U [[3<=serverAnwering | 2<=requestBuffer] & ~ [requestBuffer<=requestBuffer]]]]

abstracting: (requestBuffer<=requestBuffer) states: 0

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-4CANNOT_COMPUTE

MC time: 4m38sec

checking: AG [[requestBufferSlots<=serverWaiting | [2<=serverWaiting | serverAnwering<=serverWaiting]]]
normalized: ~ [E [true U ~ [[requestBufferSlots<=serverWaiting | [2<=serverWaiting | serverAnwering<=serverWaiting]]]]]

abstracting: (serverAnwering<=serverWaiting) states: 0

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-5CANNOT_COMPUTE

MC time: 4m38sec

checking: AG [~ [~ [~ [3<=serverAnwering]]]]
normalized: ~ [E [true U 3<=serverAnwering]]


FORMULA CSRepetitions-COL-03-ReachabilityCardinality-6CANNOT_COMPUTE

MC time: 0m0sec

checking: EF [~ [[[clientWaiting<=serverWaiting & clientWaiting<=clientWaiting] | [requestBufferSlots<=clientWaiting | serverWaiting<=serverAnwering]]]]
normalized: E [true U ~ [[[requestBufferSlots<=clientWaiting | serverWaiting<=serverAnwering] | [clientWaiting<=serverWaiting & clientWaiting<=clientWaiting]]]]

abstracting: (clientWaiting<=clientWaiting) states: 0
abstracting: (clientWaiting<=serverWaiting) states: 0
abstracting: (serverWaiting<=serverAnwering) states: 0
abstracting: (requestBufferSlots<=clientWaiting) states: 0
-> the formula is TRUE

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 19m14sec

checking: EF [[[[1<=serverAnwering | serverWaiting<=clientSending] & 1<=clientWaiting] & clientWaiting<=clientSending]]
normalized: E [true U [clientWaiting<=clientSending & [1<=clientWaiting & [1<=serverAnwering | serverWaiting<=clientSending]]]]

abstracting: (serverWaiting<=clientSending) states: 0

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-8CANNOT_COMPUTE

MC time: 4m41sec

checking: EF [~ [clientSending<=clientWaiting]]
normalized: E [true U ~ [clientSending<=clientWaiting]]

abstracting: (clientSending<=clientWaiting) states: 0
-> the formula is TRUE

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m35sec

checking: EF [[[3<=serverWaiting & ~ [1<=serverAnwering]] & ~ [serverAnwering<=clientSending]]]
normalized: E [true U [~ [serverAnwering<=clientSending] & [3<=serverWaiting & ~ [1<=serverAnwering]]]]


FORMULA CSRepetitions-COL-03-ReachabilityCardinality-10CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [1<=clientWaiting]
normalized: ~ [E [true U ~ [1<=clientWaiting]]]


FORMULA CSRepetitions-COL-03-ReachabilityCardinality-11CANNOT_COMPUTE

MC time: 0m0sec

checking: AG [serverWaiting<=serverWaiting]
normalized: ~ [E [true U ~ [serverWaiting<=serverWaiting]]]

abstracting: (serverWaiting<=serverWaiting) states: 0
-> the formula is FALSE

FORMULA CSRepetitions-COL-03-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m24sec

checking: AG [1<=serverWaiting]
normalized: ~ [E [true U ~ [1<=serverWaiting]]]


FORMULA CSRepetitions-COL-03-ReachabilityCardinality-13CANNOT_COMPUTE


BK_TIME_CONFINEMENT_REACHED

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

check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m0sec

1308 1587 1858 2311 2016 2200 2697 3440 3298 2615 3600 4216 5436 5151 5138 4814 4150 5795 7115 9667 9534 9124 7924 8966 8408 7359 5233 11533 12750 17803 17946 17120 16479 14749 16645 16158 15512 13520 10383 18738 23665 23787 32327 34307 32813 32186 31496 30170 28333 31046 30360 29327 29275 24997 18330
iterations count:55251 (682), effective:3271 (40)

initing FirstDep: 0m0sec

Unknown names:
clientSending
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:81 (1), effective:0 (0)
Unknown names:
requestBuffer
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
serverAnwering
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
requestBuffer
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
serverWaiting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
serverAnwering
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:81 (1), effective:0 (0)
Unknown names:
serverAnwering
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:81 (1), effective:0 (0)
Unknown names:
serverAnwering
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
clientWaiting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula


iterations count:81 (1), effective:0 (0)
Unknown names:
serverWaiting
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

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_CSRepetitions-COL-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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/S_CSRepetitions-COL-03.tgz
mv S_CSRepetitions-COL-03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_CSRepetitions-COL-03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r120st-ebro-143297419400126"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;