Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662339500877.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ResAllocation-PT-R050C002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339500877
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 23:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 23:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 23:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K May 18 16:43 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 ResAllocation-PT-R050C002-UpperBounds-00
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-01
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-02
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-03
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-04
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-05
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-06
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-07
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-08
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-09
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-10
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-11
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-12
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-13
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-14
FORMULA_NAME ResAllocation-PT-R050C002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717265455183

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R050C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:10:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 18:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:10:56] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-01 18:10:56] [INFO ] Transformed 200 places.
[2024-06-01 18:10:56] [INFO ] Transformed 102 transitions.
[2024-06-01 18:10:56] [INFO ] Found NUPN structural information;
[2024-06-01 18:10:56] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ResAllocation-PT-R050C002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R050C002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 102 rows 200 cols
[2024-06-01 18:10:56] [INFO ] Computed 100 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (15 resets) in 65 ms. (151 steps per ms)
FORMULA ResAllocation-PT-R050C002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (16 resets) in 150 ms. (529 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 18:10:56] [INFO ] Invariant cache hit.
[2024-06-01 18:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2024-06-01 18:10:57] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 18:10:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 18:10:57] [INFO ] Added : 45 causal constraints over 9 iterations in 120 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 18:10:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:10:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2024-06-01 18:10:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 18:10:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 18:10:57] [INFO ] Added : 45 causal constraints over 9 iterations in 109 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 18:10:57] [INFO ] [Real]Absence check using 100 positive place invariants in 21 ms returned sat
[2024-06-01 18:10:57] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 18:10:57] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 18:10:57] [INFO ] Added : 85 causal constraints over 17 iterations in 215 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 18:10:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:10:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 19 ms returned sat
[2024-06-01 18:10:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 18:10:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:10:58] [INFO ] Added : 85 causal constraints over 17 iterations in 179 ms. Result :sat
Minimization took 28 ms.
[2024-06-01 18:10:58] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-06-01 18:10:58] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 18:10:58] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 10 ms to minimize.
[2024-06-01 18:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:10:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-06-01 18:10:58] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 18:10:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
[2024-06-01 18:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 18:10:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 18:10:58] [INFO ] Added : 83 causal constraints over 17 iterations in 167 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 18:10:58] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2024-06-01 18:10:58] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 18:10:58] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 18:10:59] [INFO ] Added : 93 causal constraints over 19 iterations in 221 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 18:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:10:59] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-06-01 18:10:59] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 18:10:59] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 18:10:59] [INFO ] Added : 93 causal constraints over 19 iterations in 164 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 18:10:59] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2024-06-01 18:10:59] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 18:10:59] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 18:10:59] [INFO ] Added : 96 causal constraints over 20 iterations in 228 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 18:10:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:11:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2024-06-01 18:11:00] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 18:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:11:00] [INFO ] Added : 96 causal constraints over 20 iterations in 170 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 18:11:00] [INFO ] [Real]Absence check using 100 positive place invariants in 12 ms returned sat
[2024-06-01 18:11:00] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-01 18:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:11:00] [INFO ] Added : 49 causal constraints over 10 iterations in 108 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 18:11:00] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2024-06-01 18:11:00] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-01 18:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 18:11:00] [INFO ] Added : 45 causal constraints over 9 iterations in 90 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 18:11:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:11:00] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-06-01 18:11:00] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-01 18:11:00] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 18:11:00] [INFO ] Added : 45 causal constraints over 9 iterations in 83 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 18:11:01] [INFO ] [Real]Absence check using 100 positive place invariants in 13 ms returned sat
[2024-06-01 18:11:01] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 18:11:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 18:11:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 18:11:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2024-06-01 18:11:01] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 18:11:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 18:11:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-01 18:11:01] [INFO ] Computed and/alt/rep : 100/100/100 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 18:11:01] [INFO ] Added : 79 causal constraints over 16 iterations in 141 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ResAllocation-PT-R050C002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5419 ms.
ITS solved all properties within timeout

BK_STOP 1717265461745

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ResAllocation-PT-R050C002, 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 r520-tall-171662339500877"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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