fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r513-tall-167987240900350
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 464955.00 0.00 0.00 TF??T?T?T??T?TF? normal

Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1679894489352

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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.813sec


RS generation: 0m21.809sec


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



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

checking: AG [~ [9<=p5_3]]
normalized: ~ [E [true U 9<=p5_3]]

abstracting: (9<=p5_3)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [18<=p5_2]
normalized: E [true U 18<=p5_2]

abstracting: (18<=p5_2)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [~ [3<=p4_1]]
normalized: ~ [E [true U 3<=p4_1]]

abstracting: (3<=p4_1)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [p4_2<=58]
normalized: ~ [E [true U ~ [p4_2<=58]]]

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

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [49<=p2_1]
normalized: E [true U 49<=p2_1]

abstracting: (49<=p2_1)
states: 504,443,317,248 (11)
-> the formula is TRUE

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

MC time: 0m13.551sec

checking: AG [~ [p1_2<=p0_1]]
normalized: ~ [E [true U p1_2<=p0_1]]

abstracting: (p1_2<=p0_1)
states: 608,458,069,728 (11)
-> the formula is FALSE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 1.231sec

checking: EF [~ [[[p2_3<=29 | ~ [p2_1<=p0_3]] & [p4_1<=4 | 37<=p4_1]]]]
normalized: E [true U ~ [[[p4_1<=4 | 37<=p4_1] & [p2_3<=29 | ~ [p2_1<=p0_3]]]]]

abstracting: (p2_1<=p0_3)
states: 608,450,537,592 (11)
abstracting: (p2_3<=29)
states: 486,527,753,232 (11)
abstracting: (37<=p4_1)
states: 0
abstracting: (p4_1<=4)
states: 1,207,044,185,616 (12)
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.543sec

checking: EF [[[78<=p2_3 & [[[[[[p2_3<=20 & [p5_2<=p0_1 | 17<=p3_3]] | ~ [1<=p5_1]] | [[p3_1<=p0_1 | ~ [42<=p2_2]] | [82<=p0_2 | ~ [p1_1<=p2_1]]]] | ~ [[~ [60<=p1_2] | [[6<=p5_3 & p1_1<=p3_1] | ~ [p5_1<=p0_3]]]]] & p5_1<=45] & [16<=p0_1 & ~ [[p2_2<=p4_2 | [[91<=p2_1 & p3_1<=p5_1] & [77<=p0_2 & p0_3<=p3_2]]]]]]] & p4_1<=64]]
normalized: E [true U [p4_1<=64 & [78<=p2_3 & [[16<=p0_1 & ~ [[p2_2<=p4_2 | [[77<=p0_2 & p0_3<=p3_2] & [91<=p2_1 & p3_1<=p5_1]]]]] & [p5_1<=45 & [~ [[[~ [p5_1<=p0_3] | [6<=p5_3 & p1_1<=p3_1]] | ~ [60<=p1_2]]] | [[[82<=p0_2 | ~ [p1_1<=p2_1]] | [p3_1<=p0_1 | ~ [42<=p2_2]]] | [~ [1<=p5_1] | [p2_3<=20 & [p5_2<=p0_1 | 17<=p3_3]]]]]]]]]]

abstracting: (17<=p3_3)
states: 0
abstracting: (p5_2<=p0_1)
states: 1,177,933,204,656 (12)
abstracting: (p2_3<=20)
states: 361,018,900,368 (11)
abstracting: (1<=p5_1)
states: 1,005,870,154,680 (12)
abstracting: (42<=p2_2)
states: 576,909,260,928 (11)
abstracting: (p3_1<=p0_1)
states: 1,197,313,691,148 (12)
abstracting: (p1_1<=p2_1)
states: 603,527,081,976 (11)
abstracting: (82<=p0_2)
states: 253,676,054,016 (11)
abstracting: (60<=p1_2)
states: 405,263,456,928 (11)
abstracting: (p1_1<=p3_1)
states: 29,202,733,332 (10)
abstracting: (6<=p5_3)
states: 0
abstracting: (p5_1<=p0_3)
states: 1,177,933,204,656 (12)
abstracting: (p5_1<=45)
states: 1,207,044,185,616 (12)
abstracting: (p3_1<=p5_1)
states: 1,005,870,154,680 (12)
abstracting: (91<=p2_1)
states: 206,685,901,152 (11)
abstracting: (p0_3<=p3_2)
states: 29,193,994,188 (10)
abstracting: (77<=p0_2)
states: 283,339,486,944 (11)
abstracting: (p2_2<=p4_2)
states: 38,759,299,128 (10)
abstracting: (16<=p0_1)
states: 922,782,212,352 (11)
abstracting: (78<=p2_3)
states: 277,153,035,264 (11)
abstracting: (p4_1<=64)
states: 1,207,044,185,616 (12)
-> the formula is TRUE

FORMULA Murphy-PT-D2N100-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1679894954307

--------------------
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:1415 (67), effective:313 (14)

iterations count:3251 (154), effective:824 (39)

iterations count:1463 (69), effective:474 (22)

iterations count:3228 (153), effective:769 (36)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 339 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="ReachabilityCardinality"
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 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 r513-tall-167987240900350"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;