fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r500-smll-171649588100382
Last Updated
July 7, 2024

About the Execution of LTSMin+red for IOTPpurchase-PT-C05M04P03D02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
362.716 6941.00 18521.00 182.00 TTTTTTTTTFTTTFTF 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.r500-smll-171649588100382.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 IOTPpurchase-PT-C05M04P03D02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588100382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 156K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717287026128

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 00:10:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 00:10:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 00:10:28] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 00:10:28] [INFO ] Transformed 111 places.
[2024-06-02 00:10:28] [INFO ] Transformed 45 transitions.
[2024-06-02 00:10:28] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 434 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 115 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2512 ms. (15 steps per ms) remains 13/16 properties
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1083 ms. (36 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 383 ms. (104 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (8 resets) in 203 ms. (196 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (8 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1254 ms. (31 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1160 ms. (34 steps per ms) remains 12/13 properties
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 12/12 properties
// Phase 1: matrix 45 rows 111 cols
[2024-06-02 00:10:31] [INFO ] Computed 67 invariants in 19 ms
[2024-06-02 00:10:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-01 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-06 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-08 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-11 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 33/37 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-02 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-07 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-09 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 4/98 variables, 4/41 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-00 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-04 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 4/45 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/45 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-03 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-14 is UNSAT
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 13/111 variables, 22/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 45/156 variables, 111/178 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 179 constraints, problems are : Problem set: 11 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 51/75 variables, 34/36 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/36 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/80 variables, 4/40 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/40 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/103 variables, 20/60 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/60 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/106 variables, 2/62 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/62 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/111 variables, 5/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 0/67 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 45/156 variables, 111/178 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 1/179 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 1/180 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/180 constraints. Problems are: Problem set: 11 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/156 variables, 0/180 constraints. Problems are: Problem set: 11 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 180 constraints, problems are : Problem set: 11 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1406ms problems are : Problem set: 11 solved, 1 unsolved
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=120 )
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 5079 ms.
ITS solved all properties within timeout

BK_STOP 1717287033069

--------------------
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 ReachabilityCardinality -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="IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="ReachabilityCardinality"
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 IOTPpurchase-PT-C05M04P03D02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649588100382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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