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

About the Execution of LTSMin+red for PGCD-COL-D02N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.483 1800000.00 7182365.00 553.50 [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-167987254200246.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-COL-D02N100, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r535-tall-167987254200246
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.8K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 7.5K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K 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 1680810932478

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-COL-D02N100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-06 19:55:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-04-06 19:55:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 19:55:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-06 19:55:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-06 19:55:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 395 ms
[2023-04-06 19:55:34] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 16 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2023-04-06 19:55:34] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-06 19:55:34] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-06 19:55:34] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 5 ms.
[2023-04-06 19:55:34] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.24362KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 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 8 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 19:55:34] [INFO ] Computed 4 invariants in 7 ms
[2023-04-06 19:55:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 140 ms. Remains : 9/9 places, 9/9 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 9/9 places, 9/9 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 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:34] [INFO ] Invariant cache hit.
[2023-04-06 19:55:34] [INFO ] Implicit Places using invariants in 36 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 6/9 places, 9/9 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 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 40 ms. Remains : 6/9 places, 9/9 transitions.
Random walk for 1250042 steps, including 0 resets, run took 184 ms (no deadlock found). (steps per millisecond=6793 )
Random directed walk for 1250076 steps, including 0 resets, run took 142 ms (no deadlock found). (steps per millisecond=8803 )
// Phase 1: matrix 9 rows 6 cols
[2023-04-06 19:55:35] [INFO ] Computed 1 invariants in 1 ms
[2023-04-06 19:55:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 19:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 19:55:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-04-06 19:55:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:55:35] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-04-06 19:55:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 19:55:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-06 19:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 19:55:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-06 19:55:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:55:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-06 19:55:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 4 ms to minimize.
[2023-04-06 19:55:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-06 19:55:35] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-06 19:55:35] [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 15600 steps, including 349 resets, run took 22 ms. (steps per millisecond=709 )
Random directed walk for 500077 steps, including 0 resets, run took 58 ms (no deadlock found). (steps per millisecond=8622 )
Random walk for 500092 steps, including 0 resets, run took 63 ms (no deadlock found). (steps per millisecond=7937 )
Random directed walk for 500062 steps, including 0 resets, run took 54 ms (no deadlock found). (steps per millisecond=9260 )
Random walk for 500039 steps, including 0 resets, run took 45 ms (no deadlock found). (steps per millisecond=11111 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 6/6 places, 9/9 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 6 /6 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:35] [INFO ] Invariant cache hit.
[2023-04-06 19:55:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-04-06 19:55:35] [INFO ] Invariant cache hit.
[2023-04-06 19:55:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:55:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-06 19:55:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-06 19:55:35] [INFO ] Invariant cache hit.
[2023-04-06 19:55:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 93 ms. Remains : 6/6 places, 9/9 transitions.
Random walk for 1250083 steps, including 0 resets, run took 114 ms (no deadlock found). (steps per millisecond=10965 )
Random directed walk for 1250000 steps, including 0 resets, run took 112 ms (no deadlock found). (steps per millisecond=11160 )
[2023-04-06 19:55:35] [INFO ] Invariant cache hit.
[2023-04-06 19:55:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-06 19:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 19:55:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-06 19:55:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:55:35] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-06 19:55:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 19:55:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-06 19:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 19:55:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-04-06 19:55:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:55:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-06 19:55:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2023-04-06 19:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-04-06 19:55:36] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 4 ms.
[2023-04-06 19:55:36] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 15600 steps, including 339 resets, run took 16 ms. (steps per millisecond=975 )
Random directed walk for 500005 steps, including 0 resets, run took 65 ms (no deadlock found). (steps per millisecond=7692 )
Random walk for 500080 steps, including 0 resets, run took 63 ms (no deadlock found). (steps per millisecond=7937 )
Random directed walk for 500068 steps, including 0 resets, run took 52 ms (no deadlock found). (steps per millisecond=9616 )
Random walk for 500054 steps, including 0 resets, run took 46 ms (no deadlock found). (steps per millisecond=10870 )
[2023-04-06 19:55:36] [INFO ] Flatten gal took : 13 ms
[2023-04-06 19:55:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-04-06 19:55:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 2114 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 421532 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16119668 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-COL-D02N100"
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-COL-D02N100, 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-167987254200246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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