Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025500015.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025500015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Mar 7 18:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 18:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 26K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779942832200

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:33:53] [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]
[2026-05-28 04:33:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:33:53] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2026-05-28 04:33:53] [INFO ] Transformed 108 places.
[2026-05-28 04:33:53] [INFO ] Transformed 100 transitions.
[2026-05-28 04:33:53] [INFO ] Found NUPN structural information;
[2026-05-28 04:33:53] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
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 100 rows 108 cols
[2026-05-28 04:33:54] [INFO ] Computed 9 invariants in 8 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 (165 resets) in 23 ms. (416 steps per ms)
FORMULA MedleyA-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (124 resets) in 38 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-28 04:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-28 04:33:54] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 9 ms.
[2026-05-28 04:33:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-28 04:33:54] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:55] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 4 ms to minimize.
[2026-05-28 04:33:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2026-05-28 04:33:55] [INFO ] Added : 94 causal constraints over 19 iterations in 448 ms. Result :sat
Minimization took 43 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-28 04:33:55] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-28 04:33:55] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 8 ms.
[2026-05-28 04:33:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2026-05-28 04:33:56] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-28 04:33:56] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:56] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:56] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:33:56] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 6 ms to minimize.
[2026-05-28 04:33:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 401 ms
[2026-05-28 04:33:56] [INFO ] Added : 84 causal constraints over 17 iterations in 787 ms. Result :sat
Minimization took 41 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:56] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-28 04:33:57] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 11 ms.
[2026-05-28 04:33:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:33:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2026-05-28 04:33:57] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2026-05-28 04:33:57] [INFO ] Computed and/alt/rep : 97/162/97 causal constraints (skipped 2 transitions) in 7 ms.
[2026-05-28 04:33:57] [INFO ] Added : 88 causal constraints over 18 iterations in 258 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA MedleyA-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 108 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p90) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 99/99 transitions.
Graph (complete) has 183 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 107 transition count 75
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 83 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 49 place count 83 transition count 69
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 61 place count 77 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 70 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 70 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 75 place count 70 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 69 transition count 61
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 119 place count 48 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 48 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 47 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 46 transition count 38
Applied a total of 122 rules in 39 ms. Remains 46 /108 variables (removed 62) and now considering 38/99 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 46/108 places, 38/99 transitions.
// Phase 1: matrix 38 rows 46 cols
[2026-05-28 04:33:58] [INFO ] Computed 9 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA MedleyA-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (58213 resets) in 743 ms. (1344 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 )
[2026-05-28 04:33:59] [INFO ] Flatten gal took : 37 ms
[2026-05-28 04:33:59] [INFO ] Flatten gal took : 7 ms
[2026-05-28 04:33:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5727493779038253992.gal : 6 ms
[2026-05-28 04:33:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1767267292693868785.prop : 0 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5727493779038253992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1767267292693868785.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 5473 ms.

BK_STOP 1779942839209

--------------------
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
++ 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 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="MedleyA-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is MedleyA-PT-03, 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 r191-oct2-177969025500015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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