Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399700510.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 3.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 11 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K 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 BusinessProcesses-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225399309

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:03:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:03:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:03:20] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-06-01 07:03:20] [INFO ] Transformed 393 places.
[2024-06-01 07:03:20] [INFO ] Transformed 344 transitions.
[2024-06-01 07:03:20] [INFO ] Found NUPN structural information;
[2024-06-01 07:03:20] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (345 resets) in 2115 ms. (18 steps per ms) remains 3/9 properties
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (65 resets) in 546 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (70 resets) in 302 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
// Phase 1: matrix 331 rows 380 cols
[2024-06-01 07:03:22] [INFO ] Computed 58 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 226/240 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 226/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 102/342 variables, 21/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 102/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 38/380 variables, 14/400 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 38/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 331/711 variables, 380/818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 23 ms to minimize.
[2024-06-01 07:03:23] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-08-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/711 variables, 2/820 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/711 variables, 0/820 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/711 variables, 0/820 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 711/711 variables, and 820 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1679 ms.
Refiners :[Domain max(s): 380/380 constraints, Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 188/191 variables, 18/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 188/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 148/339 variables, 26/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 148/383 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
[2024-06-01 07:03:24] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:03:25] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 16/399 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/399 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/380 variables, 14/413 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 41/454 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 2/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 331/711 variables, 380/836 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/711 variables, 2/838 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/711 variables, 0/838 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/711 variables, 0/838 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 711/711 variables, and 838 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1563 ms.
Refiners :[Domain max(s): 380/380 constraints, Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 3325ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 117 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=39 )
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 4718 ms.
ITS solved all properties within timeout

BK_STOP 1717225405503

--------------------
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="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r472-tajo-171620399700510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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