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.r312-tall-165472282700741.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 RingSingleMessageInMbox-PT-d0m160, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282700741
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.3K Jun 7 17:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 7 17:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Jun 7 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 7 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Jun 7 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 64K Jun 6 12:11 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654927398712

Running Version 202205111006
[2022-06-11 06:03:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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, 3600]
[2022-06-11 06:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 06:03:20] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-06-11 06:03:20] [INFO ] Transformed 385 places.
[2022-06-11 06:03:20] [INFO ] Transformed 59 transitions.
[2022-06-11 06:03:20] [INFO ] Parsed PT model containing 385 places and 59 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 329 places in 0 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 59 rows 56 cols
[2022-06-11 06:03:20] [INFO ] Computed 5 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 2177 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :1
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
// Phase 1: matrix 59 rows 56 cols
[2022-06-11 06:03:20] [INFO ] Computed 5 place invariants in 7 ms
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned unsat
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-06-11 06:03:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 06:03:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 06:03:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned unsat
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 06:03:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-11 06:03:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 06:03:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 06:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 06:03:20] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-11 06:03:20] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-11 06:03:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 11 ms returned sat
[2022-06-11 06:03:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
[2022-06-11 06:03:20] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2022-06-11 06:03:20] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-11 06:03:20] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2022-06-11 06:03:20] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2022-06-11 06:03:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 209 ms
[2022-06-11 06:03:20] [INFO ] Computed and/alt/rep : 18/36/18 causal constraints (skipped 40 transitions) in 7 ms.
[2022-06-11 06:03:20] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1, 0, 12] Max seen :[1, 0, 0]
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 56/56 places, 59/59 transitions.
Graph (complete) has 148 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 56
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 47 transition count 48
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 47 transition count 48
Applied a total of 16 rules in 18 ms. Remains 47 /56 variables (removed 9) and now considering 48/59 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 47/56 places, 48/59 transitions.
// Phase 1: matrix 48 rows 47 cols
[2022-06-11 06:03:20] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 216946 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 94318 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 1) seen :1
// Phase 1: matrix 48 rows 47 cols
[2022-06-11 06:03:21] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 06:03:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-11 06:03:21] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 06:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 06:03:21] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA RingSingleMessageInMbox-PT-d0m160-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2093 ms.

BK_STOP 1654927402058

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -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 3600 -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="RingSingleMessageInMbox-PT-d0m160"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 RingSingleMessageInMbox-PT-d0m160, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282700741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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