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 TriangularGrid-PT-1500, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028300745
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465162337939


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: TriangularGrid_PT_1500
(NrP: 16 NrTr: 12 NrArc: 48)

net check time: 0m 0.000sec

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

init dd package: 0m 4.242sec


RS generation: 0m 1.754sec


-> reachability set: #nodes 1551 (1.6e+03) #states 705,712 (5)



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

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

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

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=pi2_1_1) states: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=pb1_1_1) states: 677,488 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.159sec

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

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

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (pb1_1_1<=pb1_1_1) states: 705,712 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [pb3_1_1<=po3_1_1]
normalized: E [true U pb3_1_1<=po3_1_1]

abstracting: (pb3_1_1<=po3_1_1) states: 14,160 (4)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.603sec

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

abstracting: (pi3_1_1<=pbl_1_1) states: 705,712 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [[~ [3<=pb3_1_1] & [pi3_1_1<=pol1_1_1 | 2<=pb3_1_1]]]]
normalized: ~ [E [true U [~ [3<=pb3_1_1] & [pi3_1_1<=pol1_1_1 | 2<=pb3_1_1]]]]

abstracting: (2<=pb3_1_1) states: 686,832 (5)
abstracting: (pi3_1_1<=pol1_1_1) states: 531,656 (5)
abstracting: (3<=pb3_1_1) states: 677,488 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: EF [[~ [[1<=pil2_1_1 | pol1_1_1<=pol3_1_1]] & ~ [~ [pbl_1_1<=pol1_1_1]]]]
normalized: E [true U [pbl_1_1<=pol1_1_1 & ~ [[1<=pil2_1_1 | pol1_1_1<=pol3_1_1]]]]

abstracting: (pol1_1_1<=pol3_1_1) states: 529,288 (5)
abstracting: (1<=pil2_1_1) states: 355,232 (5)
abstracting: (pbl_1_1<=pol1_1_1) states: 68,101 (4)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EF [~ [[[pol2_1_1<=pi3_1_1 & po1_1_1<=po2_1_1] | [1<=pb2_1_1 & 2<=pb1_1_1]]]]
normalized: E [true U ~ [[[pol2_1_1<=pi3_1_1 & po1_1_1<=po2_1_1] | [1<=pb2_1_1 & 2<=pb1_1_1]]]]

abstracting: (2<=pb1_1_1) states: 686,832 (5)
abstracting: (1<=pb2_1_1) states: 696,240 (5)
abstracting: (po1_1_1<=po2_1_1) states: 529,288 (5)
abstracting: (pol2_1_1<=pi3_1_1) states: 526,904 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.434sec

checking: EF [[[[1<=pbl_1_1 & 3<=pil2_1_1] | [1<=po2_1_1 & 3<=pol1_1_1]] & pi1_1_1<=pb1_1_1]]
normalized: E [true U [pi1_1_1<=pb1_1_1 & [[1<=pbl_1_1 & 3<=pil2_1_1] | [1<=po2_1_1 & 3<=pol1_1_1]]]]

abstracting: (3<=pol1_1_1) states: 0
abstracting: (1<=po2_1_1) states: 350,480 (5)
abstracting: (3<=pil2_1_1) states: 0
abstracting: (1<=pbl_1_1) states: 694,236 (5)
abstracting: (pi1_1_1<=pb1_1_1) states: 700,992 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AG [[~ [[po3_1_1<=pil1_1_1 & 3<=pi3_1_1]] | ~ [[pol2_1_1<=pol2_1_1 | pol1_1_1<=pol2_1_1]]]]
normalized: ~ [E [true U ~ [[~ [[pol2_1_1<=pol2_1_1 | pol1_1_1<=pol2_1_1]] | ~ [[po3_1_1<=pil1_1_1 & 3<=pi3_1_1]]]]]]

abstracting: (3<=pi3_1_1) states: 0
abstracting: (po3_1_1<=pil1_1_1) states: 531,656 (5)
abstracting: (pol1_1_1<=pol2_1_1) states: 529,288 (5)
abstracting: (pol2_1_1<=pol2_1_1) states: 705,712 (5)
-> the formula is TRUE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EF [[[2<=po1_1_1 & [2<=pi3_1_1 & pil3_1_1<=pil3_1_1]] & [~ [2<=po1_1_1] & [3<=po3_1_1 & 3<=po3_1_1]]]]
normalized: E [true U [[~ [2<=po1_1_1] & [3<=po3_1_1 & 3<=po3_1_1]] & [2<=po1_1_1 & [2<=pi3_1_1 & pil3_1_1<=pil3_1_1]]]]

abstracting: (pil3_1_1<=pil3_1_1) states: 705,712 (5)
abstracting: (2<=pi3_1_1) states: 0
abstracting: (2<=po1_1_1) states: 0
abstracting: (3<=po3_1_1) states: 0
abstracting: (3<=po3_1_1) states: 0
abstracting: (2<=po1_1_1) states: 0
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[1<=pb1_1_1 | [[pb2_1_1<=po2_1_1 & 1<=pi2_1_1] & [2<=pb2_1_1 & pol3_1_1<=pbl_1_1]]]]
normalized: ~ [E [true U ~ [[1<=pb1_1_1 | [[pb2_1_1<=po2_1_1 & 1<=pi2_1_1] & [2<=pb2_1_1 & pol3_1_1<=pbl_1_1]]]]]]

abstracting: (pol3_1_1<=pbl_1_1) states: 694,236 (5)
abstracting: (2<=pb2_1_1) states: 686,832 (5)
abstracting: (1<=pi2_1_1) states: 350,480 (5)
abstracting: (pb2_1_1<=po2_1_1) states: 14,160 (4)
abstracting: (1<=pb1_1_1) states: 696,240 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EF [[[[pol1_1_1<=po3_1_1 | 3<=pb1_1_1] & 2<=po3_1_1] & [[1<=pb2_1_1 & 1<=pbl_1_1] & po1_1_1<=pbl_1_1]]]
normalized: E [true U [[po1_1_1<=pbl_1_1 & [1<=pb2_1_1 & 1<=pbl_1_1]] & [2<=po3_1_1 & [pol1_1_1<=po3_1_1 | 3<=pb1_1_1]]]]

abstracting: (3<=pb1_1_1) states: 677,488 (5)
abstracting: (pol1_1_1<=po3_1_1) states: 526,904 (5)
abstracting: (2<=po3_1_1) states: 0
abstracting: (1<=pbl_1_1) states: 694,236 (5)
abstracting: (1<=pb2_1_1) states: 696,240 (5)
abstracting: (po1_1_1<=pbl_1_1) states: 705,712 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: AG [[[[1<=pi3_1_1 | 1<=po3_1_1] | [2<=pol1_1_1 & pb1_1_1<=pb2_1_1]] | [[pi1_1_1<=pb1_1_1 | 3<=pol3_1_1] | ~ [1<=pil3_1_1]]]]
normalized: ~ [E [true U ~ [[[~ [1<=pil3_1_1] | [pi1_1_1<=pb1_1_1 | 3<=pol3_1_1]] | [[2<=pol1_1_1 & pb1_1_1<=pb2_1_1] | [1<=pi3_1_1 | 1<=po3_1_1]]]]]]

abstracting: (1<=po3_1_1) states: 350,480 (5)
abstracting: (1<=pi3_1_1) states: 350,480 (5)
abstracting: (pb1_1_1<=pb2_1_1) states: 355,232 (5)
abstracting: (2<=pol1_1_1) states: 0
abstracting: (3<=pol3_1_1) states: 0
abstracting: (pi1_1_1<=pb1_1_1) states: 700,992 (5)
abstracting: (1<=pil3_1_1) states: 355,232 (5)
-> the formula is FALSE

FORMULA TriangularGrid-PT-1500-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec


Total processing time: 0m11.099sec


BK_STOP 1465162349078

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

476 1197 1531
iterations count:3062 (255), effective:800 (66)

initing FirstDep: 0m 0.000sec

1546
iterations count:1043 (86), effective:441 (36)
1551 1734 1551
iterations count:3270 (272), effective:444 (37)
1551 1731 1551
iterations count:3251 (270), effective:443 (36)
1721
iterations count:1071 (89), effective:447 (37)
1546
iterations count:1057 (88), effective:447 (37)
1377
iterations count:1102 (91), effective:455 (37)

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="TriangularGrid-PT-1500"
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/TriangularGrid-PT-1500.tgz
mv TriangularGrid-PT-1500 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 TriangularGrid-PT-1500, 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 r221su-smll-146468028300745"
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 ;