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.r240-smll-165303241500253.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 SmartHome-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241500253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 7.4K Apr 29 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 29 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 29 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 09:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 64K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653107567645

Running Version 202205111006
[2022-05-21 04:32:49] [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-05-21 04:32:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:32:50] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-21 04:32:50] [INFO ] Transformed 252 places.
[2022-05-21 04:32:50] [INFO ] Transformed 291 transitions.
[2022-05-21 04:32:50] [INFO ] Found NUPN structural information;
[2022-05-21 04:32:50] [INFO ] Parsed PT model containing 252 places and 291 transitions in 410 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 21 transitions.
// Phase 1: matrix 270 rows 232 cols
[2022-05-21 04:32:50] [INFO ] Computed 11 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :15
FORMULA SmartHome-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 270 rows 232 cols
[2022-05-21 04:32:50] [INFO ] Computed 11 place invariants in 10 ms
[2022-05-21 04:32:51] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2022-05-21 04:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 04:32:51] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-05-21 04:32:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 04:32:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2022-05-21 04:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 04:32:51] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2022-05-21 04:32:51] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 26 ms to minimize.
[2022-05-21 04:32:52] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2022-05-21 04:32:52] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2022-05-21 04:32:52] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 3 ms to minimize.
[2022-05-21 04:32:52] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2022-05-21 04:32:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2022-05-21 04:32:52] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 48 ms.
[2022-05-21 04:32:54] [INFO ] Added : 200 causal constraints over 40 iterations in 1507 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 232 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 232/232 places, 269/269 transitions.
Graph (trivial) has 227 edges and 232 vertex of which 90 / 232 are part of one of the 6 SCC in 8 ms
Free SCC test removed 84 places
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Graph (complete) has 236 edges and 148 vertex of which 142 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Reduce places removed 7 places and 7 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 135 transition count 89
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 68 rules applied. Total rules applied 140 place count 78 transition count 78
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 145 place count 73 transition count 78
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 145 place count 73 transition count 75
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 70 transition count 75
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 178 place count 43 transition count 48
Iterating global reduction 3 with 27 rules applied. Total rules applied 205 place count 43 transition count 48
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 211 place count 43 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 211 place count 43 transition count 36
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 223 place count 37 transition count 36
Graph (complete) has 63 edges and 37 vertex of which 33 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 4 with 2 rules applied. Total rules applied 225 place count 33 transition count 33
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 236 place count 32 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 236 place count 32 transition count 22
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 238 place count 31 transition count 22
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 252 place count 24 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 23 transition count 14
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 6 with 13 rules applied. Total rules applied 266 place count 17 transition count 7
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 273 place count 10 transition count 7
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 273 place count 10 transition count 2
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 285 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 285 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 287 place count 2 transition count 1
Applied a total of 287 rules in 74 ms. Remains 2 /232 variables (removed 230) and now considering 1/269 (removed 268) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/232 places, 1/269 transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 04:32:54] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :1
FORMULA SmartHome-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5119 ms.

BK_STOP 1653107575167

--------------------
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="SmartHome-PT-08"
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 SmartHome-PT-08, 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 r240-smll-165303241500253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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