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.r266-tall-174931350100126.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 CopsAndRobbers-PT-HRL014X002, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-tall-174931350100126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 6 09:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 6 11:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Jun 6 11:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 15K Jun 6 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 6 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Jun 6 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Jun 6 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 137K 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 booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1749319144140

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CopsAndRobbers-PT-HRL014X002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-07 17:59:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-07 17:59:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:59:05] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-07 17:59:05] [INFO ] Transformed 80 places.
[2025-06-07 17:59:05] [INFO ] Transformed 158 transitions.
[2025-06-07 17:59:05] [INFO ] Parsed PT model containing 80 places and 158 transitions and 807 arcs in 154 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.19165KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 80/80 places, 158/158 transitions.
Computed a total of 4 stabilizing places and 29 stable transitions
Graph (complete) has 570 edges and 80 vertex of which 66 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 0 output transitions
Computed a total of 4 stabilizing places and 29 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 65 transition count 157
Computed a total of 4 stabilizing places and 29 stable transitions
Computed a total of 4 stabilizing places and 29 stable transitions
Applied a total of 3 rules in 82 ms. Remains 65 /80 variables (removed 15) and now considering 157/158 (removed 1) transitions.
Running 129 sub problems to find dead transitions.
// Phase 1: matrix 157 rows 65 cols
[2025-06-07 17:59:05] [INFO ] Computed 17 invariants in 14 ms
[2025-06-07 17:59:05] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/17 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 157/222 variables, 65/82 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 42/124 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/124 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/124 constraints. Problems are: Problem set: 28 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 124 constraints, problems are : Problem set: 28 solved, 101 unsolved in 2553 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 14/14 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/15 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/17 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 157/222 variables, 65/82 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 42/124 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 101/225 constraints. Problems are: Problem set: 28 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/225 constraints. Problems are: Problem set: 28 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 222/222 variables, and 225 constraints, problems are : Problem set: 28 solved, 101 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 101/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 22882ms problems are : Problem set: 28 solved, 101 unsolved
Search for dead transitions found 28 dead transitions in 22913ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 28 transitions.
Starting structural reductions in DEADLOCK mode, iteration 1 : 65/80 places, 129/158 transitions.
Computed a total of 4 stabilizing places and 29 stable transitions
Computed a total of 4 stabilizing places and 29 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 65 transition count 128
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 2 place count 64 transition count 128
Computed a total of 4 stabilizing places and 29 stable transitions
Computed a total of 4 stabilizing places and 29 stable transitions
Applied a total of 2 rules in 21 ms. Remains 64 /65 variables (removed 1) and now considering 128/129 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 23087 ms. Remains : 64/80 places, 128/158 transitions.
Finished random walk after 8 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=8 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 23319 ms.
ITS solved all properties within timeout

BK_STOP 1749319168779

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CopsAndRobbers-PT-HRL014X002"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is CopsAndRobbers-PT-HRL014X002, 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 r266-tall-174931350100126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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