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.r188-tall-171640616500332.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 greatspnxred
Input is GPUForwardProgress-PT-20a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-tall-171640616500332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 11 22:44 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 32K 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 booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716474088233

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=GPUForwardProgress-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 14:21:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-23 14:21:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:21:29] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-23 14:21:29] [INFO ] Transformed 88 places.
[2024-05-23 14:21:29] [INFO ] Transformed 109 transitions.
[2024-05-23 14:21:29] [INFO ] Found NUPN structural information;
[2024-05-23 14:21:29] [INFO ] Parsed PT model containing 88 places and 109 transitions and 421 arcs in 175 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 88/88 places, 109/109 transitions.
Ensure Unique test removed 1 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 87 transition count 87
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 23 place count 87 transition count 67
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 63 place count 67 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 66 transition count 66
Applied a total of 65 rules in 40 ms. Remains 66 /88 variables (removed 22) and now considering 66/109 (removed 43) transitions.
// Phase 1: matrix 66 rows 66 cols
[2024-05-23 14:21:29] [INFO ] Computed 21 invariants in 7 ms
[2024-05-23 14:21:30] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-23 14:21:30] [INFO ] Invariant cache hit.
[2024-05-23 14:21:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 14:21:30] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-23 14:21:30] [INFO ] Invariant cache hit.
[2024-05-23 14:21:30] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 65/130 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/132 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/132 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 194 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2451 ms.
Refiners :[Domain max(s): 66/66 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 66/66 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 65/130 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 65/256 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 1/132 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 259 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2940 ms.
Refiners :[Domain max(s): 66/66 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 66/66 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 5498ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5515ms
Starting structural reductions in LIVENESS mode, iteration 1 : 66/88 places, 66/109 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 6117 ms. Remains : 66/88 places, 66/109 transitions.
Discarding 22 transitions out of 66. Remains 44
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (317 resets) in 1495 ms. (26 steps per ms) remains 1/43 properties
BEST_FIRST walk for 40004 steps (526 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
[2024-05-23 14:21:36] [INFO ] Invariant cache hit.
[2024-05-23 14:21:36] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 42/63 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 42/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/130 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/131 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/132 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/132 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/132 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Domain max(s): 66/66 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 66/66 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 42/63 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 42/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/65 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/130 variables, 65/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 40/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/131 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/131 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/132 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/132 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/132 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Domain max(s): 66/66 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 66/66 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 151 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 13 ms.
Able to resolve query QuasiLiveness after proving 44 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 7148 ms.
ITS solved all properties within timeout

BK_STOP 1716474096614

--------------------
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 QuasiLiveness -timeout 180 -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-20a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is GPUForwardProgress-PT-20a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-tall-171640616500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-20a.tgz
mv GPUForwardProgress-PT-20a execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;