Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r513-tall-167987241000361.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Murphy-PT-D4N025, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241000361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 22K Mar 26 22:42 model.pnml

--------------------
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 Murphy-PT-D4N025-CTLCardinality-00
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-01
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-02
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-03
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-04
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-05
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-06
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-07
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-08
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-09
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-10
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-11
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-12
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-13
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-14
FORMULA_NAME Murphy-PT-D4N025-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679895123805

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N025
Not applying reductions.
Model is PT
CTLCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_COL_D4_N25
(NrP: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.883sec


RS generation: 0m10.488sec


-> reachability set: #nodes 25113 (2.5e+04) #states 20,012,606,308,670,976 (16)



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

checking: AF [AX [EG [EF [17<=p1_4]]]]
normalized: ~ [EG [EX [~ [EG [E [true U 17<=p1_4]]]]]]

abstracting: (17<=p1_4)
states: 5,950,535,723,543,808 (15)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m31.488sec

checking: EG [E [~ [A [AX [p2_4<=25] U p1_1<=3]] U 19<=p5_2]]
normalized: EG [E [~ [[~ [EG [~ [p1_1<=3]]] & ~ [E [~ [p1_1<=3] U [EX [~ [p2_4<=25]] & ~ [p1_1<=3]]]]]] U 19<=p5_2]]

abstracting: (19<=p5_2)
states: 0
abstracting: (p1_1<=3)
states: 4,742,937,928,175,616 (15)
abstracting: (p2_4<=25)
states: 17,089,131,942,121,536 (16)
.abstracting: (p1_1<=3)
states: 4,742,937,928,175,616 (15)
abstracting: (p1_1<=3)
states: 4,742,937,928,175,616 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.502sec

checking: AF [~ [[EX [[~ [EG [p0_3<=7]] & AX [2<=p1_3]]] & EX [AG [AF [25<=p3_4]]]]]]
normalized: ~ [EG [[EX [~ [E [true U EG [~ [25<=p3_4]]]]] & EX [[~ [EX [~ [2<=p1_3]]] & ~ [EG [p0_3<=7]]]]]]]

abstracting: (p0_3<=7)
states: 8,458,955,548,932,096 (15)
.
EG iterations: 1
abstracting: (2<=p1_3)
states: 17,498,773,988,467,200 (16)
..abstracting: (25<=p3_4)
states: 0

EG iterations: 0
..
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.811sec

checking: EX [~ [AF [[EF [[14<=p4_3 & p0_3<=0]] | ~ [AF [p0_3<=7]]]]]]
normalized: EX [EG [~ [[EG [~ [p0_3<=7]] | E [true U [14<=p4_3 & p0_3<=0]]]]]]

abstracting: (p0_3<=0)
states: 1,331,807,098,152,960 (15)
abstracting: (14<=p4_3)
states: 0
abstracting: (p0_3<=7)
states: 8,458,955,548,932,096 (15)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Murphy-PT-D4N025-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.063sec

checking: AG [E [~ [AG [A [1<=p2_3 U 8<=p2_1]]] U 12<=p2_3]]
normalized: ~ [E [true U ~ [E [E [true U ~ [[~ [EG [~ [8<=p2_1]]] & ~ [E [~ [8<=p2_1] U [~ [1<=p2_3] & ~ [8<=p2_1]]]]]]] U 12<=p2_3]]]]

abstracting: (12<=p2_3)
states: 8,664,392,514,057,120 (15)
abstracting: (8<=p2_1)
states: 11,553,650,759,738,880 (16)
abstracting: (1<=p2_3)
states: 18,680,799,210,518,016 (16)
abstracting: (8<=p2_1)
states: 11,553,650,759,738,880 (16)
abstracting: (8<=p2_1)
states: 11,553,650,759,738,880 (16)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.471sec

checking: EX [AX [AG [[~ [5<=p2_4] | [~ [p1_5<=p4_3] | [20<=p1_3 & 15<=p3_4]]]]]]
normalized: EX [~ [EX [E [true U ~ [[[[20<=p1_3 & 15<=p3_4] | ~ [p1_5<=p4_3]] | ~ [5<=p2_4]]]]]]]

abstracting: (5<=p2_4)
states: 14,222,590,267,032,576 (16)
abstracting: (p1_5<=p4_3)
states: 2,513,831,824,198,656 (15)
abstracting: (15<=p3_4)
states: 0
abstracting: (20<=p1_3)
states: 4,732,794,534,042,432 (15)
..-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.497sec

checking: AF [AG [~ [[A [15<=p0_5 U p1_2<=p5_1] | [18<=p4_1 | p1_5<=13]]]]]
normalized: ~ [EG [E [true U [[18<=p4_1 | p1_5<=13] | [~ [EG [~ [p1_2<=p5_1]]] & ~ [E [~ [p1_2<=p5_1] U [~ [15<=p0_5] & ~ [p1_2<=p5_1]]]]]]]]]

abstracting: (p1_2<=p5_1)
states: 3,082,348,425,192,192 (15)
abstracting: (15<=p0_5)
states: 6,921,915,086,116,224 (15)
abstracting: (p1_2<=p5_1)
states: 3,082,348,425,192,192 (15)
abstracting: (p1_2<=p5_1)
states: 3,082,348,425,192,192 (15)
.
EG iterations: 1
abstracting: (p1_5<=13)
states: 12,535,800,031,260,576 (16)
abstracting: (18<=p4_1)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.303sec

checking: ~ [AF [E [A [[E [3<=p3_3 U p5_1<=p0_4] | ~ [p5_3<=p5_2]] U [p2_3<=p3_2 | [p5_4<=19 & 24<=p2_2]]] U EF [A [p0_5<=1 U p1_4<=10]]]]]
normalized: EG [~ [E [[~ [EG [~ [[p2_3<=p3_2 | [p5_4<=19 & 24<=p2_2]]]]] & ~ [E [~ [[p2_3<=p3_2 | [p5_4<=19 & 24<=p2_2]]] U [~ [[~ [p5_3<=p5_2] | E [3<=p3_3 U p5_1<=p0_4]]] & ~ [[p2_3<=p3_2 | [p5_4<=19 & 24<=p2_2]]]]]]] U E [true U [~ [E [~ [p1_4<=10] U [~ [p0_5<=1] & ~ [p1_4<=10]]]] & ~ [EG [~ [p1_4<=10]]]]]]]]

abstracting: (p1_4<=10)
states: 10,715,597,867,495,232 (16)
.
EG iterations: 1
abstracting: (p1_4<=10)
states: 10,715,597,867,495,232 (16)
abstracting: (p0_5<=1)
states: 2,513,795,135,993,856 (15)
abstracting: (p1_4<=10)
states: 10,715,597,867,495,232 (16)
abstracting: (24<=p2_2)
states: 3,442,624,780,668,480 (15)
abstracting: (p5_4<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_3<=p3_2)
states: 1,922,801,117,073,408 (15)
abstracting: (p5_1<=p0_4)
states: 18,114,774,041,624,832 (16)
abstracting: (3<=p3_3)
states: 0
abstracting: (p5_3<=p5_2)
states: 12,785,831,808,317,568 (16)
abstracting: (24<=p2_2)
states: 3,442,624,780,668,480 (15)
abstracting: (p5_4<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_3<=p3_2)
states: 1,922,801,117,073,408 (15)
abstracting: (24<=p2_2)
states: 3,442,624,780,668,480 (15)
abstracting: (p5_4<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_3<=p3_2)
states: 1,922,801,117,073,408 (15)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.303sec

checking: AX [E [EF [[[A [5<=p2_3 U p2_2<=p0_1] | A [p3_2<=p3_4 U p2_2<=p1_1]] & EG [10<=p4_1]]] U [[2<=p3_3 | AF [[p5_5<=p2_5 & p1_1<=17]]] & ~ [AG [7<=p4_2]]]]]
normalized: ~ [EX [~ [E [E [true U [[[~ [EG [~ [p2_2<=p1_1]]] & ~ [E [~ [p2_2<=p1_1] U [~ [p3_2<=p3_4] & ~ [p2_2<=p1_1]]]]] | [~ [EG [~ [p2_2<=p0_1]]] & ~ [E [~ [p2_2<=p0_1] U [~ [5<=p2_3] & ~ [p2_2<=p0_1]]]]]] & EG [10<=p4_1]]] U [E [true U ~ [7<=p4_2]] & [2<=p3_3 | ~ [EG [~ [[p5_5<=p2_5 & p1_1<=17]]]]]]]]]]

abstracting: (p1_1<=17)
states: 14,486,191,003,103,040 (16)
abstracting: (p5_5<=p2_5)
states: 18,114,774,041,624,832 (16)
.
EG iterations: 1
abstracting: (2<=p3_3)
states: 0
abstracting: (7<=p4_2)
states: 0
abstracting: (10<=p4_1)
states: 0
.
EG iterations: 1
abstracting: (p2_2<=p0_1)
states: 10,340,271,134,189,568 (16)
abstracting: (5<=p2_3)
states: 14,222,590,267,032,576 (16)
abstracting: (p2_2<=p0_1)
states: 10,340,271,134,189,568 (16)
abstracting: (p2_2<=p0_1)
states: 10,340,271,134,189,568 (16)
.
EG iterations: 1
abstracting: (p2_2<=p1_1)
states: 10,340,264,818,211,328 (16)
abstracting: (p3_2<=p3_4)
states: 15,009,454,731,503,232 (16)
abstracting: (p2_2<=p1_1)
states: 10,340,264,818,211,328 (16)
abstracting: (p2_2<=p1_1)
states: 10,340,264,818,211,328 (16)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Murphy-PT-D4N025-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1679895662121

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


initing FirstDep: 0m 0.000sec


iterations count:23162 (661), effective:4563 (130)

initing FirstDep: 0m 0.000sec


iterations count:1967 (56), effective:361 (10)

iterations count:2521 (72), effective:471 (13)

iterations count:35 (1), effective:0 (0)

iterations count:1359 (38), effective:148 (4)

iterations count:288 (8), effective:125 (3)

iterations count:994 (28), effective:196 (5)

iterations count:6697 (191), effective:1492 (42)

iterations count:1197 (34), effective:233 (6)

iterations count:612 (17), effective:116 (3)

iterations count:629 (17), effective:127 (3)

iterations count:128 (3), effective:17 (0)

iterations count:721 (20), effective:134 (3)

iterations count:35 (1), effective:0 (0)

iterations count:759 (21), effective:134 (3)

iterations count:35 (1), effective:0 (0)

iterations count:35 (1), effective:0 (0)

iterations count:1220 (34), effective:126 (3)

iterations count:50 (1), effective:4 (0)

iterations count:35 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 338 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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="Murphy-PT-D4N025"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is Murphy-PT-D4N025, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r513-tall-167987241000361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D4N025.tgz
mv Murphy-PT-D4N025 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;