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.r399-tall-171690530400469.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 Sudoku-COL-AN08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530400469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.3K Apr 12 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 11:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN08-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717033534143

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 01:45:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-30 01:45:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:45:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 01:45:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 01:45:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 482 ms
[2024-05-30 01:45:35] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 4
[2024-05-30 01:45:35] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 01:45:35] [INFO ] Skeletonized 4 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 01:45:35] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[64, 64, 0, 64] Max Struct:[64, 64, 64, 64]
FORMULA Sudoku-COL-AN08-UpperBounds-08 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-11 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-12 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-13 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-15 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-04 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-02 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-10 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-14 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-01 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-06 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-07 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-09 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-00 64 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-30 01:45:35] [INFO ] Invariant cache hit.
[2024-05-30 01:45:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-30 01:45:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-30 01:45:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 01:45:36] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0] Max Struct:[64]
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2024-05-30 01:45:36] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 26 ms.
[2024-05-30 01:45:36] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 01:45:36] [INFO ] Computed 192 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (179 resets) in 416 ms. (23 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 105 ms. (94 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[59] Max Struct:[64]
[2024-05-30 01:45:36] [INFO ] Invariant cache hit.
[2024-05-30 01:45:36] [INFO ] [Real]Absence check using 192 positive place invariants in 63 ms returned sat
[2024-05-30 01:45:37] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-30 01:45:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-30 01:45:37] [INFO ] Added : 0 causal constraints over 0 iterations in 92 ms. Result :sat
Minimization took 633 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[59] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[59] Max Struct:[64]
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 52 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 704/704 places, 512/512 transitions.
[2024-05-30 01:45:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[59] Max Struct:[64]
RANDOM walk for 814847 steps (14654 resets) in 30001 ms. (27 steps per ms)
BEST_FIRST walk for 434379 steps (48 resets) in 5001 ms. (86 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[62] Max Struct:[64]
[2024-05-30 01:46:13] [INFO ] Invariant cache hit.
[2024-05-30 01:46:13] [INFO ] [Real]Absence check using 192 positive place invariants in 71 ms returned sat
[2024-05-30 01:46:13] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-30 01:46:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-30 01:46:13] [INFO ] Added : 0 causal constraints over 0 iterations in 81 ms. Result :sat
Minimization took 3150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[62] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[64] Max Struct:[64]
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 704/704 places, 512/512 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 19 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:46:17] [INFO ] Invariant cache hit.
[2024-05-30 01:46:17] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-30 01:46:17] [INFO ] Invariant cache hit.
[2024-05-30 01:46:18] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2024-05-30 01:46:18] [INFO ] Redundant transitions in 28 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 704/704 places, 512/512 transitions.
[2024-05-30 01:46:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[64] Max Struct:[64]
FORMULA Sudoku-COL-AN08-UpperBounds-05 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-UpperBounds-03 64 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (17983 resets) in 27963 ms. (35 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 7 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 70817 ms.
ITS solved all properties within timeout

BK_STOP 1717033606168

--------------------
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="Sudoku-COL-AN08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-COL-AN08, 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 r399-tall-171690530400469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN08.tgz
mv Sudoku-COL-AN08 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 ;