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 S_Diffusion2D-PT-D20N010, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r134st-blw3-143297579900255
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433373359506

Model: S_Diffusion2D-PT-D20N010
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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 400 NrTr: 2964 NrArc: 5928)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m56sec


-> reachability set: #nodes 4390 (4.4e+03) #states 32,308,197,757,577,553,240 (19)



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

checking: maxVal(cAMP__19_16_)<=1
normalized: maxVal(cAMP__19_16_)<=1

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__15_13_)<=1
normalized: maxVal(cAMP__15_13_)<=1

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__10_1_)<=3 & maxVal(cAMP__9_2_)<=1] & [maxVal(cAMP__17_13_)<=2 & [maxVal(cAMP__20_2_)<=1 & maxVal(cAMP__13_6_)<=2]]]
normalized: [[maxVal(cAMP__17_13_)<=2 & [maxVal(cAMP__20_2_)<=1 & maxVal(cAMP__13_6_)<=2]] & [maxVal(cAMP__10_1_)<=3 & maxVal(cAMP__9_2_)<=1]]

abstracting: (10<=1) states: 0
abstracting: (10<=3) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__16_9_)<=2
normalized: maxVal(cAMP__16_9_)<=2

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

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__7_6_)<=1 & [[maxVal(cAMP__14_11_)<=3 & [[maxVal(cAMP__6_17_)<=1 & [maxVal(cAMP__20_1_)<=2 & maxVal(cAMP__19_7_)<=2]] & maxVal(cAMP__9_15_)<=1]] & [maxVal(cAMP__18_13_)<=2 & maxVal(cAMP__20_20_)<=2]]]
normalized: [maxVal(cAMP__7_6_)<=1 & [[maxVal(cAMP__14_11_)<=3 & [maxVal(cAMP__9_15_)<=1 & [maxVal(cAMP__6_17_)<=1 & [maxVal(cAMP__20_1_)<=2 & maxVal(cAMP__19_7_)<=2]]]] & [maxVal(cAMP__18_13_)<=2 & maxVal(cAMP__20_20_)<=2]]]

abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=3) states: 0
abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__8_7_)<=1
normalized: maxVal(cAMP__8_7_)<=1

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__2_5_)<=1
normalized: maxVal(cAMP__2_5_)<=1

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__16_1_)<=3
normalized: maxVal(cAMP__16_1_)<=3

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

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__17_4_)<=3
normalized: maxVal(cAMP__17_4_)<=3

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

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(cAMP__16_6_)<=2 & maxVal(cAMP__18_1_)<=3] & maxVal(cAMP__9_10_)<=3]
normalized: [maxVal(cAMP__9_10_)<=3 & [maxVal(cAMP__16_6_)<=2 & maxVal(cAMP__18_1_)<=3]]

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

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__13_16_)<=2 & [[[maxVal(cAMP__16_1_)<=1 & maxVal(cAMP__15_11_)<=2] & [[maxVal(cAMP__19_12_)<=1 & maxVal(cAMP__19_7_)<=3] & maxVal(cAMP__16_6_)<=2]] & maxVal(cAMP__9_3_)<=1]]
normalized: [maxVal(cAMP__13_16_)<=2 & [maxVal(cAMP__9_3_)<=1 & [[maxVal(cAMP__16_1_)<=1 & maxVal(cAMP__15_11_)<=2] & [maxVal(cAMP__16_6_)<=2 & [maxVal(cAMP__19_12_)<=1 & maxVal(cAMP__19_7_)<=3]]]]]

abstracting: (10<=3) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=2) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__18_3_)<=2
normalized: maxVal(cAMP__18_3_)<=2

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

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(cAMP__19_7_)<=1 & [[[[[maxVal(cAMP__1_2_)<=1 & maxVal(cAMP__6_5_)<=3] & maxVal(cAMP__7_16_)<=1] & maxVal(cAMP__3_12_)<=2] & maxVal(cAMP__12_6_)<=2] & maxVal(cAMP__5_14_)<=1]]
normalized: [maxVal(cAMP__19_7_)<=1 & [maxVal(cAMP__5_14_)<=1 & [maxVal(cAMP__12_6_)<=2 & [maxVal(cAMP__3_12_)<=2 & [maxVal(cAMP__7_16_)<=1 & [maxVal(cAMP__1_2_)<=1 & maxVal(cAMP__6_5_)<=3]]]]]]

abstracting: (10<=3) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=2) states: 0
abstracting: (10<=1) states: 0
abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__12_12_)<=2
normalized: maxVal(cAMP__12_12_)<=2

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

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__12_17_)<=1
normalized: maxVal(cAMP__12_17_)<=1

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(cAMP__17_10_)<=1
normalized: maxVal(cAMP__17_10_)<=1

abstracting: (10<=1) states: 0
-> the formula is FALSE

FORMULA Diffusion2D-PT-D20N010-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 1m27sec


BK_STOP 1433373447326

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

473 511 552 591 628 669 710 741 753 763 771 777 783 789 794 799 804 808 812 816 820 833 845 857 868 880 891 903 915 929 942 954 967 980 993 1008 1023 1037 1051 1067 1084 1100 1116 1135 1154 1173 1208 1232 1253 1272 1280 1286 1291 1296 1300 1303 1307 1310 1313 1315 1318 1321 1322 1324 1325 1327 1329 1330 1337 1348 1355 1361 1365 1370 1373 1377 1380 1383 1386 1389 1391 1394 1396 1398 1400 1410 1423 1432 1441 1450 1459 1470 1485 1496 1506 1518 1535 1548 1566 1585 1601 1603 1604 1606 1607 1608 1610 1611 1613 1614 1616 1617 1618 1620 1621 1623 1624 1625 1627 1628 1629 1631 1632 1633 1635 1636 1637 1639 1640 1641 1642 1644 1645 1646 1647 1649 1650 1651 1652 1654 1655 1656 1657 1659 1660 1661 1662 1663 1665 1666 1667 1668 1669 1671 1672 1673 1674 1675 1676 1678 1679 1680 1681 1682 1683 1684 1685 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1698 1699 1700 1705 1717 1729 1740 1752 1763 1775 1786 1800 1813 1826 1838 1851 1864 1878 1893 1907 1921 1935 1952 1969 1984 2000 2021 2039 2060 2083 2110 2146 2171 2181 2188 2194 2199 2203 2207 2211 2214 2217 2220 2223 2225 2228 2230 2231 2232 2233 2233 2234 2235 2236 2237 2237 2238 2239 2240 2240 2248 2258 2266 2272 2277 2281 2285 2289 2292 2296 2299 2302 2304 2307 2309 2312 2314 2316 2318 2320 2329 2341 2349 2357 2365 2372 2380 2388 2397 2411 2420 2429 2438 2447 2457 2472 2482 2493 2504 2521 2534 2549 2569 2601 2622 2632 2639 2644 2650 2654 2658 2661 2664 2667 2670 2671 2672 2672 2673 2674 2674 2675 2675 2676 2677 2677 2678 2678 2679 2680 2680 2681 2681 2682 2683 2683 2684 2684 2685 2686 2686 2687 2688 2688 2689 2689 2690 2691 2691 2692 2692 2693 2694 2694 2695 2695 2696 2697 2697 2698 2698 2699 2700 2700 2701 2701 2702 2703 2703 2704 2704 2705 2706 2706 2707 2707 2708 2709 2709 2710 2710 2711 2712 2712 2713 2713 2714 2715 2715 2716 2716 2717 2718 2718 2719 2719 2720 2721 2722 2723 2724 2725 2726 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2777 2778 2779 2780 2781 2782 2783 2784 2785 2787 2788 2789 2790 2793 2800 2806 2812 2818 2824 2830 2837 2843 2849 2855 2861 2867 2873 2879 2885 2891 2897 2903 2909 2915 2922 2928 2934 2940 2946 2952 2958 2964 2970 2976 2982 2988 2995 3001 3007 3013 3019 3025 3032 3038 3044 3050 3056 3062 3068 3074 3080 3086 3092 3098 3104 3110 3116 3123 3129 3135 3141 3147 3153 3159 3165 3171 3177 3183 3189 3196 3202 3208 3214 3220 3226 3233 3239 3245 3251 3257 3263 3269 3275 3281 3287 3293 3299 3305 3311 3317 3324 3330 3336 3342 3348 3354 3360 3366 3372 3378 3384 3390 3397 3403 3409 3415 3421 3427 3434 3440 3446 3452 3458 3464 3470 3476 3482 3488 3494 3500 3506 3512 3519 3525 3531 3537 3543 3549 3555 3561 3567 3573 3579 3585 3591 3598 3604 3610 3616 3622 3628 3635 3641 3647 3653 3659 3665 3671 3677 3683 3689 3695 3701 3707 3713 3720 3726 3732 3738 3744 3750 3756 3762 3768 3774 3780 3786 3792 3799 3805 3811 3817 3823 3830 3836 3842 3848 3854 3860 3866 3872 3878 3884 3890 3896 3902 3908 3914 3920 3927 3933 3939 3945 3951 3957 3963 3969 3975 3981 3987 3993 4000 4006 4029 4036 4048 4055 4063 4075 4080 4093 4099 4112 4117 4129 4135 4140 4153 4157 4171 4175 4179 4192 4196 4201 4213 4218 4230 4234 4238 4251 4255 4259 4271 4275 4279 4291 4295 4299 4311 4315 4318 4331 4334 4337 4342 4353 4356 4360 4372 4375 4378
iterations count:690924 (233), effective:3990 (1)

initing FirstDep: 0m0sec

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="S_Diffusion2D-PT-D20N010"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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/S_Diffusion2D-PT-D20N010.tgz
mv S_Diffusion2D-PT-D20N010 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 S_Diffusion2D-PT-D20N010, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r134st-blw3-143297579900255"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;