Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372700391.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is NoC3x3-PT-5B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372700391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K May 18 16:43 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

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

=== Now, execution of the tool begins

BK_START 1716691822931

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-26 02:50:24] [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]
[2024-05-26 02:50:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:50:24] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-26 02:50:24] [INFO ] Transformed 1571 places.
[2024-05-26 02:50:24] [INFO ] Transformed 2173 transitions.
[2024-05-26 02:50:24] [INFO ] Found NUPN structural information;
[2024-05-26 02:50:24] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2173 rows 1571 cols
[2024-05-26 02:50:24] [INFO ] Computed 66 invariants in 39 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :13
FORMULA NoC3x3-PT-5B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
[2024-05-26 02:50:25] [INFO ] Invariant cache hit.
[2024-05-26 02:50:25] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2024-05-26 02:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:50:26] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2024-05-26 02:50:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:50:26] [INFO ] [Nat]Absence check using 66 positive place invariants in 53 ms returned sat
[2024-05-26 02:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:50:27] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2024-05-26 02:50:28] [INFO ] Deduced a trap composed of 70 places in 650 ms of which 7 ms to minimize.
[2024-05-26 02:50:28] [INFO ] Deduced a trap composed of 41 places in 573 ms of which 1 ms to minimize.
[2024-05-26 02:50:29] [INFO ] Deduced a trap composed of 26 places in 474 ms of which 2 ms to minimize.
[2024-05-26 02:50:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1997 ms
[2024-05-26 02:50:29] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 113 ms.
[2024-05-26 02:50:31] [INFO ] Added : 35 causal constraints over 7 iterations in 1948 ms. Result :unknown
[2024-05-26 02:50:31] [INFO ] [Real]Absence check using 66 positive place invariants in 42 ms returned sat
[2024-05-26 02:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:50:32] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2024-05-26 02:50:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:50:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 43 ms returned sat
[2024-05-26 02:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:50:37] [INFO ] [Nat]Absence check using state equation in 4764 ms returned unknown
[2024-05-26 02:50:37] [INFO ] [Real]Absence check using 66 positive place invariants in 40 ms returned sat
[2024-05-26 02:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 02:50:38] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-05-26 02:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 02:50:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 43 ms returned sat
[2024-05-26 02:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 02:50:43] [INFO ] [Nat]Absence check using state equation in 4745 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA NoC3x3-PT-5B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1571 transition count 1837
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 1235 transition count 1837
Discarding 273 places :
Symmetric choice reduction at 2 with 273 rule applications. Total rules 945 place count 962 transition count 1564
Iterating global reduction 2 with 273 rules applied. Total rules applied 1218 place count 962 transition count 1564
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 1218 place count 962 transition count 1530
Deduced a syphon composed of 34 places in 4 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 1286 place count 928 transition count 1530
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 1396 place count 818 transition count 1332
Iterating global reduction 2 with 110 rules applied. Total rules applied 1506 place count 818 transition count 1332
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 1561 place count 763 transition count 1219
Iterating global reduction 2 with 55 rules applied. Total rules applied 1616 place count 763 transition count 1219
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 1640 place count 739 transition count 1171
Iterating global reduction 2 with 24 rules applied. Total rules applied 1664 place count 739 transition count 1171
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1671 place count 732 transition count 1157
Iterating global reduction 2 with 7 rules applied. Total rules applied 1678 place count 732 transition count 1157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1682 place count 728 transition count 1149
Iterating global reduction 2 with 4 rules applied. Total rules applied 1686 place count 728 transition count 1149
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1690 place count 724 transition count 1137
Iterating global reduction 2 with 4 rules applied. Total rules applied 1694 place count 724 transition count 1137
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 2034 place count 554 transition count 967
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2038 place count 554 transition count 963
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2240 place count 453 transition count 989
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2254 place count 453 transition count 975
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 2326 place count 417 transition count 983
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 2388 place count 417 transition count 921
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2397 place count 408 transition count 921
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 2397 place count 408 transition count 916
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2407 place count 403 transition count 916
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 2443 place count 385 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2445 place count 384 transition count 898
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 2450 place count 384 transition count 898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2451 place count 383 transition count 897
Applied a total of 2451 rules in 526 ms. Remains 383 /1571 variables (removed 1188) and now considering 897/2173 (removed 1276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 527 ms. Remains : 383/1571 places, 897/2173 transitions.
// Phase 1: matrix 897 rows 383 cols
[2024-05-26 02:50:44] [INFO ] Computed 57 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 4934 resets, run finished after 3648 ms. (steps per millisecond=274 ) properties (out of 2) seen :2
FORMULA NoC3x3-PT-5B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23261 ms.

BK_STOP 1716691849088

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="NoC3x3-PT-5B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is NoC3x3-PT-5B, 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 r263-tall-171654372700391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5B.tgz
mv NoC3x3-PT-5B 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;