fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r513-tall-167987240900345
Last Updated
May 14, 2023

About the Execution of Marcie for Murphy-PT-D2N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 363679.00 0.00 0.00 TF????FTFFFF?T?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.6K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K 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 4.4K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 20K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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.3K 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 14K 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-D2N100-CTLCardinality-00
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-01
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-02
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-03
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-04
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-05
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-06
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-07
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-08
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-09
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-10
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-11
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-12
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-13
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-14
FORMULA_NAME Murphy-PT-D2N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679894210451

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-D2N100
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_D2_N100
(NrP: 18 NrTr: 21 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.767sec


RS generation: 0m21.500sec


-> reachability set: #nodes 53223 (5.3e+04) #states 1,207,044,185,616 (12)



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

checking: EF [EG [[~ [AX [17<=p3_2]] & 20<=p3_2]]]
normalized: E [true U EG [[EX [~ [17<=p3_2]] & 20<=p3_2]]]

abstracting: (20<=p3_2)
states: 0
abstracting: (17<=p3_2)
states: 0
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.747sec

checking: EG [EG [~ [E [p5_1<=77 U ~ [p0_3<=34]]]]]
normalized: EG [EG [~ [E [p5_1<=77 U ~ [p0_3<=34]]]]]

abstracting: (p0_3<=34)
states: 549,386,606,160 (11)
abstracting: (p5_1<=77)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.663sec

checking: EX [AG [~ [EX [[AX [44<=p0_3] | ~ [p3_2<=34]]]]]]
normalized: EX [~ [E [true U EX [[~ [p3_2<=34] | ~ [EX [~ [44<=p0_3]]]]]]]]

abstracting: (44<=p0_3)
states: 555,382,795,968 (11)
.abstracting: (p3_2<=34)
states: 1,207,044,185,616 (12)
..-> the formula is FALSE

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

MC time: 0m 9.277sec

checking: AG [EG [[AX [35<=p2_1] | ~ [AX [[100<=p2_3 & p4_3<=74]]]]]]
normalized: ~ [E [true U ~ [EG [[EX [~ [[100<=p2_3 & p4_3<=74]]] | ~ [EX [~ [35<=p2_1]]]]]]]]

abstracting: (35<=p2_1)
states: 657,657,579,456 (11)
.abstracting: (p4_3<=74)
states: 1,207,044,185,616 (12)
abstracting: (100<=p2_3)
states: 166,856,796,288 (11)
..
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m34.875sec

checking: [~ [EF [AX [EF [16<=p2_3]]]] | [AF [p1_3<=47] | ~ [EF [AG [p3_3<=61]]]]]
normalized: [[~ [E [true U ~ [E [true U ~ [p3_3<=61]]]]] | ~ [EG [~ [p1_3<=47]]]] | ~ [E [true U ~ [EX [~ [E [true U 16<=p2_3]]]]]]]

abstracting: (16<=p2_3)
states: 922,782,212,352 (11)
.abstracting: (p1_3<=47)
states: 692,794,038,096 (11)
.
EG iterations: 1
abstracting: (p3_3<=61)
states: 1,207,044,185,616 (12)
-> the formula is FALSE

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

MC time: 0m 3.300sec

checking: E [EF [AX [AX [~ [p2_3<=p2_3]]]] U AG [p2_3<=p2_3]]
normalized: E [E [true U ~ [EX [EX [p2_3<=p2_3]]]] U ~ [E [true U ~ [p2_3<=p2_3]]]]

abstracting: (p2_3<=p2_3)
states: 1,207,044,185,616 (12)
abstracting: (p2_3<=p2_3)
states: 1,207,044,185,616 (12)
..-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [AG [[AX [[[p1_2<=p4_2 | AX [p5_3<=p5_1]] & ~ [[p3_1<=18 | 82<=p1_1]]]] | p0_1<=60]]]
normalized: E [true U ~ [[p0_1<=60 | ~ [EX [~ [[~ [[p3_1<=18 | 82<=p1_1]] & [p1_2<=p4_2 | ~ [EX [~ [p5_3<=p5_1]]]]]]]]]]]

abstracting: (p5_3<=p5_1)
states: 771,167,118,588 (11)
.abstracting: (p1_2<=p4_2)
states: 38,768,451,336 (10)
abstracting: (82<=p1_1)
states: 253,670,589,216 (11)
abstracting: (p3_1<=18)
states: 1,207,044,185,616 (12)
.abstracting: (p0_1<=60)
states: 809,879,543,280 (11)
-> the formula is TRUE

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

MC time: 0m18.392sec

checking: EF [~ [AF [~ [[[[p3_3<=31 | 45<=p5_2] & [p1_2<=90 & p4_2<=p1_3]] & [AX [p5_1<=82] | p4_3<=p4_3]]]]]]
normalized: E [true U EG [[[p4_3<=p4_3 | ~ [EX [~ [p5_1<=82]]]] & [[p1_2<=90 & p4_2<=p1_3] & [p3_3<=31 | 45<=p5_2]]]]]

abstracting: (45<=p5_2)
states: 0
abstracting: (p3_3<=31)
states: 1,207,044,185,616 (12)
abstracting: (p4_2<=p1_3)
states: 1,187,575,696,728 (12)
abstracting: (p1_2<=90)
states: 1,000,363,344,048 (12)
abstracting: (p5_1<=82)
states: 1,207,044,185,616 (12)
.abstracting: (p4_3<=p4_3)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.035sec

checking: [~ [EF [40<=p3_2]] & E [AG [[A [[91<=p4_1 & p0_3<=73] U ~ [p2_1<=p2_3]] | E [56<=p2_2 U AF [p5_3<=88]]]] U AX [~ [p3_3<=p2_1]]]]
normalized: [E [~ [E [true U ~ [[E [56<=p2_2 U ~ [EG [~ [p5_3<=88]]]] | [~ [EG [p2_1<=p2_3]] & ~ [E [p2_1<=p2_3 U [p2_1<=p2_3 & ~ [[91<=p4_1 & p0_3<=73]]]]]]]]]] U ~ [EX [p3_3<=p2_1]]] & ~ [E [true U 40<=p3_2]]]

abstracting: (40<=p3_2)
states: 0
abstracting: (p3_3<=p2_1)
states: 1,197,313,691,148 (12)
.abstracting: (p0_3<=73)
states: 904,707,364,752 (11)
abstracting: (91<=p4_1)
states: 0
abstracting: (p2_1<=p2_3)
states: 608,450,537,592 (11)
abstracting: (p2_1<=p2_3)
states: 608,450,537,592 (11)
abstracting: (p2_1<=p2_3)
states: 608,450,537,592 (11)
.
EG iterations: 1
abstracting: (p5_3<=88)
states: 1,207,044,185,616 (12)
.
EG iterations: 1
abstracting: (56<=p2_2)
states: 439,312,507,200 (11)
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.134sec

checking: E [[AG [AX [AX [77<=p3_2]]] | AX [EX [EX [p3_1<=45]]]] U ~ [[A [[p3_2<=p1_3 | p4_2<=14] U [p5_3<=p3_1 | p5_3<=40]] & EF [EX [46<=p0_3]]]]]
normalized: E [[~ [EX [~ [EX [EX [p3_1<=45]]]]] | ~ [E [true U EX [EX [~ [77<=p3_2]]]]]] U ~ [[E [true U EX [46<=p0_3]] & [~ [EG [~ [[p5_3<=p3_1 | p5_3<=40]]]] & ~ [E [~ [[p5_3<=p3_1 | p5_3<=40]] U [~ [[p3_2<=p1_3 | p4_2<=14]] & ~ [[p5_3<=p3_1 | p5_3<=40]]]]]]]]]

abstracting: (p5_3<=40)
states: 1,207,044,185,616 (12)
abstracting: (p5_3<=p3_1)
states: 402,348,061,872 (11)
abstracting: (p4_2<=14)
states: 1,207,044,185,616 (12)
abstracting: (p3_2<=p1_3)
states: 1,197,309,941,172 (12)
abstracting: (p5_3<=40)
states: 1,207,044,185,616 (12)
abstracting: (p5_3<=p3_1)
states: 402,348,061,872 (11)
abstracting: (p5_3<=40)
states: 1,207,044,185,616 (12)
abstracting: (p5_3<=p3_1)
states: 402,348,061,872 (11)
.
EG iterations: 1
abstracting: (46<=p0_3)
states: 534,503,743,488 (11)
.abstracting: (77<=p3_2)
states: 0
..abstracting: (p3_1<=45)
states: 1,207,044,185,616 (12)
...-> the formula is FALSE

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

MC time: 0m12.789sec

checking: [EX [~ [[~ [[[90<=p5_3 & A [p3_1<=36 U 29<=p2_1]] & EX [p5_1<=78]]] | A [p0_2<=63 U A [20<=p0_2 U p0_2<=67]]]]] | EF [~ [EG [[EF [p1_1<=p0_2] & AF [p0_3<=95]]]]]]
normalized: [E [true U ~ [EG [[~ [EG [~ [p0_3<=95]]] & E [true U p1_1<=p0_2]]]]] | EX [~ [[[~ [EG [~ [[~ [EG [~ [p0_2<=67]]] & ~ [E [~ [p0_2<=67] U [~ [20<=p0_2] & ~ [p0_2<=67]]]]]]]] & ~ [E [~ [[~ [EG [~ [p0_2<=67]]] & ~ [E [~ [p0_2<=67] U [~ [20<=p0_2] & ~ [p0_2<=67]]]]]] U [~ [p0_2<=63] & ~ [[~ [EG [~ [p0_2<=67]]] & ~ [E [~ [p0_2<=67] U [~ [20<=p0_2] & ~ [p0_2<=67]]]]]]]]]] | ~ [[EX [p5_1<=78] & [90<=p5_3 & [~ [EG [~ [29<=p2_1]]] & ~ [E [~ [29<=p2_1] U [~ [p3_1<=36] & ~ [29<=p2_1]]]]]]]]]]]]

abstracting: (29<=p2_1)
states: 733,761,219,744 (11)
abstracting: (p3_1<=36)
states: 1,207,044,185,616 (12)
abstracting: (29<=p2_1)
states: 733,761,219,744 (11)
abstracting: (29<=p2_1)
states: 733,761,219,744 (11)
.
EG iterations: 1
abstracting: (90<=p5_3)
states: 0
abstracting: (p5_1<=78)
states: 1,207,044,185,616 (12)
.abstracting: (p0_2<=67)
states: 863,530,583,184 (11)
abstracting: (20<=p0_2)
states: 860,867,834,112 (11)
abstracting: (p0_2<=67)
states: 863,530,583,184 (11)
abstracting: (p0_2<=67)
states: 863,530,583,184 (11)
.
EG iterations: 1
abstracting: (p0_2<=63)
states: 833,672,816,784 (11)
abstracting: (p0_2<=67)
states: 863,530,583,184 (11)
abstracting: (20<=p0_2)
states: 860,867,834,112 (11)
abstracting: (p0_2<=67)
states: 863,530,583,184 (11)
abstracting: (p0_2<=67)
states: 863,530,583,184 (11)
.
EG iterations: 1

BK_STOP 1679894574130

--------------------
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:14959 (712), effective:3586 (170)

initing FirstDep: 0m 0.000sec


iterations count:1108 (52), effective:264 (12)

iterations count:1436 (68), effective:343 (16)

iterations count:3625 (172), effective:960 (45)

iterations count:512 (24), effective:119 (5)

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

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

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

iterations count:1763 (83), effective:391 (18)

iterations count:3431 (163), effective:746 (35)

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

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

iterations count:1496 (71), effective:357 (17)

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

iterations count:21 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 337 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-D2N100"
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-D2N100, 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-167987240900345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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