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-171620505700366.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-384, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505700366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 293K 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-384-ReachabilityCardinality-2024-00
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-01
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-02
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-03
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-04
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-05
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-06
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-07
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-08
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-09
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-10
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-11
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-12
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-13
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-14
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717205775100

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-384
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:36:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 01:36:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:36:16] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 01:36:16] [INFO ] Transformed 768 places.
[2024-06-01 01:36:16] [INFO ] Transformed 384 transitions.
[2024-06-01 01:36:16] [INFO ] Parsed PT model containing 768 places and 384 transitions and 1536 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2150 ms. (18 steps per ms) remains 4/16 properties
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1108 ms. (36 steps per ms) remains 4/4 properties
// Phase 1: matrix 384 rows 768 cols
[2024-06-01 01:36:17] [INFO ] Computed 385 invariants in 67 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/215 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 51/266 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/270 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 310/580 variables, 121/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem CircularTrains-PT-384-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem CircularTrains-PT-384-ReachabilityCardinality-2024-05 is UNSAT
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 126/706 variables, 111/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/706 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 62/768 variables, 59/385 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/768 variables, 0/385 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 384/1152 variables, 768/1153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1152 variables, 0/1153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1152 variables, 0/1153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1152/1152 variables, and 1153 constraints, problems are : Problem set: 2 solved, 2 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/179 variables, 54/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 1/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 49/228 variables, 26/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/232 variables, 2/83 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 316/548 variables, 108/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/191 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 142/690 variables, 120/311 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 0/311 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/692 variables, 1/312 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 0/312 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 76/768 variables, 73/385 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/768 variables, 0/385 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 384/1152 variables, 768/1153 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1152 variables, 2/1155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1152 variables, 0/1155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1152 variables, 0/1155 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1152/1152 variables, and 1155 constraints, problems are : Problem set: 2 solved, 2 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 203/203 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 768/768 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2091ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 313 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=22 )
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA CircularTrains-PT-384-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 27 ms.
All properties solved without resorting to model-checking.
Total runtime 3743 ms.
ITS solved all properties within timeout

BK_STOP 1717205780027

--------------------
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-384"
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-384, 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-171620505700366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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