fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution%20of%20r221su-smll-146468028000597
Last Updated
June 30, 2016

About the Execution of Marcie for HypertorusGrid-PT-d2k2p1b00

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5799.910 46524.00 46049.00 30.10 FFFTTFTFTFTTFFTF normal

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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028000597
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1465071585740


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=CTLCardinality.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.016sec


RS generation: 0m 0.936sec


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



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

checking: AF [1<=po_d1_n1_2_2]
normalized: ~ [EG [~ [1<=po_d1_n1_2_2]]]

abstracting: (1<=po_d1_n1_2_2) states: 18,758,263,731 (10)
.............
EG iterations: 13
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.817sec

checking: AF [AG [1<=po_d2_n1_1_1]]
normalized: ~ [EG [E [true U ~ [1<=po_d2_n1_1_1]]]]

abstracting: (1<=po_d2_n1_1_1) states: 18,758,263,731 (10)
......
EG iterations: 6
-> the formula is FALSE

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

MC time: 0m 0.415sec

checking: ~ [AX [EF [2<=po_d1_n1_1_1]]]
normalized: EX [~ [E [true U 2<=po_d1_n1_1_1]]]

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

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

MC time: 0m 0.001sec

checking: AF [[3<=pb_d1_n2_1_1 & 3<=pb_d2_n1_2_1]]
normalized: ~ [EG [~ [[3<=pb_d1_n2_1_1 & 3<=pb_d2_n1_2_1]]]]

abstracting: (3<=pb_d2_n1_2_1) states: 2,279,178,356 (9)
abstracting: (3<=pb_d1_n2_1_1) states: 2,279,178,356 (9)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.076sec

checking: AG [AF [pol_d2_n1_2_1<=pil_d2_n1_2_1]]
normalized: ~ [E [true U EG [~ [pol_d2_n1_2_1<=pil_d2_n1_2_1]]]]

abstracting: (pol_d2_n1_2_1<=pil_d2_n1_2_1) states: 39,505,177,062 (10)
....................
EG iterations: 20
-> the formula is FALSE

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

MC time: 0m 3.670sec

checking: AF [EX [[1<=pol_d2_n1_2_2 & 3<=pb_d2_n1_1_1]]]
normalized: ~ [EG [~ [EX [[1<=pol_d2_n1_2_2 & 3<=pb_d2_n1_1_1]]]]]

abstracting: (3<=pb_d2_n1_1_1) states: 2,279,178,356 (9)
abstracting: (1<=pol_d2_n1_2_2) states: 32,978,865,411 (10)
...........
EG iterations: 10
-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.181sec

checking: AX [AF [~ [po_d2_n1_1_2<=po_d2_n1_2_1]]]
normalized: ~ [EX [EG [po_d2_n1_1_2<=po_d2_n1_2_1]]]

abstracting: (po_d2_n1_1_2<=po_d2_n1_2_1) states: 39,505,177,062 (10)
.............
EG iterations: 13
.-> the formula is FALSE

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.938sec

checking: [EF [2<=pb_d1_n2_2_2] & EG [[~ [1<=pi_d1_n1_1_2] | [1<=pb_d1_n1_2_2 & 2<=pb_d2_n1_2_2]]]]
normalized: [EG [[[1<=pb_d1_n1_2_2 & 2<=pb_d2_n1_2_2] | ~ [1<=pi_d1_n1_1_2]]] & E [true U 2<=pb_d1_n2_2_2]]

abstracting: (2<=pb_d1_n2_2_2) states: 8,095,580,786 (9)
abstracting: (1<=pi_d1_n1_1_2) states: 18,758,263,731 (10)
abstracting: (2<=pb_d2_n1_2_2) states: 8,095,580,786 (9)
abstracting: (1<=pb_d1_n1_2_2) states: 22,219,994,884 (10)
.............
EG iterations: 13
-> the formula is TRUE

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

MC time: 0m 3.561sec

checking: EG [~ [~ [[pi_d1_n1_1_2<=pi_d1_n1_2_1 | pil_d2_n1_2_1<=pil_d1_n1_1_1]]]]
normalized: EG [[pi_d1_n1_1_2<=pi_d1_n1_2_1 | pil_d2_n1_2_1<=pil_d1_n1_1_1]]

abstracting: (pil_d2_n1_2_1<=pil_d1_n1_1_1) states: 39,505,177,062 (10)
abstracting: (pi_d1_n1_1_2<=pi_d1_n1_2_1) states: 39,505,177,062 (10)
.........
EG iterations: 9
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.743sec

checking: [pbl_1_1<=pb_d2_n1_2_2 & EF [EG [pb_d1_n2_1_2<=pb_d1_n1_2_1]]]
normalized: [pbl_1_1<=pb_d2_n1_2_2 & E [true U EG [pb_d1_n2_1_2<=pb_d1_n1_2_1]]]

abstracting: (pb_d1_n2_1_2<=pb_d1_n1_2_1) states: 36,456,320,605 (10)
......
EG iterations: 6
abstracting: (pbl_1_1<=pb_d2_n1_2_2) states: 22,279,649,927 (10)
-> the formula is TRUE

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

MC time: 0m 4.474sec

checking: ~ [EF [[2<=po_d1_n1_2_1 & [po_d2_n1_1_2<=pb_d1_n2_2_2 | 2<=pol_d2_n1_2_1]]]]
normalized: ~ [E [true U [2<=po_d1_n1_2_1 & [po_d2_n1_1_2<=pb_d1_n2_2_2 | 2<=pol_d2_n1_2_1]]]]

abstracting: (2<=pol_d2_n1_2_1) states: 0
abstracting: (po_d2_n1_1_2<=pb_d1_n2_2_2) states: 40,797,750,799 (10)
abstracting: (2<=po_d1_n1_2_1) states: 0
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [EX [po_d1_n1_2_2<=pb_d2_n1_1_2] U [3<=pb_d1_n2_2_1 & [3<=pil_d1_n1_1_1 & 1<=po_d2_n1_2_1]]]
normalized: [~ [EG [~ [[3<=pb_d1_n2_2_1 & [3<=pil_d1_n1_1_1 & 1<=po_d2_n1_2_1]]]]] & ~ [E [~ [[3<=pb_d1_n2_2_1 & [3<=pil_d1_n1_1_1 & 1<=po_d2_n1_2_1]]] U [~ [[3<=pb_d1_n2_2_1 & [3<=pil_d1_n1_1_1 & 1<=po_d2_n1_2_1]]] & ~ [EX [po_d1_n1_2_2<=pb_d2_n1_1_2]]]]]]

abstracting: (po_d1_n1_2_2<=pb_d2_n1_1_2) states: 40,797,750,799 (10)
.abstracting: (1<=po_d2_n1_2_1) states: 18,758,263,731 (10)
abstracting: (3<=pil_d1_n1_1_1) states: 0
abstracting: (3<=pb_d1_n2_2_1) states: 2,279,178,356 (9)
abstracting: (1<=po_d2_n1_2_1) states: 18,758,263,731 (10)
abstracting: (3<=pil_d1_n1_1_1) states: 0
abstracting: (3<=pb_d1_n2_2_1) states: 2,279,178,356 (9)
abstracting: (1<=po_d2_n1_2_1) states: 18,758,263,731 (10)
abstracting: (3<=pil_d1_n1_1_1) states: 0
abstracting: (3<=pb_d1_n2_2_1) states: 2,279,178,356 (9)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m21.314sec

checking: [pi_d2_n1_1_1<=pol_d2_n1_1_1 & ~ [EG [[pbl_1_1<=pb_d2_n1_1_1 | pb_d1_n1_1_2<=po_d2_n1_1_2]]]]
normalized: [pi_d2_n1_1_1<=pol_d2_n1_1_1 & ~ [EG [[pbl_1_1<=pb_d2_n1_1_1 | pb_d1_n1_1_2<=po_d2_n1_1_2]]]]

abstracting: (pb_d1_n1_1_2<=po_d2_n1_1_2) states: 34,569,521,828 (10)
abstracting: (pbl_1_1<=pb_d2_n1_1_1) states: 22,154,762,307 (10)
......
EG iterations: 6
abstracting: (pi_d2_n1_1_1<=pol_d2_n1_1_1) states: 45,210,817,491 (10)
-> the formula is FALSE

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

MC time: 0m 0.583sec

checking: E [[[pi_d1_n1_2_2<=po_d1_n1_1_2 | pbl_1_2<=po_d2_n1_2_1] | ~ [3<=pb_d1_n2_2_2]] U EG [pb_d2_n2_1_1<=pil_d1_n1_1_1]]
normalized: E [[~ [3<=pb_d1_n2_2_2] | [pi_d1_n1_2_2<=po_d1_n1_1_2 | pbl_1_2<=po_d2_n1_2_1]] U EG [pb_d2_n2_1_1<=pil_d1_n1_1_1]]

abstracting: (pb_d2_n2_1_1<=pil_d1_n1_1_1) states: 38,589,160,786 (10)
..........
EG iterations: 10
abstracting: (pbl_1_2<=po_d2_n1_2_1) states: 18,636,323,755 (10)
abstracting: (pi_d1_n1_2_2<=po_d1_n1_1_2) states: 39,505,177,062 (10)
abstracting: (3<=pb_d1_n2_2_2) states: 2,279,178,356 (9)
-> the formula is TRUE

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.283sec

checking: EG [[[~ [2<=pb_d1_n1_1_1] | [1<=pb_d2_n1_2_1 | pol_d2_n1_1_1<=pb_d2_n1_1_2]] | ~ [[pbl_2_1<=pol_d1_n1_2_2 & 1<=pi_d1_n1_2_1]]]]
normalized: EG [[~ [[pbl_2_1<=pol_d1_n1_2_2 & 1<=pi_d1_n1_2_1]] | [[1<=pb_d2_n1_2_1 | pol_d2_n1_1_1<=pb_d2_n1_1_2] | ~ [2<=pb_d1_n1_1_1]]]]

abstracting: (2<=pb_d1_n1_1_1) states: 8,095,580,786 (9)
abstracting: (pol_d2_n1_1_1<=pb_d2_n1_1_2) states: 33,159,373,227 (10)
abstracting: (1<=pb_d2_n1_2_1) states: 22,219,994,884 (10)
abstracting: (1<=pi_d1_n1_2_1) states: 18,758,263,731 (10)
abstracting: (pbl_2_1<=pol_d1_n1_2_2) states: 23,106,129,515 (10)
......
EG iterations: 6
-> the formula is TRUE

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

MC time: 0m 0.374sec

checking: [AF [[~ [1<=pol_d1_n1_1_1] & [3<=pi_d2_n1_2_1 & po_d1_n1_2_2<=pbl_2_2]]] & E [pi_d2_n1_1_2<=pbl_2_1 U [pi_d2_n1_2_1<=pol_d2_n1_2_1 & 3<=pi_d1_n1_1_1]]]
normalized: [E [pi_d2_n1_1_2<=pbl_2_1 U [pi_d2_n1_2_1<=pol_d2_n1_2_1 & 3<=pi_d1_n1_1_1]] & ~ [EG [~ [[[3<=pi_d2_n1_2_1 & po_d1_n1_2_2<=pbl_2_2] & ~ [1<=pol_d1_n1_1_1]]]]]]

abstracting: (1<=pol_d1_n1_1_1) states: 32,978,865,411 (10)
abstracting: (po_d1_n1_2_2<=pbl_2_2) states: 47,379,974,907 (10)
abstracting: (3<=pi_d2_n1_2_1) states: 0

EG iterations: 0
abstracting: (3<=pi_d1_n1_1_1) states: 0
abstracting: (pi_d2_n1_2_1<=pol_d2_n1_2_1) states: 45,210,817,491 (10)
abstracting: (pi_d2_n1_1_2<=pbl_2_1) states: 47,379,974,907 (10)
-> the formula is FALSE

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

MC time: 0m 0.013sec


Total processing time: 0m46.474sec


BK_STOP 1465071632264

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

3477
iterations count:1011 (15), effective:61 (0)
8097 13965 14738 11367 12047 9108
iterations count:6029 (94), effective:364 (5)
5876 10065 11000 13591 19829 14392
iterations count:6829 (106), effective:434 (6)
8549 11935 16770 21128 21565 7203
iterations count:6463 (100), effective:454 (7)
11139 14025 15866 22127 20839 14486 15520 15756 19904 24357 21247 23308 18747 24093 23314 20775 24329 25904 26787 27675 32085 32346 25798 24712 15992 13673
iterations count:26537 (414), effective:1921 (30)
6710
iterations count:1734 (27), effective:116 (1)

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="CTLCardinality"
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 CTLCardinality"
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-146468028000597"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;