fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r490-tall-167912708100058
Last Updated
May 14, 2023

About the Execution of Marcie+red for Sudoku-COL-AN08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7066.731 3600000.00 3683406.00 9687.40 ??F?T?T??T??F??F normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.4K Feb 26 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 3.3K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 09:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 08:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 08:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN08-CTLFireability-00
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-01
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-02
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-03
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-04
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-05
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-06
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-07
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-08
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-09
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-10
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-11
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-12
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-13
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-14
FORMULA_NAME Sudoku-COL-AN08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679173990979

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 21:13:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 21:13:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:13:12] [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.
[2023-03-18 21:13:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 21:13:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2023-03-18 21:13:13] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
FORMULA Sudoku-COL-AN08-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:13:13] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 21:13:13] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 11 formulas.
FORMULA Sudoku-COL-AN08-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All 15 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2023-03-18 21:13:13] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 25 ms.
[2023-03-18 21:13:13] [INFO ] Unfolded 11 HLPN properties in 6 ms.
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 21 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2023-03-18 21:13:13] [INFO ] Computed 23 place invariants in 44 ms
[2023-03-18 21:13:14] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-18 21:13:14] [INFO ] Invariant cache hit.
[2023-03-18 21:13:14] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-18 21:13:14] [INFO ] Invariant cache hit.
[2023-03-18 21:13:14] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 192/704 places, 512/512 transitions.
Support contains 192 out of 192 places after structural reductions.
[2023-03-18 21:13:15] [INFO ] Flatten gal took : 319 ms
[2023-03-18 21:13:17] [INFO ] Flatten gal took : 356 ms
[2023-03-18 21:13:20] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 742 ms. (steps per millisecond=13 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2158 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1957 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2101 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2554 ms. (steps per millisecond=3 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:13:30] [INFO ] Invariant cache hit.
[2023-03-18 21:13:33] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
[2023-03-18 21:13:34] [INFO ] Flatten gal took : 235 ms
[2023-03-18 21:13:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-COL-AN08-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:13:36] [INFO ] Flatten gal took : 291 ms
[2023-03-18 21:13:37] [INFO ] Input system was already deterministic with 512 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:37] [INFO ] Flatten gal took : 24 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 29 ms
[2023-03-18 21:13:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 23 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 29 ms
[2023-03-18 21:13:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 22 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 27 ms
[2023-03-18 21:13:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 22 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 27 ms
[2023-03-18 21:13:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 42 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 61 ms
[2023-03-18 21:13:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 18 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 22 ms
[2023-03-18 21:13:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 24 ms
[2023-03-18 21:13:38] [INFO ] Flatten gal took : 31 ms
[2023-03-18 21:13:39] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:39] [INFO ] Flatten gal took : 29 ms
[2023-03-18 21:13:39] [INFO ] Flatten gal took : 42 ms
[2023-03-18 21:13:39] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:39] [INFO ] Flatten gal took : 63 ms
[2023-03-18 21:13:39] [INFO ] Flatten gal took : 98 ms
[2023-03-18 21:13:39] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 192/192 places, 512/512 transitions.
[2023-03-18 21:13:39] [INFO ] Flatten gal took : 27 ms
[2023-03-18 21:13:39] [INFO ] Flatten gal took : 37 ms
[2023-03-18 21:13:40] [INFO ] Input system was already deterministic with 512 transitions.
[2023-03-18 21:13:40] [INFO ] Flatten gal took : 277 ms
[2023-03-18 21:13:42] [INFO ] Flatten gal took : 270 ms
[2023-03-18 21:13:44] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 84 ms.
[2023-03-18 21:13:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 192 places, 512 transitions and 1536 arcs took 2 ms.
Total runtime 31601 ms.
There are residual formulas that ITS could not solve within timeout
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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 192 NrTr: 512 NrArc: 1536)

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

net check time: 0m 0.000sec

init dd package: 0m 3.028sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9058276 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16077844 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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.002sec

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="CTLFireability"
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-COL-AN08, examination is CTLFireability"
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-167912708100058"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;