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.r150-smll-165276998700301.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 Parking-PT-104, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.5K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 23K 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 Parking-PT-104-UpperBounds-00
FORMULA_NAME Parking-PT-104-UpperBounds-01
FORMULA_NAME Parking-PT-104-UpperBounds-02
FORMULA_NAME Parking-PT-104-UpperBounds-03
FORMULA_NAME Parking-PT-104-UpperBounds-04
FORMULA_NAME Parking-PT-104-UpperBounds-05
FORMULA_NAME Parking-PT-104-UpperBounds-06
FORMULA_NAME Parking-PT-104-UpperBounds-07
FORMULA_NAME Parking-PT-104-UpperBounds-08
FORMULA_NAME Parking-PT-104-UpperBounds-09
FORMULA_NAME Parking-PT-104-UpperBounds-10
FORMULA_NAME Parking-PT-104-UpperBounds-11
FORMULA_NAME Parking-PT-104-UpperBounds-12
FORMULA_NAME Parking-PT-104-UpperBounds-13
FORMULA_NAME Parking-PT-104-UpperBounds-14
FORMULA_NAME Parking-PT-104-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653051155318

Running Version 202205111006
[2022-05-20 12:52:37] [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-20 12:52:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:52:38] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2022-05-20 12:52:38] [INFO ] Transformed 65 places.
[2022-05-20 12:52:38] [INFO ] Transformed 97 transitions.
[2022-05-20 12:52:38] [INFO ] Found NUPN structural information;
[2022-05-20 12:52:38] [INFO ] Parsed PT model containing 65 places and 97 transitions in 424 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
// Phase 1: matrix 56 rows 65 cols
[2022-05-20 12:52:38] [INFO ] Computed 16 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 594 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :14
FORMULA Parking-PT-104-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-104-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
// Phase 1: matrix 56 rows 65 cols
[2022-05-20 12:52:38] [INFO ] Computed 16 place invariants in 13 ms
[2022-05-20 12:52:38] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2022-05-20 12:52:38] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-20 12:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:52:38] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-20 12:52:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-20 12:52:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-20 12:52:39] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2022-05-20 12:52:39] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-20 12:52:39] [INFO ] Added : 44 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 53 ms.
[2022-05-20 12:52:39] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:52:39] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-20 12:52:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:52:39] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-20 12:52:39] [INFO ] [Nat]Added 12 Read/Feed constraints in 13 ms returned sat
[2022-05-20 12:52:39] [INFO ] Computed and/alt/rep : 55/191/55 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-20 12:52:39] [INFO ] Added : 55 causal constraints over 12 iterations in 204 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA Parking-PT-104-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 65 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 55/55 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 52
Reduce places removed 3 places and 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 61 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 60 transition count 50
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 7 place count 60 transition count 45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 17 place count 55 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 54 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 54 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 51 transition count 41
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 51 transition count 35
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 45 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 44 transition count 34
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 22 rules applied. Total rules applied 60 place count 35 transition count 21
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 19 rules applied. Total rules applied 79 place count 22 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 83 place count 18 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 83 place count 18 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 93 place count 13 transition count 10
Applied a total of 93 rules in 66 ms. Remains 13 /65 variables (removed 52) and now considering 10/55 (removed 45) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/65 places, 10/55 transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-20 12:52:40] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 91135 resets, run finished after 1196 ms. (steps per millisecond=836 ) properties (out of 1) seen :1
FORMULA Parking-PT-104-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3461 ms.

BK_STOP 1653051161338

--------------------
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="Parking-PT-104"
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 Parking-PT-104, 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 r150-smll-165276998700301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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