Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r223-smll-167840362200016.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is GPUForwardProgress-PT-32b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-167840362200016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 160K Mar 5 18:22 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 GPUForwardProgress-PT-32b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-32b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678578472755

Running Version 202205111006
[2023-03-11 23:47:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 23:47:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:47:55] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2023-03-11 23:47:55] [INFO ] Transformed 644 places.
[2023-03-11 23:47:55] [INFO ] Transformed 677 transitions.
[2023-03-11 23:47:55] [INFO ] Found NUPN structural information;
[2023-03-11 23:47:55] [INFO ] Parsed PT model containing 644 places and 677 transitions in 395 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 677 rows 644 cols
[2023-03-11 23:47:55] [INFO ] Computed 34 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 36 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :12
FORMULA GPUForwardProgress-PT-32b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :1
FORMULA GPUForwardProgress-PT-32b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
// Phase 1: matrix 677 rows 644 cols
[2023-03-11 23:47:55] [INFO ] Computed 34 place invariants in 8 ms
[2023-03-11 23:47:56] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 41 ms returned sat
[2023-03-11 23:47:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:47:56] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2023-03-11 23:47:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:47:56] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 23:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:47:57] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-11 23:47:57] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 84 ms.
[2023-03-11 23:47:59] [INFO ] Added : 214 causal constraints over 44 iterations in 2609 ms. Result :sat
Minimization took 160 ms.
[2023-03-11 23:48:00] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 35 ms returned sat
[2023-03-11 23:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:48:00] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-11 23:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:48:00] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 37 ms returned sat
[2023-03-11 23:48:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:48:01] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-11 23:48:01] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 72 ms.
[2023-03-11 23:48:03] [INFO ] Added : 190 causal constraints over 38 iterations in 1954 ms. Result :sat
Minimization took 147 ms.
[2023-03-11 23:48:03] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 33 ms returned sat
[2023-03-11 23:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:48:04] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-11 23:48:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:48:04] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 34 ms returned sat
[2023-03-11 23:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:48:04] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-11 23:48:04] [INFO ] Computed and/alt/rep : 671/1221/671 causal constraints (skipped 5 transitions) in 58 ms.
[2023-03-11 23:48:06] [INFO ] Added : 188 causal constraints over 38 iterations in 1983 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA GPUForwardProgress-PT-32b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-32b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 644 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 644/644 places, 676/676 transitions.
Graph (trivial) has 576 edges and 644 vertex of which 7 / 644 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 967 edges and 638 vertex of which 601 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.5 ms
Discarding 37 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 365 transitions
Trivial Post-agglo rules discarded 365 transitions
Performed 365 trivial Post agglomeration. Transition count delta: 365
Iterating post reduction 0 with 367 rules applied. Total rules applied 369 place count 601 transition count 298
Reduce places removed 365 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 398 rules applied. Total rules applied 767 place count 236 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 768 place count 235 transition count 265
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 768 place count 235 transition count 202
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 894 place count 172 transition count 202
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 929 place count 137 transition count 167
Iterating global reduction 3 with 35 rules applied. Total rules applied 964 place count 137 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 964 place count 137 transition count 165
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 968 place count 135 transition count 165
Graph (complete) has 261 edges and 135 vertex of which 28 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.1 ms
Discarding 107 places :
Also discarding 106 output transitions
Drop transitions removed 106 transitions
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 19 rules applied. Total rules applied 987 place count 28 transition count 41
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 52 rules applied. Total rules applied 1039 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1040 place count 9 transition count 7
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 1047 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1048 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1049 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1050 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1050 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 8 with 2 rules applied. Total rules applied 1052 place count 2 transition count 1
Applied a total of 1052 rules in 106 ms. Remains 2 /644 variables (removed 642) and now considering 1/676 (removed 675) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/644 places, 1/676 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-11 23:48:07] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 362 ms. (steps per millisecond=2762 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-32b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12973 ms.

BK_STOP 1678578487820

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is GPUForwardProgress-PT-32b, 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 r223-smll-167840362200016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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