Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r147-tall-162089138000246.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ParamProductionCell-PT-4, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-162089138000246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1620948006085

Running Version 0
[2021-05-13 23:20:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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]
[2021-05-13 23:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:20:07] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-13 23:20:07] [INFO ] Transformed 231 places.
[2021-05-13 23:20:07] [INFO ] Transformed 202 transitions.
[2021-05-13 23:20:07] [INFO ] Found NUPN structural information;
[2021-05-13 23:20:07] [INFO ] Parsed PT model containing 231 places and 202 transitions in 112 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.15563KB memory used
Starting structural reductions, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 71 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/231 places, 164/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3077 ms (no deadlock found). (steps per millisecond=406 )
Random directed walk for 1250002 steps, including 0 resets, run took 1910 ms (no deadlock found). (steps per millisecond=654 )
// Phase 1: matrix 164 rows 193 cols
[2021-05-13 23:20:13] [INFO ] Computed 59 place invariants in 27 ms
[2021-05-13 23:20:13] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2021-05-13 23:20:13] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-13 23:20:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:13] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-13 23:20:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 23:20:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2021-05-13 23:20:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2021-05-13 23:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 23:20:13] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-13 23:20:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-13 23:20:13] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-13 23:20:13] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 3 ms to minimize.
[2021-05-13 23:20:13] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2021-05-13 23:20:13] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 52 places in 30 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 40 places in 24 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 35 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:20:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 2 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2021-05-13 23:20:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 37 trap constraints in 1905 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION

BK_STOP 1620948016686

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ParamProductionCell-PT-4"
export BK_EXAMINATION="ReachabilityDeadlock"
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 ParamProductionCell-PT-4, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r147-tall-162089138000246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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