About the Execution of Marcie for GPPP-PT-C1000N0000000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16200.764 | 3600000.00 | 2677999.00 | 742423.70 | F?TFFFT?T?FFT?T? | normal |
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.r161-tall-167838845800889.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 GPPP-PT-C1000N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845800889
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 10:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 10:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C1000N0000000100-CTLCardinality-00
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-01
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-02
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-03
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-04
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-05
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-06
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-07
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-08
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-09
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-10
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-11
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-12
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-13
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-14
FORMULA_NAME GPPP-PT-C1000N0000000100-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679885596203
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=GPPP-PT-C1000N0000000100
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: GPPP_PT_C1000N0000000100
(NrP: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.872sec
RS generation: 0m29.282sec
-> reachability set: #nodes 561475 (5.6e+05) #states 1,140,616,996,412,371 (15)
starting MCC model checker
--------------------------
checking: EF [2431<=_3PG]
normalized: E [true U 2431<=_3PG]
abstracting: (2431<=_3PG)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.502sec
checking: ~ [EF [6028<=NADPplus]]
normalized: ~ [E [true U 6028<=NADPplus]]
abstracting: (6028<=NADPplus)
states: 0
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[4342<=FBP & EF [Pyr<=4950]]]
normalized: E [true U [4342<=FBP & E [true U Pyr<=4950]]]
abstracting: (Pyr<=4950)
states: 1,140,616,996,412,371 (15)
abstracting: (4342<=FBP)
states: 0
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.669sec
checking: AF [AG [EG [EF [ADP<=S7P]]]]
normalized: ~ [EG [E [true U ~ [EG [E [true U ADP<=S7P]]]]]]
abstracting: (ADP<=S7P)
states: 1
..
EG iterations: 2
EG iterations: 0
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.263sec
checking: AG [EF [EX [ADP<=S7P]]]
normalized: ~ [E [true U ~ [E [true U EX [ADP<=S7P]]]]]
abstracting: (ADP<=S7P)
states: 1
.-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [AG [EF [[EG [5163<=GAP] & [A [GSSG<=5960 U 4502<=a2] | ~ [a1<=6563]]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U [[~ [a1<=6563] | [~ [EG [~ [4502<=a2]]] & ~ [E [~ [4502<=a2] U [~ [GSSG<=5960] & ~ [4502<=a2]]]]]] & EG [5163<=GAP]]]]]]]
abstracting: (5163<=GAP)
states: 0
.
EG iterations: 1
abstracting: (4502<=a2)
states: 0
abstracting: (GSSG<=5960)
states: 1,140,616,996,412,371 (15)
abstracting: (4502<=a2)
states: 0
abstracting: (4502<=a2)
states: 0
EG iterations: 0
abstracting: (a1<=6563)
states: 1,140,616,996,412,371 (15)
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.318sec
checking: ~ [AG [EX [EX [[[c2<=6282 & F6P<=203] | AF [GSSG<=S7P]]]]]]
normalized: E [true U ~ [EX [EX [[~ [EG [~ [GSSG<=S7P]]] | [c2<=6282 & F6P<=203]]]]]]
abstracting: (F6P<=203)
states: 1,140,616,996,412,371 (15)
abstracting: (c2<=6282)
states: 2,503,268,824,696 (12)
abstracting: (GSSG<=S7P)
states: 10,577,975,351,313 (13)
.
EG iterations: 1
..-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m34.127sec
checking: EG [~ [[[2361<=NADplus & EF [6293<=start]] | ~ [AG [[[GAP<=c2 | 3362<=Pi] | [910<=R5P & G6P<=a2]]]]]]]
normalized: EG [~ [[E [true U ~ [[[910<=R5P & G6P<=a2] | [GAP<=c2 | 3362<=Pi]]]] | [2361<=NADplus & E [true U 6293<=start]]]]]
abstracting: (6293<=start)
states: 0
abstracting: (2361<=NADplus)
states: 0
abstracting: (3362<=Pi)
states: 1,140,616,996,412,370 (15)
abstracting: (GAP<=c2)
states: 1,139,271,533,401,975 (15)
abstracting: (G6P<=a2)
states: 1,140,611,633,189,767 (15)
abstracting: (910<=R5P)
states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 10m25.184sec
checking: ~ [E [AF [EX [AG [NADH<=ADP]]] U ~ [[E [[EG [Gluc<=c1] | ~ [ADP<=FBP]] U ~ [1631<=c1]] | EX [EG [3573<=NADplus]]]]]]
normalized: ~ [E [~ [EG [~ [EX [~ [E [true U ~ [NADH<=ADP]]]]]]] U ~ [[EX [EG [3573<=NADplus]] | E [[~ [ADP<=FBP] | EG [Gluc<=c1]] U ~ [1631<=c1]]]]]]
abstracting: (1631<=c1)
states: 2,503,268,824,696 (12)
abstracting: (Gluc<=c1)
states: 2,503,268,824,696 (12)
.
EG iterations: 1
abstracting: (ADP<=FBP)
states: 1
abstracting: (3573<=NADplus)
states: 0
.
EG iterations: 1
.abstracting: (NADH<=ADP)
states: 1,140,616,996,412,371 (15)
..
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m31.124sec
checking: EF [~ [[[PEP<=1196 | EX [E [Pyr<=_3PG U 4907<=a1]]] | [AX [920<=ATP] | [ADP<=6406 | [AG [F6P<=E4P] & EG [G6P<=182]]]]]]]
normalized: E [true U ~ [[[[ADP<=6406 | [EG [G6P<=182] & ~ [E [true U ~ [F6P<=E4P]]]]] | ~ [EX [~ [920<=ATP]]]] | [PEP<=1196 | EX [E [Pyr<=_3PG U 4907<=a1]]]]]]
abstracting: (4907<=a1)
states: 0
abstracting: (Pyr<=_3PG)
states: 777,053,478,509,023 (14)
.abstracting: (PEP<=1196)
states: 1,140,616,996,412,371 (15)
abstracting: (920<=ATP)
states: 0
.abstracting: (F6P<=E4P)
states: 933,915,382,458,612 (14)
abstracting: (G6P<=182)
states: 995,069,955,901,474 (14)
.
EG iterations: 1
abstracting: (ADP<=6406)
states: 1
-> the formula is FALSE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 4m33.846sec
checking: EG [AG [AG [[[[a1<=b1 | 3551<=GSSG] & ~ [5984<=b1]] | [[GSH<=947 & Ru5P<=GSH] | A [G6P<=1700 U Gluc<=4503]]]]]]
normalized: EG [~ [E [true U E [true U ~ [[[[~ [EG [~ [Gluc<=4503]]] & ~ [E [~ [Gluc<=4503] U [~ [G6P<=1700] & ~ [Gluc<=4503]]]]] | [GSH<=947 & Ru5P<=GSH]] | [~ [5984<=b1] & [a1<=b1 | 3551<=GSSG]]]]]]]]
abstracting: (3551<=GSSG)
states: 0
abstracting: (a1<=b1)
states: 1,140,611,600,307,621 (15)
abstracting: (5984<=b1)
states: 0
abstracting: (Ru5P<=GSH)
states: 560,402,495,691,937 (14)
abstracting: (GSH<=947)
states: 1,140,616,996,412,371 (15)
abstracting: (Gluc<=4503)
states: 1,140,616,996,412,371 (15)
abstracting: (G6P<=1700)
states: 1,140,616,996,412,371 (15)
abstracting: (Gluc<=4503)
states: 1,140,616,996,412,371 (15)
abstracting: (Gluc<=4503)
states: 1,140,616,996,412,371 (15)
.
EG iterations: 1
EG iterations: 0
-> the formula is TRUE
FORMULA GPPP-PT-C1000N0000000100-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m59.956sec
checking: [EF [[F6P<=5398 & c2<=R5P]] & [[AF [4569<=Ru5P] & EG [AF [GSSG<=4170]]] | ~ [AF [E [~ [AF [b2<=NADH]] U c1<=NADPH]]]]]
normalized: [[EG [~ [E [EG [~ [b2<=NADH]] U c1<=NADPH]]] | [EG [~ [EG [~ [GSSG<=4170]]]] & ~ [EG [~ [4569<=Ru5P]]]]] & E [true U [F6P<=5398 & c2<=R5P]]]
abstracting: (c2<=R5P)
states: 2,503,268,824,696 (12)
abstracting: (F6P<=5398)
states: 1,140,616,996,412,371 (15)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 237152 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16256836 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.002sec
iterations count:12167 (553), effective:2934 (133)
initing FirstDep: 0m 0.000sec
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:5141 (233), effective:1073 (48)
iterations count:109 (4), effective:14 (0)
iterations count:131 (5), effective:17 (0)
iterations count:22 (1), effective:0 (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="GPPP-PT-C1000N0000000100"
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 GPPP-PT-C1000N0000000100, 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 r161-tall-167838845800889"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C1000N0000000100.tgz
mv GPPP-PT-C1000N0000000100 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 '
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 ;