fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r265-tall-174931349700053
Last Updated
June 24, 2025

About the Execution of 2024-gold for ErlangenMainframeV0-PT-1400

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15681.910 34710.00 51552.00 291.90 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349700053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ErlangenMainframeV0-PT-1400, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 75M
-rw-r--r-- 1 mcc users 5.9K Jun 6 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jun 6 12:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 12:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.2K Jun 6 09:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 6 09:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 6 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 6 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 12:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 12:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 75M Jun 5 20:08 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749318981505

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-1400
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:56:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 17:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:56:25] [INFO ] Load time of PNML (sax parser for PT used): 2861 ms
[2025-06-07 17:56:25] [INFO ] Transformed 299 places.
[2025-06-07 17:56:26] [INFO ] Transformed 49450 transitions.
[2025-06-07 17:56:26] [INFO ] Found NUPN structural information;
[2025-06-07 17:56:26] [INFO ] Parsed PT model containing 299 places and 49450 transitions and 1540891 arcs in 3491 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 4 places in 161 ms
Reduce places removed 4 places and 4 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 49446 rows 295 cols
[2025-06-07 17:56:28] [INFO ] Computed 34 invariants in 1226 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 3388 ms. (2 steps per ms)
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (4 resets) in 556 ms. (35 steps per ms)
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-07 17:56:32] [INFO ] Invariant cache hit.
[2025-06-07 17:56:32] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2025-06-07 17:56:32] [INFO ] [Real]Absence check using 20 positive and 14 generalized place invariants in 4 ms returned sat
[2025-06-07 17:56:37] [INFO ] [Real]Absence check using state equation in 4835 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 295 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p179) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 49445/49445 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 6 / 295 are part of one of the 3 SCC in 14 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 2170 edges and 292 vertex of which 290 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.339 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 289 transition count 49342
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 193 place count 195 transition count 49342
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 193 place count 195 transition count 49338
Deduced a syphon composed of 4 places in 102 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 201 place count 191 transition count 49338
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 244 place count 148 transition count 49295
Iterating global reduction 2 with 43 rules applied. Total rules applied 287 place count 148 transition count 49295
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 287 place count 148 transition count 49289
Deduced a syphon composed of 6 places in 79 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 299 place count 142 transition count 49289
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 312 place count 129 transition count 32907
Ensure Unique test removed 13 places
Iterating global reduction 2 with 26 rules applied. Total rules applied 338 place count 116 transition count 32907
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 351 place count 103 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 364 place count 103 transition count 143
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 468 place count 51 transition count 91
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 218 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 471 place count 50 transition count 89
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 475 place count 46 transition count 63
Iterating global reduction 3 with 4 rules applied. Total rules applied 479 place count 46 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 483 place count 46 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 483 place count 46 transition count 58
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 485 place count 45 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 489 place count 43 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 493 place count 43 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 515 place count 43 transition count 43
Free-agglomeration rule applied 16 times.
Iterating global reduction 5 with 16 rules applied. Total rules applied 531 place count 43 transition count 27
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 562 place count 27 transition count 12
Ensure Unique test removed 12 places
Iterating post reduction 6 with 12 rules applied. Total rules applied 574 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 575 place count 14 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 577 place count 12 transition count 11
Applied a total of 577 rules in 17448 ms. Remains 12 /295 variables (removed 283) and now considering 11/49445 (removed 49434) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17458 ms. Remains : 12/295 places, 11/49445 transitions.
[2025-06-07 17:56:54] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 12 cols
[2025-06-07 17:56:54] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 562 ms. (1776 steps per ms)
FORMULA ErlangenMainframeV0-PT-1400-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 339 ms. (2941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-07 17:56:55] [INFO ] Flatten gal took : 18 ms
[2025-06-07 17:56:55] [INFO ] Flatten gal took : 3 ms
[2025-06-07 17:56:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12707393837461438281.gal : 5 ms
[2025-06-07 17:56:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16572853491901275461.prop : 1 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/ReachabilityCardinality12707393837461438281.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16572853491901275461.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 33358 ms.

BK_STOP 1749319016215

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="ErlangenMainframeV0-PT-1400"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ErlangenMainframeV0-PT-1400, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-174931349700053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-1400.tgz
mv ErlangenMainframeV0-PT-1400 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;