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-165286034500517.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 ShieldRVs-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034500517
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.0K Apr 30 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:58 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 370K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1653037982701

Running Version 202205111006
[2022-05-20 09:13:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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 09:13:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:13:04] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2022-05-20 09:13:04] [INFO ] Transformed 1203 places.
[2022-05-20 09:13:04] [INFO ] Transformed 1353 transitions.
[2022-05-20 09:13:04] [INFO ] Found NUPN structural information;
[2022-05-20 09:13:04] [INFO ] Parsed PT model containing 1203 places and 1353 transitions in 258 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 1203 transition count 1232
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 1082 transition count 1232
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 242 place count 1082 transition count 1082
Deduced a syphon composed of 150 places in 13 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 542 place count 932 transition count 1082
Discarding 210 places :
Symmetric choice reduction at 2 with 210 rule applications. Total rules 752 place count 722 transition count 872
Iterating global reduction 2 with 210 rules applied. Total rules applied 962 place count 722 transition count 872
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 90 Pre rules applied. Total rules applied 962 place count 722 transition count 782
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1142 place count 632 transition count 782
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 210
Deduced a syphon composed of 210 places in 2 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 2 with 420 rules applied. Total rules applied 1562 place count 422 transition count 572
Applied a total of 1562 rules in 295 ms. Remains 422 /1203 variables (removed 781) and now considering 572/1353 (removed 781) transitions.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:13:04] [INFO ] Computed 121 place invariants in 21 ms
[2022-05-20 09:13:04] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:13:04] [INFO ] Computed 121 place invariants in 19 ms
[2022-05-20 09:13:05] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:13:05] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 09:13:05] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 422/1203 places, 572/1353 transitions.
Finished structural reductions, in 1 iterations. Remains : 422/1203 places, 572/1353 transitions.
Discarding 180 transitions out of 572. Remains 392
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 391) seen :368
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 572 rows 422 cols
[2022-05-20 09:13:06] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 09:13:06] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2022-05-20 09:13:07] [INFO ] After 1313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-20 09:13:08] [INFO ] [Nat]Absence check using 121 positive place invariants in 26 ms returned sat
[2022-05-20 09:13:08] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 13 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2022-05-20 09:13:09] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 690 ms
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:13:10] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 33 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 34 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-05-20 09:13:11] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:13:12] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 0 ms to minimize.
[2022-05-20 09:13:12] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2022-05-20 09:13:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1550 ms
[2022-05-20 09:13:12] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 6 ms to minimize.
[2022-05-20 09:13:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-05-20 09:13:12] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-05-20 09:13:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2022-05-20 09:13:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-05-20 09:13:12] [INFO ] After 4227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 501 ms.
[2022-05-20 09:13:12] [INFO ] After 5125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 2 properties in 4086 ms.
Support contains 57 out of 422 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 51 place count 422 transition count 572
Applied a total of 51 rules in 57 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 572/572 transitions.
Finished random walk after 17202 steps, including 47 resets, run visited all 19 properties in 360 ms. (steps per millisecond=47 )
Able to resolve query QuasiLiveness after proving 392 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 13660 ms.

BK_STOP 1653037997580

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -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="ShieldRVs-PT-030B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldRVs-PT-030B, examination is QuasiLiveness"
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-165286034500517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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