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

About the Execution of ITS-Tools for SquareGrid-PT-040204

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
369.287 21462.00 30676.00 83.00 T 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.r409-tall-171690547400036.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 itstools
Input is SquareGrid-PT-040204, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-tall-171690547400036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 04:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 04:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 04:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 130K May 18 16:43 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 1717100075189

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SquareGrid-PT-040204
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202405141337
[2024-05-30 20:14:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-30 20:14:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 20:14:36] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-30 20:14:36] [INFO ] Transformed 240 places.
[2024-05-30 20:14:36] [INFO ] Transformed 272 transitions.
[2024-05-30 20:14:36] [INFO ] Parsed PT model containing 240 places and 272 transitions and 1088 arcs in 171 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 9 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.19579KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 240/240 places, 272/272 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 42 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 55 ms. Remains : 240/240 places, 272/272 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 240/240 places, 272/272 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 23 ms. Remains 240 /240 variables (removed 0) and now considering 272/272 (removed 0) transitions.
// Phase 1: matrix 272 rows 240 cols
[2024-05-30 20:14:36] [INFO ] Computed 97 invariants in 37 ms
[2024-05-30 20:14:37] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-30 20:14:37] [INFO ] Invariant cache hit.
[2024-05-30 20:14:37] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-30 20:14:37] [INFO ] Redundant transitions in 11 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-30 20:14:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/512 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 337 constraints, problems are : Problem set: 0 solved, 208 unsolved in 6698 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 128/240 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 272/512 variables, 240/337 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 208/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/512 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 512/512 variables, and 545 constraints, problems are : Problem set: 0 solved, 208 unsolved in 12388 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 19206ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 19219ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 19924 ms. Remains : 240/240 places, 272/272 transitions.
Finished random walk after 3311 steps, including 0 resets, run found a deadlock after 56 ms. (steps per millisecond=59 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 20279 ms.

BK_STOP 1717100096651

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="SquareGrid-PT-040204"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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 itstools"
echo " Input is SquareGrid-PT-040204, 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 r409-tall-171690547400036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SquareGrid-PT-040204.tgz
mv SquareGrid-PT-040204 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 ;