About the Execution of ITS-Tools for SemanticWebServices-PT-S064P15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
478.928 | 3465.00 | 6065.00 | 58.00 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2022-input.r211-oct2-165281604100226.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SemanticWebServices-PT-S064P15, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-oct2-165281604100226
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 6.4K Apr 29 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 137K May 10 09:34 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 1653118401224
Running Version 202205111006
[2022-05-21 07:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-21 07:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:33:22] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-21 07:33:22] [INFO ] Transformed 118 places.
[2022-05-21 07:33:22] [INFO ] Transformed 194 transitions.
[2022-05-21 07:33:22] [INFO ] Parsed PT model containing 118 places and 194 transitions in 219 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 101 transitions
Reduce redundant transitions removed 101 transitions.
Built sparse matrix representations for Structural reductions in 14 ms.8705KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 116/116 places, 91/91 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 469 edges and 116 vertex of which 108 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.32 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 34 places
Computed a total of 7 stabilizing places and 10 stable transitions
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 74 transition count 88
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 45 place count 64 transition count 78
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 64 transition count 78
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 56 place count 64 transition count 77
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 65 place count 55 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 55 transition count 68
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 82 place count 47 transition count 60
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 47 transition count 60
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 97 place count 40 transition count 53
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 40 transition count 53
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 34 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 34 transition count 47
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 121 place count 29 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 29 transition count 42
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 29 transition count 37
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 132 place count 28 transition count 36
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 132 rules in 74 ms. Remains 28 /116 variables (removed 88) and now considering 36/91 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/116 places, 36/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 846 ms (no deadlock found). (steps per millisecond=1477 )
Random directed walk for 1250003 steps, including 0 resets, run took 529 ms (no deadlock found). (steps per millisecond=2362 )
[2022-05-21 07:33:24] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2022-05-21 07:33:24] [INFO ] Computed 0 place invariants in 15 ms
[2022-05-21 07:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:33:24] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-21 07:33:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:33:24] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-21 07:33:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-21 07:33:24] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2022-05-21 07:33:24] [INFO ] Computed and/alt/rep : 26/33/21 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 07:33:24] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
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 2139 ms.
BK_STOP 1653118404689
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-S064P15"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SemanticWebServices-PT-S064P15, 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 r211-oct2-165281604100226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SemanticWebServices-PT-S064P15.tgz
mv SemanticWebServices-PT-S064P15 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 '
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 ;