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-171690531000726.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-PT-BN16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531000726
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 95M
-rw-r--r-- 1 mcc users 1.7M Apr 12 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Apr 12 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Apr 12 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 717K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 903K Apr 12 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4M Apr 12 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Apr 12 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.7M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-PT-BN16-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717087937533

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 16:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 16:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:52:19] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-05-30 16:52:19] [INFO ] Transformed 5120 places.
[2024-05-30 16:52:19] [INFO ] Transformed 4096 transitions.
[2024-05-30 16:52:19] [INFO ] Found NUPN structural information;
[2024-05-30 16:52:19] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 123 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (188 resets) in 17767 ms. (2 steps per ms) remains 4/13 properties
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2047 ms. (19 steps per ms) remains 4/4 properties
BEST_FIRST walk for 24396 steps (4 resets) in 21369 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 779 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1384 ms. (28 steps per ms) remains 4/4 properties
// Phase 1: matrix 4096 rows 5120 cols
[2024-05-30 16:52:30] [INFO ] Computed 1024 invariants in 68 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5120 variables, 5120/5120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem Sudoku-PT-BN16-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem Sudoku-PT-BN16-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/9216 variables, and 6144 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4279 ms.
Refiners :[Domain max(s): 5120/5120 constraints, Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 0/5120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1286/1315 variables, 98/127 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1315 variables, 1286/1413 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1315 variables, 0/1413 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3771/5086 variables, 895/2308 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5086 variables, 3771/6079 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5086 variables, 0/6079 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 34/5120 variables, 31/6110 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5120 variables, 34/6144 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5120 variables, 0/6144 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 9216/9216 variables, and 11264 constraints, problems are : Problem set: 2 solved, 2 unsolved in 5037 ms.
Refiners :[Domain max(s): 5120/5120 constraints, Positive P Invariants (semi-flows): 1024/1024 constraints, State Equation: 5120/5120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 13389ms problems are : Problem set: 2 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 298 are kept as prefixes of interest. Removing 4822 places using SCC suffix rule.10 ms
Discarding 4822 places :
Also discarding 1384 output transitions
Drop transitions (Output transitions of discarded places.) removed 1384 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2609 transitions
Reduce isomorphic transitions removed 2609 transitions.
Iterating post reduction 0 with 2609 rules applied. Total rules applied 2610 place count 298 transition count 103
Ensure Unique test removed 128 places
Iterating post reduction 1 with 128 rules applied. Total rules applied 2738 place count 170 transition count 103
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 2761 place count 147 transition count 80
Ensure Unique test removed 2 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 2786 place count 145 transition count 80
Applied a total of 2786 rules in 69 ms. Remains 145 /5120 variables (removed 4975) and now considering 80/4096 (removed 4016) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 145/5120 places, 80/4096 transitions.
RANDOM walk for 2286 steps (87 resets) in 110 ms. (20 steps per ms) remains 0/2 properties
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-BN16-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 25738 ms.
ITS solved all properties within timeout

BK_STOP 1717087964462

--------------------
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 ReachabilityCardinality -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-PT-BN16"
export BK_EXAMINATION="ReachabilityCardinality"
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-PT-BN16, examination is ReachabilityCardinality"
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-171690531000726"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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