Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813696900479.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BusinessProcesses-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 79K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678790013911

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:33:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 10:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:33:36] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-14 10:33:36] [INFO ] Transformed 288 places.
[2023-03-14 10:33:36] [INFO ] Transformed 283 transitions.
[2023-03-14 10:33:36] [INFO ] Found NUPN structural information;
[2023-03-14 10:33:36] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 2 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 16) seen :12
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :1
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 281 rows 286 cols
[2023-03-14 10:33:37] [INFO ] Computed 44 place invariants in 26 ms
[2023-03-14 10:33:37] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned sat
[2023-03-14 10:33:37] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 21 ms returned sat
[2023-03-14 10:33:37] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-14 10:33:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-14 10:33:38] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 8 ms returned sat
[2023-03-14 10:33:38] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-14 10:33:38] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 9 ms to minimize.
[2023-03-14 10:33:38] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2023-03-14 10:33:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-03-14 10:33:38] [INFO ] After 619ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-14 10:33:38] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 12 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 281/281 transitions.
Graph (complete) has 635 edges and 286 vertex of which 282 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 282 transition count 227
Reduce places removed 53 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 58 rules applied. Total rules applied 112 place count 229 transition count 222
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 224 transition count 221
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 118 place count 224 transition count 183
Deduced a syphon composed of 38 places in 26 ms
Ensure Unique test removed 5 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 199 place count 181 transition count 183
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 225 place count 155 transition count 157
Iterating global reduction 3 with 26 rules applied. Total rules applied 251 place count 155 transition count 157
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 251 place count 155 transition count 151
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 263 place count 149 transition count 151
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 337 place count 112 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 111 transition count 117
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 342 place count 111 transition count 114
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 345 place count 108 transition count 114
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 349 place count 108 transition count 114
Applied a total of 349 rules in 271 ms. Remains 108 /286 variables (removed 178) and now considering 114/281 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 108/286 places, 114/281 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished probabilistic random walk after 904 steps, run visited all 1 properties in 19 ms. (steps per millisecond=47 )
Probabilistic random walk after 904 steps, saw 335 distinct states, run finished after 19 ms. (steps per millisecond=47 ) properties seen :1
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 3101 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 04
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 288 places, 283 transitions, 916 arcs.
Final Score: 7215.998
Took : 11 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-04-ReachabilityFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678790162583

--------------------
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 ReachabilityFireability -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="BusinessProcesses-PT-04"
export BK_EXAMINATION="ReachabilityFireability"
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 BusinessProcesses-PT-04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696900479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-04.tgz
mv BusinessProcesses-PT-04 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;