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.r202-smll-167840348200141.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 marciexred
Input is GPUForwardProgress-PT-36b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348200141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 14:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 11K Feb 25 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 14:17 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 179K 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-36b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-36b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678617923644

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 10:45:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 10:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:45:26] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2023-03-12 10:45:26] [INFO ] Transformed 720 places.
[2023-03-12 10:45:26] [INFO ] Transformed 757 transitions.
[2023-03-12 10:45:26] [INFO ] Found NUPN structural information;
[2023-03-12 10:45:26] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 757 rows 720 cols
[2023-03-12 10:45:27] [INFO ] Computed 38 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 32 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :13
FORMULA GPUForwardProgress-PT-36b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
[2023-03-12 10:45:27] [INFO ] Invariant cache hit.
[2023-03-12 10:45:27] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 44 ms returned sat
[2023-03-12 10:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:45:28] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2023-03-12 10:45:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:45:28] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 43 ms returned sat
[2023-03-12 10:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:45:29] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2023-03-12 10:45:29] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 106 ms.
[2023-03-12 10:45:31] [INFO ] Added : 157 causal constraints over 32 iterations in 2410 ms. Result :sat
Minimization took 252 ms.
[2023-03-12 10:45:32] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 36 ms returned sat
[2023-03-12 10:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:45:32] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-12 10:45:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:45:33] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 50 ms returned sat
[2023-03-12 10:45:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:45:33] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-12 10:45:33] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 97 ms.
[2023-03-12 10:45:36] [INFO ] Added : 185 causal constraints over 37 iterations in 2391 ms. Result :sat
Minimization took 191 ms.
[2023-03-12 10:45:36] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 38 ms returned sat
[2023-03-12 10:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:45:37] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2023-03-12 10:45:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:45:37] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 52 ms returned sat
[2023-03-12 10:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:45:37] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-12 10:45:37] [INFO ] Computed and/alt/rep : 751/1369/751 causal constraints (skipped 5 transitions) in 88 ms.
[2023-03-12 10:45:39] [INFO ] Added : 140 causal constraints over 28 iterations in 1805 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA GPUForwardProgress-PT-36b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-36b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 720 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 720/720 places, 756/756 transitions.
Graph (trivial) has 644 edges and 720 vertex of which 7 / 720 are part of one of the 1 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1083 edges and 714 vertex of which 673 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.6 ms
Discarding 41 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 409 transitions
Trivial Post-agglo rules discarded 409 transitions
Performed 409 trivial Post agglomeration. Transition count delta: 409
Iterating post reduction 0 with 411 rules applied. Total rules applied 413 place count 673 transition count 334
Reduce places removed 409 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 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 446 rules applied. Total rules applied 859 place count 264 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 860 place count 263 transition count 297
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 860 place count 263 transition count 226
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 1002 place count 192 transition count 226
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1041 place count 153 transition count 187
Iterating global reduction 3 with 39 rules applied. Total rules applied 1080 place count 153 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1080 place count 153 transition count 185
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1084 place count 151 transition count 185
Graph (complete) has 293 edges and 151 vertex of which 32 are kept as prefixes of interest. Removing 119 places using SCC suffix rule.1 ms
Discarding 119 places :
Also discarding 118 output transitions
Drop transitions removed 118 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 23 rules applied. Total rules applied 1107 place count 32 transition count 45
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 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 60 rules applied. Total rules applied 1167 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 1168 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 1175 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 1176 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 1177 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 1178 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 1178 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 1180 place count 2 transition count 1
Applied a total of 1180 rules in 150 ms. Remains 2 /720 variables (removed 718) and now considering 1/756 (removed 755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 2/720 places, 1/756 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-12 10:45:40] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 440 ms. (steps per millisecond=2272 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-36b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13982 ms.
ITS solved all properties within timeout

BK_STOP 1678617941458

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-36b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is GPUForwardProgress-PT-36b, 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 r202-smll-167840348200141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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