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

About the Execution of LTSMin+red for LeafsetExtension-PT-S16C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
323.508 5683.00 10652.00 83.00 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 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.r504-tall-171649612600341.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 ltsminxred
Input is LeafsetExtension-PT-S16C2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612600341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 13:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 905K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S16C2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717228403177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:53:24] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-06-01 07:53:24] [INFO ] Transformed 1542 places.
[2024-06-01 07:53:24] [INFO ] Transformed 1449 transitions.
[2024-06-01 07:53:24] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1449 rows 1542 cols
[2024-06-01 07:53:24] [INFO ] Computed 93 invariants in 106 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf, 1, 1, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 10000 steps (545 resets) in 57 ms. (172 steps per ms)
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (383 resets) in 67 ms. (735 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-06-01 07:53:24] [INFO ] Invariant cache hit.
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 26 ms returned unsat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 38 ms returned unsat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 31 ms returned unsat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-06-01 07:53:25] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 40 ms returned unsat
[2024-06-01 07:53:26] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2024-06-01 07:53:26] [INFO ] [Real]Absence check using 19 positive and 74 generalized place invariants in 43 ms returned sat
[2024-06-01 07:53:26] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-06-01 07:53:26] [INFO ] Computed and/alt/rep : 1430/2224/1430 causal constraints (skipped 2 transitions) in 94 ms.
[2024-06-01 07:53:27] [INFO ] Added : 6 causal constraints over 2 iterations in 409 ms. Result :sat
Minimization took 765 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, +inf]
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 45 are kept as prefixes of interest. Removing 1497 places using SCC suffix rule.4 ms
Discarding 1497 places :
Also discarding 1070 output transitions
Drop transitions (Output transitions of discarded places.) removed 1070 transitions
Drop transitions (Empty/Sink Transition effects.) removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 298 rules applied. Total rules applied 299 place count 37 transition count 89
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 10 rules applied. Total rules applied 309 place count 35 transition count 81
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 317 place count 27 transition count 81
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 324 place count 20 transition count 74
Iterating global reduction 3 with 7 rules applied. Total rules applied 331 place count 20 transition count 74
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 340 place count 20 transition count 65
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 349 place count 11 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 405 place count 11 transition count 9
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 406 place count 10 transition count 9
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 413 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 421 place count 2 transition count 2
Applied a total of 421 rules in 60 ms. Remains 2 /1542 variables (removed 1540) and now considering 2/1449 (removed 1447) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 2/1542 places, 2/1449 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 07:53:28] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (143851 resets) in 295 ms. (3378 steps per ms)
BEST_FIRST walk for 1000001 steps (125308 resets) in 308 ms. (3236 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 07:53:28] [INFO ] Invariant cache hit.
[2024-06-01 07:53:28] [INFO ] [Real]Absence check using state equation in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA LeafsetExtension-PT-S16C2-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4530 ms.
ITS solved all properties within timeout

BK_STOP 1717228408860

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -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="LeafsetExtension-PT-S16C2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ltsminxred"
echo " Input is LeafsetExtension-PT-S16C2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612600341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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