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

About the Execution of LTSMin+red for Sudoku-COL-AN10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
280.768 20347.00 26707.00 297.70 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 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.r489-tall-167912706300077.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 ltsminxred
Input is Sudoku-COL-AN10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 09:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 09:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 09:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679180918990

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 23:08:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-18 23:08:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:08:40] [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 23:08:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 23:08:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 605 ms
[2023-03-18 23:08:41] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-18 23:08:41] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 23:08:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 23:08:41] [INFO ] Computed 3 place invariants in 6 ms
FORMULA Sudoku-COL-AN10-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN10-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-18 23:08:41] [INFO ] Invariant cache hit.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-18 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-18 23:08:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 23:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 23:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 23:08:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 23:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-18 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 23:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 5 ms.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-18 23:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 23:08:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 23:08:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 23:08:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 23:08:41] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100]
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2023-03-18 23:08:41] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 28 ms.
[2023-03-18 23:08:41] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1706 ms. (steps per millisecond=5 ) properties (out of 6) seen :546
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 6) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 6) seen :24
// Phase 1: matrix 1000 rows 1300 cols
[2023-03-18 23:08:44] [INFO ] Computed 300 place invariants in 22 ms
[2023-03-18 23:08:45] [INFO ] [Real]Absence check using 300 positive place invariants in 225 ms returned sat
[2023-03-18 23:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:45] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2023-03-18 23:08:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:46] [INFO ] [Nat]Absence check using 300 positive place invariants in 172 ms returned sat
[2023-03-18 23:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:46] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-18 23:08:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-18 23:08:46] [INFO ] Added : 0 causal constraints over 0 iterations in 142 ms. Result :sat
Minimization took 209 ms.
[2023-03-18 23:08:47] [INFO ] [Real]Absence check using 300 positive place invariants in 215 ms returned sat
[2023-03-18 23:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:48] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2023-03-18 23:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:48] [INFO ] [Nat]Absence check using 300 positive place invariants in 132 ms returned sat
[2023-03-18 23:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:48] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-18 23:08:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 43 ms.
[2023-03-18 23:08:48] [INFO ] Added : 0 causal constraints over 0 iterations in 140 ms. Result :sat
Minimization took 217 ms.
[2023-03-18 23:08:49] [INFO ] [Real]Absence check using 300 positive place invariants in 225 ms returned sat
[2023-03-18 23:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:50] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-18 23:08:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:50] [INFO ] [Nat]Absence check using 300 positive place invariants in 132 ms returned sat
[2023-03-18 23:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:50] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-18 23:08:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-18 23:08:50] [INFO ] Added : 0 causal constraints over 0 iterations in 138 ms. Result :sat
Minimization took 210 ms.
[2023-03-18 23:08:51] [INFO ] [Real]Absence check using 300 positive place invariants in 214 ms returned sat
[2023-03-18 23:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:52] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-18 23:08:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:52] [INFO ] [Nat]Absence check using 300 positive place invariants in 130 ms returned sat
[2023-03-18 23:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:52] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-18 23:08:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-18 23:08:53] [INFO ] Added : 0 causal constraints over 0 iterations in 133 ms. Result :sat
Minimization took 210 ms.
[2023-03-18 23:08:53] [INFO ] [Real]Absence check using 300 positive place invariants in 221 ms returned sat
[2023-03-18 23:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:54] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-18 23:08:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:54] [INFO ] [Nat]Absence check using 300 positive place invariants in 126 ms returned sat
[2023-03-18 23:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:54] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-18 23:08:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-18 23:08:54] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Minimization took 213 ms.
[2023-03-18 23:08:55] [INFO ] [Real]Absence check using 300 positive place invariants in 215 ms returned sat
[2023-03-18 23:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:56] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-18 23:08:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 23:08:56] [INFO ] [Nat]Absence check using 300 positive place invariants in 127 ms returned sat
[2023-03-18 23:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 23:08:56] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2023-03-18 23:08:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-18 23:08:56] [INFO ] Added : 0 causal constraints over 0 iterations in 126 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100] Max seen :[91, 91, 91, 91, 91, 91]
FORMULA Sudoku-COL-AN10-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN10-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN10-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN10-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN10-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN10-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 18021 ms.
ITS solved all properties within timeout

BK_STOP 1679180939337

--------------------
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 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-AN10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-COL-AN10, 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 r489-tall-167912706300077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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