Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399800576.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-16, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399800576
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716336892015

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-22 00:14:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:14:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:14:53] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-22 00:14:53] [INFO ] Transformed 638 places.
[2024-05-22 00:14:53] [INFO ] Transformed 578 transitions.
[2024-05-22 00:14:53] [INFO ] Found NUPN structural information;
[2024-05-22 00:14:53] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 208 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 630/630 places, 570/570 transitions.
[2024-05-22 00:14:53] [INFO ] Redundant transitions in 20 ms returned []
Running 569 sub problems to find dead transitions.
// Phase 1: matrix 570 rows 630 cols
[2024-05-22 00:14:53] [INFO ] Computed 100 invariants in 32 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/624 variables, 624/624 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/624 variables, 37/661 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/624 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 6/630 variables, 62/723 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 6/729 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 15 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 158 places in 329 ms of which 12 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 157 places in 199 ms of which 4 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 157 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 164 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 5 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 155 places in 164 ms of which 4 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 159 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 165 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 160 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2024-05-22 00:15:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 4 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 157 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 5 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 5 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 168 places in 1027 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 157 places in 185 ms of which 4 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 154 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 153 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 157 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 145 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 157 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 160 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 162 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 141 places in 147 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 20/770 constraints. Problems are: Problem set: 0 solved, 569 unsolved
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 157 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 139 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 152 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 158 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 167 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 163 places in 171 ms of which 3 ms to minimize.
SMT process timed out in 30356ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 30508 ms. Remains : 630/630 places, 570/570 transitions.
Final net has 630 places and 570 transitions.
[2024-05-22 00:15:24] [INFO ] Flatten gal took : 117 ms
[2024-05-22 00:15:24] [INFO ] Applying decomposition
[2024-05-22 00:15:24] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8150216069304839377.txt' '-o' '/tmp/graph8150216069304839377.bin' '-w' '/tmp/graph8150216069304839377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8150216069304839377.bin' '-l' '-1' '-v' '-w' '/tmp/graph8150216069304839377.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:15:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:15:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:15:24] [INFO ] Removed a total of 286 redundant transitions.
[2024-05-22 00:15:25] [INFO ] Flatten gal took : 161 ms
[2024-05-22 00:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 21 ms.
[2024-05-22 00:15:25] [INFO ] Time to serialize gal into /tmp/StateSpace14325194482055302453.gal : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace14325194482055302453.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.74273e+27,17.1561,414924,39871,78,838686,1117,1173,1.61742e+06,81,2770,0
Total reachable state count : 3742732142828126884692230144

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 66
STATE_SPACE MAX_TOKEN_PER_MARKING 66 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 3742732142828126884571045205
STATE_SPACE STATES 3742732142828126884571045205 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 49297 ms.

BK_STOP 1716336942774

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-16"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-16, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800576"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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