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-174931349600019.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 Champagne-PT-H10T0R, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349600019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 7.4K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 11:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 18K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 380K 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 Champagne-PT-H10T0R-UpperBounds-00
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-01
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-02
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-03
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-04
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-05
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-06
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-07
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-08
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-09
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-10
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-11
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-12
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-13
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-14
FORMULA_NAME Champagne-PT-H10T0R-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318798210

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H10T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:53:19] [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:53:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:19] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2025-06-07 17:53:19] [INFO ] Transformed 1259 places.
[2025-06-07 17:53:19] [INFO ] Transformed 2192 transitions.
[2025-06-07 17:53:19] [INFO ] Found NUPN structural information;
[2025-06-07 17:53:19] [INFO ] Parsed PT model containing 1259 places and 2192 transitions and 6374 arcs in 247 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 2192 rows 1259 cols
[2025-06-07 17:53:20] [INFO ] Computed 63 invariants in 40 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 (10 resets) in 78 ms. (126 steps per ms)
FORMULA Champagne-PT-H10T0R-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H10T0R-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-07 17:53:20] [INFO ] Invariant cache hit.
[2025-06-07 17:53:20] [INFO ] [Real]Absence check using 63 positive place invariants in 49 ms returned sat
[2025-06-07 17:53:21] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2025-06-07 17:53:21] [INFO ] Deduced a trap composed of 122 places in 370 ms of which 41 ms to minimize.
[2025-06-07 17:53:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:22] [INFO ] [Nat]Absence check using 63 positive place invariants in 31 ms returned sat
[2025-06-07 17:53:22] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-06-07 17:53:23] [INFO ] Deduced a trap composed of 122 places in 348 ms of which 5 ms to minimize.
[2025-06-07 17:53:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2025-06-07 17:53:23] [INFO ] Computed and/alt/rep : 2046/7725/2046 causal constraints (skipped 145 transitions) in 133 ms.
Maximisation of solution failed !
Minimization took 2 ms.
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 1259 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1072) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 2191/2191 transitions.
Graph (trivial) has 1225 edges and 1259 vertex of which 114 / 1259 are part of one of the 16 SCC in 14 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 529 rules applied. Total rules applied 530 place count 1161 transition count 1532
Reduce places removed 529 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 649 rules applied. Total rules applied 1179 place count 632 transition count 1412
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 2 with 60 rules applied. Total rules applied 1239 place count 572 transition count 1412
Discarding 221 places :
Symmetric choice reduction at 3 with 221 rule applications. Total rules 1460 place count 351 transition count 1191
Iterating global reduction 3 with 221 rules applied. Total rules applied 1681 place count 351 transition count 1191
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 1681 place count 351 transition count 1129
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 1805 place count 289 transition count 1129
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1854 place count 240 transition count 678
Iterating global reduction 3 with 49 rules applied. Total rules applied 1903 place count 240 transition count 678
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 3 with 49 rules applied. Total rules applied 1952 place count 240 transition count 629
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 2076 place count 178 transition count 567
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2080 place count 176 transition count 573
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 2084 place count 176 transition count 569
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 2090 place count 176 transition count 563
Free-agglomeration rule applied 108 times.
Iterating global reduction 5 with 108 rules applied. Total rules applied 2198 place count 176 transition count 455
Reduce places removed 108 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 444 transitions
Reduce isomorphic transitions removed 444 transitions.
Graph (complete) has 201 edges and 68 vertex of which 7 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 5 with 553 rules applied. Total rules applied 2751 place count 7 transition count 7
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2752 place count 7 transition count 6
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2754 place count 5 transition count 4
Iterating global reduction 7 with 2 rules applied. Total rules applied 2756 place count 5 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 2757 place count 5 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2758 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2759 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2760 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2760 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2762 place count 2 transition count 1
Applied a total of 2762 rules in 281 ms. Remains 2 /1259 variables (removed 1257) and now considering 1/2191 (removed 2190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 2/1259 places, 1/2191 transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-07 17:53:27] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (500000 resets) in 319 ms. (3125 steps per ms)
FORMULA Champagne-PT-H10T0R-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (500000 resets) in 153 ms. (6493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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:53:28] [INFO ] Flatten gal took : 117 ms
[2025-06-07 17:53:28] [INFO ] Flatten gal took : 4 ms
[2025-06-07 17:53:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9693461331262022218.gal : 2 ms
[2025-06-07 17:53:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10895293692718984933.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9693461331262022218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10895293692718984933.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 8441 ms.

BK_STOP 1749318808099

--------------------
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="Champagne-PT-H10T0R"
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 Champagne-PT-H10T0R, 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-174931349600019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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