Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978400078.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K Feb 26 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:21 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.7K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 61K 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 ShieldRVs-PT-005B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-005B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679338451068

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=ShieldRVs-PT-005B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:54:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 18:54:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:54:13] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-20 18:54:13] [INFO ] Transformed 203 places.
[2023-03-20 18:54:13] [INFO ] Transformed 228 transitions.
[2023-03-20 18:54:13] [INFO ] Found NUPN structural information;
[2023-03-20 18:54:13] [INFO ] Parsed PT model containing 203 places and 228 transitions and 720 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 43 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 13) seen :10
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 228 rows 203 cols
[2023-03-20 18:54:13] [INFO ] Computed 21 place invariants in 46 ms
[2023-03-20 18:54:13] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 18:54:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-20 18:54:14] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 18:54:14] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 8 ms to minimize.
[2023-03-20 18:54:14] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-20 18:54:14] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2023-03-20 18:54:14] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2023-03-20 18:54:14] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 0 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-20 18:54:15] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1637 ms
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 1 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 3 ms to minimize.
[2023-03-20 18:54:16] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-20 18:54:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-20 18:54:17] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-20 18:54:17] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1057 ms
[2023-03-20 18:54:17] [INFO ] After 2956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-20 18:54:17] [INFO ] After 3231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 25 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 228/228 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 203 transition count 220
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 195 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 191 transition count 216
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 24 place count 191 transition count 191
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 74 place count 166 transition count 191
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 100 place count 140 transition count 165
Iterating global reduction 3 with 26 rules applied. Total rules applied 126 place count 140 transition count 165
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 126 place count 140 transition count 160
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 136 place count 135 transition count 160
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 196 place count 105 transition count 130
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 206 place count 105 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 104 transition count 129
Applied a total of 207 rules in 73 ms. Remains 104 /203 variables (removed 99) and now considering 129/228 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 104/203 places, 129/228 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2354 steps, including 3 resets, run visited all 1 properties in 6 ms. (steps per millisecond=392 )
FORMULA ShieldRVs-PT-005B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 4450 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: ShieldRVs_PT_005B
(NrP: 203 NrTr: 228 NrArc: 720)

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

net check time: 0m 0.000sec

init dd package: 0m 3.554sec


before gc: list nodes free: 2050034

after gc: idd nodes used:13117611, unused:50882389; list nodes free:225731789
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6299824 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16104296 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.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

12998919 13036313 13050331 13060767 13060485 13062571 13072603 13077309 13078905 13076853 13078561 13076941 13084155 13092620 13093486 13094621 13093148 13096806 13095339 13091509 13092079 13093352 13092044 13094619 13094900 13098645 13099979 13104141 13112267 13116754 13112233 13112251 13114473 13116379 13113738 13118291 13114702 21058511 21063386 21059484 21062500 21067502 21064070 21060172 21061471 21061447 21061182 21059848

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="ShieldRVs-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 ShieldRVs-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 r426-tajo-167905978400078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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