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.r185-tall-167838871600033.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 smartxred
Input is Echo-PT-d02r09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r185-tall-167838871600033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:07 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:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 303K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1679418259073

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Echo-PT-d02r09
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 17:04:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-21 17:04:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 17:04:20] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-21 17:04:20] [INFO ] Transformed 735 places.
[2023-03-21 17:04:20] [INFO ] Transformed 570 transitions.
[2023-03-21 17:04:20] [INFO ] Found NUPN structural information;
[2023-03-21 17:04:20] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 142 ms.
Structural test allowed to assert that 6 places are NOT stable. Took 7 ms.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 729) seen :725
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 735 cols
[2023-03-21 17:04:21] [INFO ] Computed 369 place invariants in 52 ms
[2023-03-21 17:04:21] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 17:04:21] [INFO ] [Nat]Absence check using 85 positive place invariants in 27 ms returned sat
[2023-03-21 17:04:21] [INFO ] [Nat]Absence check using 85 positive and 284 generalized place invariants in 53 ms returned sat
[2023-03-21 17:04:23] [INFO ] After 1650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 17:04:23] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 4 ms to minimize.
[2023-03-21 17:04:23] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2023-03-21 17:04:23] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 17:04:24] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-21 17:04:24] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 1 ms to minimize.
[2023-03-21 17:04:24] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-21 17:04:24] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 0 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-21 17:04:25] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-21 17:04:26] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2023-03-21 17:04:26] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-21 17:04:26] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 1 ms to minimize.
[2023-03-21 17:04:26] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-21 17:04:26] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2023-03-21 17:04:27] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2023-03-21 17:04:28] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2023-03-21 17:04:28] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-21 17:04:28] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2023-03-21 17:04:28] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-21 17:04:28] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2023-03-21 17:04:28] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2023-03-21 17:04:29] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2023-03-21 17:04:29] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 4 ms to minimize.
[2023-03-21 17:04:29] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2023-03-21 17:04:29] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2023-03-21 17:04:29] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2023-03-21 17:04:29] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 0 ms to minimize.
[2023-03-21 17:04:30] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 7261 ms
[2023-03-21 17:04:30] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 1 ms to minimize.
[2023-03-21 17:04:31] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2023-03-21 17:04:31] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2023-03-21 17:04:31] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2023-03-21 17:04:31] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-21 17:04:31] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2023-03-21 17:04:31] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2023-03-21 17:04:32] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-21 17:04:32] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-21 17:04:32] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-21 17:04:32] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-21 17:04:32] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2023-03-21 17:04:32] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2023-03-21 17:04:33] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2023-03-21 17:04:33] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2023-03-21 17:04:33] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-21 17:04:33] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-03-21 17:04:33] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-21 17:04:33] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2023-03-21 17:04:34] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2023-03-21 17:04:35] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-21 17:04:35] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2023-03-21 17:04:35] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2023-03-21 17:04:35] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2023-03-21 17:04:35] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2023-03-21 17:04:35] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2023-03-21 17:04:36] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2023-03-21 17:04:36] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 5412 ms
[2023-03-21 17:04:36] [INFO ] After 14388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-21 17:04:36] [INFO ] After 14719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 574 steps, including 20 resets, run visited all 2 properties in 5 ms. (steps per millisecond=114 )
Parikh walk visited 2 properties in 6 ms.
Able to resolve query StableMarking after proving 730 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 15882 ms.
ITS solved all properties within timeout

BK_STOP 1679418277106

--------------------
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 StableMarking -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="Echo-PT-d02r09"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is Echo-PT-d02r09, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r185-tall-167838871600033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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