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 marcie
Input is PhaseVariation-PT-D02CS100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r089kn-ebro-146369093400124
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464106304515


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: PhaseVariation_PT_D02CS100
(NrP: 14 NrTr: 65 NrArc: 443)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m 6.955sec


RS generation: 0m 1.851sec


-> reachability set: #nodes 9836 (9.8e+03) #states 18,989,219,241 (10)



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

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

abstracting: (1<=pool__2_2_) states: 17,619,166,557 (10)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.841sec

checking: EF [~ [~ [~ [2<=pool__2_1_]]]]
normalized: E [true U ~ [2<=pool__2_1_]]

abstracting: (2<=pool__2_1_) states: 16,306,170,509 (10)
-> the formula is TRUE

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

MC time: 0m 1.093sec

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

abstracting: (2<=pool__1_1_) states: 16,209,702,585 (10)
-> the formula is FALSE

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

MC time: 0m 0.930sec

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

abstracting: (cell___2_2__B_<=pool__1_1_) states: 9,714,978,270 (9)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.450sec

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

abstracting: (size_dot<=pool__1_1_) states: 3,414,892 (6)
-> the formula is FALSE

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

MC time: 0m 0.160sec

checking: EF [[~ [run_dot<=pool__2_1_] & 3<=pool__1_2_]]
normalized: E [true U [3<=pool__1_2_ & ~ [run_dot<=pool__2_1_]]]

abstracting: (run_dot<=pool__2_1_) states: 17,635,107,573 (10)
abstracting: (3<=pool__1_2_) states: 15,047,889,534 (10)
-> the formula is TRUE

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

MC time: 0m 0.380sec

checking: AG [[~ [~ [cell___1_1__A_<=pool__2_2_]] | 2<=pool__1_2_]]
normalized: ~ [E [true U ~ [[cell___1_1__A_<=pool__2_2_ | 2<=pool__1_2_]]]]

abstracting: (2<=pool__1_2_) states: 16,306,170,509 (10)
abstracting: (cell___1_1__A_<=pool__2_2_) states: 9,245,720,042 (9)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.470sec

checking: AG [[cell___2_1__B_<=pool__1_1_ | cell___1_2__A_<=pool__1_2_]]
normalized: ~ [E [true U ~ [[cell___2_1__B_<=pool__1_1_ | cell___1_2__A_<=pool__1_2_]]]]

abstracting: (cell___1_2__A_<=pool__1_2_) states: 9,832,059,567 (9)
abstracting: (cell___2_1__B_<=pool__1_1_) states: 9,714,978,270 (9)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.183sec

checking: EF [[[[1<=cell___2_1__B_ & cell___1_2__B_<=cell___2_2__A_] | ~ [3<=cell___1_1__A_]] & 3<=run_dot]]
normalized: E [true U [3<=run_dot & [~ [3<=cell___1_1__A_] | [1<=cell___2_1__B_ & cell___1_2__B_<=cell___2_2__A_]]]]

abstracting: (cell___1_2__B_<=cell___2_2__A_) states: 9,954,930,212 (9)
abstracting: (1<=cell___2_1__B_) states: 17,633,898,009 (10)
abstracting: (3<=cell___1_1__A_) states: 16,232,186,293 (10)
abstracting: (3<=run_dot) states: 0
-> the formula is FALSE

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

MC time: 0m 0.798sec

checking: EF [[[3<=pool__1_2_ | 1<=run_dot] & [~ [2<=size_dot] & [2<=run_dot & 1<=run_dot]]]]
normalized: E [true U [[~ [2<=size_dot] & [2<=run_dot & 1<=run_dot]] & [3<=pool__1_2_ | 1<=run_dot]]]

abstracting: (1<=run_dot) states: 18,957,563,352 (10)
abstracting: (3<=pool__1_2_) states: 15,047,889,534 (10)
abstracting: (1<=run_dot) states: 18,957,563,352 (10)
abstracting: (2<=run_dot) states: 0
abstracting: (2<=size_dot) states: 18,989,219,240 (10)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: EF [~ [[[pool__1_1_<=pool__1_2_ | 1<=pool__1_1_] | pool__2_2_<=cell___2_1__B_]]]
normalized: E [true U ~ [[pool__2_2_<=cell___2_1__B_ | [pool__1_1_<=pool__1_2_ | 1<=pool__1_1_]]]]

abstracting: (1<=pool__1_1_) states: 17,568,989,885 (10)
abstracting: (pool__1_1_<=pool__1_2_) states: 10,201,790,331 (10)
abstracting: (pool__2_2_<=cell___2_1__B_) states: 9,969,221,565 (9)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.445sec

checking: AG [~ [[[pool__2_1_<=cell___1_2__A_ & cell___2_1__B_<=pool__2_1_] & ~ [3<=cell___2_1__A_]]]]
normalized: ~ [E [true U [~ [3<=cell___2_1__A_] & [pool__2_1_<=cell___1_2__A_ & cell___2_1__B_<=pool__2_1_]]]]

abstracting: (cell___2_1__B_<=pool__2_1_) states: 9,832,059,567 (9)
abstracting: (pool__2_1_<=cell___1_2__A_) states: 9,969,221,565 (9)
abstracting: (3<=cell___2_1__A_) states: 15,073,712,397 (10)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.283sec

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

abstracting: (3<=pool__1_2_) states: 15,047,889,534 (10)
abstracting: (2<=size_dot) states: 18,989,219,240 (10)
abstracting: (1<=pool__2_1_) states: 17,619,166,557 (10)
abstracting: (3<=cell___1_1__A_) states: 16,232,186,293 (10)
abstracting: (3<=cell___1_2__B_) states: 15,073,712,397 (10)
abstracting: (2<=cell___2_2__B_) states: 16,328,729,061 (10)
-> the formula is FALSE

FORMULA PhaseVariation-PT-D02CS100-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.570sec

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

abstracting: (1<=pool__2_2_) states: 17,619,166,557 (10)
abstracting: (1<=cell___1_2__B_) states: 17,633,898,009 (10)
abstracting: (2<=cell___1_1__B_) states: 16,232,186,293 (10)
abstracting: (size_dot<=pool__2_1_) states: 4,470,388 (6)
abstracting: (2<=pool__1_2_) states: 16,306,170,509 (10)
-> the formula is FALSE

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

MC time: 0m 2.211sec

checking: AG [[[[cell___1_2__A_<=cell___1_1__B_ | 1<=cell___2_2__A_] & cell___1_1__B_<=cell___1_1__A_] | 2<=size_dot]]
normalized: ~ [E [true U ~ [[2<=size_dot | [cell___1_1__B_<=cell___1_1__A_ & [cell___1_2__A_<=cell___1_1__B_ | 1<=cell___2_2__A_]]]]]]

abstracting: (1<=cell___2_2__A_) states: 17,633,898,009 (10)
abstracting: (cell___1_2__A_<=cell___1_1__B_) states: 9,728,667,602 (9)
abstracting: (cell___1_1__B_<=cell___1_1__A_) states: 10,548,846,240 (10)
abstracting: (2<=size_dot) states: 18,989,219,240 (10)
-> the formula is TRUE

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

MC time: 0m 1.558sec

checking: EF [[[1<=cell___1_2__B_ & pool__2_2_<=size_dot] & [~ [2<=pool__1_1_] | [cell___2_1__A_<=pool__2_1_ | cell___1_2__A_<=pool__1_2_]]]]
normalized: E [true U [[[cell___2_1__A_<=pool__2_1_ | cell___1_2__A_<=pool__1_2_] | ~ [2<=pool__1_1_]] & [1<=cell___1_2__B_ & pool__2_2_<=size_dot]]]

abstracting: (pool__2_2_<=size_dot) states: 18,985,804,349 (10)
abstracting: (1<=cell___1_2__B_) states: 17,633,898,009 (10)
abstracting: (2<=pool__1_1_) states: 16,209,702,585 (10)
abstracting: (cell___1_2__A_<=pool__1_2_) states: 9,832,059,567 (9)
abstracting: (cell___2_1__A_<=pool__2_1_) states: 9,832,059,567 (9)
-> the formula is TRUE

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

MC time: 0m 0.657sec


Total processing time: 0m36.523sec


BK_STOP 1464106341105

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

check for maximal unmarked siphon
ok
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: 0m 0.000sec

3964 5431 9625 9827
iterations count:4517 (69), effective:237 (3)

initing FirstDep: 0m 0.000sec


iterations count:273 (4), effective:26 (0)

iterations count:615 (9), effective:25 (0)

iterations count:89 (1), effective:24 (0)

iterations count:103 (1), effective:26 (0)

iterations count:78 (1), effective:13 (0)

iterations count:637 (9), effective:26 (0)
9454
iterations count:1298 (19), effective:76 (1)

iterations count:679 (10), effective:40 (0)

iterations count:977 (15), effective:27 (0)

iterations count:637 (9), effective:26 (0)

iterations count:98 (1), effective:26 (0)

iterations count:142 (2), effective:25 (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-D02CS100"
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/PhaseVariation-PT-D02CS100.tgz
mv PhaseVariation-PT-D02CS100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is PhaseVariation-PT-D02CS100, 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 r089kn-ebro-146369093400124"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;