About the Execution of Marcie for S_PhaseVariation-PT-D02CS010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5415.050 | 11950.00 | 12049.00 | 20.20 | TFTTTTTFFTTTFTFT | 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 S_PhaseVariation-PT-D02CS010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433146200655
=====================================================================
--------------------
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 PhaseVariation-PT-D02CS010-ReachabilityCardinality-0
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-1
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-10
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-11
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-12
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-13
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-14
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-15
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-2
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-3
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-4
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-5
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-6
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-7
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-8
FORMULA_NAME PhaseVariation-PT-D02CS010-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464806136237
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: PhaseVariation_PT_D02CS010
(NrP: 14 NrTr: 65 NrArc: 443)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 7.518sec
RS generation: 0m 0.011sec
-> reachability set: #nodes 202 (2.0e+02) #states 7,716 (3)
starting MCC model checker
--------------------------
checking: AG [~ [~ [~ [2<=run_dot]]]]
normalized: ~ [E [true U 2<=run_dot]]
abstracting: (2<=run_dot) states: 0
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [3<=cell___1_1__B_]]
normalized: ~ [E [true U 3<=cell___1_1__B_]]
abstracting: (3<=cell___1_1__B_) states: 0
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [cell___2_1__A_<=cell___2_1__A_]
normalized: ~ [E [true U ~ [cell___2_1__A_<=cell___2_1__A_]]]
abstracting: (cell___2_1__A_<=cell___2_1__A_) states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [cell___1_2__A_<=size_dot]
normalized: ~ [E [true U ~ [cell___1_2__A_<=size_dot]]]
abstracting: (cell___1_2__A_<=size_dot) states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [pool__2_1_<=pool__2_1_]
normalized: ~ [E [true U ~ [pool__2_1_<=pool__2_1_]]]
abstracting: (pool__2_1_<=pool__2_1_) states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[~ [cell___1_1__A_<=cell___1_1__A_] & 3<=cell___2_1__A_]]]
normalized: ~ [E [true U [3<=cell___2_1__A_ & ~ [cell___1_1__A_<=cell___1_1__A_]]]]
abstracting: (cell___1_1__A_<=cell___1_1__A_) states: 7,716 (3)
abstracting: (3<=cell___2_1__A_) states: 891
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [~ [[pool__2_1_<=pool__1_2_ & size_dot<=cell___2_2__B_]]]]
normalized: E [true U [pool__2_1_<=pool__1_2_ & size_dot<=cell___2_2__B_]]
abstracting: (size_dot<=cell___2_2__B_) states: 0
abstracting: (pool__2_1_<=pool__1_2_) states: 5,172 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[~ [2<=pool__2_2_] | ~ [2<=cell___2_1__A_]] | ~ [~ [cell___2_2__B_<=cell___2_2__B_]]]]
normalized: ~ [E [true U ~ [[cell___2_2__B_<=cell___2_2__B_ | [~ [2<=pool__2_2_] | ~ [2<=cell___2_1__A_]]]]]]
abstracting: (2<=cell___2_1__A_) states: 2,534 (3)
abstracting: (2<=pool__2_2_) states: 1,896 (3)
abstracting: (cell___2_2__B_<=cell___2_2__B_) states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[pool__2_1_<=cell___1_2__B_ | [cell___2_2__A_<=pool__2_2_ | ~ [3<=cell___2_2__B_]]]]
normalized: ~ [E [true U ~ [[pool__2_1_<=cell___1_2__B_ | [cell___2_2__A_<=pool__2_2_ | ~ [3<=cell___2_2__B_]]]]]]
abstracting: (3<=cell___2_2__B_) states: 891
abstracting: (cell___2_2__A_<=pool__2_2_) states: 4,291 (3)
abstracting: (pool__2_1_<=cell___1_2__B_) states: 5,445 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[~ [1<=run_dot] & ~ [pool__1_2_<=run_dot]] | ~ [~ [pool__2_2_<=pool__2_2_]]]]
normalized: ~ [E [true U ~ [[pool__2_2_<=pool__2_2_ | [~ [pool__1_2_<=run_dot] & ~ [1<=run_dot]]]]]]
abstracting: (1<=run_dot) states: 6,000 (3)
abstracting: (pool__1_2_<=run_dot) states: 5,364 (3)
abstracting: (pool__2_2_<=pool__2_2_) states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[cell___1_1__B_<=cell___1_1__B_ | 3<=pool__2_1_] | ~ [cell___1_2__B_<=cell___2_2__B_]]]]
normalized: E [true U ~ [[[cell___1_1__B_<=cell___1_1__B_ | 3<=pool__2_1_] | ~ [cell___1_2__B_<=cell___2_2__B_]]]]
abstracting: (cell___1_2__B_<=cell___2_2__B_) states: 4,977 (3)
abstracting: (3<=pool__2_1_) states: 600
abstracting: (cell___1_1__B_<=cell___1_1__B_) states: 7,716 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[[size_dot<=cell___1_2__B_ | 3<=cell___2_1__A_] | [3<=size_dot | 2<=cell___2_2__A_]] | 1<=pool__2_1_]]
normalized: ~ [E [true U ~ [[1<=pool__2_1_ | [[3<=size_dot | 2<=cell___2_2__A_] | [size_dot<=cell___1_2__B_ | 3<=cell___2_1__A_]]]]]]
abstracting: (3<=cell___2_1__A_) states: 891
abstracting: (size_dot<=cell___1_2__B_) states: 0
abstracting: (2<=cell___2_2__A_) states: 2,534 (3)
abstracting: (3<=size_dot) states: 7,707 (3)
abstracting: (1<=pool__2_1_) states: 4,152 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [[[pool__1_2_<=pool__1_1_ & pool__2_1_<=size_dot] & ~ [cell___2_1__A_<=cell___2_1__A_]]]]
normalized: ~ [E [true U [[pool__1_2_<=pool__1_1_ & pool__2_1_<=size_dot] & ~ [cell___2_1__A_<=cell___2_1__A_]]]]
abstracting: (cell___2_1__A_<=cell___2_1__A_) states: 7,716 (3)
abstracting: (pool__2_1_<=size_dot) states: 7,709 (3)
abstracting: (pool__1_2_<=pool__1_1_) states: 4,760 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[[[cell___1_2__A_<=run_dot | 2<=cell___2_2__A_] | [1<=cell___1_1__A_ & 1<=run_dot]] & 1<=size_dot]]
normalized: ~ [E [true U ~ [[1<=size_dot & [[1<=cell___1_1__A_ & 1<=run_dot] | [cell___1_2__A_<=run_dot | 2<=cell___2_2__A_]]]]]]
abstracting: (2<=cell___2_2__A_) states: 2,534 (3)
abstracting: (cell___1_2__A_<=run_dot) states: 4,691 (3)
abstracting: (1<=run_dot) states: 6,000 (3)
abstracting: (1<=cell___1_1__A_) states: 7,716 (3)
abstracting: (1<=size_dot) states: 7,716 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: EF [[[~ [cell___2_2__B_<=cell___1_1__A_] & [size_dot<=cell___2_2__A_ & cell___2_2__A_<=pool__1_2_]] & ~ [cell___1_1__A_<=cell___1_2__A_]]]
normalized: E [true U [[~ [cell___2_2__B_<=cell___1_1__A_] & [size_dot<=cell___2_2__A_ & cell___2_2__A_<=pool__1_2_]] & ~ [cell___1_1__A_<=cell___1_2__A_]]]
abstracting: (cell___1_1__A_<=cell___1_2__A_) states: 3,322 (3)
abstracting: (cell___2_2__A_<=pool__1_2_) states: 4,562 (3)
abstracting: (size_dot<=cell___2_2__A_) states: 0
abstracting: (cell___2_2__B_<=cell___1_1__A_) states: 6,213 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[[~ [run_dot<=pool__1_1_] | cell___1_1__A_<=pool__2_2_] & [[pool__2_2_<=cell___1_1__A_ & 1<=pool__2_1_] & ~ [cell___2_2__A_<=size_dot]]]]
normalized: E [true U [[~ [cell___2_2__A_<=size_dot] & [pool__2_2_<=cell___1_1__A_ & 1<=pool__2_1_]] & [cell___1_1__A_<=pool__2_2_ | ~ [run_dot<=pool__1_1_]]]]
abstracting: (run_dot<=pool__1_1_) states: 4,716 (3)
abstracting: (cell___1_1__A_<=pool__2_2_) states: 2,732 (3)
abstracting: (1<=pool__2_1_) states: 4,152 (3)
abstracting: (pool__2_2_<=cell___1_1__A_) states: 6,584 (3)
abstracting: (cell___2_2__A_<=size_dot) states: 7,716 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
Total processing time: 0m11.887sec
BK_STOP 1464806148187
--------------------
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
iterations count:580 (8), effective:28 (0)
initing FirstDep: 0m 0.000sec
iterations count:209 (3), effective:10 (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="S_PhaseVariation-PT-D02CS010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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_PhaseVariation-PT-D02CS010.tgz
mv S_PhaseVariation-PT-D02CS010 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 S_PhaseVariation-PT-D02CS010, 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 r173kn-ebro-146433146200655"
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 '
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 ;