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.r201-smll-171649587200373.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 greatspnxred
Input is IOTPpurchase-PT-C03M03P03D03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649587200373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K May 18 16:42 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 IOTPpurchase-PT-C03M03P03D03-UpperBounds-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716804713357

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C03M03P03D03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 10:11:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-27 10:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 10:11:55] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-27 10:11:55] [INFO ] Transformed 111 places.
[2024-05-27 10:11:55] [INFO ] Transformed 45 transitions.
[2024-05-27 10:11:55] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 111 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 3, 0, 3, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 3, 0, 3, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 45 rows 111 cols
[2024-05-27 10:11:55] [INFO ] Computed 67 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 3, 0, 3, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0] Max Struct:[3, 3, 3, 3, 23, 3, 3, 6, 3, 1, 3, 3, 8, 3, 3, 3]
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 62 ms. (158 steps per ms)
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-10 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (12 resets) in 132 ms. (451 steps per ms)
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 1, 2, 2] Max Struct:[23, 6, 8, 3, 3]
[2024-05-27 10:11:55] [INFO ] Invariant cache hit.
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 28 ms returned unsat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned unsat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 18 ms returned unsat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 19 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-27 10:11:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-27 10:11:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-27 10:11:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 10:11:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 23 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-27 10:11:56] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-27 10:11:56] [INFO ] Added : 18 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 24 ms.
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 16 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-27 10:11:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-27 10:11:56] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-27 10:11:57] [INFO ] Added : 19 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 1, 2, 2] Max Struct:[3, 3, 1, 3, 3]
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[3]
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 36 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 67 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 70 place count 56 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 78 place count 48 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 78 place count 48 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 104 place count 32 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 104 place count 32 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 29 transition count 17
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 127 place count 19 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 17 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 129 place count 17 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 135 place count 13 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 136 place count 13 transition count 7
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 140 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 142 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 143 place count 8 transition count 5
Applied a total of 143 rules in 65 ms. Remains 8 /111 variables (removed 103) and now considering 5/45 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 8/111 places, 5/45 transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-05-27 10:11:57] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[3]
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 384 ms. (2597 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after 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 2569 ms.
ITS solved all properties within timeout

BK_STOP 1716804717790

--------------------
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.202405141337.jar
+ 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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is IOTPpurchase-PT-C03M03P03D03, 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 r201-smll-171649587200373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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