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.r489-tall-167912707500949.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 UtahNoC-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707500949
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 205K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME UtahNoC-PT-none-UpperBounds-00
FORMULA_NAME UtahNoC-PT-none-UpperBounds-01
FORMULA_NAME UtahNoC-PT-none-UpperBounds-02
FORMULA_NAME UtahNoC-PT-none-UpperBounds-03
FORMULA_NAME UtahNoC-PT-none-UpperBounds-04
FORMULA_NAME UtahNoC-PT-none-UpperBounds-05
FORMULA_NAME UtahNoC-PT-none-UpperBounds-06
FORMULA_NAME UtahNoC-PT-none-UpperBounds-07
FORMULA_NAME UtahNoC-PT-none-UpperBounds-08
FORMULA_NAME UtahNoC-PT-none-UpperBounds-09
FORMULA_NAME UtahNoC-PT-none-UpperBounds-10
FORMULA_NAME UtahNoC-PT-none-UpperBounds-11
FORMULA_NAME UtahNoC-PT-none-UpperBounds-12
FORMULA_NAME UtahNoC-PT-none-UpperBounds-13
FORMULA_NAME UtahNoC-PT-none-UpperBounds-14
FORMULA_NAME UtahNoC-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679335293803

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 18:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 18:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:01:35] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-20 18:01:35] [INFO ] Transformed 216 places.
[2023-03-20 18:01:35] [INFO ] Transformed 977 transitions.
[2023-03-20 18:01:35] [INFO ] Found NUPN structural information;
[2023-03-20 18:01:35] [INFO ] Parsed PT model containing 216 places and 977 transitions and 2905 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 148 transitions
Reduce redundant transitions removed 148 transitions.
Normalized transition count is 427 out of 829 initially.
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 18:01:35] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :14
FORMULA UtahNoC-PT-none-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA UtahNoC-PT-none-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
[2023-03-20 18:01:35] [INFO ] Flow matrix only has 427 transitions (discarded 402 similar events)
// Phase 1: matrix 427 rows 216 cols
[2023-03-20 18:01:35] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-20 18:01:35] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-20 18:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:01:36] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-20 18:01:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:01:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 18:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:01:36] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-20 18:01:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-20 18:01:36] [INFO ] [Nat]Added 43 Read/Feed constraints in 51 ms returned sat
[2023-03-20 18:01:36] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 50 ms.
[2023-03-20 18:01:37] [INFO ] Added : 169 causal constraints over 34 iterations in 1029 ms. Result :sat
Minimization took 79 ms.
[2023-03-20 18:01:37] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 18:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 18:01:37] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-20 18:01:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 18:01:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-20 18:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 18:01:37] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-20 18:01:37] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-20 18:01:37] [INFO ] Computed and/alt/rep : 374/1166/374 causal constraints (skipped 52 transitions) in 41 ms.
[2023-03-20 18:01:39] [INFO ] Added : 227 causal constraints over 49 iterations in 1391 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA UtahNoC-PT-none-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 216 places. Attempting structural reductions.
Drop transitions removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 824/824 transitions.
Graph (trivial) has 358 edges and 216 vertex of which 93 / 216 are part of one of the 14 SCC in 3 ms
Free SCC test removed 79 places
Drop transitions removed 251 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 329 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 102 transition count 361
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 102 transition count 361
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 116 place count 102 transition count 316
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 125 place count 93 transition count 294
Iterating global reduction 1 with 9 rules applied. Total rules applied 134 place count 93 transition count 294
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 146 place count 93 transition count 282
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 89 transition count 275
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 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 2 with 15 rules applied. Total rules applied 169 place count 89 transition count 260
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 174 place count 86 transition count 258
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 188 place count 79 transition count 279
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 79 transition count 278
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 79 transition count 277
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 193 place count 79 transition count 274
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 198 place count 76 transition count 272
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 200 place count 76 transition count 270
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 204 place count 76 transition count 270
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 205 place count 76 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 206 place count 75 transition count 268
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 74 edges and 73 vertex of which 18 / 73 are part of one of the 4 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 209 place count 59 transition count 268
Drop transitions removed 25 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 264 place count 59 transition count 213
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 267 place count 56 transition count 201
Iterating global reduction 9 with 3 rules applied. Total rules applied 270 place count 56 transition count 201
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 276 place count 53 transition count 211
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 277 place count 53 transition count 210
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 284 place count 53 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 285 place count 52 transition count 202
Applied a total of 285 rules in 101 ms. Remains 52 /216 variables (removed 164) and now considering 202/824 (removed 622) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 52/216 places, 202/824 transitions.
Normalized transition count is 121 out of 202 initially.
// Phase 1: matrix 121 rows 52 cols
[2023-03-20 18:01:39] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=958 ) properties (out of 1) seen :1
FORMULA UtahNoC-PT-none-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5344 ms.
ITS solved all properties within timeout

BK_STOP 1679335301500

--------------------
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 UpperBounds -timeout 360 -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="UtahNoC-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 UtahNoC-PT-none, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912707500949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;