About the Execution of ITS-Tools for DiscoveryGPU-PT-10b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
127.640 | 1703.00 | 2174.00 | 29.80 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r085-tall-165260115400046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 DiscoveryGPU-PT-10b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-tall-165260115400046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.0K Apr 30 07:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 07:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 07:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 75K May 10 09:33 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 1652701897812
Running Version 202205111006
[2022-05-16 11:51:39] [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-16 11:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:51:39] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-16 11:51:39] [INFO ] Transformed 296 places.
[2022-05-16 11:51:39] [INFO ] Transformed 314 transitions.
[2022-05-16 11:51:39] [INFO ] Found NUPN structural information;
[2022-05-16 11:51:39] [INFO ] Parsed PT model containing 296 places and 314 transitions in 195 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.8078KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 296/296 places, 314/314 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Graph (complete) has 510 edges and 296 vertex of which 256 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.10 ms
Discarding 40 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 256 transition count 228
Reduce places removed 66 places and 0 transitions.
Computed a total of 43 stabilizing places and 43 stable transitions
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 190 transition count 228
Computed a total of 43 stabilizing places and 43 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 133 place count 190 transition count 218
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 153 place count 180 transition count 218
Computed a total of 33 stabilizing places and 33 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 167 place count 166 transition count 204
Iterating global reduction 2 with 14 rules applied. Total rules applied 181 place count 166 transition count 204
Computed a total of 31 stabilizing places and 31 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 181 place count 166 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 185 place count 164 transition count 202
Computed a total of 33 stabilizing places and 31 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 194 place count 155 transition count 193
Iterating global reduction 2 with 9 rules applied. Total rules applied 203 place count 155 transition count 193
Computed a total of 33 stabilizing places and 31 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 212 place count 146 transition count 184
Iterating global reduction 2 with 9 rules applied. Total rules applied 221 place count 146 transition count 184
Computed a total of 33 stabilizing places and 31 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 230 place count 137 transition count 166
Iterating global reduction 2 with 9 rules applied. Total rules applied 239 place count 137 transition count 166
Computed a total of 33 stabilizing places and 31 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 248 place count 128 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 257 place count 128 transition count 157
Computed a total of 33 stabilizing places and 31 stable transitions
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 381 place count 66 transition count 95
Computed a total of 66 stabilizing places and 75 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 390 place count 57 transition count 77
Iterating global reduction 2 with 9 rules applied. Total rules applied 399 place count 57 transition count 77
Computed a total of 57 stabilizing places and 66 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 408 place count 48 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 417 place count 48 transition count 68
Computed a total of 48 stabilizing places and 57 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 426 place count 39 transition count 50
Iterating global reduction 2 with 9 rules applied. Total rules applied 435 place count 39 transition count 50
Computed a total of 39 stabilizing places and 39 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 444 place count 30 transition count 41
Iterating global reduction 2 with 9 rules applied. Total rules applied 453 place count 30 transition count 41
Computed a total of 30 stabilizing places and 30 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 462 place count 21 transition count 23
Iterating global reduction 2 with 9 rules applied. Total rules applied 471 place count 21 transition count 23
Computed a total of 21 stabilizing places and 21 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 480 place count 12 transition count 14
Iterating global reduction 2 with 9 rules applied. Total rules applied 489 place count 12 transition count 14
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 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 490 place count 12 transition count 13
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 491 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Graph (complete) has 10 edges and 9 vertex of which 6 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 496 place count 6 transition count 7
Reduce places removed 2 places and 0 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 498 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 4 with 2 rules applied. Total rules applied 500 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 4 with 1 rules applied. Total rules applied 501 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 4 with 1 rules applied. Total rules applied 502 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 502 rules in 149 ms. Remains 2 /296 variables (removed 294) and now considering 4/314 (removed 310) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/296 places, 4/314 transitions.
Finished random walk after 22 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=22 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 412 ms.
BK_STOP 1652701899515
--------------------
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="DiscoveryGPU-PT-10b"
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 DiscoveryGPU-PT-10b, 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 r085-tall-165260115400046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10b.tgz
mv DiscoveryGPU-PT-10b 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 ;