Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r016-tajo-165245743100006.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-01a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743100006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.1K Apr 30 07:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 07:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 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 201K 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 1652771227183

Running Version 202205111006
[2022-05-17 07:07:08] [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-17 07:07:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:07:08] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2022-05-17 07:07:08] [INFO ] Transformed 431 places.
[2022-05-17 07:07:08] [INFO ] Transformed 735 transitions.
[2022-05-17 07:07:08] [INFO ] Found NUPN structural information;
[2022-05-17 07:07:08] [INFO ] Parsed PT model containing 431 places and 735 transitions in 250 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.11371KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 431/431 places, 728/728 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Ensure Unique test removed 4 places
Computed a total of 1 stabilizing places and 1 stable transitions
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 425 transition count 696
Reduce places removed 32 places and 0 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 393 transition count 696
Computed a total of 3 stabilizing places and 1 stable transitions
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 70 place count 393 transition count 667
Deduced a syphon composed of 29 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 139 place count 353 transition count 667
Computed a total of 3 stabilizing places and 1 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 353 transition count 666
Reduce places removed 1 places and 0 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 352 transition count 666
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 348 transition count 649
Ensure Unique test removed 1 places
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 347 transition count 649
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 156 place count 346 transition count 644
Reduce places removed 3 places and 0 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 159 place count 343 transition count 644
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 636
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 636
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 628
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 628
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 620
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 620
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 612
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 612
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 604
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 604
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 596
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 596
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 588
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 588
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 580
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 580
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 572
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 572
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 564
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 564
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 556
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 556
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 548
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 548
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 330 transition count 540
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 330 transition count 540
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 329 transition count 532
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 329 transition count 532
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 328 transition count 524
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 328 transition count 524
Computed a total of 3 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 327 transition count 516
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 327 transition count 516
Computed a total of 3 stabilizing places and 1 stable transitions
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 205 place count 320 transition count 509
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 319 transition count 508
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 6 with 2 rules applied. Total rules applied 208 place count 317 transition count 508
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 208 place count 317 transition count 504
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 217 place count 312 transition count 504
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 220 place count 309 transition count 504
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 220 place count 309 transition count 503
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 222 place count 308 transition count 503
Computed a total of 0 stabilizing places and 0 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 8 with 6 rules applied. Total rules applied 228 place count 305 transition count 500
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 230 place count 303 transition count 498
Iterating global reduction 8 with 2 rules applied. Total rules applied 232 place count 303 transition count 498
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 232 rules in 399 ms. Remains 303 /431 variables (removed 128) and now considering 498/728 (removed 230) transitions.
Finished structural reductions, in 1 iterations. Remains : 303/431 places, 498/728 transitions.
Finished random walk after 148 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=74 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 726 ms.

BK_STOP 1652771229340

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r016-tajo-165245743100006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a 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 ;