Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r441-tajo-167905986800058.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r441-tajo-167905986800058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 26 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 18:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 122K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1679557759459

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=ShieldRVs-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-23 07:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:49:21] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-23 07:49:21] [INFO ] Transformed 403 places.
[2023-03-23 07:49:21] [INFO ] Transformed 453 transitions.
[2023-03-23 07:49:21] [INFO ] Found NUPN structural information;
[2023-03-23 07:49:21] [INFO ] Parsed PT model containing 403 places and 453 transitions and 1440 arcs in 135 ms.
Structural test allowed to assert that 191 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 212) seen :206
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 453 rows 403 cols
[2023-03-23 07:49:22] [INFO ] Computed 41 place invariants in 22 ms
[2023-03-23 07:49:22] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:49:22] [INFO ] [Nat]Absence check using 41 positive place invariants in 17 ms returned sat
[2023-03-23 07:49:23] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:49:23] [INFO ] Deduced a trap composed of 23 places in 518 ms of which 9 ms to minimize.
[2023-03-23 07:49:24] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2023-03-23 07:49:24] [INFO ] Deduced a trap composed of 28 places in 620 ms of which 1 ms to minimize.
[2023-03-23 07:49:24] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 1 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 7 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-23 07:49:25] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 8 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2023-03-23 07:49:26] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-23 07:49:27] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 0 ms to minimize.
[2023-03-23 07:49:27] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 1 ms to minimize.
[2023-03-23 07:49:27] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-23 07:49:27] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2023-03-23 07:49:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-23 07:49:27] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5168 ms
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2023-03-23 07:49:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 370 ms
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 0 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 326 ms
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 1 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-23 07:49:29] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-03-23 07:49:30] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:49:31] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-23 07:49:31] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-23 07:49:31] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-23 07:49:31] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2023-03-23 07:49:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2077 ms
[2023-03-23 07:49:31] [INFO ] After 8556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-23 07:49:31] [INFO ] After 8889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 2608 ms.
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 453/453 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 403 transition count 412
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 362 transition count 412
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 82 place count 362 transition count 362
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 182 place count 312 transition count 362
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 247 place count 247 transition count 297
Iterating global reduction 2 with 65 rules applied. Total rules applied 312 place count 247 transition count 297
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 312 place count 247 transition count 267
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 372 place count 217 transition count 267
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 512 place count 147 transition count 197
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 2 with 22 rules applied. Total rules applied 534 place count 147 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 535 place count 146 transition count 196
Applied a total of 535 rules in 108 ms. Remains 146 /403 variables (removed 257) and now considering 196/453 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 146/403 places, 196/453 transitions.
Finished random walk after 1240 steps, including 9 resets, run visited all 5 properties in 16 ms. (steps per millisecond=77 )
Able to resolve query StableMarking after proving 213 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 13000 ms.
ITS solved all properties within timeout

BK_STOP 1679557774508

--------------------
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="ShieldRVs-PT-010B"
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 ShieldRVs-PT-010B, 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 r441-tajo-167905986800058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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