fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r612-tall-171774431300161
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BlocksWorld-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11630.279 546206.00 596591.00 1775.00 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/mcc2024-input.r612-tall-171774431300161.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is BlocksWorld-PT-13, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r612-tall-171774431300161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.9M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.9M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 42K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 684K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 848K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 73K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 173K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 4.4M Jun 7 06:26 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717746572298

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:49:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-07 07:49:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:49:33] [INFO ] Load time of PNML (sax parser for PT used): 383 ms
[2024-06-07 07:49:33] [INFO ] Transformed 4691 places.
[2024-06-07 07:49:33] [INFO ] Transformed 9113 transitions.
[2024-06-07 07:49:33] [INFO ] Found NUPN structural information;
[2024-06-07 07:49:33] [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, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56, pred_on_table_57, pred_on_table_58, pred_on_table_59, pred_on_table_60, pred_on_table_61, pred_on_table_62, pred_on_table_63, pred_on_table_64, pred_on_table_65, pred_on_table_66]
[2024-06-07 07:49:33] [INFO ] Parsed PT model containing 4691 places and 9113 transitions and 45542 arcs in 541 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 12 ms.37860KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 4691/4691 places, 9113/9113 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2353 ms. Remains 4691 /4691 variables (removed 0) and now considering 9113/9113 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2367 ms. Remains : 4691/4691 places, 9113/9113 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 4691/4691 places, 9113/9113 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2132 ms. Remains 4691 /4691 variables (removed 0) and now considering 9113/9113 (removed 0) transitions.
// Phase 1: matrix 9113 rows 4691 cols
[2024-06-07 07:49:38] [INFO ] Computed 135 invariants in 130 ms
[2024-06-07 07:49:44] [INFO ] Implicit Places using invariants in 5589 ms returned []
[2024-06-07 07:49:44] [INFO ] Invariant cache hit.
[2024-06-07 07:49:49] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-07 07:50:07] [INFO ] Implicit Places using invariants and state equation in 23732 ms returned []
Implicit Place search using SMT with State Equation took 29355 ms to find 0 implicit places.
[2024-06-07 07:50:09] [INFO ] Redundant transitions in 1239 ms returned []
Running 9105 sub problems to find dead transitions.
[2024-06-07 07:50:09] [INFO ] Invariant cache hit.
[2024-06-07 07:50:09] [INFO ] State equation strengthened by 119 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD3058 is UNSAT
Problem TDEAD3126 is UNSAT
Problem TDEAD3194 is UNSAT
Problem TDEAD3262 is UNSAT
Problem TDEAD3398 is UNSAT
Problem TDEAD3534 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3670 is UNSAT
Problem TDEAD3738 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3942 is UNSAT
Problem TDEAD4010 is UNSAT
Problem TDEAD4078 is UNSAT
Problem TDEAD4214 is UNSAT
Problem TDEAD4350 is UNSAT
Problem TDEAD4418 is UNSAT
Problem TDEAD4486 is UNSAT
Problem TDEAD4554 is UNSAT
Problem TDEAD4622 is UNSAT
Problem TDEAD4690 is UNSAT
Problem TDEAD4822 is UNSAT
Problem TDEAD4952 is UNSAT
Problem TDEAD5080 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5330 is UNSAT
Problem TDEAD5572 is UNSAT
Problem TDEAD5690 is UNSAT
Problem TDEAD5806 is UNSAT
Problem TDEAD5920 is UNSAT
Problem TDEAD6032 is UNSAT
Problem TDEAD6142 is UNSAT
Problem TDEAD6250 is UNSAT
Problem TDEAD6356 is UNSAT
Problem TDEAD6460 is UNSAT
Problem TDEAD6562 is UNSAT
Problem TDEAD6662 is UNSAT
Problem TDEAD6760 is UNSAT
Problem TDEAD6856 is UNSAT
Problem TDEAD6950 is UNSAT
Problem TDEAD7042 is UNSAT
Problem TDEAD7220 is UNSAT
Problem TDEAD7306 is UNSAT
Problem TDEAD7390 is UNSAT
Problem TDEAD7472 is UNSAT
Problem TDEAD7630 is UNSAT
Problem TDEAD7706 is UNSAT
Problem TDEAD7780 is UNSAT
Problem TDEAD7922 is UNSAT
Problem TDEAD7990 is UNSAT
Problem TDEAD8056 is UNSAT
Problem TDEAD8120 is UNSAT
Problem TDEAD8182 is UNSAT
Problem TDEAD8242 is UNSAT
Problem TDEAD8300 is UNSAT
Problem TDEAD8356 is UNSAT
Problem TDEAD8410 is UNSAT
Problem TDEAD8462 is UNSAT
Problem TDEAD8512 is UNSAT
Problem TDEAD8560 is UNSAT
Problem TDEAD8606 is UNSAT
Problem TDEAD8650 is UNSAT
Problem TDEAD8732 is UNSAT
Problem TDEAD8806 is UNSAT
Problem TDEAD8840 is UNSAT
Problem TDEAD8872 is UNSAT
Problem TDEAD8902 is UNSAT
Problem TDEAD8930 is UNSAT
Problem TDEAD8956 is UNSAT
Problem TDEAD8980 is UNSAT
Problem TDEAD9002 is UNSAT
Problem TDEAD9022 is UNSAT
Problem TDEAD9056 is UNSAT
Problem TDEAD9082 is UNSAT
Problem TDEAD9092 is UNSAT
Problem TDEAD9100 is UNSAT
Problem TDEAD9106 is UNSAT
Problem TDEAD9110 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4683 variables, 119/119 constraints. Problems are: Problem set: 118 solved, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4683/13804 variables, and 119 constraints, problems are : Problem set: 118 solved, 8987 unsolved in 30243 ms.
Refiners :[Positive P Invariants (semi-flows): 119/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 9046/4557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 118 solved, 8987 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4624 variables, 9/9 constraints. Problems are: Problem set: 118 solved, 8987 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4624/13804 variables, and 9 constraints, problems are : Problem set: 118 solved, 8987 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/135 constraints, State Equation: 0/4691 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 4489/4557 constraints, Known Traps: 0/0 constraints]
After SMT, in 139948ms problems are : Problem set: 118 solved, 8987 unsolved
Search for dead transitions found 118 dead transitions in 140065ms
Found 118 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 118 transitions
Dead transitions reduction (with SMT) removed 118 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 4691/4691 places, 8995/9113 transitions.
Computed a total of 59 stabilizing places and 0 stable transitions
Graph (complete) has 26050 edges and 4691 vertex of which 4632 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.36 ms
Discarding 59 places :
Also discarding 0 output transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 1 rules in 1872 ms. Remains 4632 /4691 variables (removed 59) and now considering 8995/8995 (removed 0) transitions.
// Phase 1: matrix 8995 rows 4632 cols
[2024-06-07 07:52:31] [INFO ] Computed 135 invariants in 51 ms
[2024-06-07 07:52:36] [INFO ] Implicit Places using invariants in 4840 ms returned []
[2024-06-07 07:52:36] [INFO ] Invariant cache hit.
[2024-06-07 07:52:41] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-07 07:52:55] [INFO ] Implicit Places using invariants and state equation in 19237 ms returned []
Implicit Place search using SMT with State Equation took 24082 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 4632/4691 places, 8995/9113 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 198816 ms. Remains : 4632/4691 places, 8995/9113 transitions.
Interrupted Random walk after 347242 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 429630 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
[2024-06-07 07:53:55] [INFO ] Invariant cache hit.
[2024-06-07 07:54:04] [INFO ] [Real]Absence check using 135 positive place invariants in 3829 ms returned sat
[2024-06-07 07:55:34] [INFO ] [Real]Absence check using state equation in 90879 ms returned sat
[2024-06-07 07:55:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:55:41] [INFO ] [Nat]Absence check using 135 positive place invariants in 1822 ms returned sat
[2024-06-07 07:58:29] [INFO ] [Nat]Absence check using state equation in 167547 ms returned sat
[2024-06-07 07:58:29] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-07 07:58:29] [INFO ] [Nat]Added 17 Read/Feed constraints in 168 ms returned sat
[2024-06-07 07:58:37] [INFO ] Deduced a trap composed of 134 places in 7726 ms of which 230 ms to minimize.
[2024-06-07 07:58:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 8981 ms
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 544994 ms.
ITS solved all properties within timeout

BK_STOP 1717747118504

--------------------
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 ReachabilityDeadlock -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-13"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BlocksWorld-PT-13, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r612-tall-171774431300161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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