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 Solitaire-PT-SqrNC5x5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r106kn-smll-143285115200204
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433082630786

Model: Solitaire-PT-SqrNC5x5
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=2 --place-order=5

parse successfull
net created successfully

(NrP: 50 NrTr: 84 NrArc: 456)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m52sec


-> reachability set: #nodes 64614 (6.5e+04) #states 16,098,428 (7)



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

checking: EF [[3<=F36 & [F25<=T26 & ~ [F35<=T63]]]]
normalized: E [true U [3<=F36 & [F25<=T26 & ~ [F35<=T63]]]]

abstracting: (F35<=T63) states: 11,949,954 (7)
abstracting: (F25<=T26) states: 11,973,314 (7)
abstracting: (3<=F36) states: 0
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

checking: EF [~ [[T32<=T43 | [T34<=T34 | 3<=T26]]]]
normalized: E [true U ~ [[T32<=T43 | [T34<=T34 | 3<=T26]]]]

abstracting: (3<=T26) states: 0
abstracting: (T34<=T34) states: 16,098,428 (7)
abstracting: (T32<=T43) states: 12,072,505 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=T46 & 3<=T24] & T52<=T54] & [[2<=T62 | 3<=F66] | [T33<=T35 | T64<=T54]]]]
normalized: E [true U [[[T33<=T35 | T64<=T54] | [2<=T62 | 3<=F66]] & [T52<=T54 & [3<=T46 & 3<=T24]]]]

abstracting: (3<=T24) states: 0
abstracting: (3<=T46) states: 0
abstracting: (T52<=T54) states: 12,072,269 (7)
abstracting: (3<=F66) states: 0
abstracting: (2<=T62) states: 0
abstracting: (T64<=T54) states: 12,056,110 (7)
abstracting: (T33<=T35) states: 12,054,147 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [[[~ [F22<=F46] | ~ [3<=T36]] | 2<=T25]]
normalized: ~ [E [true U ~ [[2<=T25 | [~ [3<=T36] | ~ [F22<=F46]]]]]]

abstracting: (F22<=F46) states: 12,159,431 (7)
abstracting: (3<=T36) states: 0
abstracting: (2<=T25) states: 0
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10sec

checking: EF [[[[2<=T62 & 2<=F66] & 1<=T46] & F32<=F66]]
normalized: E [true U [F32<=F66 & [1<=T46 & [2<=T62 & 2<=F66]]]]

abstracting: (2<=F66) states: 0
abstracting: (2<=T62) states: 0
abstracting: (1<=T46) states: 7,913,667 (6)
abstracting: (F32<=F66) states: 11,972,437 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [T66<=F62]] & ~ [~ [2<=T63]]]]
normalized: E [true U [T66<=F62 & 2<=T63]]

abstracting: (2<=T63) states: 0
abstracting: (T66<=F62) states: 12,033,432 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[T56<=T26 | ~ [2<=F54]] | [3<=F66 | [2<=F65 | F53<=T63]]]]
normalized: ~ [E [true U ~ [[[3<=F66 | [2<=F65 | F53<=T63]] | [T56<=T26 | ~ [2<=F54]]]]]]

abstracting: (2<=F54) states: 0
abstracting: (T56<=T26) states: 12,183,322 (7)
abstracting: (F53<=T63) states: 11,965,256 (7)
abstracting: (2<=F65) states: 0
abstracting: (3<=F66) states: 0
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[3<=F55 | T43<=T52]] | ~ [[3<=T65 | 2<=T44]]]]
normalized: ~ [E [true U ~ [[~ [[3<=F55 | T43<=T52]] | ~ [[3<=T65 | 2<=T44]]]]]]

abstracting: (2<=T44) states: 0
abstracting: (3<=T65) states: 0
abstracting: (T43<=T52) states: 12,024,025 (7)
abstracting: (3<=F55) states: 0
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[F22<=F25 | T53<=T66]]]]
normalized: ~ [E [true U ~ [[F22<=F25 | T53<=T66]]]]

abstracting: (T53<=T66) states: 12,161,173 (7)
abstracting: (F22<=F25) states: 12,183,322 (7)
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m15sec

checking: AG [[~ [~ [F35<=F35]] | ~ [~ [T22<=T33]]]]
normalized: ~ [E [true U ~ [[F35<=F35 | T22<=T33]]]]

abstracting: (T22<=T33) states: 12,018,424 (7)
abstracting: (F35<=F35) states: 16,098,428 (7)
-> the formula is TRUE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14sec

checking: EF [[~ [~ [2<=T52]] & ~ [T65<=T24]]]
normalized: E [true U [2<=T52 & ~ [T65<=T24]]]

abstracting: (T65<=T24) states: 12,064,914 (7)
abstracting: (2<=T52) states: 0
-> the formula is FALSE

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m8sec

checking: AG [~ [[3<=F54 & 3<=F66]]]
normalized: ~ [E [true U [3<=F54 & 3<=F66]]]

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

FORMULA Solitaire-PT-SqrNC5x5-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 5m4sec


BK_STOP 1433082935801

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

.........10 64614.
initing FirstDep: 0m0sec

43714 87404 86940 89610 86890 88413 77804 80407 161859 152236 158222 156040 152594 154169 151260 143571 141966 129716 126756 133041 132973 132623 131738 132508 124138 123548 122056
iterations count:27184 (323), effective:1717 (20)

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="Solitaire-PT-SqrNC5x5"
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/Solitaire-PT-SqrNC5x5.tgz
mv Solitaire-PT-SqrNC5x5 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 Solitaire-PT-SqrNC5x5, 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 r106kn-smll-143285115200204"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;