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.r536-tall-167987254600251.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-COL-D03N050, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-167987254600251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.2K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 16K 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679942079358

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=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-COL-D03N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-27 18:34:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-27 18:34:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-27 18:34:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-27 18:34:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-27 18:34:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 382 ms
[2023-03-27 18:34:41] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 12 PT places and 12.0 transition bindings in 14 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2023-03-27 18:34:41] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-03-27 18:34:41] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [2:1*[(MOD (ADD $x 1) 4)]] contains successor/predecessor on variables of sort CD
[2023-03-27 18:34:41] [INFO ] Unfolded HLPN to a Petri net with 12 places and 12 transitions 56 arcs in 5 ms.
[2023-03-27 18:34:41] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.24094KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 9 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-03-27 18:34:41] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-27 18:34:41] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 173 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-27 18:34:41] [INFO ] Invariant cache hit.
[2023-03-27 18:34:41] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 8/12 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 40 ms. Remains : 8/12 places, 12/12 transitions.
Random walk for 1250017 steps, including 0 resets, run took 233 ms (no deadlock found). (steps per millisecond=5364 )
Random directed walk for 1250002 steps, including 0 resets, run took 206 ms (no deadlock found). (steps per millisecond=6067 )
// Phase 1: matrix 12 rows 8 cols
[2023-03-27 18:34:42] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-27 18:34:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 18:34:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-27 18:34:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 18:34:42] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-27 18:34:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 18:34:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 18:34:42] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-27 18:34:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 18:34:42] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-03-27 18:34:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2023-03-27 18:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-27 18:34:42] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-27 18:34:42] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 8500 steps, including 178 resets, run took 15 ms. (steps per millisecond=566 )
Random directed walk for 500008 steps, including 0 resets, run took 66 ms (no deadlock found). (steps per millisecond=7575 )
Random walk for 500017 steps, including 0 resets, run took 71 ms (no deadlock found). (steps per millisecond=7042 )
Random directed walk for 500035 steps, including 0 resets, run took 65 ms (no deadlock found). (steps per millisecond=7692 )
Random walk for 500047 steps, including 0 resets, run took 64 ms (no deadlock found). (steps per millisecond=7813 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 8/8 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-27 18:34:42] [INFO ] Invariant cache hit.
[2023-03-27 18:34:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-27 18:34:42] [INFO ] Invariant cache hit.
[2023-03-27 18:34:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 18:34:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-27 18:34:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-27 18:34:42] [INFO ] Invariant cache hit.
[2023-03-27 18:34:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 92 ms. Remains : 8/8 places, 12/12 transitions.
Random walk for 1250081 steps, including 0 resets, run took 149 ms (no deadlock found). (steps per millisecond=8389 )
Random directed walk for 1250039 steps, including 0 resets, run took 144 ms (no deadlock found). (steps per millisecond=8680 )
[2023-03-27 18:34:43] [INFO ] Invariant cache hit.
[2023-03-27 18:34:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-27 18:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 18:34:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-27 18:34:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 18:34:43] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2023-03-27 18:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 18:34:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 18:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 18:34:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-27 18:34:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-27 18:34:43] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-03-27 18:34:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-27 18:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-03-27 18:34:43] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-27 18:34:43] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Parikh directed walk for 8500 steps, including 200 resets, run took 10 ms. (steps per millisecond=850 )
Random directed walk for 500044 steps, including 0 resets, run took 58 ms (no deadlock found). (steps per millisecond=8621 )
Random walk for 500019 steps, including 0 resets, run took 71 ms (no deadlock found). (steps per millisecond=7042 )
Random directed walk for 500007 steps, including 0 resets, run took 63 ms (no deadlock found). (steps per millisecond=7936 )
Random walk for 500031 steps, including 0 resets, run took 57 ms (no deadlock found). (steps per millisecond=8772 )
[2023-03-27 18:34:43] [INFO ] Flatten gal took : 13 ms
[2023-03-27 18:34:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-27 18:34:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 56 arcs took 1 ms.
Total runtime 2387 ms.
There are residual formulas that ITS could not solve within timeout
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=/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//ReachabilityDeadlock.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PGCD_COL_D3_N50_unf
(NrP: 12 NrTr: 12 NrArc: 56)

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

net check time: 0m 0.000sec

init dd package: 0m 2.693sec


RS generation: 0m10.276sec


-> reachability set: #nodes 34961 (3.5e+04) #states 417,214,571,243 (11)



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

checking: EF [DEADLOCK]
normalized: E [true U DEADLOCK]

-> the formula is FALSE

FORMULA ReachabilityDeadlock FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.796sec

totally nodes used: 667267 (6.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 27876361 3687990 31564351
used/not used/entry size/cache size: 4128743 62980121 16 1024MB
basic ops cache: hits/miss/sum: 487684 110662 598346
used/not used/entry size/cache size: 197687 16579529 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 168301 35039 203340
used/not used/entry size/cache size: 34894 8353714 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66501516
1 563931
2 36603
3 2152
4 2086
5 1153
6 1061
7 35
8 1
9 314
>= 10 12

Total processing time: 0m16.489sec


BK_STOP 1679942100878

--------------------
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 ReachabilityDeadlock -timeout 180 -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:11549 (962), effective:3858 (321)

initing FirstDep: 0m 0.000sec

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-COL-D03N050"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-COL-D03N050, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-167987254600251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D03N050.tgz
mv PGCD-COL-D03N050 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;