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-165286033900168.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 ShieldIIPt-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286033900168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 9.3K Apr 29 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 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 167K 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 1653032581702

Running Version 202205111006
[2022-05-20 07:43:02] [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 07:43:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:43:03] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2022-05-20 07:43:03] [INFO ] Transformed 703 places.
[2022-05-20 07:43:03] [INFO ] Transformed 653 transitions.
[2022-05-20 07:43:03] [INFO ] Found NUPN structural information;
[2022-05-20 07:43:03] [INFO ] Parsed PT model containing 703 places and 653 transitions in 224 ms.
Structural test allowed to assert that 282 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 421) seen :408
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 653 rows 703 cols
[2022-05-20 07:43:04] [INFO ] Computed 91 place invariants in 19 ms
[2022-05-20 07:43:04] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-20 07:43:04] [INFO ] [Nat]Absence check using 91 positive place invariants in 133 ms returned sat
[2022-05-20 07:43:05] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-20 07:43:05] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 6 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2022-05-20 07:43:06] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-20 07:43:07] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2022-05-20 07:43:08] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2022-05-20 07:43:08] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-05-20 07:43:08] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2022-05-20 07:43:08] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-20 07:43:08] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2721 ms
[2022-05-20 07:43:08] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2022-05-20 07:43:08] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 902 ms
[2022-05-20 07:43:09] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 0 ms to minimize.
[2022-05-20 07:43:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-20 07:43:10] [INFO ] After 4889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 333 ms.
[2022-05-20 07:43:10] [INFO ] After 5773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 6801 ms.
Support contains 13 out of 703 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 703 transition count 485
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 170 rules applied. Total rules applied 338 place count 535 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 339 place count 534 transition count 483
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 339 place count 534 transition count 442
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 421 place count 493 transition count 442
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 488 place count 426 transition count 375
Iterating global reduction 3 with 67 rules applied. Total rules applied 555 place count 426 transition count 375
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 555 place count 426 transition count 347
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 611 place count 398 transition count 347
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 1 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 947 place count 230 transition count 179
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1003 place count 202 transition count 197
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1004 place count 202 transition count 196
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1006 place count 202 transition count 194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1008 place count 200 transition count 194
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 1018 place count 200 transition count 194
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1019 place count 199 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1021 place count 197 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1021 place count 197 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1023 place count 196 transition count 192
Applied a total of 1023 rules in 159 ms. Remains 196 /703 variables (removed 507) and now considering 192/653 (removed 461) transitions.
Finished structural reductions, in 1 iterations. Remains : 196/703 places, 192/653 transitions.
Finished random walk after 2260 steps, including 0 resets, run visited all 13 properties in 71 ms. (steps per millisecond=31 )
Able to resolve query StableMarking after proving 422 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 14570 ms.

BK_STOP 1653032597440

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ShieldIIPt-PT-010B"
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 ShieldIIPt-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 r229-tall-165286033900168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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