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.r023-oct2-167813610100096.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-10a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r023-oct2-167813610100096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 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 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 920K 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 1678986939728

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:15:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-16 17:15:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:15:42] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2023-03-16 17:15:42] [INFO ] Transformed 2186 places.
[2023-03-16 17:15:42] [INFO ] Transformed 3192 transitions.
[2023-03-16 17:15:42] [INFO ] Found NUPN structural information;
[2023-03-16 17:15:42] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 350 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.22343KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Ensure Unique test removed 40 places
Computed a total of 1 stabilizing places and 1 stable transitions
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 263 rules applied. Total rules applied 263 place count 2126 transition count 2955
Reduce places removed 203 places and 0 transitions.
Computed a total of 21 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 203 rules applied. Total rules applied 466 place count 1923 transition count 2955
Computed a total of 21 stabilizing places and 1 stable transitions
Performed 209 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 209 Pre rules applied. Total rules applied 466 place count 1923 transition count 2746
Deduced a syphon composed of 209 places in 14 ms
Ensure Unique test removed 83 places
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 2 with 501 rules applied. Total rules applied 967 place count 1631 transition count 2746
Computed a total of 21 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 968 place count 1631 transition count 2745
Reduce places removed 1 places and 0 transitions.
Computed a total of 21 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 969 place count 1630 transition count 2745
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 982 place count 1617 transition count 2674
Ensure Unique test removed 1 places
Iterating global reduction 4 with 14 rules applied. Total rules applied 996 place count 1616 transition count 2674
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 21 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 1002 place count 1615 transition count 2669
Reduce places removed 3 places and 0 transitions.
Computed a total of 21 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 3 rules applied. Total rules applied 1005 place count 1612 transition count 2669
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1006 place count 1611 transition count 2661
Iterating global reduction 6 with 1 rules applied. Total rules applied 1007 place count 1611 transition count 2661
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1008 place count 1610 transition count 2653
Iterating global reduction 6 with 1 rules applied. Total rules applied 1009 place count 1610 transition count 2653
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1010 place count 1609 transition count 2645
Iterating global reduction 6 with 1 rules applied. Total rules applied 1011 place count 1609 transition count 2645
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1012 place count 1608 transition count 2637
Iterating global reduction 6 with 1 rules applied. Total rules applied 1013 place count 1608 transition count 2637
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1014 place count 1607 transition count 2629
Iterating global reduction 6 with 1 rules applied. Total rules applied 1015 place count 1607 transition count 2629
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1016 place count 1606 transition count 2621
Iterating global reduction 6 with 1 rules applied. Total rules applied 1017 place count 1606 transition count 2621
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1018 place count 1605 transition count 2613
Iterating global reduction 6 with 1 rules applied. Total rules applied 1019 place count 1605 transition count 2613
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1020 place count 1604 transition count 2605
Iterating global reduction 6 with 1 rules applied. Total rules applied 1021 place count 1604 transition count 2605
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1022 place count 1603 transition count 2597
Iterating global reduction 6 with 1 rules applied. Total rules applied 1023 place count 1603 transition count 2597
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1024 place count 1602 transition count 2589
Iterating global reduction 6 with 1 rules applied. Total rules applied 1025 place count 1602 transition count 2589
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1026 place count 1601 transition count 2581
Iterating global reduction 6 with 1 rules applied. Total rules applied 1027 place count 1601 transition count 2581
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1028 place count 1600 transition count 2573
Iterating global reduction 6 with 1 rules applied. Total rules applied 1029 place count 1600 transition count 2573
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1030 place count 1599 transition count 2565
Iterating global reduction 6 with 1 rules applied. Total rules applied 1031 place count 1599 transition count 2565
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1032 place count 1598 transition count 2557
Iterating global reduction 6 with 1 rules applied. Total rules applied 1033 place count 1598 transition count 2557
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1034 place count 1597 transition count 2549
Iterating global reduction 6 with 1 rules applied. Total rules applied 1035 place count 1597 transition count 2549
Computed a total of 21 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1036 place count 1596 transition count 2541
Iterating global reduction 6 with 1 rules applied. Total rules applied 1037 place count 1596 transition count 2541
Computed a total of 21 stabilizing places and 1 stable transitions
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 1177 place count 1526 transition count 2471
Computed a total of 21 stabilizing places and 1 stable transitions
Computed a total of 21 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 1178 place count 1525 transition count 2470
Reduce places removed 20 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 6 with 20 rules applied. Total rules applied 1198 place count 1505 transition count 2470
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 40 Pre rules applied. Total rules applied 1198 place count 1505 transition count 2430
Deduced a syphon composed of 40 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 81 rules applied. Total rules applied 1279 place count 1464 transition count 2430
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 7 with 21 rules applied. Total rules applied 1300 place count 1443 transition count 2430
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 1300 place count 1443 transition count 2429
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1302 place count 1442 transition count 2429
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 1344 place count 1421 transition count 2408
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1364 place count 1401 transition count 2388
Iterating global reduction 8 with 20 rules applied. Total rules applied 1384 place count 1401 transition count 2388
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 1384 rules in 2164 ms. Remains 1401 /2186 variables (removed 785) and now considering 2388/3158 (removed 770) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2165 ms. Remains : 1401/2186 places, 2388/3158 transitions.
Finished random walk after 68 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=34 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 2637 ms.
ITS solved all properties within timeout

BK_STOP 1678986945281

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

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-10a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-10a, 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 r023-oct2-167813610100096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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