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.r299-tall-167873953200629.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 smartxred
Input is PolyORBLF-PT-S06J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953200629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 28K Feb 26 14:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 14:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 444K Feb 26 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 52K Feb 26 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 273K Feb 26 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 534K Feb 26 14:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 26 14:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:35 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 14M 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-S06J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679524476969

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 22:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 22:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:34:39] [INFO ] Load time of PNML (sax parser for PT used): 623 ms
[2023-03-22 22:34:39] [INFO ] Transformed 894 places.
[2023-03-22 22:34:39] [INFO ] Transformed 14334 transitions.
[2023-03-22 22:34:39] [INFO ] Parsed PT model containing 894 places and 14334 transitions and 119772 arcs in 797 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Normalized transition count is 3526 out of 3574 initially.
// Phase 1: matrix 3526 rows 894 cols
[2023-03-22 22:34:39] [INFO ] Computed 62 place invariants in 311 ms
Incomplete random walk after 10000 steps, including 55 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 16) seen :37
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :20
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :23
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :18
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :19
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :21
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :16
[2023-03-22 22:34:40] [INFO ] Flow matrix only has 3526 transitions (discarded 48 similar events)
// Phase 1: matrix 3526 rows 894 cols
[2023-03-22 22:34:40] [INFO ] Computed 62 place invariants in 164 ms
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive place invariants in 48 ms returned unsat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 33 ms returned unsat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 43 ms returned unsat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 40 ms returned unsat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-22 22:34:41] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 41 ms returned unsat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 38 ms returned unsat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 38 ms returned unsat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 37 ms returned unsat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 13 ms returned unsat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 37 ms returned unsat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 42 ms returned sat
[2023-03-22 22:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:34:47] [INFO ] [Real]Absence check using state equation in 4886 ms returned unknown
[2023-03-22 22:34:47] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-22 22:34:47] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 47 ms returned unsat
[2023-03-22 22:34:47] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2023-03-22 22:34:48] [INFO ] [Real]Absence check using 19 positive and 43 generalized place invariants in 48 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 8, 1, 1, 6, 1, 1, 1, 4, -1, 1, 4] Max seen :[1, 1, 8, 1, 1, 6, 1, 1, 1, 4, 3, 1, 4]
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 894/894 places, 3574/3574 transitions.
Ensure Unique test removed 6 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 888 transition count 3502
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 150 place count 816 transition count 3502
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 150 place count 816 transition count 3390
Deduced a syphon composed of 112 places in 5 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 374 place count 704 transition count 3390
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 564 place count 609 transition count 3295
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 580 place count 609 transition count 3279
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 596 place count 593 transition count 3279
Applied a total of 596 rules in 658 ms. Remains 593 /894 variables (removed 301) and now considering 3279/3574 (removed 295) transitions.
[2023-03-22 22:34:48] [INFO ] Flow matrix only has 3231 transitions (discarded 48 similar events)
// Phase 1: matrix 3231 rows 593 cols
[2023-03-22 22:34:48] [INFO ] Computed 56 place invariants in 74 ms
[2023-03-22 22:34:50] [INFO ] Dead Transitions using invariants and state equation in 2194 ms found 1224 transitions.
Found 1224 dead transitions using SMT.
Drop transitions removed 1224 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 593/894 places, 2055/3574 transitions.
Applied a total of 0 rules in 47 ms. Remains 593 /593 variables (removed 0) and now considering 2055/2055 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2903 ms. Remains : 593/894 places, 2055/3574 transitions.
Normalized transition count is 2007 out of 2055 initially.
// Phase 1: matrix 2007 rows 593 cols
[2023-03-22 22:34:51] [INFO ] Computed 56 place invariants in 40 ms
Incomplete random walk after 1000000 steps, including 11073 resets, run finished after 8849 ms. (steps per millisecond=113 ) properties (out of 1) seen :4
FORMULA PolyORBLF-PT-S06J06T08-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21442 ms.
ITS solved all properties within timeout

BK_STOP 1679524500783

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-S06J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PolyORBLF-PT-S06J06T08, 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 r299-tall-167873953200629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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