fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r368-tall-178024404800126
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for SupplyChain-PT-00100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
374.855 22373.00 34304.00 283.80 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/mcc2026-input.r368-tall-178024404800126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is SupplyChain-PT-00100, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r368-tall-178024404800126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 852K
-rw-r--r-- 1 mcc users 7.4K May 27 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 27 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 27 10:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 27 10:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 27 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 27 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 27 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 405K May 26 18:17 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 1780307454729

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SupplyChain-PT-00100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2026-06-01 09:50:55] [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]
[2026-06-01 09:50:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 09:50:56] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-06-01 09:50:56] [INFO ] Transformed 1304 places.
[2026-06-01 09:50:56] [INFO ] Transformed 803 transitions.
[2026-06-01 09:50:56] [INFO ] Parsed PT model containing 1304 places and 803 transitions and 3606 arcs in 202 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 6 ms.18192KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1304/1304 places, 803/803 transitions.
Computed a total of 1304 stabilizing places and 802 stable transitions
Ensure Unique test removed 390 places
Computed a total of 914 stabilizing places and 802 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 470 rules applied. Total rules applied 470 place count 914 transition count 723
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Computed a total of 834 stabilizing places and 642 stable transitions
Iterating post reduction 1 with 160 rules applied. Total rules applied 630 place count 834 transition count 643
Computed a total of 834 stabilizing places and 642 stable transitions
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 630 place count 834 transition count 543
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 100 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 930 place count 634 transition count 543
Computed a total of 634 stabilizing places and 542 stable transitions
Computed a total of 634 stabilizing places and 542 stable transitions
Reduce places removed 100 places and 100 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 1030 place count 534 transition count 443
Computed a total of 534 stabilizing places and 442 stable transitions
Computed a total of 534 stabilizing places and 442 stable transitions
Applied a total of 1030 rules in 223 ms. Remains 534 /1304 variables (removed 770) and now considering 443/803 (removed 360) transitions.
Running 243 sub problems to find dead transitions.
// Phase 1: matrix 443 rows 534 cols
[2026-06-01 09:50:56] [INFO ] Computed 202 invariants in 12 ms
[2026-06-01 09:50:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 102/102 constraints. Problems are: Problem set: 10 solved, 233 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:50:58] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 7 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:50:58] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 4 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 2/104 constraints. Problems are: Problem set: 20 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 0/104 constraints. Problems are: Problem set: 20 solved, 223 unsolved
At refinement iteration 3 (OVERLAPS) 100/534 variables, 100/204 constraints. Problems are: Problem set: 20 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/204 constraints. Problems are: Problem set: 20 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 442/976 variables, 534/738 constraints. Problems are: Problem set: 20 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/976 variables, 0/738 constraints. Problems are: Problem set: 20 solved, 223 unsolved
SMT process timed out in 20190ms, After SMT, problems are : Problem set: 20 solved, 223 unsolved
Search for dead transitions found 20 dead transitions in 20212ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 534/1304 places, 423/803 transitions.
Computed a total of 534 stabilizing places and 422 stable transitions
Graph (complete) has 834 edges and 534 vertex of which 504 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 0 output transitions
Computed a total of 504 stabilizing places and 422 stable transitions
Computed a total of 504 stabilizing places and 422 stable transitions
Applied a total of 1 rules in 31 ms. Remains 504 /534 variables (removed 30) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 20510 ms. Remains : 504/1304 places, 423/803 transitions.
Finished random walk after 167 steps, including 0 resets, run found a deadlock after 6 ms. (steps per millisecond=27 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 20795 ms.

BK_STOP 1780307477102

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="SupplyChain-PT-00100"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is SupplyChain-PT-00100, 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 r368-tall-178024404800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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