Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r229-tall-165286034100288.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034100288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.1K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 349K May 10 09:34 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 1653034744591

Running Version 202205111006
[2022-05-20 08:19:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-20 08:19:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:19:05] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2022-05-20 08:19:06] [INFO ] Transformed 1363 places.
[2022-05-20 08:19:06] [INFO ] Transformed 1263 transitions.
[2022-05-20 08:19:06] [INFO ] Found NUPN structural information;
[2022-05-20 08:19:06] [INFO ] Parsed PT model containing 1363 places and 1263 transitions in 285 ms.
Structural test allowed to assert that 544 places are NOT stable. Took 13 ms.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 819) seen :804
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2022-05-20 08:19:06] [INFO ] Computed 221 place invariants in 35 ms
[2022-05-20 08:19:07] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-20 08:19:08] [INFO ] [Nat]Absence check using 221 positive place invariants in 68 ms returned sat
[2022-05-20 08:19:10] [INFO ] After 1419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-20 08:19:10] [INFO ] Deduced a trap composed of 15 places in 319 ms of which 6 ms to minimize.
[2022-05-20 08:19:10] [INFO ] Deduced a trap composed of 23 places in 321 ms of which 2 ms to minimize.
[2022-05-20 08:19:11] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 1 ms to minimize.
[2022-05-20 08:19:11] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2022-05-20 08:19:11] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 1 ms to minimize.
[2022-05-20 08:19:12] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 1 ms to minimize.
[2022-05-20 08:19:12] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2022-05-20 08:19:12] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 1 ms to minimize.
[2022-05-20 08:19:12] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2022-05-20 08:19:13] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2022-05-20 08:19:13] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 1 ms to minimize.
[2022-05-20 08:19:13] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 1 ms to minimize.
[2022-05-20 08:19:13] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 0 ms to minimize.
[2022-05-20 08:19:14] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2022-05-20 08:19:14] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2022-05-20 08:19:14] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 1 ms to minimize.
[2022-05-20 08:19:14] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 0 ms to minimize.
[2022-05-20 08:19:15] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 0 ms to minimize.
[2022-05-20 08:19:15] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2022-05-20 08:19:15] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2022-05-20 08:19:15] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 1 ms to minimize.
[2022-05-20 08:19:16] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2022-05-20 08:19:16] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 1 ms to minimize.
[2022-05-20 08:19:16] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2022-05-20 08:19:16] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 1 ms to minimize.
[2022-05-20 08:19:17] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2022-05-20 08:19:17] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2022-05-20 08:19:17] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 0 ms to minimize.
[2022-05-20 08:19:17] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 1 ms to minimize.
[2022-05-20 08:19:17] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-20 08:19:18] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2022-05-20 08:19:18] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 0 ms to minimize.
[2022-05-20 08:19:18] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2022-05-20 08:19:18] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2022-05-20 08:19:18] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2022-05-20 08:19:18] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2022-05-20 08:19:19] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 0 ms to minimize.
[2022-05-20 08:19:19] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2022-05-20 08:19:19] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 0 ms to minimize.
[2022-05-20 08:19:19] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2022-05-20 08:19:19] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 0 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 0 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2022-05-20 08:19:20] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2022-05-20 08:19:21] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 0 ms to minimize.
[2022-05-20 08:19:21] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2022-05-20 08:19:21] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2022-05-20 08:19:21] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 0 ms to minimize.
[2022-05-20 08:19:21] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 0 ms to minimize.
[2022-05-20 08:19:21] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 11608 ms
[2022-05-20 08:19:22] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2022-05-20 08:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-20 08:19:22] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-20 08:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-20 08:19:22] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2022-05-20 08:19:22] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-20 08:19:23] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2022-05-20 08:19:23] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2022-05-20 08:19:23] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-05-20 08:19:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 655 ms
[2022-05-20 08:19:23] [INFO ] After 15290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 771 ms.
[2022-05-20 08:19:24] [INFO ] After 17020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 6 different solutions.
Parikh walk visited 9 properties in 21937 ms.
Support contains 6 out of 1363 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 1363 transition count 1121
Reduce places removed 142 places and 0 transitions.
Iterating post reduction 1 with 142 rules applied. Total rules applied 284 place count 1221 transition count 1121
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 284 place count 1221 transition count 1021
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 484 place count 1121 transition count 1021
Discarding 134 places :
Symmetric choice reduction at 2 with 134 rule applications. Total rules 618 place count 987 transition count 887
Iterating global reduction 2 with 134 rules applied. Total rules applied 752 place count 987 transition count 887
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 752 place count 987 transition count 827
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 872 place count 927 transition count 827
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 1 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1472 place count 627 transition count 527
Partial Free-agglomeration rule applied 177 times.
Drop transitions removed 177 transitions
Iterating global reduction 2 with 177 rules applied. Total rules applied 1649 place count 627 transition count 527
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1650 place count 626 transition count 526
Applied a total of 1650 rules in 436 ms. Remains 626 /1363 variables (removed 737) and now considering 526/1263 (removed 737) transitions.
Finished structural reductions, in 1 iterations. Remains : 626/1363 places, 526/1263 transitions.
Finished random walk after 333952 steps, including 1 resets, run visited all 6 properties in 2013 ms. (steps per millisecond=165 )
Able to resolve query StableMarking after proving 820 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 43372 ms.

BK_STOP 1653034789161

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="ShieldPPPs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-020B, 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 r229-tall-165286034100288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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