fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r255-tall-165303541900060
Last Updated
Jun 22, 2022

About the Execution of Tapaal for Sudoku-COL-AN03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
503.371 147103.00 296894.00 345.40 FTTTFFTTTTTFTFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r255-tall-165303541900060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool tapaal
Input is Sudoku-COL-AN03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-165303541900060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 11K Apr 30 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 30 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 30 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.4K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 model.pnml
-rw-r--r-- 1 mcc users 1.6K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:10 UpperBounds.xml

--------------------
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-AN03-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653216427773

tapaal
Got BK_BIN_PATH=/home/mcc/BenchKit/bin/
---> tapaal --- TAPAAL v5
Setting MODEL_PATH=.
Setting VERIFYPN=/home/mcc/BenchKit/bin/verifypn
Got BK_TIME_CONFINEMENT=3600
Setting TEMPDIR=/home/mcc/BenchKit/bin/tmp
Got BK_MEMORY_CONFINEMENT=16384
Limiting to 16265216 kB
Total timeout: 3590
Time left: 3590

*************************************
* TAPAAL verifying LTLFireability *
*************************************
TEMPDIR=/home/mcc/BenchKit/bin/tmp
QF=/home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu
MF=/home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV
Time left: 3590
---------------------------------------------------
Step -1: Stripping Colors
---------------------------------------------------
Verifying stripped models (16 in total)
/home/mcc/BenchKit/bin/verifypn -n -c -q 718 -ltl -l 29 -d 299 -z 4 -x 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 ./model.pnml ./LTLFireability.xml
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-15
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-14
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-13
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-12
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-11
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-10
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-09
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-08
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-07
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-06
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-05
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-04
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-03
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-02
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-01
Warning: CPN OverApproximation is only available for Reachability queries without deadlock, negated fireability and UpperBounds, skipping Sudoku-COL-AN03-LTLFireability-00
WARNING: Could not run CPN over-approximation on any queries, terminating.
Time left: 3590
---------------------------------------------------
Step 0: Parallel Simplification
---------------------------------------------------
Doing parallel simplification (16 in total)
Total simplification timout is 718 -- reduction timeout is 299
timeout 1017 /home/mcc/BenchKit/bin/verifypn -n -ltl -q 718 -l 29 -d 299 -z 4 -s OverApprox --binary-query-io 2 --write-simplified /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --write-reduced /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV -x 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 ./model.pnml ./LTLFireability.xml
FORMULA Sudoku-COL-AN03-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING STRUCTURAL_REDUCTION QUERY_REDUCTION SAT_SMT LP_APPROX UNFOLDING_TO_PT
Query index 0 was solved

Query is NOT satisfied.

FORMULA Sudoku-COL-AN03-LTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING STRUCTURAL_REDUCTION QUERY_REDUCTION SAT_SMT LP_APPROX UNFOLDING_TO_PT
Query index 1 was solved

Query is satisfied.

FORMULA Sudoku-COL-AN03-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING STRUCTURAL_REDUCTION QUERY_REDUCTION SAT_SMT LP_APPROX UNFOLDING_TO_PT
Query index 3 was solved

Query is satisfied.

FORMULA Sudoku-COL-AN03-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING STRUCTURAL_REDUCTION QUERY_REDUCTION SAT_SMT LP_APPROX UNFOLDING_TO_PT
Query index 9 was solved

Query is satisfied.

FORMULA Sudoku-COL-AN03-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING STRUCTURAL_REDUCTION QUERY_REDUCTION SAT_SMT LP_APPROX UNFOLDING_TO_PT
Query index 12 was solved

Query is satisfied.
Solution found by parallel simplification (step 0)
Solution found by parallel simplification (step 0)
Solution found by parallel simplification (step 0)
Solution found by parallel simplification (step 0)
Solution found by parallel simplification (step 0)
Time left: 3446

---------------------------------------------------
Step 1: Parallel processing
---------------------------------------------------
Doing parallel verification of individual queries (11 in total)
Each query is verified by 4 parallel strategies for 299 seconds
------------------- QUERY 1 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is NOT satisfied.
Spent 0.026979 on verification
FORMULA Sudoku-COL-AN03-LTLFireability-11 FALSE TECHNIQUES EXPLICIT TARJAN WEAK_SKIP STUBBORN AUT_STUB HEURISTIC LOGFIRECOUNT_HEUR(5000) OPTIM-1

Query index 0 was solved
Query is NOT satisfied.
Spent 0.054071 on verification
@@@0.05,149016@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ tarjan\ --ltl-heur\ fire-count\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 1 -n

FORMULA Sudoku-COL-AN03-LTLFireability-11 FALSE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3446
------------------- QUERY 2 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is satisfied.
Spent 0.257182 on verification
@@@0.27,149180@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ tarjan\ --ltl-heur\ aut\ -s\ DFS\ -p\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 2 -n

FORMULA Sudoku-COL-AN03-LTLFireability-06 TRUE TECHNIQUES EXPLICIT TARJAN WEAK_SKIP OPTIM-1
Time left: 3446
------------------- QUERY 3 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is NOT satisfied.
Spent 0.010055 on verification
@@@0.01,21600@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ ndfs\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 3 -n

FORMULA Sudoku-COL-AN03-LTLFireability-05 FALSE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3445
------------------- QUERY 4 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is satisfied.
Spent 0.394801 on verification
@@@0.39,149124@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ tarjan\ --ltl-heur\ fire-count\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 4 -n

FORMULA Sudoku-COL-AN03-LTLFireability-08 TRUE TECHNIQUES EXPLICIT TARJAN WEAK_SKIP STUBBORN AUT_STUB HEURISTIC LOGFIRECOUNT_HEUR(5000) OPTIM-1
Time left: 3445
------------------- QUERY 5 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is satisfied.
Spent 0.1382 on verification
@@@0.14,149216@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ tarjan\ --ltl-heur\ aut\ -s\ DFS\ -p\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 5 -n

FORMULA Sudoku-COL-AN03-LTLFireability-07 TRUE TECHNIQUES EXPLICIT TARJAN WEAK_SKIP OPTIM-1
Time left: 3444
------------------- QUERY 6 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is NOT satisfied.
Spent 0.013732 on verification
@@@0.01,21392@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ ndfs\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 6 -n

FORMULA Sudoku-COL-AN03-LTLFireability-14 FALSE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3444
------------------- QUERY 7 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is satisfied.
Spent 0.016362 on verification
@@@0.02,21512@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ ndfs\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 7 -n

FORMULA Sudoku-COL-AN03-LTLFireability-02 TRUE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3444
------------------- QUERY 8 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is NOT satisfied.
Spent 0.012519 on verification
@@@0.01,21424@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ ndfs\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 8 -n

FORMULA Sudoku-COL-AN03-LTLFireability-13 FALSE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3444
------------------- QUERY 9 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is NOT satisfied.
Spent 0.012167 on verification
@@@0.01,21468@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ ndfs\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 9 -n

FORMULA Sudoku-COL-AN03-LTLFireability-04 FALSE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3443
------------------- QUERY 10 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is satisfied.
Spent 0.249171 on verification
@@@0.26,150052@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ tarjan\ --ltl-heur\ aut\ -s\ DFS\ -p\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 10 -n

FORMULA Sudoku-COL-AN03-LTLFireability-10 TRUE TECHNIQUES EXPLICIT TARJAN WEAK_SKIP OPTIM-1
Time left: 3443
------------------- QUERY 11 ----------------------
Solution found by parallel processing (step 1)

Query index 0 was solved
Query is NOT satisfied.
Spent 0.013149 on verification
@@@0.02,21448@@@
parallel: This job succeeded:
eval /usr/bin/time -f "@@@%e,%M@@@" /home/mcc/BenchKit/bin/verifypn -n -ltl\ ndfs\ -q\ 0\ -l\ 0\ -d\ 119 /home/mcc/BenchKit/bin/tmp/tmp.V8dRjdPUzV /home/mcc/BenchKit/bin/tmp/tmp.3VHSHVYWcu --binary-query-io 1 -x 11 -n

FORMULA Sudoku-COL-AN03-LTLFireability-15 FALSE TECHNIQUES EXPLICIT NDFS WEAK_SKIP HEURISTIC AUTOMATON_HEUR OPTIM-1
Time left: 3443
All queries are solved
Time left: 3443
terminated-with-cleanup

BK_STOP 1653216574876

--------------------
content from stderr:

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-AN03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="tapaal"
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-4028"
echo " Executing tool tapaal"
echo " Input is Sudoku-COL-AN03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r255-tall-165303541900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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