Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r288-smll-167863554200226.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ParamProductionCell-PT-0, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r288-smll-167863554200226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K Mar 5 18:23 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 1678907818526

Running Version 202205111006
[2023-03-15 19:17:00] [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]
[2023-03-15 19:17:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:17:00] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-15 19:17:00] [INFO ] Transformed 198 places.
[2023-03-15 19:17:00] [INFO ] Transformed 176 transitions.
[2023-03-15 19:17:00] [INFO ] Found NUPN structural information;
[2023-03-15 19:17:00] [INFO ] Parsed PT model containing 198 places and 176 transitions in 353 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 7 ms.7952KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 198/198 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 198 transition count 164
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 186 transition count 164
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 180 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 180 transition count 158
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 74 place count 160 transition count 140
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 74 place count 160 transition count 139
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 158 transition count 139
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 156 transition count 138
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 80 rules in 121 ms. Remains 156 /198 variables (removed 42) and now considering 138/176 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 156/198 places, 138/176 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1822 ms (no deadlock found). (steps per millisecond=686 )
Random directed walk for 1250001 steps, including 0 resets, run took 1485 ms (no deadlock found). (steps per millisecond=841 )
// Phase 1: matrix 138 rows 156 cols
[2023-03-15 19:17:04] [INFO ] Computed 45 place invariants in 15 ms
[2023-03-15 19:17:04] [INFO ] [Real]Absence check using 28 positive place invariants in 28 ms returned sat
[2023-03-15 19:17:04] [INFO ] [Real]Absence check using 28 positive and 17 generalized place invariants in 21 ms returned sat
[2023-03-15 19:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:17:04] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2023-03-15 19:17:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:17:05] [INFO ] [Nat]Absence check using 28 positive place invariants in 14 ms returned sat
[2023-03-15 19:17:05] [INFO ] [Nat]Absence check using 28 positive and 17 generalized place invariants in 16 ms returned sat
[2023-03-15 19:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:17:05] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-15 19:17:05] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 19:17:05] [INFO ] [Nat]Added 59 Read/Feed constraints in 41 ms returned sat
[2023-03-15 19:17:05] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 7 ms to minimize.
[2023-03-15 19:17:05] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-15 19:17:05] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-15 19:17:05] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-15 19:17:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2023-03-15 19:17:07] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-03-15 19:17:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-03-15 19:17:08] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-15 19:17:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 2768 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 7716 ms.

BK_STOP 1678907828242

--------------------
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
+ [[ 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
+ 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 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=@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="ParamProductionCell-PT-0"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is ParamProductionCell-PT-0, 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 r288-smll-167863554200226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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