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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 806K Feb 26 09:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 09:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 08:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 399K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 934K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21M Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 49K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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-AN13-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-AN13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679224073134

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 11:07:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 11:07:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:07:54] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-19 11:07:55] [INFO ] Transformed 2704 places.
[2023-03-19 11:07:55] [INFO ] Transformed 2197 transitions.
[2023-03-19 11:07:55] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 636 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2997 ms. (steps per millisecond=3 ) properties (out of 16) seen :6
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=9 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2589 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :1
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-19 11:08:03] [INFO ] Computed 507 place invariants in 47 ms
[2023-03-19 11:08:07] [INFO ] [Real]Absence check using 507 positive place invariants in 151 ms returned sat
[2023-03-19 11:08:07] [INFO ] After 1270ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-19 11:08:08] [INFO ] [Nat]Absence check using 507 positive place invariants in 127 ms returned sat
[2023-03-19 11:08:20] [INFO ] After 11982ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2023-03-19 11:08:21] [INFO ] After 12306ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-03-19 11:08:21] [INFO ] After 13921ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 3 different solutions.
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 40 ms.
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1419 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217295 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217295 steps, saw 215195 distinct states, run finished after 3005 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 11:08:26] [INFO ] Computed 38 place invariants in 181 ms
[2023-03-19 11:08:26] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 29 ms returned sat
[2023-03-19 11:08:27] [INFO ] After 798ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:08:27] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 37 ms returned sat
[2023-03-19 11:08:28] [INFO ] After 630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:08:28] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-19 11:08:28] [INFO ] After 957ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 160 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=20 )
FORMULA Sudoku-PT-AN13-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 34000 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Sudoku_PT_AN13
(NrP: 2704 NrTr: 2197 NrArc: 8788)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.598sec

net check time: 0m 0.001sec

init dd package: 0m 2.765sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6214660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16032336 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.005sec

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-AN13"
export BK_EXAMINATION="ReachabilityCardinality"
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 Sudoku-PT-AN13, 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 r490-tall-167912708400262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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