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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 23:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 23:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 23:04 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 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-00
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-01
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-02
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-03
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-04
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-05
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-06
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-07
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-08
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-09
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-10
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-11
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-12
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-13
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-14
FORMULA_NAME ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717207329042

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:02:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 02:02:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:02:10] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-06-01 02:02:10] [INFO ] Transformed 25 places.
[2024-06-01 02:02:10] [INFO ] Transformed 18 transitions.
[2024-06-01 02:02:10] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40091 steps (13 resets) in 367 ms. (108 steps per ms) remains 10/16 properties
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1141 ms. (35 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 02:02:11] [INFO ] Computed 8 invariants in 8 ms
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-04 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-08 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-09 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-14 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-00 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-11 is UNSAT
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 9 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/16 variables, 2/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/22 variables, 2/5 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-06-01 02:02:11] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 1/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/25 variables, 3/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/43 variables, 25/34 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 1/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 35 constraints, problems are : Problem set: 9 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 381ms problems are : Problem set: 9 solved, 1 unsolved
Finished Parikh walk after 1371 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=457 )
FORMULA ClientsAndServers-PT-N0020P2-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 1578 ms.
ITS solved all properties within timeout

BK_STOP 1717207331787

--------------------
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="ClientsAndServers-PT-N0020P2"
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 ClientsAndServers-PT-N0020P2, 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-171620505900462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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