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

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

=== Now, execution of the tool begins

BK_START 1465071838648


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: HypertorusGrid_PT_d2k2p1b00
(NrP: 52 NrTr: 64 NrArc: 256)

net check time: 0m 0.000sec

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

init dd package: 0m 4.508sec


RS generation: 0m 1.009sec


-> reachability set: #nodes 1489 (1.5e+03) #states 51,737,129,142 (10)



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

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

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

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[~ [3<=pol_d1_n1_2_2] | ~ [2<=pb_d2_n2_1_1]]]]
normalized: E [true U ~ [[~ [3<=pol_d1_n1_2_2] | ~ [2<=pb_d2_n2_1_1]]]]

abstracting: (2<=pb_d2_n2_1_1) states: 8,095,580,786 (9)
abstracting: (3<=pol_d1_n1_2_2) states: 0
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [~ [[2<=po_d1_n1_1_1 & 1<=pil_d1_n1_1_2]]]
normalized: ~ [E [true U [2<=po_d1_n1_1_1 & 1<=pil_d1_n1_1_2]]]

abstracting: (1<=pil_d1_n1_1_2) states: 32,978,865,411 (10)
abstracting: (2<=po_d1_n1_1_1) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[1<=pil_d1_n1_1_2 | [~ [2<=pb_d1_n2_1_2] | ~ [2<=pil_d1_n1_2_1]]]]
normalized: ~ [E [true U ~ [[1<=pil_d1_n1_1_2 | [~ [2<=pb_d1_n2_1_2] | ~ [2<=pil_d1_n1_2_1]]]]]]

abstracting: (2<=pil_d1_n1_2_1) states: 0
abstracting: (2<=pb_d1_n2_1_2) states: 8,095,580,786 (9)
abstracting: (1<=pil_d1_n1_1_2) states: 32,978,865,411 (10)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[2<=pb_d1_n2_2_1 & [2<=pb_d1_n1_2_1 | 2<=pbl_1_2]] | 2<=pil_d2_n1_1_2]]
normalized: E [true U [2<=pil_d2_n1_1_2 | [2<=pb_d1_n2_2_1 & [2<=pb_d1_n1_2_1 | 2<=pbl_1_2]]]]

abstracting: (2<=pbl_1_2) states: 23,438,574,347 (10)
abstracting: (2<=pb_d1_n1_2_1) states: 8,095,580,786 (9)
abstracting: (2<=pb_d1_n2_2_1) states: 8,095,580,786 (9)
abstracting: (2<=pil_d2_n1_1_2) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.468sec

checking: EF [[2<=pol_d2_n1_1_2 & [~ [1<=pol_d2_n1_2_1] | ~ [po_d1_n1_1_2<=pbl_2_1]]]]
normalized: E [true U [2<=pol_d2_n1_1_2 & [~ [po_d1_n1_1_2<=pbl_2_1] | ~ [1<=pol_d2_n1_2_1]]]]

abstracting: (1<=pol_d2_n1_2_1) states: 32,978,865,411 (10)
abstracting: (po_d1_n1_1_2<=pbl_2_1) states: 47,379,974,907 (10)
abstracting: (2<=pol_d2_n1_1_2) states: 0
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [~ [[[pb_d1_n2_1_2<=pil_d1_n1_2_2 | pbl_1_2<=pb_d1_n1_1_2] | ~ [2<=pil_d1_n1_2_1]]]]
normalized: E [true U ~ [[~ [2<=pil_d1_n1_2_1] | [pb_d1_n2_1_2<=pil_d1_n1_2_2 | pbl_1_2<=pb_d1_n1_1_2]]]]

abstracting: (pbl_1_2<=pb_d1_n1_1_2) states: 22,154,762,307 (10)
abstracting: (pb_d1_n2_1_2<=pil_d1_n1_2_2) states: 38,589,160,786 (10)
abstracting: (2<=pil_d1_n1_2_1) states: 0
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [1<=pb_d2_n1_1_2] | [~ [2<=pol_d1_n1_2_1] | [3<=pol_d1_n1_2_2 | pbl_1_1<=pbl_2_2]]]]
normalized: ~ [E [true U ~ [[[~ [2<=pol_d1_n1_2_1] | [3<=pol_d1_n1_2_2 | pbl_1_1<=pbl_2_2]] | ~ [1<=pb_d2_n1_1_2]]]]]

abstracting: (1<=pb_d2_n1_1_2) states: 22,219,994,884 (10)
abstracting: (pbl_1_1<=pbl_2_2) states: 31,196,851,738 (10)
abstracting: (3<=pol_d1_n1_2_2) states: 0
abstracting: (2<=pol_d1_n1_2_1) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [[2<=pi_d2_n1_1_2 | [pil_d1_n1_1_1<=pol_d1_n1_1_2 | [pi_d2_n1_1_2<=pol_d1_n1_2_1 | 1<=pil_d1_n1_1_2]]]]
normalized: ~ [E [true U ~ [[2<=pi_d2_n1_1_2 | [pil_d1_n1_1_1<=pol_d1_n1_1_2 | [pi_d2_n1_1_2<=pol_d1_n1_2_1 | 1<=pil_d1_n1_1_2]]]]]]

abstracting: (1<=pil_d1_n1_1_2) states: 32,978,865,411 (10)
abstracting: (pi_d2_n1_1_2<=pol_d1_n1_2_1) states: 45,210,817,491 (10)
abstracting: (pil_d1_n1_1_1<=pol_d1_n1_1_2) states: 39,505,177,062 (10)
abstracting: (2<=pi_d2_n1_1_2) states: 0
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.637sec

checking: AG [[~ [[3<=pi_d2_n1_1_2 | 3<=pi_d2_n1_2_1]] | [[pbl_1_1<=pol_d1_n1_1_2 & pi_d2_n1_1_1<=po_d1_n1_1_2] | 1<=pb_d1_n1_2_1]]]
normalized: ~ [E [true U ~ [[~ [[3<=pi_d2_n1_1_2 | 3<=pi_d2_n1_2_1]] | [1<=pb_d1_n1_2_1 | [pbl_1_1<=pol_d1_n1_1_2 & pi_d2_n1_1_1<=po_d1_n1_1_2]]]]]]

abstracting: (pi_d2_n1_1_1<=po_d1_n1_1_2) states: 39,505,177,062 (10)
abstracting: (pbl_1_1<=pol_d1_n1_1_2) states: 23,106,129,515 (10)
abstracting: (1<=pb_d1_n1_2_1) states: 22,219,994,884 (10)
abstracting: (3<=pi_d2_n1_2_1) states: 0
abstracting: (3<=pi_d2_n1_1_2) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[~ [2<=pol_d1_n1_1_1] | [[pol_d1_n1_1_2<=po_d2_n1_1_2 | pbl_2_1<=pb_d2_n1_1_1] | [3<=pol_d2_n1_2_2 & 3<=pol_d1_n1_1_1]]]]
normalized: ~ [E [true U ~ [[~ [2<=pol_d1_n1_1_1] | [[pol_d1_n1_1_2<=po_d2_n1_1_2 | pbl_2_1<=pb_d2_n1_1_1] | [3<=pol_d2_n1_2_2 & 3<=pol_d1_n1_1_1]]]]]]

abstracting: (3<=pol_d1_n1_1_1) states: 0
abstracting: (3<=pol_d2_n1_2_2) states: 0
abstracting: (pbl_2_1<=pb_d2_n1_1_1) states: 22,279,649,927 (10)
abstracting: (pol_d1_n1_1_2<=po_d2_n1_1_2) states: 30,990,215,811 (10)
abstracting: (2<=pol_d1_n1_1_1) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[[2<=pol_d1_n1_2_2 | [2<=po_d2_n1_2_1 | pb_d1_n2_2_2<=pb_d1_n1_1_2]] | [~ [3<=po_d1_n1_2_1] | ~ [pb_d1_n2_2_1<=pol_d1_n1_2_1]]]]
normalized: ~ [E [true U ~ [[[2<=pol_d1_n1_2_2 | [2<=po_d2_n1_2_1 | pb_d1_n2_2_2<=pb_d1_n1_1_2]] | [~ [pb_d1_n2_2_1<=pol_d1_n1_2_1] | ~ [3<=po_d1_n1_2_1]]]]]]

abstracting: (3<=po_d1_n1_2_1) states: 0
abstracting: (pb_d1_n2_2_1<=pol_d1_n1_2_1) states: 38,589,160,786 (10)
abstracting: (pb_d1_n2_2_2<=pb_d1_n1_1_2) states: 36,456,320,605 (10)
abstracting: (2<=po_d2_n1_2_1) states: 0
abstracting: (2<=pol_d1_n1_2_2) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[po_d2_n1_1_2<=pol_d2_n1_1_1 | [[pol_d1_n1_2_2<=pol_d1_n1_1_1 | 3<=pol_d2_n1_1_2] | [po_d1_n1_2_1<=pi_d1_n1_2_2 | 3<=pb_d1_n1_2_1]]]]
normalized: ~ [E [true U ~ [[po_d2_n1_1_2<=pol_d2_n1_1_1 | [[po_d1_n1_2_1<=pi_d1_n1_2_2 | 3<=pb_d1_n1_2_1] | [pol_d1_n1_2_2<=pol_d1_n1_1_1 | 3<=pol_d2_n1_1_2]]]]]]

abstracting: (3<=pol_d2_n1_1_2) states: 0
abstracting: (pol_d1_n1_2_2<=pol_d1_n1_1_1) states: 39,505,177,062 (10)
abstracting: (3<=pb_d1_n1_2_1) states: 2,279,178,356 (9)
abstracting: (po_d1_n1_2_1<=pi_d1_n1_2_2) states: 39,505,177,062 (10)
abstracting: (po_d2_n1_1_2<=pol_d2_n1_1_1) states: 45,210,817,491 (10)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.300sec

checking: EF [[[~ [pbl_2_2<=po_d1_n1_1_2] & [1<=po_d1_n1_1_1 & 1<=pil_d2_n1_1_2]] & [[1<=pol_d2_n1_1_2 & 2<=pi_d1_n1_1_1] & [pil_d2_n1_2_2<=pol_d2_n1_1_2 | pb_d1_n1_1_2<=pil_d1_n1_1_2]]]]
normalized: E [true U [[[pil_d2_n1_2_2<=pol_d2_n1_1_2 | pb_d1_n1_1_2<=pil_d1_n1_1_2] & [1<=pol_d2_n1_1_2 & 2<=pi_d1_n1_1_1]] & [[1<=po_d1_n1_1_1 & 1<=pil_d2_n1_1_2] & ~ [pbl_2_2<=po_d1_n1_1_2]]]]

abstracting: (pbl_2_2<=po_d1_n1_1_2) states: 18,636,323,755 (10)
abstracting: (1<=pil_d2_n1_1_2) states: 32,978,865,411 (10)
abstracting: (1<=po_d1_n1_1_1) states: 18,758,263,731 (10)
abstracting: (2<=pi_d1_n1_1_1) states: 0
abstracting: (1<=pol_d2_n1_1_2) states: 32,978,865,411 (10)
abstracting: (pb_d1_n1_1_2<=pil_d1_n1_1_2) states: 38,589,160,786 (10)
abstracting: (pil_d2_n1_2_2<=pol_d2_n1_1_2) states: 39,505,177,062 (10)
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec


Total processing time: 0m21.685sec


BK_STOP 1465071860371

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

548 485 550 780 1389 1041 1483 1791 1709 1799 1112 1780 1706 3015 2420
iterations count:15972 (249), effective:1963 (30)

initing FirstDep: 0m 0.000sec

8591 9047 8003 17181 11529 16478 17677 19473 18680 11862 11393 11033
iterations count:12543 (195), effective:847 (13)
5292 10450 13805 12849 19092 15570
iterations count:6864 (107), effective:440 (6)
6151 12558 14640 12527 17091 17314 18479 19877 13026
iterations count:9320 (145), effective:604 (9)

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="HypertorusGrid-PT-d2k2p1b00"
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/HypertorusGrid-PT-d2k2p1b00.tgz
mv HypertorusGrid-PT-d2k2p1b00 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 HypertorusGrid-PT-d2k2p1b00, 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-146468028000601"
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 ;