fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r526-tall-171679094500321
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SemanticWebServices-PT-S064P15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
338.319 2930.00 5869.00 55.40 T normal

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.r526-tall-171679094500321.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 ltsminxred
Input is SemanticWebServices-PT-S064P15, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r526-tall-171679094500321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 02:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 137K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717220227228

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SemanticWebServices-PT-S064P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:37:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 05:37:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:37:08] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 05:37:08] [INFO ] Transformed 118 places.
[2024-06-01 05:37:08] [INFO ] Transformed 194 transitions.
[2024-06-01 05:37:08] [INFO ] Parsed PT model containing 118 places and 194 transitions and 1007 arcs in 166 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 101 transitions
Reduce redundant transitions removed 101 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.19737KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 116/116 places, 91/91 transitions.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 469 edges and 116 vertex of which 108 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Ensure Unique test removed 34 places
Computed a total of 7 stabilizing places and 10 stable transitions
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 74 transition count 88
Computed a total of 7 stabilizing places and 10 stable transitions
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 64 transition count 78
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 64 transition count 77
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 65 place count 55 transition count 68
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 55 transition count 68
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 82 place count 47 transition count 60
Iterating global reduction 2 with 8 rules applied. Total rules applied 90 place count 47 transition count 60
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 97 place count 40 transition count 53
Iterating global reduction 2 with 7 rules applied. Total rules applied 104 place count 40 transition count 53
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 34 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 34 transition count 47
Computed a total of 6 stabilizing places and 8 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 29 transition count 42
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 29 transition count 42
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 131 place count 29 transition count 37
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 28 transition count 36
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Applied a total of 132 rules in 68 ms. Remains 28 /116 variables (removed 88) and now considering 36/91 (removed 55) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 80 ms. Remains : 28/116 places, 36/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 570 ms (no deadlock found). (steps per millisecond=2192 )
Random directed walk for 1250002 steps, including 0 resets, run took 549 ms (no deadlock found). (steps per millisecond=2276 )
[2024-06-01 05:37:09] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2024-06-01 05:37:09] [INFO ] Computed 0 invariants in 8 ms
[2024-06-01 05:37:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:37:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:37:10] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:37:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:37:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:37:10] [INFO ] Computed and/alt/rep : 26/33/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:37:10] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Interrupted Parikh directed walk after 2 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=2 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 1726 ms.
ITS solved all properties within timeout

BK_STOP 1717220230158

--------------------
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 ReachabilityDeadlock -timeout 180 -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="SemanticWebServices-PT-S064P15"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ltsminxred"
echo " Input is SemanticWebServices-PT-S064P15, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r526-tall-171679094500321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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