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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 647K 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 LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717228183123

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:49:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:49:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:49:44] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-01 07:49:44] [INFO ] Transformed 462 places.
[2024-06-01 07:49:44] [INFO ] Transformed 409 transitions.
[2024-06-01 07:49:44] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2165 resets) in 1623 ms. (24 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (460 resets) in 376 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (458 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (337 resets) in 775 ms. (51 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (464 resets) in 336 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (468 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (459 resets) in 122 ms. (325 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (457 resets) in 120 ms. (330 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (493 resets) in 145 ms. (273 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (484 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (454 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (469 resets) in 141 ms. (281 steps per ms) remains 9/9 properties
// Phase 1: matrix 409 rows 462 cols
[2024-06-01 07:49:45] [INFO ] Computed 53 invariants in 31 ms
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 337/450 variables, 40/41 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 07:49:46] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 15 ms to minimize.
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 35 places in 473 ms of which 20 ms to minimize.
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 11 ms to minimize.
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:49:47] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 5/46 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 10/460 variables, 10/56 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:49:48] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 4/60 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/60 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/462 variables, 2/62 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/62 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 409/871 variables, 462/524 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/871 variables, 0/524 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/871 variables, 0/524 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 871/871 variables, and 524 constraints, problems are : Problem set: 7 solved, 2 unsolved in 2805 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 376/414 variables, 29/29 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 3/32 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/32 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/425 variables, 11/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 3/46 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-06-01 07:49:49] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:49:49] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 2/48 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/48 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S08C2-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 462/871 variables, and 61 constraints, problems are : Problem set: 9 solved, 0 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/462 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 8/11 constraints]
After SMT, in 3351ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 5005 ms.
ITS solved all properties within timeout

BK_STOP 1717228189346

--------------------
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="LeafsetExtension-PT-S08C2"
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 LeafsetExtension-PT-S08C2, 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 r504-tall-171649612500318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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