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-2270
Executing tool marcie
Input is PhaseVariation-PT-D02CS010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r246su-smll-143368767100009
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433802753205

Model: PhaseVariation-PT-D02CS010
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

(NrP: 14 NrTr: 65 NrArc: 443)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 154 (1.5e+02) #states 7,716 (3)



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

checking: EF [[[[size_dot<=cell___1_2__A_ & 1<=pool__2_2_] & 3<=cell___2_2__A_] & 3<=pool__1_1_]]
normalized: E [true U [3<=pool__1_1_ & [3<=cell___2_2__A_ & [size_dot<=cell___1_2__A_ & 1<=pool__2_2_]]]]

abstracting: (1<=pool__2_2_) states: 4,152 (3)
abstracting: (size_dot<=cell___1_2__A_) states: 0
abstracting: (3<=cell___2_2__A_) states: 891
abstracting: (3<=pool__1_1_) states: 0
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (pool__1_1_<=pool__1_1_) states: 7,716 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [2<=pool__2_2_] & cell___2_1__B_<=pool__2_1_] | ~ [size_dot<=cell___2_2__B_]]]
normalized: ~ [E [true U ~ [[~ [size_dot<=cell___2_2__B_] | [cell___2_1__B_<=pool__2_1_ & ~ [2<=pool__2_2_]]]]]]

abstracting: (2<=pool__2_2_) states: 1,896 (3)
abstracting: (cell___2_1__B_<=pool__2_1_) states: 4,291 (3)
abstracting: (size_dot<=cell___2_2__B_) states: 0
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[2<=size_dot | pool__2_1_<=cell___2_2__B_] | 1<=cell___2_2__A_] | pool__1_2_<=pool__2_2_]]
normalized: ~ [E [true U ~ [[pool__1_2_<=pool__2_2_ | [1<=cell___2_2__A_ | [2<=size_dot | pool__2_1_<=cell___2_2__B_]]]]]]

abstracting: (pool__2_1_<=cell___2_2__B_) states: 5,445 (3)
abstracting: (2<=size_dot) states: 7,715 (3)
abstracting: (1<=cell___2_2__A_) states: 4,825 (3)
abstracting: (pool__1_2_<=pool__2_2_) states: 5,172 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=cell___1_1__A_) states: 7,716 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[2<=cell___1_1__A_ | 3<=size_dot] | [3<=cell___1_1__A_ & cell___2_2__B_<=cell___2_2__B_]] | [1<=pool__1_2_ & [cell___2_2__B_<=cell___1_1__A_ | cell___1_2__B_<=run_dot]]]]
normalized: ~ [E [true U ~ [[[1<=pool__1_2_ & [cell___2_2__B_<=cell___1_1__A_ | cell___1_2__B_<=run_dot]] | [[3<=cell___1_1__A_ & cell___2_2__B_<=cell___2_2__B_] | [2<=cell___1_1__A_ | 3<=size_dot]]]]]]

abstracting: (3<=size_dot) states: 7,707 (3)
abstracting: (2<=cell___1_1__A_) states: 4,032 (3)
abstracting: (cell___2_2__B_<=cell___2_2__B_) states: 7,716 (3)
abstracting: (3<=cell___1_1__A_) states: 1,412 (3)
abstracting: (cell___1_2__B_<=run_dot) states: 4,691 (3)
abstracting: (cell___2_2__B_<=cell___1_1__A_) states: 6,213 (3)
abstracting: (1<=pool__1_2_) states: 4,152 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[[cell___1_2__B_<=cell___2_2__A_ & cell___1_2__A_<=cell___1_2__A_] | [cell___2_2__B_<=pool__1_1_ | 1<=pool__2_1_]]]]
normalized: E [true U ~ [[[cell___2_2__B_<=pool__1_1_ | 1<=pool__2_1_] | [cell___1_2__B_<=cell___2_2__A_ & cell___1_2__A_<=cell___1_2__A_]]]]

abstracting: (cell___1_2__A_<=cell___1_2__A_) states: 7,716 (3)
abstracting: (cell___1_2__B_<=cell___2_2__A_) states: 4,977 (3)
abstracting: (1<=pool__2_1_) states: 4,152 (3)
abstracting: (cell___2_2__B_<=pool__1_1_) states: 4,135 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[3<=cell___1_2__B_ & 1<=cell___1_1__A_] & [2<=run_dot & pool__2_1_<=cell___1_2__B_]]]]
normalized: ~ [E [true U [[2<=run_dot & pool__2_1_<=cell___1_2__B_] & [3<=cell___1_2__B_ & 1<=cell___1_1__A_]]]]

abstracting: (1<=cell___1_1__A_) states: 7,716 (3)
abstracting: (3<=cell___1_2__B_) states: 891
abstracting: (pool__2_1_<=cell___1_2__B_) states: 5,445 (3)
abstracting: (2<=run_dot) states: 0
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=cell___1_1__A_) states: 7,716 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [~ [pool__1_2_<=cell___1_2__A_]] | ~ [[2<=pool__1_2_ & pool__1_2_<=run_dot]]]]
normalized: ~ [E [true U ~ [[pool__1_2_<=cell___1_2__A_ | ~ [[2<=pool__1_2_ & pool__1_2_<=run_dot]]]]]]

abstracting: (pool__1_2_<=run_dot) states: 5,364 (3)
abstracting: (2<=pool__1_2_) states: 1,896 (3)
abstracting: (pool__1_2_<=cell___1_2__A_) states: 5,068 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [3<=cell___1_1__B_]
normalized: E [true U 3<=cell___1_1__B_]

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

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[2<=pool__1_2_ | [[1<=cell___1_1__A_ & cell___1_2__B_<=cell___1_2__B_] | [3<=size_dot & size_dot<=pool__2_2_]]]]
normalized: ~ [E [true U ~ [[2<=pool__1_2_ | [[1<=cell___1_1__A_ & cell___1_2__B_<=cell___1_2__B_] | [3<=size_dot & size_dot<=pool__2_2_]]]]]]

abstracting: (size_dot<=pool__2_2_) states: 30
abstracting: (3<=size_dot) states: 7,707 (3)
abstracting: (cell___1_2__B_<=cell___1_2__B_) states: 7,716 (3)
abstracting: (1<=cell___1_1__A_) states: 7,716 (3)
abstracting: (2<=pool__1_2_) states: 1,896 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[3<=pool__2_2_ | 1<=run_dot] | ~ [cell___1_1__B_<=run_dot]] & [[pool__1_2_<=cell___2_2__B_ | 3<=pool__2_1_] | [1<=size_dot | 3<=cell___1_1__A_]]]]
normalized: ~ [E [true U ~ [[[[3<=pool__2_2_ | 1<=run_dot] | ~ [cell___1_1__B_<=run_dot]] & [[pool__1_2_<=cell___2_2__B_ | 3<=pool__2_1_] | [1<=size_dot | 3<=cell___1_1__A_]]]]]]

abstracting: (3<=cell___1_1__A_) states: 1,412 (3)
abstracting: (1<=size_dot) states: 7,716 (3)
abstracting: (3<=pool__2_1_) states: 600
abstracting: (pool__1_2_<=cell___2_2__B_) states: 5,445 (3)
abstracting: (cell___1_1__B_<=run_dot) states: 5,684 (3)
abstracting: (1<=run_dot) states: 6,000 (3)
abstracting: (3<=pool__2_2_) states: 600
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [3<=cell___1_1__B_]
normalized: E [true U 3<=cell___1_1__B_]

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

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[3<=pool__1_1_ | 1<=cell___2_2__A_] | [2<=cell___2_2__B_ | pool__2_2_<=pool__2_2_]] | 2<=cell___2_2__A_]]
normalized: ~ [E [true U ~ [[2<=cell___2_2__A_ | [[2<=cell___2_2__B_ | pool__2_2_<=pool__2_2_] | [3<=pool__1_1_ | 1<=cell___2_2__A_]]]]]]

abstracting: (1<=cell___2_2__A_) states: 4,825 (3)
abstracting: (3<=pool__1_1_) states: 0
abstracting: (pool__2_2_<=pool__2_2_) states: 7,716 (3)
abstracting: (2<=cell___2_2__B_) states: 2,534 (3)
abstracting: (2<=cell___2_2__A_) states: 2,534 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[cell___2_2__B_<=pool__1_1_ | [~ [cell___1_2__B_<=pool__2_2_] | 1<=cell___1_1__A_]]]
normalized: ~ [E [true U ~ [[cell___2_2__B_<=pool__1_1_ | [1<=cell___1_1__A_ | ~ [cell___1_2__B_<=pool__2_2_]]]]]]

abstracting: (cell___1_2__B_<=pool__2_2_) states: 4,562 (3)
abstracting: (1<=cell___1_1__A_) states: 7,716 (3)
abstracting: (cell___2_2__B_<=pool__1_1_) states: 4,135 (3)
-> the formula is TRUE

FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433802758592

--------------------
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


iterations count:612 (9), effective:29 (0)

initing FirstDep: 0m0sec


iterations count:154 (2), effective:4 (0)

iterations count:147 (2), effective:5 (0)

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="PhaseVariation-PT-D02CS010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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/PhaseVariation-PT-D02CS010.tgz
mv PhaseVariation-PT-D02CS010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is PhaseVariation-PT-D02CS010, 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 r246su-smll-143368767100009"
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 ;