About the Execution of MARCIE for PhaseVariation-PT-D02CS010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7483.490 | 7628.00 | 7020.00 | 30.00 | TFTTFTFFFFTTTTFT | 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-3254
Executing tool marcie
Input is PhaseVariation-PT-D02CS010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r041-smll-149440525400097
=====================================================================
--------------------
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 1494518493874
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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
parse successfull
net created successfully
Net: PhaseVariation_PT_D02CS010
(NrP: 14 NrTr: 65 NrArc: 443)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.298sec
parse successfull
net created successfully
Net: PhaseVariation_PT_D02CS010
(NrP: 14 NrTr: 65 NrArc: 443)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.895sec
RS generation: 0m 0.008sec
-> reachability set: #nodes 187 (1.9e+02) #states 7,716 (3)
starting MCC model checker
--------------------------
checking: AG [1<=size_dot]
normalized: ~ [E [true U ~ [1<=size_dot]]]
abstracting: (1<=size_dot)
states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-7 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-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [size_dot<=cell___2_1__B_]
normalized: E [true U size_dot<=cell___2_1__B_]
abstracting: (size_dot<=cell___2_1__B_)
states: 0
-> 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: EF [~ [cell___1_2__B_<=size_dot]]
normalized: E [true U ~ [cell___1_2__B_<=size_dot]]
abstracting: (cell___1_2__B_<=size_dot)
states: 7,716 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [~ [[1<=size_dot | size_dot<=pool__2_2_]]]]
normalized: ~ [E [true U ~ [[1<=size_dot | size_dot<=pool__2_2_]]]]
abstracting: (size_dot<=pool__2_2_)
states: 30
abstracting: (1<=size_dot)
states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[~ [3<=run_dot] | [run_dot<=pool__1_1_ | 3<=pool__2_1_]]]]
normalized: E [true U ~ [[[run_dot<=pool__1_1_ | 3<=pool__2_1_] | ~ [3<=run_dot]]]]
abstracting: (3<=run_dot)
states: 0
abstracting: (3<=pool__2_1_)
states: 600
abstracting: (run_dot<=pool__1_1_)
states: 4,716 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[2<=run_dot & [1<=cell___1_1__B_ | 3<=cell___2_1__B_]] & ~ [~ [2<=pool__1_2_]]]]
normalized: E [true U [[[1<=cell___1_1__B_ | 3<=cell___2_1__B_] & 2<=run_dot] & 2<=pool__1_2_]]
abstracting: (2<=pool__1_2_)
states: 1,896 (3)
abstracting: (2<=run_dot)
states: 0
abstracting: (3<=cell___2_1__B_)
states: 891
abstracting: (1<=cell___1_1__B_)
states: 4,032 (3)
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[size_dot<=cell___2_2__A_ | ~ [[cell___2_2__A_<=cell___2_1__B_ | 1<=size_dot]]]]
normalized: E [true U [~ [[cell___2_2__A_<=cell___2_1__B_ | 1<=size_dot]] | size_dot<=cell___2_2__A_]]
abstracting: (size_dot<=cell___2_2__A_)
states: 0
abstracting: (1<=size_dot)
states: 7,716 (3)
abstracting: (cell___2_2__A_<=cell___2_1__B_)
states: 4,977 (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 [[~ [[3<=cell___2_1__A_ | 2<=cell___2_2__B_]] | ~ [[size_dot<=cell___2_1__B_ & pool__2_2_<=cell___1_1__A_]]]]
normalized: ~ [E [true U ~ [[~ [[size_dot<=cell___2_1__B_ & pool__2_2_<=cell___1_1__A_]] | ~ [[3<=cell___2_1__A_ | 2<=cell___2_2__B_]]]]]]
abstracting: (2<=cell___2_2__B_)
states: 2,534 (3)
abstracting: (3<=cell___2_1__A_)
states: 891
abstracting: (pool__2_2_<=cell___1_1__A_)
states: 6,584 (3)
abstracting: (size_dot<=cell___2_1__B_)
states: 0
-> 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_2__A_<=pool__1_2_ | pool__1_2_<=cell___1_2__B_] | [2<=pool__2_1_ | 2<=cell___1_2__A_]] | 2<=cell___2_1__B_]]
normalized: ~ [E [true U ~ [[[[2<=pool__2_1_ | 2<=cell___1_2__A_] | [cell___1_2__A_<=pool__1_2_ | pool__1_2_<=cell___1_2__B_]] | 2<=cell___2_1__B_]]]]
abstracting: (2<=cell___2_1__B_)
states: 2,534 (3)
abstracting: (pool__1_2_<=cell___1_2__B_)
states: 5,068 (3)
abstracting: (cell___1_2__A_<=pool__1_2_)
states: 4,291 (3)
abstracting: (2<=cell___1_2__A_)
states: 2,534 (3)
abstracting: (2<=pool__2_1_)
states: 1,896 (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: EF [[[[size_dot<=pool__1_1_ & 1<=cell___2_1__A_] & [1<=cell___2_1__A_ | pool__2_1_<=pool__1_2_]] & 3<=cell___1_2__A_]]
normalized: E [true U [[[1<=cell___2_1__A_ | pool__2_1_<=pool__1_2_] & [size_dot<=pool__1_1_ & 1<=cell___2_1__A_]] & 3<=cell___1_2__A_]]
abstracting: (3<=cell___1_2__A_)
states: 891
abstracting: (1<=cell___2_1__A_)
states: 4,825 (3)
abstracting: (size_dot<=pool__1_1_)
states: 7
abstracting: (pool__2_1_<=pool__1_2_)
states: 5,172 (3)
abstracting: (1<=cell___2_1__A_)
states: 4,825 (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
checking: AG [[[~ [pool__2_1_<=cell___2_2__A_] | ~ [size_dot<=cell___1_2__B_]] | [run_dot<=cell___1_2__A_ & ~ [3<=cell___1_1__B_]]]]
normalized: ~ [E [true U ~ [[[run_dot<=cell___1_2__A_ & ~ [3<=cell___1_1__B_]] | [~ [size_dot<=cell___1_2__B_] | ~ [pool__2_1_<=cell___2_2__A_]]]]]]
abstracting: (pool__2_1_<=cell___2_2__A_)
states: 5,445 (3)
abstracting: (size_dot<=cell___1_2__B_)
states: 0
abstracting: (3<=cell___1_1__B_)
states: 0
abstracting: (run_dot<=cell___1_2__A_)
states: 5,316 (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: EF [[[~ [cell___2_1__A_<=pool__1_1_] & [pool__2_1_<=pool__2_1_ & 3<=cell___1_2__A_]] & ~ [~ [cell___1_1__B_<=cell___2_2__A_]]]]
normalized: E [true U [[[pool__2_1_<=pool__2_1_ & 3<=cell___1_2__A_] & ~ [cell___2_1__A_<=pool__1_1_]] & cell___1_1__B_<=cell___2_2__A_]]
abstracting: (cell___1_1__B_<=cell___2_2__A_)
states: 5,797 (3)
abstracting: (cell___2_1__A_<=pool__1_1_)
states: 4,135 (3)
abstracting: (3<=cell___1_2__A_)
states: 891
abstracting: (pool__2_1_<=pool__2_1_)
states: 7,716 (3)
-> the formula is TRUE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AG [[[cell___1_2__A_<=run_dot | pool__1_2_<=pool__1_2_] | [[cell___2_2__A_<=cell___2_1__B_ & 2<=pool__2_2_] & 1<=cell___2_1__B_]]]
normalized: ~ [E [true U ~ [[[1<=cell___2_1__B_ & [cell___2_2__A_<=cell___2_1__B_ & 2<=pool__2_2_]] | [cell___1_2__A_<=run_dot | pool__1_2_<=pool__1_2_]]]]]
abstracting: (pool__1_2_<=pool__1_2_)
states: 7,716 (3)
abstracting: (cell___1_2__A_<=run_dot)
states: 4,691 (3)
abstracting: (2<=pool__2_2_)
states: 1,896 (3)
abstracting: (cell___2_2__A_<=cell___2_1__B_)
states: 4,977 (3)
abstracting: (1<=cell___2_1__B_)
states: 4,825 (3)
-> 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<=pool__1_2_ | [[pool__2_2_<=cell___2_2__A_ & run_dot<=run_dot] | [pool__2_1_<=cell___1_1__A_ | cell___1_2__B_<=size_dot]]]]
normalized: ~ [E [true U ~ [[3<=pool__1_2_ | [[pool__2_1_<=cell___1_1__A_ | cell___1_2__B_<=size_dot] | [pool__2_2_<=cell___2_2__A_ & run_dot<=run_dot]]]]]]
abstracting: (run_dot<=run_dot)
states: 7,716 (3)
abstracting: (pool__2_2_<=cell___2_2__A_)
states: 5,068 (3)
abstracting: (cell___1_2__B_<=size_dot)
states: 7,716 (3)
abstracting: (pool__2_1_<=cell___1_1__A_)
states: 6,584 (3)
abstracting: (3<=pool__1_2_)
states: 600
-> 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: EF [[[[size_dot<=cell___1_2__B_ & pool__2_2_<=cell___1_1__B_] & [1<=cell___1_1__B_ | 3<=pool__2_2_]] & [[cell___1_2__A_<=cell___1_2__A_ & cell___1_1__A_<=cell___1_2__A_] & ~ [3<=cell___1_2__B_]]]]
normalized: E [true U [[~ [3<=cell___1_2__B_] & [cell___1_2__A_<=cell___1_2__A_ & cell___1_1__A_<=cell___1_2__A_]] & [[1<=cell___1_1__B_ | 3<=pool__2_2_] & [size_dot<=cell___1_2__B_ & pool__2_2_<=cell___1_1__B_]]]]
abstracting: (pool__2_2_<=cell___1_1__B_)
states: 4,984 (3)
abstracting: (size_dot<=cell___1_2__B_)
states: 0
abstracting: (3<=pool__2_2_)
states: 600
abstracting: (1<=cell___1_1__B_)
states: 4,032 (3)
abstracting: (cell___1_1__A_<=cell___1_2__A_)
states: 3,322 (3)
abstracting: (cell___1_2__A_<=cell___1_2__A_)
states: 7,716 (3)
abstracting: (3<=cell___1_2__B_)
states: 891
-> the formula is FALSE
FORMULA PhaseVariation-PT-D02CS010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 7122 (7.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 22888 38449 61337
used/not used/entry size/cache size: 40150 67068714 16 1024MB
basic ops cache: hits/miss/sum: 7345 12017 19362
used/not used/entry size/cache size: 22104 16755112 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1911 2233 4144
used/not used/entry size/cache size: 2233 8386375 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67102244
1 6381
2 169
3 30
4 11
5 5
6 4
7 4
8 2
9 1
>= 10 13
Total processing time: 0m 7.514sec
BK_STOP 1494518501502
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
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:592 (9), effective:28 (0)
initing FirstDep: 0m 0.000sec
iterations count:201 (3), effective:8 (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="PhaseVariation-PT-D02CS010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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/PhaseVariation-PT-D02CS010.tgz
mv PhaseVariation-PT-D02CS010 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is 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 r041-smll-149440525400097"
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 ;