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.r117-tall-167814495300171.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 lolaxred
Input is DBSingleClientW-PT-d1m09, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-tall-167814495300171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K 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 1679413188168

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=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d1m09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 15:39:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-21 15:39:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 15:39:49] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-21 15:39:49] [INFO ] Transformed 1440 places.
[2023-03-21 15:39:49] [INFO ] Transformed 672 transitions.
[2023-03-21 15:39:49] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 152 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.28938KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 347/347 places, 672/672 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 1376 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.8 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Computed a total of 6 stabilizing places and 42 stable transitions
Graph (complete) has 1239 edges and 326 vertex of which 325 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 325 transition count 592
Computed a total of 6 stabilizing places and 43 stable transitions
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 178 place count 229 transition count 331
Iterating global reduction 1 with 96 rules applied. Total rules applied 274 place count 229 transition count 331
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 278 place count 229 transition count 327
Computed a total of 5 stabilizing places and 18 stable transitions
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 352 place count 155 transition count 253
Iterating global reduction 2 with 74 rules applied. Total rules applied 426 place count 155 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Iterating post reduction 2 with 6 rules applied. Total rules applied 432 place count 155 transition count 247
Computed a total of 5 stabilizing places and 18 stable transitions
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 475 place count 112 transition count 178
Iterating global reduction 3 with 43 rules applied. Total rules applied 518 place count 112 transition count 178
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Iterating post reduction 3 with 24 rules applied. Total rules applied 542 place count 112 transition count 154
Computed a total of 5 stabilizing places and 18 stable transitions
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 554 place count 100 transition count 133
Iterating global reduction 4 with 12 rules applied. Total rules applied 566 place count 100 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 568 place count 100 transition count 131
Computed a total of 5 stabilizing places and 15 stable transitions
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 577 place count 91 transition count 122
Iterating global reduction 5 with 9 rules applied. Total rules applied 586 place count 91 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 589 place count 91 transition count 119
Computed a total of 5 stabilizing places and 15 stable transitions
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 596 place count 84 transition count 112
Iterating global reduction 6 with 7 rules applied. Total rules applied 603 place count 84 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Iterating post reduction 6 with 3 rules applied. Total rules applied 606 place count 84 transition count 109
Computed a total of 5 stabilizing places and 15 stable transitions
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 608 place count 82 transition count 101
Iterating global reduction 7 with 2 rules applied. Total rules applied 610 place count 82 transition count 101
Computed a total of 5 stabilizing places and 13 stable transitions
Computed a total of 5 stabilizing places and 13 stable transitions
Applied a total of 610 rules in 303 ms. Remains 82 /347 variables (removed 265) and now considering 101/672 (removed 571) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 304 ms. Remains : 82/347 places, 101/672 transitions.
Finished random walk after 3 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=3 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 510 ms.
ITS solved all properties within timeout

BK_STOP 1679413191074

--------------------
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="DBSingleClientW-PT-d1m09"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DBSingleClientW-PT-d1m09, 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 r117-tall-167814495300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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