About the Execution of 2025-gold for CopsAndRobbers-PT-CRL025X003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 443.268 | 46852.00 | 55380.00 | 363.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.r080-tall-177946972500296.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 CopsAndRobbers-PT-CRL025X003, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r080-tall-177946972500296
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.9K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 133K Mar 3 18:30 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 1779559278993
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CopsAndRobbers-PT-CRL025X003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202505121319
[2026-05-23 18:01:20] [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-05-23 18:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 18:01:20] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2026-05-23 18:01:20] [INFO ] Transformed 135 places.
[2026-05-23 18:01:20] [INFO ] Transformed 179 transitions.
[2026-05-23 18:01:20] [INFO ] Parsed PT model containing 135 places and 179 transitions and 834 arcs in 156 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.14497KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 135/135 places, 179/179 transitions.
Computed a total of 4 stabilizing places and 51 stable transitions
Graph (complete) has 810 edges and 135 vertex of which 110 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.5 ms
Discarding 25 places :
Also discarding 0 output transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 110 transition count 178
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 178
Computed a total of 4 stabilizing places and 51 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 177
Computed a total of 4 stabilizing places and 51 stable transitions
Computed a total of 4 stabilizing places and 51 stable transitions
Applied a total of 5 rules in 54 ms. Remains 108 /135 variables (removed 27) and now considering 177/179 (removed 2) transitions.
Running 127 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 108 cols
[2026-05-23 18:01:20] [INFO ] Computed 28 invariants in 17 ms
[2026-05-23 18:01:20] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 186 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 2/108 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 177/285 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 50/186 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 127/313 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/285 variables, and 313 constraints, problems are : Problem set: 0 solved, 127 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40218ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 40233ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 40328 ms. Remains : 108/135 places, 177/179 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1336 ms (no deadlock found). (steps per millisecond=935 )
Random directed walk for 1250000 steps, including 0 resets, run took 1294 ms (no deadlock found). (steps per millisecond=965 )
[2026-05-23 18:02:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2026-05-23 18:02:03] [INFO ] [Real]Absence check using 27 positive place invariants in 6 ms returned sat
[2026-05-23 18:02:03] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-23 18:02:03] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-23 18:02:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2026-05-23 18:02:03] [INFO ] [Nat]Absence check using 27 positive place invariants in 5 ms returned sat
[2026-05-23 18:02:03] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-23 18:02:04] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2026-05-23 18:02:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-23 18:02:04] [INFO ] [Nat]Added 50 Read/Feed constraints in 34 ms returned sat
[2026-05-23 18:02:04] [INFO ] Computed and/alt/rep : 75/225/75 causal constraints (skipped 52 transitions) in 15 ms.
[2026-05-23 18:02:04] [INFO ] Added : 22 causal constraints over 5 iterations in 140 ms. Result :sat
Parikh directed walk for 7200 steps, including 228 resets, run took 23 ms. (steps per millisecond=313 )
Random directed walk for 500000 steps, including 0 resets, run took 519 ms (no deadlock found). (steps per millisecond=963 )
Random walk for 500000 steps, including 0 resets, run took 495 ms (no deadlock found). (steps per millisecond=1010 )
Random directed walk for 500002 steps, including 0 resets, run took 484 ms (no deadlock found). (steps per millisecond=1033 )
Finished random walk after 15 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=15 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 45517 ms.
BK_STOP 1779559325845
--------------------
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="CopsAndRobbers-PT-CRL025X003"
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 CopsAndRobbers-PT-CRL025X003, 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 r080-tall-177946972500296"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-CRL025X003.tgz
mv CopsAndRobbers-PT-CRL025X003 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 '
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 ;
