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.r160-smll-167819445900251.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 gold2022
Input is DiscoveryGPU-PT-13b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-167819445900251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.9K Feb 25 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K 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 1678438966197

Running Version 202205111006
[2023-03-10 09:02:48] [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]
[2023-03-10 09:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:02:49] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2023-03-10 09:02:49] [INFO ] Transformed 380 places.
[2023-03-10 09:02:49] [INFO ] Transformed 404 transitions.
[2023-03-10 09:02:49] [INFO ] Found NUPN structural information;
[2023-03-10 09:02:49] [INFO ] Parsed PT model containing 380 places and 404 transitions in 477 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 7 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 11 ms.9771KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 380/380 places, 404/404 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Graph (complete) has 657 edges and 380 vertex of which 328 are kept as prefixes of interest. Removing 52 places using SCC suffix rule.27 ms
Discarding 52 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 328 transition count 294
Reduce places removed 84 places and 0 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 244 transition count 294
Computed a total of 55 stabilizing places and 55 stable transitions
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 169 place count 244 transition count 281
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 195 place count 231 transition count 281
Computed a total of 42 stabilizing places and 42 stable transitions
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 212 place count 214 transition count 264
Iterating global reduction 2 with 17 rules applied. Total rules applied 229 place count 214 transition count 264
Computed a total of 40 stabilizing places and 40 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 229 place count 214 transition count 262
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 233 place count 212 transition count 262
Computed a total of 42 stabilizing places and 40 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 245 place count 200 transition count 250
Iterating global reduction 2 with 12 rules applied. Total rules applied 257 place count 200 transition count 250
Computed a total of 42 stabilizing places and 40 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 269 place count 188 transition count 238
Iterating global reduction 2 with 12 rules applied. Total rules applied 281 place count 188 transition count 238
Computed a total of 42 stabilizing places and 40 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 293 place count 176 transition count 214
Iterating global reduction 2 with 12 rules applied. Total rules applied 305 place count 176 transition count 214
Computed a total of 42 stabilizing places and 40 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 317 place count 164 transition count 202
Iterating global reduction 2 with 12 rules applied. Total rules applied 329 place count 164 transition count 202
Computed a total of 42 stabilizing places and 40 stable transitions
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 489 place count 84 transition count 122
Computed a total of 84 stabilizing places and 96 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 501 place count 72 transition count 98
Iterating global reduction 2 with 12 rules applied. Total rules applied 513 place count 72 transition count 98
Computed a total of 72 stabilizing places and 84 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 525 place count 60 transition count 86
Iterating global reduction 2 with 12 rules applied. Total rules applied 537 place count 60 transition count 86
Computed a total of 60 stabilizing places and 72 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 549 place count 48 transition count 62
Iterating global reduction 2 with 12 rules applied. Total rules applied 561 place count 48 transition count 62
Computed a total of 48 stabilizing places and 48 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 573 place count 36 transition count 50
Iterating global reduction 2 with 12 rules applied. Total rules applied 585 place count 36 transition count 50
Computed a total of 36 stabilizing places and 36 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 597 place count 24 transition count 26
Iterating global reduction 2 with 12 rules applied. Total rules applied 609 place count 24 transition count 26
Computed a total of 24 stabilizing places and 24 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 621 place count 12 transition count 14
Iterating global reduction 2 with 12 rules applied. Total rules applied 633 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 634 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 635 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 640 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 642 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 644 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 645 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 646 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 646 rules in 323 ms. Remains 2 /380 variables (removed 378) and now considering 4/404 (removed 400) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/380 places, 4/404 transitions.
Finished random walk after 28 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=28 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 939 ms.

BK_STOP 1678438969882

--------------------
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-13b"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is DiscoveryGPU-PT-13b, 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 r160-smll-167819445900251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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