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-167819445900241.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-12b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-167819445900241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 13:33 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 89K 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 1678438892966

Running Version 202205111006
[2023-03-10 09:01:35] [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:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:01:35] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-10 09:01:35] [INFO ] Transformed 352 places.
[2023-03-10 09:01:35] [INFO ] Transformed 374 transitions.
[2023-03-10 09:01:35] [INFO ] Found NUPN structural information;
[2023-03-10 09:01:35] [INFO ] Parsed PT model containing 352 places and 374 transitions in 364 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 8 ms.8345KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 352/352 places, 374/374 transitions.
Computed a total of 54 stabilizing places and 54 stable transitions
Graph (complete) has 608 edges and 352 vertex of which 304 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.17 ms
Discarding 48 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Computed a total of 54 stabilizing places and 54 stable transitions
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 304 transition count 272
Reduce places removed 78 places and 0 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 226 transition count 272
Computed a total of 51 stabilizing places and 51 stable transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 157 place count 226 transition count 260
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 181 place count 214 transition count 260
Computed a total of 39 stabilizing places and 39 stable transitions
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 197 place count 198 transition count 244
Iterating global reduction 2 with 16 rules applied. Total rules applied 213 place count 198 transition count 244
Computed a total of 37 stabilizing places and 37 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 213 place count 198 transition count 242
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 196 transition count 242
Computed a total of 39 stabilizing places and 37 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 228 place count 185 transition count 231
Iterating global reduction 2 with 11 rules applied. Total rules applied 239 place count 185 transition count 231
Computed a total of 39 stabilizing places and 37 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 250 place count 174 transition count 220
Iterating global reduction 2 with 11 rules applied. Total rules applied 261 place count 174 transition count 220
Computed a total of 39 stabilizing places and 37 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 272 place count 163 transition count 198
Iterating global reduction 2 with 11 rules applied. Total rules applied 283 place count 163 transition count 198
Computed a total of 39 stabilizing places and 37 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 294 place count 152 transition count 187
Iterating global reduction 2 with 11 rules applied. Total rules applied 305 place count 152 transition count 187
Computed a total of 39 stabilizing places and 37 stable transitions
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 453 place count 78 transition count 113
Computed a total of 78 stabilizing places and 89 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 464 place count 67 transition count 91
Iterating global reduction 2 with 11 rules applied. Total rules applied 475 place count 67 transition count 91
Computed a total of 67 stabilizing places and 78 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 486 place count 56 transition count 80
Iterating global reduction 2 with 11 rules applied. Total rules applied 497 place count 56 transition count 80
Computed a total of 56 stabilizing places and 67 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 508 place count 45 transition count 58
Iterating global reduction 2 with 11 rules applied. Total rules applied 519 place count 45 transition count 58
Computed a total of 45 stabilizing places and 45 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 530 place count 34 transition count 47
Iterating global reduction 2 with 11 rules applied. Total rules applied 541 place count 34 transition count 47
Computed a total of 34 stabilizing places and 34 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 552 place count 23 transition count 25
Iterating global reduction 2 with 11 rules applied. Total rules applied 563 place count 23 transition count 25
Computed a total of 23 stabilizing places and 23 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 574 place count 12 transition count 14
Iterating global reduction 2 with 11 rules applied. Total rules applied 585 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 586 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 587 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.0 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 592 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 594 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 596 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 597 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 598 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 598 rules in 225 ms. Remains 2 /352 variables (removed 350) and now considering 4/374 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/352 places, 4/374 transitions.
Finished random walk after 26 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=26 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 707 ms.

BK_STOP 1678438896212

--------------------
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-12b"
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-12b, 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-167819445900241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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