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-171662337600007.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 QuasiCertifProtocol-COL-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337600007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K 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 QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717217899185

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:58:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:58:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:58:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 04:58:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:58:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-06-01 04:58:21] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 04:58:21] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 04:58:21] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-06-01 04:58:21] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 15 ms.
[2024-06-01 04:58:21] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (6567 resets) in 1826 ms. (21 steps per ms) remains 4/9 properties
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (2228 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1249 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2251 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2261 resets) in 885 ms. (45 steps per ms) remains 4/4 properties
// Phase 1: matrix 56 rows 86 cols
[2024-06-01 04:58:22] [INFO ] Computed 31 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 16/80 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/86 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 56/142 variables, 86/117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 1 solved, 3 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 16/77 variables, 7/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 6/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 04:58:22] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 17 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 7/32 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/34 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/36 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 2/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 9/86 variables, 6/44 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 04:58:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 56/142 variables, 86/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/142 variables, 3/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/142 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/142 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 135 constraints, problems are : Problem set: 1 solved, 3 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 1303ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
FORMULA QuasiCertifProtocol-COL-02-ReachabilityFireability-2024-04 TRUE 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 3 properties in 16 ms.
All properties solved without resorting to model-checking.
Total runtime 3317 ms.
ITS solved all properties within timeout

BK_STOP 1717217903783

--------------------
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 ReachabilityFireability -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="QuasiCertifProtocol-COL-02"
export BK_EXAMINATION="ReachabilityFireability"
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 QuasiCertifProtocol-COL-02, examination is ReachabilityFireability"
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-171662337600007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;