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

About the Execution of LTSMin+red for PGCD-PT-D03N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15986.256 1800000.00 7187548.00 418.40 [undef] Time out reached

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.r535-tall-167987254200286.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 PGCD-PT-D03N050, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r535-tall-167987254200286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 7.4K Mar 31 16:48 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 1680811047977

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=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PGCD-PT-D03N050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-06 19:57:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-04-06 19:57:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 19:57:29] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-04-06 19:57:29] [INFO ] Transformed 12 places.
[2023-04-06 19:57:29] [INFO ] Transformed 12 transitions.
[2023-04-06 19:57:29] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 81 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 3 ms.24188KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 15 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 12 cols
[2023-04-06 19:57:29] [INFO ] Computed 5 invariants in 5 ms
[2023-04-06 19:57:29] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 292 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 12/12 places, 12/12 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 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:57:29] [INFO ] Invariant cache hit.
[2023-04-06 19:57:29] [INFO ] Implicit Places using invariants in 48 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 8/12 places, 12/12 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 52 ms. Remains : 8/12 places, 12/12 transitions.
Random walk for 1250000 steps, including 0 resets, run took 230 ms (no deadlock found). (steps per millisecond=5434 )
Random directed walk for 1250007 steps, including 0 resets, run took 176 ms (no deadlock found). (steps per millisecond=7102 )
// Phase 1: matrix 12 rows 8 cols
[2023-04-06 19:57:30] [INFO ] Computed 1 invariants in 1 ms
[2023-04-06 19:57:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 19:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 19:57:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-06 19:57:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 19:57:30] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2023-04-06 19:57:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 19:57:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 19:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 19:57:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-04-06 19:57:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 19:57:30] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-06 19:57:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 3 ms to minimize.
[2023-04-06 19:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-04-06 19:57:30] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-06 19:57:30] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
Parikh directed walk for 8500 steps, including 168 resets, run took 13 ms. (steps per millisecond=653 )
Random directed walk for 500016 steps, including 0 resets, run took 60 ms (no deadlock found). (steps per millisecond=8333 )
Random walk for 500018 steps, including 0 resets, run took 76 ms (no deadlock found). (steps per millisecond=6579 )
Random directed walk for 500031 steps, including 0 resets, run took 69 ms (no deadlock found). (steps per millisecond=7246 )
Random walk for 500039 steps, including 0 resets, run took 65 ms (no deadlock found). (steps per millisecond=7692 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 8/8 places, 12/12 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-04-06 19:57:30] [INFO ] Invariant cache hit.
[2023-04-06 19:57:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-06 19:57:30] [INFO ] Invariant cache hit.
[2023-04-06 19:57:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 19:57:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-06 19:57:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-06 19:57:30] [INFO ] Invariant cache hit.
[2023-04-06 19:57:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 86 ms. Remains : 8/8 places, 12/12 transitions.
Random walk for 1250034 steps, including 0 resets, run took 148 ms (no deadlock found). (steps per millisecond=8446 )
Random directed walk for 1250033 steps, including 0 resets, run took 145 ms (no deadlock found). (steps per millisecond=8620 )
[2023-04-06 19:57:31] [INFO ] Invariant cache hit.
[2023-04-06 19:57:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 19:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 19:57:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-06 19:57:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 19:57:31] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-06 19:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 19:57:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-06 19:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 19:57:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-04-06 19:57:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-04-06 19:57:31] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2023-04-06 19:57:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2023-04-06 19:57:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-06 19:57:31] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-04-06 19:57:31] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 8500 steps, including 177 resets, run took 10 ms. (steps per millisecond=850 )
Random directed walk for 500053 steps, including 0 resets, run took 61 ms (no deadlock found). (steps per millisecond=8197 )
Random walk for 500025 steps, including 0 resets, run took 58 ms (no deadlock found). (steps per millisecond=8621 )
Random directed walk for 500029 steps, including 0 resets, run took 65 ms (no deadlock found). (steps per millisecond=7692 )
Random walk for 500007 steps, including 0 resets, run took 73 ms (no deadlock found). (steps per millisecond=6849 )
[2023-04-06 19:57:31] [INFO ] Flatten gal took : 16 ms
[2023-04-06 19:57:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 3 ms.
[2023-04-06 19:57:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 12 transitions and 56 arcs took 1 ms.
Total runtime 2154 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 222248 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16157088 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2023

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="PGCD-PT-D03N050"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PGCD-PT-D03N050, 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 r535-tall-167987254200286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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