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 Raft-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369143700160
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463740388348


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: Raft_PT_04
(NrP: 88 NrTr: 160 NrArc: 563)

net check time: 0m 0.000sec

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

init dd package: 0m 4.170sec


RS generation: 0m 2.175sec


-> reachability set: #nodes 358 (3.6e+02) #states 2,965,858,466,581 (12)



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

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

abstracting: (3<=p19) states: 0
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [1<=p82]
normalized: E [true U 1<=p82]

abstracting: (1<=p82) states: 593,171,693,316 (11)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

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

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

FORMULA Raft-PT-04-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-04-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Raft-PT-04-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p78 & ~ [p11<=p53]]]
normalized: E [true U [2<=p78 & ~ [p11<=p53]]]

abstracting: (p11<=p53) states: 2,493,683,343,941 (12)
abstracting: (2<=p78) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [[p72<=p70 | 1<=p58]]]]
normalized: ~ [E [true U ~ [[p72<=p70 | 1<=p58]]]]

abstracting: (1<=p58) states: 588,876,726,020 (11)
abstracting: (p72<=p70) states: 2,499,052,053,061 (12)
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.088sec

checking: AG [~ [[[2<=p39 | 2<=p3] & p66<=p76]]]
normalized: ~ [E [true U [p66<=p76 & [2<=p39 | 2<=p3]]]]

abstracting: (2<=p3) states: 0
abstracting: (2<=p39) states: 0
abstracting: (p66<=p76) states: 2,493,683,343,941 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[3<=p4 | [p71<=p43 | 3<=p37]]]
normalized: ~ [E [true U ~ [[3<=p4 | [p71<=p43 | 3<=p37]]]]]

abstracting: (3<=p37) states: 0
abstracting: (p71<=p43) states: 2,493,683,343,941 (12)
abstracting: (3<=p4) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.052sec

checking: AG [~ [[~ [p75<=p20] & [p3<=p80 & 3<=p55]]]]
normalized: ~ [E [true U [[p3<=p80 & 3<=p55] & ~ [p75<=p20]]]]

abstracting: (p75<=p20) states: 2,477,577,216,581 (12)
abstracting: (3<=p55) states: 0
abstracting: (p3<=p80) states: 2,499,052,053,061 (12)
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[p60<=p28 | 2<=p61] & [2<=p25 & p10<=p62]]]]
normalized: ~ [E [true U [[2<=p25 & p10<=p62] & [p60<=p28 | 2<=p61]]]]

abstracting: (2<=p61) states: 0
abstracting: (p60<=p28) states: 2,477,577,216,581 (12)
abstracting: (p10<=p62) states: 2,477,577,216,581 (12)
abstracting: (2<=p25) states: 0
-> the formula is TRUE

FORMULA Raft-PT-04-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[1<=p7 & p20<=p26] | [p74<=p72 & 1<=p27]] & ~ [~ [3<=p23]]]]
normalized: E [true U [3<=p23 & [[p74<=p72 & 1<=p27] | [1<=p7 & p20<=p26]]]]

abstracting: (p20<=p26) states: 2,477,577,216,581 (12)
abstracting: (1<=p7) states: 588,876,726,020 (11)
abstracting: (1<=p27) states: 588,876,726,020 (11)
abstracting: (p74<=p72) states: 2,376,981,740,561 (12)
abstracting: (3<=p23) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=p68 & 1<=p6] & ~ [3<=p19]] | [3<=p86 & [p7<=p6 & 3<=p12]]]]
normalized: E [true U [[3<=p86 & [p7<=p6 & 3<=p12]] | [~ [3<=p19] & [2<=p68 & 1<=p6]]]]

abstracting: (1<=p6) states: 588,876,726,020 (11)
abstracting: (2<=p68) states: 0
abstracting: (3<=p19) states: 0
abstracting: (3<=p12) states: 0
abstracting: (p7<=p6) states: 2,376,981,740,561 (12)
abstracting: (3<=p86) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[p19<=p15 & p23<=p47] | ~ [p57<=p52]] & 3<=p9]]
normalized: E [true U [3<=p9 & [[p19<=p15 & p23<=p47] | ~ [p57<=p52]]]]

abstracting: (p57<=p52) states: 2,493,683,343,941 (12)
abstracting: (p23<=p47) states: 2,493,683,343,941 (12)
abstracting: (p19<=p15) states: 2,499,052,053,061 (12)
abstracting: (3<=p9) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [[p38<=p34 & 1<=p87]] & [3<=p74 & [p29<=p35 & p52<=p62]]]]
normalized: E [true U [[3<=p74 & [p29<=p35 & p52<=p62]] & ~ [[p38<=p34 & 1<=p87]]]]

abstracting: (1<=p87) states: 741,464,616,645 (11)
abstracting: (p38<=p34) states: 2,493,683,343,941 (12)
abstracting: (p52<=p62) states: 2,493,683,343,941 (12)
abstracting: (p29<=p35) states: 2,499,052,053,061 (12)
abstracting: (3<=p74) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[p76<=p82 | [p49<=p33 | 3<=p35]] | [[2<=p56 & 3<=p45] & [p74<=p49 & 1<=p7]]]]
normalized: ~ [E [true U ~ [[[[2<=p56 & 3<=p45] & [p74<=p49 & 1<=p7]] | [p76<=p82 | [p49<=p33 | 3<=p35]]]]]]

abstracting: (3<=p35) states: 0
abstracting: (p49<=p33) states: 2,493,683,343,941 (12)
abstracting: (p76<=p82) states: 2,494,757,085,765 (12)
abstracting: (1<=p7) states: 588,876,726,020 (11)
abstracting: (p74<=p49) states: 2,493,683,343,941 (12)
abstracting: (3<=p45) states: 0
abstracting: (2<=p56) states: 0
-> the formula is FALSE

FORMULA Raft-PT-04-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.109sec


Total processing time: 0m 8.198sec


BK_STOP 1463740396586

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

216 191 222 275 271 357 343 334 391 320 344 395 375 381 271 341 289 339 476 495 484 521 510 485 443 559 577 522 415 541 559 572 553 476 492 452 531 506 307 386 587 507 303 491 620 516 381 524 596 439 450 529 510 346 451 531 555 348 424 534 557 400 405 516 560 403 317 481 613 552 757 814 757 519 568 634 617 472 734 747 700 497 543 418 584 716 655 826 902 860 708 419 690 514 629 782 722 806 927 883 697 494 630 581 488 549 593 479 588 645 613 424 439 467 649 608 595 743 576 557 434 553 604 676 563 734 749 717 533 443 617 694 686 616 739 693 718 462 436 490 620 557 637 717 661 525 437 347 469 571 509 655 712 638 453 363 553 625 672 584 756 770 738 554 464 554 626 698 585 756 771 739 555 465
iterations count:174963 (1093), effective:3412 (21)

initing FirstDep: 0m 0.000sec


iterations count:984 (6), effective:31 (0)
358
iterations count:1014 (6), effective:32 (0)

iterations count:807 (5), effective:24 (0)
278
iterations count:1387 (8), effective:53 (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="Raft-PT-04"
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/Raft-PT-04.tgz
mv Raft-PT-04 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 Raft-PT-04, 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 r101kn-smll-146369143700160"
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 ;