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.r297-tall-167873950600525.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 ltsminxred
Input is PolyORBLF-PT-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950600525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K Feb 26 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Feb 26 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 157K Feb 26 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 175K Feb 26 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 807K 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 PolyORBLF-PT-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679553500223

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:38:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 06:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:38:22] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-23 06:38:22] [INFO ] Transformed 690 places.
[2023-03-23 06:38:22] [INFO ] Transformed 1434 transitions.
[2023-03-23 06:38:22] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Normalized transition count is 1290 out of 1306 initially.
// Phase 1: matrix 1290 rows 690 cols
[2023-03-23 06:38:22] [INFO ] Computed 54 place invariants in 100 ms
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 4 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 15) seen :24
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :23
[2023-03-23 06:38:23] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2023-03-23 06:38:23] [INFO ] Computed 54 place invariants in 61 ms
[2023-03-23 06:38:23] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-23 06:38:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-23 06:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:24] [INFO ] [Real]Absence check using state equation in 1040 ms returned sat
[2023-03-23 06:38:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:38:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-23 06:38:25] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-23 06:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:38:27] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2023-03-23 06:38:27] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-23 06:38:28] [INFO ] [Nat]Added 96 Read/Feed constraints in 1647 ms returned sat
[2023-03-23 06:38:29] [INFO ] Deduced a trap composed of 139 places in 383 ms of which 8 ms to minimize.
[2023-03-23 06:38:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 465 ms
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-23 06:38:29] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 18 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 30 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 17 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 10 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 12 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 9 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 10 ms returned unsat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 06:38:30] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1] Max seen :[7, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8626 ms.
ITS solved all properties within timeout

BK_STOP 1679553511629

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="PolyORBLF-PT-S02J06T08"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T08, 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 r297-tall-167873950600525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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