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.r279-smll-167863549700166.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 ltsminxred
Input is NoC3x3-PT-3B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r279-smll-167863549700166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 581K Mar 5 18:23 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 1678893419238

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=NoC3x3-PT-3B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 15:17:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-15 15:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 15:17:03] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2023-03-15 15:17:03] [INFO ] Transformed 2117 places.
[2023-03-15 15:17:03] [INFO ] Transformed 2435 transitions.
[2023-03-15 15:17:03] [INFO ] Found NUPN structural information;
[2023-03-15 15:17:03] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 583 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 12 ms.27158KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1749 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 17 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Computed a total of 131 stabilizing places and 131 stable transitions
Computed a total of 131 stabilizing places and 131 stable transitions
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 448 rules applied. Total rules applied 449 place count 2049 transition count 1929
Reduce places removed 443 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 98 stabilizing places and 98 stable transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 449 rules applied. Total rules applied 898 place count 1606 transition count 1923
Reduce places removed 3 places and 0 transitions.
Computed a total of 98 stabilizing places and 98 stable transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 901 place count 1603 transition count 1923
Computed a total of 98 stabilizing places and 98 stable transitions
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 901 place count 1603 transition count 1899
Deduced a syphon composed of 24 places in 10 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 949 place count 1579 transition count 1899
Computed a total of 98 stabilizing places and 98 stable transitions
Discarding 364 places :
Symmetric choice reduction at 3 with 364 rule applications. Total rules 1313 place count 1215 transition count 1535
Iterating global reduction 3 with 364 rules applied. Total rules applied 1677 place count 1215 transition count 1535
Computed a total of 65 stabilizing places and 65 stable transitions
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 1677 place count 1215 transition count 1503
Deduced a syphon composed of 32 places in 15 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1741 place count 1183 transition count 1503
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 136 places :
Symmetric choice reduction at 3 with 136 rule applications. Total rules 1877 place count 1047 transition count 1327
Iterating global reduction 3 with 136 rules applied. Total rules applied 2013 place count 1047 transition count 1327
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 140 places :
Symmetric choice reduction at 3 with 140 rule applications. Total rules 2153 place count 907 transition count 1171
Iterating global reduction 3 with 140 rules applied. Total rules applied 2293 place count 907 transition count 1171
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2351 place count 849 transition count 1069
Iterating global reduction 3 with 58 rules applied. Total rules applied 2409 place count 849 transition count 1069
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 2429 place count 847 transition count 1051
Reduce places removed 2 places and 0 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 2431 place count 845 transition count 1051
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 2473 place count 803 transition count 1009
Iterating global reduction 5 with 42 rules applied. Total rules applied 2515 place count 803 transition count 1009
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 2523 place count 799 transition count 1005
Reduce places removed 4 places and 0 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 2527 place count 795 transition count 1005
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 2558 place count 764 transition count 943
Iterating global reduction 7 with 31 rules applied. Total rules applied 2589 place count 764 transition count 943
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 31 places :
Symmetric choice reduction at 7 with 31 rule applications. Total rules 2620 place count 733 transition count 912
Iterating global reduction 7 with 31 rules applied. Total rules applied 2651 place count 733 transition count 912
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 41 rules applied. Total rules applied 2692 place count 728 transition count 876
Reduce places removed 5 places and 0 transitions.
Computed a total of 65 stabilizing places and 65 stable transitions
Iterating post reduction 8 with 5 rules applied. Total rules applied 2697 place count 723 transition count 876
Computed a total of 65 stabilizing places and 65 stable transitions
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 9 with 628 rules applied. Total rules applied 3325 place count 409 transition count 562
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 3340 place count 394 transition count 547
Iterating global reduction 9 with 15 rules applied. Total rules applied 3355 place count 394 transition count 547
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 3366 place count 383 transition count 525
Iterating global reduction 9 with 11 rules applied. Total rules applied 3377 place count 383 transition count 525
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 9 with 2 rules applied. Total rules applied 3379 place count 383 transition count 523
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3381 place count 381 transition count 519
Iterating global reduction 10 with 2 rules applied. Total rules applied 3383 place count 381 transition count 519
Computed a total of 10 stabilizing places and 1 stable transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 3407 place count 369 transition count 519
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3408 place count 368 transition count 518
Reduce places removed 9 places and 0 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Iterating post reduction 10 with 9 rules applied. Total rules applied 3417 place count 359 transition count 518
Computed a total of 3 stabilizing places and 19 stable transitions
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 11 with 48 rules applied. Total rules applied 3465 place count 335 transition count 494
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Computed a total of 3 stabilizing places and 19 stable transitions
Iterating post reduction 11 with 24 rules applied. Total rules applied 3489 place count 335 transition count 470
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Applied a total of 3489 rules in 1775 ms. Remains 335 /2117 variables (removed 1782) and now considering 470/2435 (removed 1965) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1776 ms. Remains : 335/2117 places, 470/2435 transitions.
Finished random walk after 80 steps, including 0 resets, run found a deadlock after 3 ms. (steps per millisecond=26 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 2571 ms.
ITS solved all properties within timeout

BK_STOP 1678893426387

--------------------
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="NoC3x3-PT-3B"
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 NoC3x3-PT-3B, 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 r279-smll-167863549700166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 ;