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.r153-smll-167819440000186.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 smartxred
Input is DiscoveryGPU-PT-07a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-smll-167819440000186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1678401400963

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=smartxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DiscoveryGPU-PT-07a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 22:36:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-09 22:36:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 22:36:45] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-09 22:36:45] [INFO ] Transformed 73 places.
[2023-03-09 22:36:45] [INFO ] Transformed 99 transitions.
[2023-03-09 22:36:45] [INFO ] Found NUPN structural information;
[2023-03-09 22:36:45] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 233 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.17451KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 73/73 places, 99/99 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 214 edges and 73 vertex of which 66 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Computed a total of 10 stabilizing places and 8 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 60 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 60 transition count 86
Computed a total of 10 stabilizing places and 8 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 54 transition count 74
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 54 transition count 74
Computed a total of 10 stabilizing places and 8 stable transitions
Computed a total of 10 stabilizing places and 8 stable transitions
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 54 transition count 73
Computed a total of 10 stabilizing places and 8 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 26 place count 54 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 53 transition count 72
Computed a total of 10 stabilizing places and 8 stable transitions
Computed a total of 10 stabilizing places and 8 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 52 transition count 71
Reduce places removed 2 places and 0 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Graph (complete) has 63 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (trivial) has 56 edges and 49 vertex of which 28 / 49 are part of one of the 14 SCC in 3 ms
Free SCC test removed 14 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 40 place count 35 transition count 63
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Computed a total of 28 stabilizing places and 35 stable transitions
Iterating post reduction 1 with 21 rules applied. Total rules applied 61 place count 28 transition count 49
Computed a total of 28 stabilizing places and 35 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 22 transition count 37
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 22 transition count 37
Computed a total of 22 stabilizing places and 29 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 16 transition count 25
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 16 transition count 25
Computed a total of 16 stabilizing places and 17 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 10 transition count 13
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 10 transition count 13
Computed a total of 10 stabilizing places and 11 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 4 transition count 7
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 4 transition count 7
Computed a total of 4 stabilizing places and 5 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 3 transition count 6
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 3 transition count 5
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 2 transition count 4
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Applied a total of 113 rules in 66 ms. Remains 2 /73 variables (removed 71) and now considering 4/99 (removed 95) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 66 ms. Remains : 2/73 places, 4/99 transitions.
Finished random walk after 16 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=8 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 379 ms.
ITS solved all properties within timeout

BK_STOP 1678401406217

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

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="DiscoveryGPU-PT-07a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is DiscoveryGPU-PT-07a, 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 r153-smll-167819440000186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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