Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r513-tall-167987240900353.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-D3N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987240900353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 18K 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-D3N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D3N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679894796624

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-D3N050
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_D3_N50
(NrP: 24 NrTr: 28 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.822sec


RS generation: 0m17.558sec


-> reachability set: #nodes 39729 (4.0e+04) #states 540,710,084,330,928 (14)



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

checking: EF [46<=p0_4]
normalized: E [true U 46<=p0_4]

abstracting: (46<=p0_4)
states: 93,920,928,731,136 (13)
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.142sec

checking: EF [~ [EF [AX [p0_1<=41]]]]
normalized: E [true U ~ [E [true U ~ [EX [~ [p0_1<=41]]]]]]

abstracting: (p0_1<=41)
states: 429,291,390,883,248 (14)
.-> the formula is FALSE

FORMULA Murphy-PT-D3N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.380sec

checking: ~ [A [~ [p4_3<=6] U AG [~ [p1_1<=12]]]]
normalized: ~ [[~ [EG [E [true U p1_1<=12]]] & ~ [E [E [true U p1_1<=12] U [p4_3<=6 & E [true U p1_1<=12]]]]]]

abstracting: (p1_1<=12)
states: 196,419,143,172,528 (14)
abstracting: (p4_3<=6)
states: 540,710,084,330,928 (14)
abstracting: (p1_1<=12)
states: 196,419,143,172,528 (14)
abstracting: (p1_1<=12)
states: 196,419,143,172,528 (14)

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.887sec

checking: AG [AF [AG [E [[14<=p5_4 | p4_3<=22] U ~ [p1_4<=34]]]]]
normalized: ~ [E [true U EG [E [true U ~ [E [[14<=p5_4 | p4_3<=22] U ~ [p1_4<=34]]]]]]]

abstracting: (p1_4<=34)
states: 391,809,286,547,856 (14)
abstracting: (p4_3<=22)
states: 540,710,084,330,928 (14)
abstracting: (14<=p5_4)
states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.942sec

checking: EF [[p4_2<=p1_4 & AX [[[AX [29<=p4_1] | AG [p0_1<=23]] & ~ [AX [p4_1<=5]]]]]]
normalized: E [true U [p4_2<=p1_4 & ~ [EX [~ [[[~ [E [true U ~ [p0_1<=23]]] | ~ [EX [~ [29<=p4_1]]]] & EX [~ [p4_1<=5]]]]]]]]

abstracting: (p4_1<=5)
states: 540,710,084,330,928 (14)
.abstracting: (29<=p4_1)
states: 0
.abstracting: (p0_1<=23)
states: 311,575,528,095,408 (14)
.abstracting: (p4_2<=p1_4)
states: 523,023,299,143,200 (14)
-> the formula is FALSE

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

MC time: 0m 8.431sec

checking: EG [[32<=p1_4 & AF [[AG [[p1_3<=p5_4 | p0_2<=6]] | ~ [E [p2_4<=30 U 49<=p2_3]]]]]]
normalized: EG [[32<=p1_4 & ~ [EG [~ [[~ [E [p2_4<=30 U 49<=p2_3]] | ~ [E [true U ~ [[p1_3<=p5_4 | p0_2<=6]]]]]]]]]]

abstracting: (p0_2<=6)
states: 115,032,726,723,888 (14)
abstracting: (p1_3<=p5_4)
states: 43,549,551,170,928 (13)
abstracting: (49<=p2_3)
states: 82,463,707,003,392 (13)
abstracting: (p2_4<=30)
states: 365,962,169,256,624 (14)
.
EG iterations: 1
abstracting: (32<=p1_4)
states: 167,836,221,696,672 (14)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D3N050-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m26.317sec

checking: EG [AX [AG [[[[p0_2<=11 | p3_1<=19] | ~ [p4_3<=29]] | ~ [A [p4_4<=43 U p3_4<=p0_1]]]]]]
normalized: EG [~ [EX [E [true U ~ [[~ [[~ [EG [~ [p3_4<=p0_1]]] & ~ [E [~ [p3_4<=p0_1] U [~ [p4_4<=43] & ~ [p3_4<=p0_1]]]]]] | [~ [p4_3<=29] | [p0_2<=11 | p3_1<=19]]]]]]]]

abstracting: (p3_1<=19)
states: 540,710,084,330,928 (14)
abstracting: (p0_2<=11)
states: 184,058,905,015,728 (14)
abstracting: (p4_3<=29)
states: 540,710,084,330,928 (14)
abstracting: (p3_4<=p0_1)
states: 531,867,172,967,136 (14)
abstracting: (p4_4<=43)
states: 540,710,084,330,928 (14)
abstracting: (p3_4<=p0_1)
states: 531,867,172,967,136 (14)
abstracting: (p3_4<=p0_1)
states: 531,867,172,967,136 (14)
.
EG iterations: 1
.
EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.548sec

checking: EG [~ [EG [[p5_3<=p2_2 | EX [A [p0_4<=p2_4 U p1_2<=p3_3]]]]]]
normalized: EG [~ [EG [[p5_3<=p2_2 | EX [[~ [EG [~ [p1_2<=p3_3]]] & ~ [E [~ [p1_2<=p3_3] U [~ [p0_4<=p2_4] & ~ [p1_2<=p3_3]]]]]]]]]]

abstracting: (p1_2<=p3_3)
states: 26,530,177,781,592 (13)
abstracting: (p0_4<=p2_4)
states: 540,710,084,330,928 (14)
abstracting: (p1_2<=p3_3)
states: 26,530,177,781,592 (13)
abstracting: (p1_2<=p3_3)
states: 26,530,177,781,592 (13)
.
EG iterations: 1
.abstracting: (p5_3<=p2_2)
states: 514,347,678,487,296 (14)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.850sec

checking: EX [AG [[AX [p0_3<=p3_1] | [AG [[p5_4<=46 | 50<=p1_2]] | E [EF [20<=p5_3] U ~ [p1_4<=19]]]]]]
normalized: EX [~ [E [true U ~ [[[E [E [true U 20<=p5_3] U ~ [p1_4<=19]] | ~ [E [true U ~ [[p5_4<=46 | 50<=p1_2]]]]] | ~ [EX [~ [p0_3<=p3_1]]]]]]]]

abstracting: (p0_3<=p3_1)
states: 26,529,097,516,344 (13)
.abstracting: (50<=p1_2)
states: 78,832,678,605,264 (13)
abstracting: (p5_4<=46)
states: 540,710,084,330,928 (14)
abstracting: (p1_4<=19)
states: 274,331,358,745,776 (14)
abstracting: (20<=p5_3)
states: 0
.-> the formula is TRUE

FORMULA Murphy-PT-D3N050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1679895114371

--------------------
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:20755 (741), effective:4264 (152)

initing FirstDep: 0m 0.000sec


iterations count:3131 (111), effective:612 (21)

iterations count:357 (12), effective:163 (5)

iterations count:273 (9), effective:199 (7)

iterations count:273 (9), effective:199 (7)

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

iterations count:273 (9), effective:199 (7)

iterations count:2488 (88), effective:479 (17)

iterations count:1185 (42), effective:241 (8)

iterations count:1036 (37), effective:201 (7)

iterations count:2797 (99), effective:587 (20)

iterations count:28 (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-D3N050"
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-D3N050, 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-167987240900353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D3N050.tgz
mv Murphy-PT-D3N050 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 ;