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

About the Execution of LTSMin+red for CircularTrains-PT-768

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
553.663 5836.00 15256.00 113.60 FFTFFFFFFFTFFFFF 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.r476-tall-171620505700374.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 CircularTrains-PT-768, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505700374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 12 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 591K 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 CircularTrains-PT-768-ReachabilityCardinality-2024-00
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-01
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-02
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-03
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-04
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-05
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-06
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-07
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-08
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-09
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-10
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-11
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-12
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-13
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-14
FORMULA_NAME CircularTrains-PT-768-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717206675082

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-768
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:51:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:51:16] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-01 01:51:16] [INFO ] Transformed 1536 places.
[2024-06-01 01:51:16] [INFO ] Transformed 768 transitions.
[2024-06-01 01:51:16] [INFO ] Parsed PT model containing 1536 places and 768 transitions and 3072 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3052 ms. (13 steps per ms) remains 6/16 properties
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 680 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 6/6 properties
// Phase 1: matrix 768 rows 1536 cols
[2024-06-01 01:51:18] [INFO ] Computed 769 invariants in 80 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 93/162 variables, 47/47 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/47 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 56/218 variables, 28/75 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/75 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 16/234 variables, 8/83 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 1/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/238 variables, 2/86 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/86 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/240 variables, 1/87 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 0/87 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/242 variables, 1/88 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/88 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-13 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 609/851 variables, 133/221 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 0/221 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 418/1269 variables, 301/522 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1269 variables, 0/522 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 15/1284 variables, 9/531 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1284 variables, 0/531 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem CircularTrains-PT-768-ReachabilityCardinality-2024-01 is UNSAT
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (OVERLAPS) 252/1536 variables, 238/769 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1536 variables, 0/769 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 768/2304 variables, 1536/2305 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2304 variables, 0/2305 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2304 variables, 0/2305 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2304/2304 variables, and 2305 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 397/397 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 1536/1536 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/42 variables, 5/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/14 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/46 variables, 2/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 539/585 variables, 30/46 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 0/46 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 545/1130 variables, 359/405 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1130 variables, 0/405 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 37/1167 variables, 22/427 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1167 variables, 0/427 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 369/1536 variables, 342/769 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1536 variables, 0/769 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 768/2304 variables, 1536/2305 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2304 variables, 1/2306 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2304 variables, 0/2306 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2304 variables, 0/2306 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2304/2304 variables, and 2306 constraints, problems are : Problem set: 5 solved, 1 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 397/397 constraints, Generalized P Invariants (flows): 372/372 constraints, State Equation: 1536/1536 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2450ms problems are : Problem set: 5 solved, 1 unsolved
Finished Parikh walk after 239 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=14 )
FORMULA CircularTrains-PT-768-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 23 ms.
All properties solved without resorting to model-checking.
Total runtime 4609 ms.
ITS solved all properties within timeout

BK_STOP 1717206680918

--------------------
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="CircularTrains-PT-768"
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 CircularTrains-PT-768, 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 r476-tall-171620505700374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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