fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r339-tall-167889212100176
Last Updated
May 14, 2023

About the Execution of ITS-Tools for RERS2020-PT-pb109

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8637.376 405856.00 453780.00 1281.70 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/mcc2023-input.r339-tall-167889212100176.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 itstools
Input is RERS2020-PT-pb109, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r339-tall-167889212100176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 86M
-rw-r--r-- 1 mcc users 9.2K Feb 26 08:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 08:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 08:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 08:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 08:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 85M 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679101452934

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=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb109
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202303021504
[2023-03-18 01:04:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-18 01:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:04:17] [INFO ] Load time of PNML (sax parser for PT used): 2466 ms
[2023-03-18 01:04:17] [INFO ] Transformed 1907 places.
[2023-03-18 01:04:17] [INFO ] Transformed 151872 transitions.
[2023-03-18 01:04:17] [INFO ] Found NUPN structural information;
[2023-03-18 01:04:17] [INFO ] Parsed PT model containing 1907 places and 151872 transitions and 605350 arcs in 2967 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6571 transitions
Reduce redundant transitions removed 6571 transitions.
Built sparse matrix representations for Structural reductions in 63 ms.315038KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1907/1907 places, 145301/145301 transitions.
Computed a total of 485 stabilizing places and 59095 stable transitions
Graph (complete) has 140297 edges and 1907 vertex of which 1906 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.777 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Computed a total of 470 stabilizing places and 59095 stable transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 1891 transition count 145299
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 469 stabilizing places and 59093 stable transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 1889 transition count 145297
Computed a total of 469 stabilizing places and 59093 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 1889 transition count 145296
Deduced a syphon composed of 1 places in 121 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 1888 transition count 145296
Computed a total of 468 stabilizing places and 59092 stable transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 207 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 70 place count 1865 transition count 145273
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Computed a total of 461 stabilizing places and 59036 stable transitions
Iterating post reduction 2 with 95 rules applied. Total rules applied 165 place count 1865 transition count 145178
Computed a total of 461 stabilizing places and 59036 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 113 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 1862 transition count 145178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 459 stabilizing places and 59034 stable transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 174 place count 1862 transition count 145175
Computed a total of 459 stabilizing places and 59034 stable transitions
Computed a total of 459 stabilizing places and 59034 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 175 place count 1861 transition count 145174
Computed a total of 458 stabilizing places and 59145 stable transitions
Computed a total of 458 stabilizing places and 59145 stable transitions
Applied a total of 175 rules in 10367 ms. Remains 1861 /1907 variables (removed 46) and now considering 145174/145301 (removed 127) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 10381 ms. Remains : 1861/1907 places, 145174/145301 transitions.
Interrupted Random walk after 319746 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 01:04:59] [INFO ] Flow matrix only has 100545 transitions (discarded 44629 similar events)
// Phase 1: matrix 100545 rows 1861 cols
[2023-03-18 01:05:00] [INFO ] Computed 15 place invariants in 588 ms
[2023-03-18 01:05:18] [INFO ] [Real]Absence check using 15 positive place invariants in 127 ms returned sat
[2023-03-18 01:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:05:45] [INFO ] [Real]Absence check using state equation in 27327 ms returned sat
[2023-03-18 01:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:06:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 250 ms returned sat
[2023-03-18 01:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:06:33] [INFO ] [Nat]Absence check using state equation in 27313 ms returned sat
[2023-03-18 01:06:35] [INFO ] State equation strengthened by 5223 read => feed constraints.
[2023-03-18 01:06:52] [INFO ] [Nat]Added 5223 Read/Feed constraints in 16649 ms returned sat
[2023-03-18 01:07:02] [INFO ] Deduced a trap composed of 85 places in 8595 ms of which 14 ms to minimize.
[2023-03-18 01:07:11] [INFO ] Deduced a trap composed of 107 places in 8362 ms of which 2 ms to minimize.
[2023-03-18 01:07:21] [INFO ] Deduced a trap composed of 114 places in 8190 ms of which 2 ms to minimize.
[2023-03-18 01:07:30] [INFO ] Deduced a trap composed of 23 places in 7731 ms of which 3 ms to minimize.
[2023-03-18 01:07:39] [INFO ] Deduced a trap composed of 51 places in 7311 ms of which 2 ms to minimize.
[2023-03-18 01:07:50] [INFO ] Deduced a trap composed of 214 places in 9104 ms of which 2 ms to minimize.
[2023-03-18 01:08:00] [INFO ] Deduced a trap composed of 58 places in 9025 ms of which 1 ms to minimize.
[2023-03-18 01:08:10] [INFO ] Deduced a trap composed of 19 places in 8964 ms of which 2 ms to minimize.
[2023-03-18 01:08:21] [INFO ] Deduced a trap composed of 141 places in 9184 ms of which 1 ms to minimize.
[2023-03-18 01:08:31] [INFO ] Deduced a trap composed of 147 places in 8502 ms of which 2 ms to minimize.
[2023-03-18 01:08:41] [INFO ] Deduced a trap composed of 208 places in 9178 ms of which 1 ms to minimize.
[2023-03-18 01:08:51] [INFO ] Deduced a trap composed of 112 places in 8810 ms of which 3 ms to minimize.
[2023-03-18 01:09:02] [INFO ] Deduced a trap composed of 53 places in 9003 ms of which 3 ms to minimize.
[2023-03-18 01:09:13] [INFO ] Deduced a trap composed of 20 places in 9449 ms of which 2 ms to minimize.
[2023-03-18 01:09:24] [INFO ] Deduced a trap composed of 33 places in 9601 ms of which 1 ms to minimize.
[2023-03-18 01:09:34] [INFO ] Deduced a trap composed of 170 places in 9455 ms of which 2 ms to minimize.
[2023-03-18 01:09:46] [INFO ] Deduced a trap composed of 151 places in 10077 ms of which 2 ms to minimize.
[2023-03-18 01:09:57] [INFO ] Deduced a trap composed of 111 places in 10043 ms of which 2 ms to minimize.
[2023-03-18 01:10:08] [INFO ] Deduced a trap composed of 48 places in 10204 ms of which 2 ms to minimize.
[2023-03-18 01:10:20] [INFO ] Deduced a trap composed of 151 places in 10396 ms of which 3 ms to minimize.
[2023-03-18 01:10:32] [INFO ] Deduced a trap composed of 128 places in 10133 ms of which 4 ms to minimize.
[2023-03-18 01:10:45] [INFO ] Deduced a trap composed of 192 places in 11579 ms of which 2 ms to minimize.
[2023-03-18 01:10:57] [INFO ] Deduced a trap composed of 230 places in 11437 ms of which 2 ms to minimize.
[2023-03-18 01:10:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Finished random directed walk after 529 steps, including 0 resets, run found a deadlock after 88 ms. (steps per millisecond=6 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 403243 ms.

BK_STOP 1679101858790

--------------------
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
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="RERS2020-PT-pb109"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb109, 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 r339-tall-167889212100176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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