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

About the Execution of Marcie+red for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
380.983 8631.00 11282.00 352.50 F 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.r504-tall-167912729000766.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 marciexred
Input is Vasy2003-PT-none, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-167912729000766
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 207K 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 1679300548237

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=marciexred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Vasy2003-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 08:22:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-20 08:22:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:22:30] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2023-03-20 08:22:30] [INFO ] Transformed 485 places.
[2023-03-20 08:22:30] [INFO ] Transformed 776 transitions.
[2023-03-20 08:22:30] [INFO ] Found NUPN structural information;
[2023-03-20 08:22:30] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 411 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 24 transitions
Reduce redundant transitions removed 24 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.27882KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (trivial) has 167 edges and 485 vertex of which 4 / 485 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Computed a total of 7 stabilizing places and 1 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 483 transition count 749
Reduce places removed 1 places and 0 transitions.
Computed a total of 7 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 482 transition count 749
Computed a total of 7 stabilizing places and 1 stable transitions
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 3 place count 482 transition count 730
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 41 place count 463 transition count 730
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 144 places :
Symmetric choice reduction at 2 with 144 rule applications. Total rules 185 place count 319 transition count 586
Ensure Unique test removed 1 places
Iterating global reduction 2 with 145 rules applied. Total rules applied 330 place count 318 transition count 586
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 2 with 40 rules applied. Total rules applied 370 place count 318 transition count 546
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 471 place count 217 transition count 418
Iterating global reduction 3 with 101 rules applied. Total rules applied 572 place count 217 transition count 418
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 73 rules applied. Total rules applied 645 place count 217 transition count 345
Reduce places removed 1 places and 0 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 646 place count 216 transition count 345
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 689 place count 173 transition count 268
Iterating global reduction 5 with 43 rules applied. Total rules applied 732 place count 173 transition count 268
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 5 with 40 rules applied. Total rules applied 772 place count 173 transition count 228
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 775 place count 170 transition count 210
Iterating global reduction 6 with 3 rules applied. Total rules applied 778 place count 170 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 779 place count 170 transition count 209
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 781 place count 168 transition count 206
Iterating global reduction 7 with 2 rules applied. Total rules applied 783 place count 168 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 7 with 2 rules applied. Total rules applied 785 place count 168 transition count 204
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 786 place count 167 transition count 202
Iterating global reduction 8 with 1 rules applied. Total rules applied 787 place count 167 transition count 202
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 788 place count 166 transition count 199
Iterating global reduction 8 with 1 rules applied. Total rules applied 789 place count 166 transition count 199
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 790 place count 165 transition count 196
Iterating global reduction 8 with 1 rules applied. Total rules applied 791 place count 165 transition count 196
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 792 place count 164 transition count 194
Iterating global reduction 8 with 1 rules applied. Total rules applied 793 place count 164 transition count 194
Computed a total of 10 stabilizing places and 1 stable transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 811 place count 155 transition count 185
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 818 place count 155 transition count 178
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 819 place count 154 transition count 177
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (trivial) has 25 edges and 145 vertex of which 4 / 145 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 14 rules applied. Total rules applied 833 place count 143 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 9 with 2 rules applied. Total rules applied 835 place count 143 transition count 171
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 835 place count 143 transition count 167
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 847 place count 135 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 10 with 3 rules applied. Total rules applied 850 place count 135 transition count 164
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 850 place count 135 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 853 place count 133 transition count 163
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 853 place count 133 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 856 place count 131 transition count 162
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 862 place count 127 transition count 160
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 863 place count 126 transition count 159
Iterating global reduction 11 with 1 rules applied. Total rules applied 864 place count 126 transition count 159
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 870 place count 123 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 11 with 4 rules applied. Total rules applied 874 place count 123 transition count 152
Computed a total of 0 stabilizing places and 0 stable transitions
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 875 place count 122 transition count 150
Iterating global reduction 12 with 1 rules applied. Total rules applied 876 place count 122 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 12 with 2 rules applied. Total rules applied 878 place count 122 transition count 148
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 878 rules in 220 ms. Remains 122 /485 variables (removed 363) and now considering 148/752 (removed 604) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 221 ms. Remains : 122/485 places, 148/752 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2967 ms (no deadlock found). (steps per millisecond=421 )
Random directed walk for 1250000 steps, including 0 resets, run took 1954 ms (no deadlock found). (steps per millisecond=639 )
[2023-03-20 08:22:35] [INFO ] Flow matrix only has 125 transitions (discarded 23 similar events)
// Phase 1: matrix 125 rows 122 cols
[2023-03-20 08:22:35] [INFO ] Computed 48 place invariants in 14 ms
[2023-03-20 08:22:35] [INFO ] [Real]Absence check using 42 positive place invariants in 5 ms returned unsat
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 5887 ms.
ITS solved all properties within timeout

BK_STOP 1679300556868

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Vasy2003-PT-none, 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 r504-tall-167912729000766"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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