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.r394-oct2-167903717500078.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPs-PT-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 82K Mar 5 18:23 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 ShieldIIPs-PT-005B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679488193363

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=ShieldIIPs-PT-005B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 12:29:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 12:29:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:29:56] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-22 12:29:56] [INFO ] Transformed 303 places.
[2023-03-22 12:29:56] [INFO ] Transformed 298 transitions.
[2023-03-22 12:29:56] [INFO ] Found NUPN structural information;
[2023-03-22 12:29:56] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 9) seen :7
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 298 rows 303 cols
[2023-03-22 12:29:56] [INFO ] Computed 46 place invariants in 8 ms
[2023-03-22 12:29:56] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 12:29:57] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2023-03-22 12:29:57] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 12:29:57] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 7 ms to minimize.
[2023-03-22 12:29:57] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-22 12:29:57] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-22 12:29:57] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 11 ms to minimize.
[2023-03-22 12:29:57] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 26 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2023-03-22 12:29:58] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 0 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 0 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2023-03-22 12:29:59] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2507 ms
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 0 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 0 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 0 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2023-03-22 12:30:00] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-22 12:30:01] [INFO ] Deduced a trap composed of 29 places in 688 ms of which 0 ms to minimize.
[2023-03-22 12:30:01] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2023-03-22 12:30:01] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2023-03-22 12:30:01] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2023-03-22 12:30:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1925 ms
[2023-03-22 12:30:01] [INFO ] After 4660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-22 12:30:01] [INFO ] After 4892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 28 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 298/298 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 303 transition count 276
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 281 transition count 274
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 279 transition count 274
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 48 place count 279 transition count 253
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 90 place count 258 transition count 253
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 114 place count 234 transition count 229
Iterating global reduction 3 with 24 rules applied. Total rules applied 138 place count 234 transition count 229
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 138 place count 234 transition count 220
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 156 place count 225 transition count 220
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 280 place count 163 transition count 158
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 307 place count 163 transition count 158
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 308 place count 162 transition count 157
Applied a total of 308 rules in 65 ms. Remains 162 /303 variables (removed 141) and now considering 157/298 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 162/303 places, 157/298 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 4862 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=607 )
FORMULA ShieldIIPs-PT-005B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 6078 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: ShieldIIPs_PT_005B
(NrP: 303 NrTr: 298 NrArc: 896)

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

net check time: 0m 0.000sec

init dd package: 0m 2.942sec


before gc: list nodes free: 1548294

after gc: idd nodes used:56840452, unused:7159548; list nodes free:34215921

RS generation: 25m57.192sec


-> last computed set: #nodes 56840151 (5.7e+07) #states 1,503,999,229,357 (12)


CANNOT_COMPUTE


BK_STOP 1679489805128

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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

idd.cc:820: DD Exception: No free nodes

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="ShieldIIPs-PT-005B"
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 ShieldIIPs-PT-005B, 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 r394-oct2-167903717500078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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