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

About the Execution of LTSMin+red for SafeBus-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
648.520 11560.00 27707.00 106.90 FTTTFTTFTFFFFFTT 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.r524-tall-171679080300446.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 SafeBus-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080300446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 20K Apr 12 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 12 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 42K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 740K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 52K Apr 12 20:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 332K Apr 12 20:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.8M 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

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

=== Now, execution of the tool begins

BK_START 1717227944303

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:45:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:45:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:45:45] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2024-06-01 07:45:45] [INFO ] Transformed 1026 places.
[2024-06-01 07:45:46] [INFO ] Transformed 10461 transitions.
[2024-06-01 07:45:46] [INFO ] Found NUPN structural information;
[2024-06-01 07:45:46] [INFO ] Parsed PT model containing 1026 places and 10461 transitions and 77364 arcs in 607 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 20 places and 0 transitions.
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3869 ms. (10 steps per ms) remains 5/13 properties
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1406 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 602 ms. (66 steps per ms) remains 5/5 properties
[2024-06-01 07:45:48] [INFO ] Flow matrix only has 2482 transitions (discarded 7979 similar events)
// Phase 1: matrix 2482 rows 1006 cols
[2024-06-01 07:45:48] [INFO ] Computed 85 invariants in 196 ms
[2024-06-01 07:45:48] [INFO ] State equation strengthened by 421 read => feed constraints.
Problem SafeBus-PT-20-ReachabilityCardinality-2024-02 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem SafeBus-PT-20-ReachabilityCardinality-2024-03 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem SafeBus-PT-20-ReachabilityCardinality-2024-07 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/922 variables, 922/922 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/922 variables, 21/943 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/922 variables, 0/943 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/942 variables, 21/964 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/942 variables, 20/984 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/942 variables, 0/984 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem SafeBus-PT-20-ReachabilityCardinality-2024-06 is UNSAT
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 61/1003 variables, 41/1025 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1003 variables, 61/1086 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1003 variables, 0/1086 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1004 variables, 1/1087 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1004 variables, 1/1088 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1004 variables, 0/1088 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2481/3485 variables, 1004/2092 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3485 variables, 420/2512 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3485 variables, 0/2512 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/3488 variables, 2/2514 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3488 variables, 2/2516 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3488 variables, 1/2517 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3488 variables, 1/2518 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3488 variables, 0/2518 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3488 variables, 0/2518 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3488/3488 variables, and 2518 constraints, problems are : Problem set: 4 solved, 1 unsolved in 1829 ms.
Refiners :[Domain max(s): 1006/1006 constraints, Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 1006/1006 constraints, ReadFeed: 421/421 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 492/495 variables, 6/9 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 492/501 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/501 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 427/922 variables, 36/537 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/922 variables, 427/964 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 0/964 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/1003 variables, 41/1005 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1003 variables, 81/1086 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 07:45:53] [INFO ] Deduced a trap composed of 99 places in 1410 ms of which 118 ms to minimize.
[2024-06-01 07:45:54] [INFO ] Deduced a trap composed of 99 places in 1265 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1003 variables, 2/1088 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1003 variables, 0/1088 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/1004 variables, 1/1089 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1004 variables, 1/1090 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1004 variables, 0/1090 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3485/3488 variables, and 2094 constraints, problems are : Problem set: 4 solved, 1 unsolved in 4472 ms.
Refiners :[Domain max(s): 1004/1006 constraints, Positive P Invariants (semi-flows): 43/44 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 1004/1006 constraints, ReadFeed: 0/421 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 7330ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 139 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=46 )
FORMULA SafeBus-PT-20-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 18 ms.
All properties solved without resorting to model-checking.
Total runtime 10388 ms.
ITS solved all properties within timeout

BK_STOP 1717227955863

--------------------
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="SafeBus-PT-20"
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 SafeBus-PT-20, 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 r524-tall-171679080300446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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