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.r496-tall-171640603600509.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 ltsminxred
Input is GPUForwardProgress-PT-12b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603600509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 65K May 18 16:42 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-12b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-12b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717197741984

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:22:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:22:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:22:23] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-31 23:22:23] [INFO ] Transformed 264 places.
[2024-05-31 23:22:23] [INFO ] Transformed 277 transitions.
[2024-05-31 23:22:23] [INFO ] Found NUPN structural information;
[2024-05-31 23:22:23] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 177 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 277 rows 264 cols
[2024-05-31 23:22:23] [INFO ] Computed 14 invariants in 27 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 (90 resets) in 37 ms. (263 steps per ms)
FORMULA GPUForwardProgress-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (23 resets) in 19 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:22:23] [INFO ] Invariant cache hit.
[2024-05-31 23:22:23] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 10 ms returned sat
[2024-05-31 23:22:23] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-31 23:22:23] [INFO ] Computed and/alt/rep : 271/481/271 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-31 23:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:22:24] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-31 23:22:24] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-31 23:22:24] [INFO ] Computed and/alt/rep : 271/481/271 causal constraints (skipped 5 transitions) in 27 ms.
[2024-05-31 23:22:24] [INFO ] Added : 165 causal constraints over 33 iterations in 647 ms. Result :sat
Minimization took 216 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:[1] Max Struct:[1]
Support contains 1 out of 264 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p53) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 276/276 transitions.
Graph (trivial) has 238 edges and 264 vertex of which 7 / 264 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 388 edges and 258 vertex of which 242 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 149 rules applied. Total rules applied 151 place count 242 transition count 117
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 312 place count 95 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 94 transition count 103
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 313 place count 94 transition count 79
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 361 place count 70 transition count 79
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 375 place count 56 transition count 65
Iterating global reduction 3 with 14 rules applied. Total rules applied 389 place count 56 transition count 65
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 389 place count 56 transition count 63
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 393 place count 54 transition count 63
Graph (complete) has 101 edges and 54 vertex of which 19 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 404 place count 19 transition count 19
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 426 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 5 with 7 rules applied. Total rules applied 433 place count 5 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 434 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 436 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 436 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 7 with 2 rules applied. Total rules applied 438 place count 2 transition count 1
Applied a total of 438 rules in 78 ms. Remains 2 /264 variables (removed 262) and now considering 1/276 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2/264 places, 1/276 transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-31 23:22:25] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA GPUForwardProgress-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 267 ms. (3731 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 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 2380 ms.
ITS solved all properties within timeout

BK_STOP 1717197745540

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -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="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-12b, 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 r496-tall-171640603600509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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