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.r261-smll-167863536300421.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 itstools
Input is Parking-PT-208, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678920870732

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 22:54:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:54:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:54:34] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-15 22:54:34] [INFO ] Transformed 137 places.
[2023-03-15 22:54:34] [INFO ] Transformed 201 transitions.
[2023-03-15 22:54:34] [INFO ] Found NUPN structural information;
[2023-03-15 22:54:34] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
// Phase 1: matrix 117 rows 137 cols
[2023-03-15 22:54:34] [INFO ] Computed 34 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 291 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :13
FORMULA Parking-PT-208-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
[2023-03-15 22:54:34] [INFO ] Invariant cache hit.
[2023-03-15 22:54:35] [INFO ] [Real]Absence check using 32 positive place invariants in 26 ms returned sat
[2023-03-15 22:54:35] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:54:35] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2023-03-15 22:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:54:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2023-03-15 22:54:35] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 22:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:54:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-15 22:54:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-15 22:54:35] [INFO ] [Nat]Added 26 Read/Feed constraints in 17 ms returned sat
[2023-03-15 22:54:35] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-15 22:54:35] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 5 ms to minimize.
[2023-03-15 22:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-15 22:54:35] [INFO ] Added : 71 causal constraints over 15 iterations in 477 ms. Result :sat
Minimization took 72 ms.
[2023-03-15 22:54:36] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:54:36] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-15 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:54:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:54:36] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2023-03-15 22:54:36] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-15 22:54:36] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 4 ms to minimize.
[2023-03-15 22:54:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-15 22:54:36] [INFO ] Added : 75 causal constraints over 15 iterations in 323 ms. Result :sat
Minimization took 56 ms.
[2023-03-15 22:54:36] [INFO ] [Real]Absence check using 32 positive place invariants in 13 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:54:36] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-15 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:54:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-15 22:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:54:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-15 22:54:37] [INFO ] [Nat]Added 26 Read/Feed constraints in 10 ms returned sat
[2023-03-15 22:54:37] [INFO ] Computed and/alt/rep : 116/396/116 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-15 22:54:37] [INFO ] Added : 97 causal constraints over 20 iterations in 355 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA Parking-PT-208-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-208-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-208-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 3213 ms.

BK_STOP 1678920878599

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-208"
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-5348"
echo " Executing tool itstools"
echo " Input is Parking-PT-208, 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 r261-smll-167863536300421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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