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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 6.4K Feb 25 13:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 13:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 13:38 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 104K 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 1678439039181

Running Version 202205111006
[2023-03-10 09:04:01] [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:04:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:04:02] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2023-03-10 09:04:02] [INFO ] Transformed 408 places.
[2023-03-10 09:04:02] [INFO ] Transformed 434 transitions.
[2023-03-10 09:04:02] [INFO ] Found NUPN structural information;
[2023-03-10 09:04:02] [INFO ] Parsed PT model containing 408 places and 434 transitions in 553 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.8888KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 408/408 places, 434/434 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Graph (complete) has 706 edges and 408 vertex of which 352 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.28 ms
Discarding 56 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 352 transition count 316
Reduce places removed 90 places and 0 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Iterating post reduction 1 with 90 rules applied. Total rules applied 181 place count 262 transition count 316
Computed a total of 59 stabilizing places and 59 stable transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 181 place count 262 transition count 302
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 209 place count 248 transition count 302
Computed a total of 45 stabilizing places and 45 stable transitions
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 227 place count 230 transition count 284
Iterating global reduction 2 with 18 rules applied. Total rules applied 245 place count 230 transition count 284
Computed a total of 43 stabilizing places and 43 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 245 place count 230 transition count 282
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 249 place count 228 transition count 282
Computed a total of 45 stabilizing places and 43 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 262 place count 215 transition count 269
Iterating global reduction 2 with 13 rules applied. Total rules applied 275 place count 215 transition count 269
Computed a total of 45 stabilizing places and 43 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 288 place count 202 transition count 256
Iterating global reduction 2 with 13 rules applied. Total rules applied 301 place count 202 transition count 256
Computed a total of 45 stabilizing places and 43 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 314 place count 189 transition count 230
Iterating global reduction 2 with 13 rules applied. Total rules applied 327 place count 189 transition count 230
Computed a total of 45 stabilizing places and 43 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 340 place count 176 transition count 217
Iterating global reduction 2 with 13 rules applied. Total rules applied 353 place count 176 transition count 217
Computed a total of 45 stabilizing places and 43 stable transitions
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 525 place count 90 transition count 131
Computed a total of 90 stabilizing places and 103 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 538 place count 77 transition count 105
Iterating global reduction 2 with 13 rules applied. Total rules applied 551 place count 77 transition count 105
Computed a total of 77 stabilizing places and 90 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 564 place count 64 transition count 92
Iterating global reduction 2 with 13 rules applied. Total rules applied 577 place count 64 transition count 92
Computed a total of 64 stabilizing places and 77 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 590 place count 51 transition count 66
Iterating global reduction 2 with 13 rules applied. Total rules applied 603 place count 51 transition count 66
Computed a total of 51 stabilizing places and 51 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 616 place count 38 transition count 53
Iterating global reduction 2 with 13 rules applied. Total rules applied 629 place count 38 transition count 53
Computed a total of 38 stabilizing places and 38 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 642 place count 25 transition count 27
Iterating global reduction 2 with 13 rules applied. Total rules applied 655 place count 25 transition count 27
Computed a total of 25 stabilizing places and 25 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 668 place count 12 transition count 14
Iterating global reduction 2 with 13 rules applied. Total rules applied 681 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 682 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 683 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 688 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 690 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 692 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 693 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 694 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 694 rules in 460 ms. Remains 2 /408 variables (removed 406) and now considering 4/434 (removed 430) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/408 places, 4/434 transitions.
Finished random walk after 30 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=30 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 1159 ms.

BK_STOP 1678439042999

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

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