Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r526-tall-171679094500326.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is SemanticWebServices-PT-S064P18, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r526-tall-171679094500326
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 02:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 12 02:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 173K May 18 16:43 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 1717220243192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SemanticWebServices-PT-S064P18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:37:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 05:37:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:37:24] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-01 05:37:24] [INFO ] Transformed 154 places.
[2024-06-01 05:37:24] [INFO ] Transformed 236 transitions.
[2024-06-01 05:37:24] [INFO ] Parsed PT model containing 154 places and 236 transitions and 1265 arcs in 178 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.20102KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 152/152 places, 112/112 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 626 edges and 152 vertex of which 144 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 49 places
Computed a total of 7 stabilizing places and 10 stable transitions
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 95 transition count 109
Computed a total of 7 stabilizing places and 10 stable transitions
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 85 transition count 99
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 85 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 85 transition count 98
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 76 transition count 89
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 76 transition count 89
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 68 transition count 81
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 68 transition count 81
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 112 place count 61 transition count 74
Iterating global reduction 2 with 7 rules applied. Total rules applied 119 place count 61 transition count 74
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 56 transition count 69
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 56 transition count 69
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 54 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 54 transition count 67
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 52 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 52 transition count 65
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 51 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 51 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 51 transition count 63
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 50 transition count 62
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Applied a total of 141 rules in 76 ms. Remains 50 /152 variables (removed 102) and now considering 62/112 (removed 50) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 88 ms. Remains : 50/152 places, 62/112 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2270 ms (no deadlock found). (steps per millisecond=550 )
Random directed walk for 1250004 steps, including 0 resets, run took 526 ms (no deadlock found). (steps per millisecond=2376 )
[2024-06-01 05:37:27] [INFO ] Flow matrix only has 53 transitions (discarded 9 similar events)
// Phase 1: matrix 53 rows 50 cols
[2024-06-01 05:37:27] [INFO ] Computed 0 invariants in 6 ms
[2024-06-01 05:37:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:37:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:37:27] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:37:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 05:37:27] [INFO ] [Nat]Added 38 Read/Feed constraints in 14 ms returned sat
[2024-06-01 05:37:27] [INFO ] Computed and/alt/rep : 48/55/39 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:37:27] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Interrupted Parikh directed walk after 2 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=1 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 3452 ms.
ITS solved all properties within timeout

BK_STOP 1717220247759

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="SemanticWebServices-PT-S064P18"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is SemanticWebServices-PT-S064P18, 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 r526-tall-171679094500326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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