About the Execution of GreatSPN+red for FireWire-PT-14
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
227.107 | 2097.00 | 4995.00 | 27.50 | 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/mcc2024-input.r560-tall-171734905800171.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 greatspnxred
Input is FireWire-PT-14, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905800171
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16: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 1717351971048
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:12:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-02 18:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:12:52] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-02 18:12:52] [INFO ] Transformed 205 places.
[2024-06-02 18:12:52] [INFO ] Transformed 610 transitions.
[2024-06-02 18:12:52] [INFO ] Found NUPN structural information;
[2024-06-02 18:12:52] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 220 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
Built sparse matrix representations for Structural reductions in 14 ms.14553KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 205/205 places, 539/539 transitions.
Computed a total of 61 stabilizing places and 136 stable transitions
Computed a total of 61 stabilizing places and 136 stable transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 205 transition count 536
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 202 transition count 536
Computed a total of 58 stabilizing places and 133 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 12 place count 196 transition count 524
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 196 transition count 524
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 55 stabilizing places and 127 stable transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 196 transition count 521
Computed a total of 55 stabilizing places and 127 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 193 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 193 transition count 512
Computed a total of 52 stabilizing places and 118 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 190 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 190 transition count 506
Computed a total of 49 stabilizing places and 112 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 187 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 187 transition count 497
Computed a total of 46 stabilizing places and 103 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 184 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 184 transition count 491
Computed a total of 43 stabilizing places and 97 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 181 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 181 transition count 482
Computed a total of 40 stabilizing places and 88 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 178 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 178 transition count 476
Computed a total of 37 stabilizing places and 82 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 175 transition count 467
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 175 transition count 467
Computed a total of 34 stabilizing places and 73 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 172 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 172 transition count 461
Computed a total of 31 stabilizing places and 67 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 169 transition count 452
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 169 transition count 452
Computed a total of 28 stabilizing places and 58 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 78 place count 166 transition count 446
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 166 transition count 446
Computed a total of 25 stabilizing places and 52 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 84 place count 163 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 87 place count 163 transition count 440
Computed a total of 22 stabilizing places and 46 stable transitions
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 160 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 160 transition count 434
Computed a total of 19 stabilizing places and 40 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 157 transition count 431
Computed a total of 16 stabilizing places and 37 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 105 place count 154 transition count 437
Computed a total of 16 stabilizing places and 37 stable transitions
Computed a total of 16 stabilizing places and 37 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 117 place count 154 transition count 425
Computed a total of 16 stabilizing places and 37 stable transitions
Computed a total of 16 stabilizing places and 37 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 153 transition count 424
Computed a total of 15 stabilizing places and 36 stable transitions
Computed a total of 15 stabilizing places and 36 stable transitions
Applied a total of 118 rules in 413 ms. Remains 153 /205 variables (removed 52) and now considering 424/539 (removed 115) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 458 ms. Remains : 153/205 places, 424/539 transitions.
Finished random walk after 9 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=9 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 795 ms.
ITS solved all properties within timeout
BK_STOP 1717351973145
--------------------
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.202405141337.jar
+ 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="FireWire-PT-14"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-14, 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 r560-tall-171734905800171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 ;