fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r028-smll-174853774400007
Last Updated
June 24, 2025

About the Execution of 2024-gold for BlocksWorld-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15691.920 67426.00 97370.00 307.20 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/mcc2025-input.r028-smll-174853774400007.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is BlocksWorld-PT-02, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774400007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 175K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748541874009

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:04:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:04:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:04:36] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2025-05-29 18:04:36] [INFO ] Transformed 209 places.
[2025-05-29 18:04:36] [INFO ] Transformed 365 transitions.
[2025-05-29 18:04:36] [INFO ] Found NUPN structural information;
[2025-05-29 18:04:36] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12]
[2025-05-29 18:04:36] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 564 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 209/209 places, 365/365 transitions.
Applied a total of 0 rules in 122 ms. Remains 209 /209 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 209 cols
[2025-05-29 18:04:37] [INFO ] Computed 27 invariants in 54 ms
[2025-05-29 18:04:38] [INFO ] Implicit Places using invariants in 866 ms returned []
[2025-05-29 18:04:38] [INFO ] Invariant cache hit.
[2025-05-29 18:04:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-29 18:04:38] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2025-05-29 18:04:39] [INFO ] Invariant cache hit.
[2025-05-29 18:04:39] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 20/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/209 variables, 7/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2025-05-29 18:04:47] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 20 ms to minimize.
[2025-05-29 18:04:47] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 257 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 17/209 variables, 26/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 335/591 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2025-05-29 18:05:24] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 5 ms to minimize.
[2025-05-29 18:05:24] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 4 ms to minimize.
[2025-05-29 18:05:24] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 4 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 3 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 2 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2025-05-29 18:05:25] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2025-05-29 18:05:26] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2025-05-29 18:05:26] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 9 ms to minimize.
[2025-05-29 18:05:26] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2025-05-29 18:05:26] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2025-05-29 18:05:27] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 3 ms to minimize.
[2025-05-29 18:05:27] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2025-05-29 18:05:27] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 3 ms to minimize.
[2025-05-29 18:05:27] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2025-05-29 18:05:27] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 3 ms to minimize.
[2025-05-29 18:05:28] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 20/611 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2025-05-29 18:05:34] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 2 ms to minimize.
[2025-05-29 18:05:34] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2025-05-29 18:05:34] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 3 ms to minimize.
[2025-05-29 18:05:34] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2025-05-29 18:05:35] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2025-05-29 18:05:35] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 3 ms to minimize.
[2025-05-29 18:05:35] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2025-05-29 18:05:36] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2025-05-29 18:05:36] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-05-29 18:05:36] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2025-05-29 18:05:38] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 3 ms to minimize.
[2025-05-29 18:05:38] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 3 ms to minimize.
[2025-05-29 18:05:38] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2025-05-29 18:05:39] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-05-29 18:05:39] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2025-05-29 18:05:40] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2025-05-29 18:05:40] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2025-05-29 18:05:41] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 3 ms to minimize.
[2025-05-29 18:05:41] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 62345ms, After SMT, problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 62391ms
Found 26 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 65040 ms.
ITS solved all properties within timeout

BK_STOP 1748541941435

--------------------
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 QuasiLiveness -timeout 180 -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="BlocksWorld-PT-02"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is BlocksWorld-PT-02, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-smll-174853774400007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-02.tgz
mv BlocksWorld-PT-02 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;