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-165245743200056.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-06a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-tajo-165245743200056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.0K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 07:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 07:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 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 597K 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 1652771281446

Running Version 202205111006
[2022-05-17 07:08:02] [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:08:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 07:08:03] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2022-05-17 07:08:03] [INFO ] Transformed 1406 places.
[2022-05-17 07:08:03] [INFO ] Transformed 2100 transitions.
[2022-05-17 07:08:03] [INFO ] Found NUPN structural information;
[2022-05-17 07:08:03] [INFO ] Parsed PT model containing 1406 places and 2100 transitions in 325 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 22 transitions
Reduce redundant transitions removed 22 transitions.
Built sparse matrix representations for Structural reductions in 7 ms.12965KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Ensure Unique test removed 24 places
Computed a total of 1 stabilizing places and 1 stable transitions
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 163 rules applied. Total rules applied 163 place count 1370 transition count 1951
Reduce places removed 127 places and 0 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 127 rules applied. Total rules applied 290 place count 1243 transition count 1951
Computed a total of 13 stabilizing places and 1 stable transitions
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 129 Pre rules applied. Total rules applied 290 place count 1243 transition count 1822
Deduced a syphon composed of 129 places in 6 ms
Ensure Unique test removed 51 places
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 309 rules applied. Total rules applied 599 place count 1063 transition count 1822
Computed a total of 13 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 600 place count 1063 transition count 1821
Reduce places removed 1 places and 0 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 601 place count 1062 transition count 1821
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 610 place count 1053 transition count 1774
Ensure Unique test removed 1 places
Iterating global reduction 4 with 10 rules applied. Total rules applied 620 place count 1052 transition count 1774
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 13 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 626 place count 1051 transition count 1769
Reduce places removed 3 places and 0 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 629 place count 1048 transition count 1769
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 630 place count 1047 transition count 1761
Iterating global reduction 6 with 1 rules applied. Total rules applied 631 place count 1047 transition count 1761
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 632 place count 1046 transition count 1753
Iterating global reduction 6 with 1 rules applied. Total rules applied 633 place count 1046 transition count 1753
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 634 place count 1045 transition count 1745
Iterating global reduction 6 with 1 rules applied. Total rules applied 635 place count 1045 transition count 1745
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 636 place count 1044 transition count 1737
Iterating global reduction 6 with 1 rules applied. Total rules applied 637 place count 1044 transition count 1737
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 638 place count 1043 transition count 1729
Iterating global reduction 6 with 1 rules applied. Total rules applied 639 place count 1043 transition count 1729
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 640 place count 1042 transition count 1721
Iterating global reduction 6 with 1 rules applied. Total rules applied 641 place count 1042 transition count 1721
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 642 place count 1041 transition count 1713
Iterating global reduction 6 with 1 rules applied. Total rules applied 643 place count 1041 transition count 1713
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 644 place count 1040 transition count 1705
Iterating global reduction 6 with 1 rules applied. Total rules applied 645 place count 1040 transition count 1705
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 646 place count 1039 transition count 1697
Iterating global reduction 6 with 1 rules applied. Total rules applied 647 place count 1039 transition count 1697
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 648 place count 1038 transition count 1689
Iterating global reduction 6 with 1 rules applied. Total rules applied 649 place count 1038 transition count 1689
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 650 place count 1037 transition count 1681
Iterating global reduction 6 with 1 rules applied. Total rules applied 651 place count 1037 transition count 1681
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 652 place count 1036 transition count 1673
Iterating global reduction 6 with 1 rules applied. Total rules applied 653 place count 1036 transition count 1673
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 654 place count 1035 transition count 1665
Iterating global reduction 6 with 1 rules applied. Total rules applied 655 place count 1035 transition count 1665
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 656 place count 1034 transition count 1657
Iterating global reduction 6 with 1 rules applied. Total rules applied 657 place count 1034 transition count 1657
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 658 place count 1033 transition count 1649
Iterating global reduction 6 with 1 rules applied. Total rules applied 659 place count 1033 transition count 1649
Computed a total of 13 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 660 place count 1032 transition count 1641
Iterating global reduction 6 with 1 rules applied. Total rules applied 661 place count 1032 transition count 1641
Computed a total of 13 stabilizing places and 1 stable transitions
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 745 place count 990 transition count 1599
Computed a total of 13 stabilizing places and 1 stable transitions
Computed a total of 13 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 746 place count 989 transition count 1598
Reduce places removed 12 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 6 with 12 rules applied. Total rules applied 758 place count 977 transition count 1598
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 758 place count 977 transition count 1574
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 49 rules applied. Total rules applied 807 place count 952 transition count 1574
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 820 place count 939 transition count 1574
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 820 place count 939 transition count 1573
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 822 place count 938 transition count 1573
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 848 place count 925 transition count 1560
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 860 place count 913 transition count 1548
Iterating global reduction 8 with 12 rules applied. Total rules applied 872 place count 913 transition count 1548
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 872 rules in 1338 ms. Remains 913 /1406 variables (removed 493) and now considering 1548/2078 (removed 530) transitions.
Finished structural reductions, in 1 iterations. Remains : 913/1406 places, 1548/2078 transitions.
Finished random walk after 75 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=37 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 1762 ms.

BK_STOP 1652771284550

--------------------
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-06a"
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-06a, 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-165245743200056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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