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.r520-tall-171662339400854.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 ResAllocation-PT-R010C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662339400854
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 11 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 11 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K 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 ResAllocation-PT-R010C002-ReachabilityCardinality-2024-00
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-01
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-02
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-03
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-04
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-05
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-06
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-07
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-08
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-09
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-10
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-11
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-12
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-13
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-14
FORMULA_NAME ResAllocation-PT-R010C002-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717265149081

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R010C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 18:05:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 18:05:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 18:05:50] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-06-01 18:05:50] [INFO ] Transformed 40 places.
[2024-06-01 18:05:50] [INFO ] Transformed 22 transitions.
[2024-06-01 18:05:50] [INFO ] Found NUPN structural information;
[2024-06-01 18:05:50] [INFO ] Parsed PT model containing 40 places and 22 transitions and 100 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1191 resets) in 1292 ms. (30 steps per ms) remains 3/6 properties
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (338 resets) in 438 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (300 resets) in 653 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (358 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
// Phase 1: matrix 22 rows 40 cols
[2024-06-01 18:05:51] [INFO ] Computed 20 invariants in 9 ms
Problem ResAllocation-PT-R010C002-ReachabilityCardinality-2024-05 is UNSAT
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 10/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/39 variables, 9/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 10/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 1/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/62 variables, 40/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 100 constraints, problems are : Problem set: 1 solved, 2 unsolved in 235 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 7/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 13/38 variables, 11/43 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 13/56 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 18:05:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 9 ms to minimize.
[2024-06-01 18:05:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 18:05:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 3/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/40 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 2/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 22/62 variables, 40/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/62 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 105 constraints, problems are : Problem set: 1 solved, 2 unsolved in 244 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 534ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 25 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 40 /40 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 40/40 places, 22/22 transitions.
RANDOM walk for 40000 steps (1196 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (331 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (355 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
Probably explored full state space saw : 6144 states, properties seen :0
Probabilistic random walk after 26624 steps, saw 6144 distinct states, run finished after 103 ms. (steps per millisecond=258 ) properties seen :0
Explored full state space saw : 6144 states, properties seen :0
Exhaustive walk after 26624 steps, saw 6144 distinct states, run finished after 61 ms. (steps per millisecond=436 ) properties seen :0
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
FORMULA ResAllocation-PT-R010C002-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 2026 ms.
ITS solved all properties within timeout

BK_STOP 1717265152222

--------------------
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="ResAllocation-PT-R010C002"
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 ResAllocation-PT-R010C002, 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 r520-tall-171662339400854"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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