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.r522-tall-167987247400454.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 marciexred
Input is PGCD-PT-D02N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.6K Mar 31 16:48 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 PGCD-PT-D02N100-ReachabilityCardinality-00
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-01
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-02
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-03
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-04
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-05
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-06
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-07
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-08
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-09
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-10
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-11
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-12
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-13
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-14
FORMULA_NAME PGCD-PT-D02N100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680818259670

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D02N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 21:57:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-04-06 21:57:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:57:41] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-04-06 21:57:41] [INFO ] Transformed 9 places.
[2023-04-06 21:57:41] [INFO ] Transformed 9 transitions.
[2023-04-06 21:57:41] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10020 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :12
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :1
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :1
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 21:57:41] [INFO ] Computed 4 invariants in 2 ms
[2023-04-06 21:57:41] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-06 21:57:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 21:57:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 21:57:41] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PGCD-PT-D02N100-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 589 ms.
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PGCD_PT_D02N100
(NrP: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.694sec


RS generation: 0m11.356sec


-> reachability set: #nodes 49631 (5.0e+04) #states 5,588,167,526 (9)



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

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

abstracting: (p0_1<=43)
states: 3,016,950,878 (9)
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.737sec

checking: AG [~ [p1_1<=p0_3]]
normalized: ~ [E [true U p1_1<=p0_3]]

abstracting: (p1_1<=p0_3)
states: 2,816,935,508 (9)
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.172sec

checking: AG [[p2_1<=73 & p2_2<=p0_2]]
normalized: ~ [E [true U ~ [[p2_1<=73 & p2_2<=p0_2]]]]

abstracting: (p2_2<=p0_2)
states: 5,588,167,526 (9)
abstracting: (p2_1<=73)
states: 4,188,460,022 (9)
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.260sec

checking: EF [[38<=p2_3 | [~ [p0_2<=23] & [~ [[~ [62<=p0_1] | ~ [p1_3<=p2_3]]] | p1_2<=8]]]]
normalized: E [true U [38<=p2_3 | [[p1_2<=8 | ~ [[~ [p1_3<=p2_3] | ~ [62<=p0_1]]]] & ~ [p0_2<=23]]]]

abstracting: (p0_2<=23)
states: 1,873,712,782 (9)
abstracting: (62<=p0_1)
states: 1,801,200,192 (9)
abstracting: (p1_3<=p2_3)
states: 2,794,106,861 (9)
abstracting: (p1_2<=8)
states: 774,370,725 (8)
abstracting: (38<=p2_3)
states: 2,879,464,896 (9)
-> the formula is TRUE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.132sec

checking: AG [[~ [[p1_2<=87 | [p1_2<=96 & ~ [p1_3<=p1_3]]]] & ~ [p1_3<=p0_3]]]
normalized: ~ [E [true U ~ [[~ [[p1_2<=87 | [p1_2<=96 & ~ [p1_3<=p1_3]]]] & ~ [p1_3<=p0_3]]]]]

abstracting: (p1_3<=p0_3)
states: 2,794,106,861 (9)
abstracting: (p1_3<=p1_3)
states: 5,588,167,526 (9)
abstracting: (p1_2<=96)
states: 4,757,591,901 (9)
abstracting: (p1_2<=87)
states: 4,562,873,838 (9)
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.359sec

checking: AG [[[20<=p2_3 & ~ [59<=p1_1]] | [[[p0_2<=p1_1 & [p2_1<=37 | ~ [[~ [[p0_2<=75 & 23<=p0_1]] | [[14<=p2_2 & p0_1<=p2_3] & [27<=p2_3 | p0_3<=95]]]]]] | p0_3<=23] & ~ [42<=p2_1]]]]
normalized: ~ [E [true U ~ [[[[p0_3<=23 | [p0_2<=p1_1 & [p2_1<=37 | ~ [[~ [[p0_2<=75 & 23<=p0_1]] | [[27<=p2_3 | p0_3<=95] & [14<=p2_2 & p0_1<=p2_3]]]]]]] & ~ [42<=p2_1]] | [20<=p2_3 & ~ [59<=p1_1]]]]]]

abstracting: (59<=p1_1)
states: 1,914,984,836 (9)
abstracting: (20<=p2_3)
states: 3,985,499,232 (9)
abstracting: (42<=p2_1)
states: 2,670,876,208 (9)
abstracting: (p0_1<=p2_3)
states: 2,816,900,637 (9)
abstracting: (14<=p2_2)
states: 4,421,515,392 (9)
abstracting: (p0_3<=95)
states: 4,737,698,998 (9)
abstracting: (27<=p2_3)
states: 3,521,469,924 (9)
abstracting: (23<=p0_1)
states: 3,781,261,484 (9)
abstracting: (p0_2<=75)
states: 4,247,769,662 (9)
abstracting: (p2_1<=37)
states: 2,708,702,630 (9)
abstracting: (p0_2<=p1_1)
states: 2,816,888,712 (9)
abstracting: (p0_3<=23)
states: 1,873,712,782 (9)
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.324sec

checking: AG [~ [[~ [[p2_2<=p1_1 | [p1_2<=p0_3 | [~ [[[p0_2<=p2_1 & p2_2<=0] & [p1_2<=6 | p2_2<=1]]] | [[[p0_2<=79 & p2_1<=97] & ~ [p0_3<=85]] | ~ [[65<=p0_1 | 80<=p2_3]]]]]]] & p0_1<=p2_2]]]
normalized: ~ [E [true U [p0_1<=p2_2 & ~ [[p2_2<=p1_1 | [p1_2<=p0_3 | [[~ [[65<=p0_1 | 80<=p2_3]] | [~ [p0_3<=85] & [p0_2<=79 & p2_1<=97]]] | ~ [[[p1_2<=6 | p2_2<=1] & [p0_2<=p2_1 & p2_2<=0]]]]]]]]]]

abstracting: (p2_2<=0)
states: 90,097,171 (7)
abstracting: (p0_2<=p2_1)
states: 2,816,900,637 (9)
abstracting: (p2_2<=1)
states: 180,217,590 (8)
abstracting: (p1_2<=6)
states: 610,083,924 (8)
abstracting: (p2_1<=97)
states: 4,777,440,518 (9)
abstracting: (p0_2<=79)
states: 4,360,358,342 (9)
abstracting: (p0_3<=85)
states: 4,514,937,830 (9)
abstracting: (80<=p2_3)
states: 1,227,809,184 (9)
abstracting: (65<=p0_1)
states: 1,693,437,592 (9)
abstracting: (p1_2<=p0_3)
states: 2,816,935,508 (9)
abstracting: (p2_2<=p1_1)
states: 2,816,888,712 (9)
abstracting: (p0_1<=p2_2)
states: 2,816,900,637 (9)
-> the formula is TRUE

FORMULA PGCD-PT-D02N100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT


BK_STOP 1680818545442

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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:9204 (1022), effective:3130 (347)

initing FirstDep: 0m 0.000sec


iterations count:772 (85), effective:254 (28)

iterations count:323 (35), effective:303 (33)

iterations count:1312 (145), effective:434 (48)

iterations count:1360 (151), effective:484 (53)

iterations count:234 (26), effective:109 (12)

iterations count:1032 (114), effective:361 (40)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 453 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="PGCD-PT-D02N100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PGCD-PT-D02N100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247400454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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