fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r522-tall-171662353100022
Last Updated
July 7, 2024

About the Execution of LTSMin+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
862.436 39506.00 125400.00 126.40 T normal

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.r522-tall-171662353100022.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-22, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-171662353100022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 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 104K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717217960081

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 04:59:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:21] [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:59:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:59:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2024-06-01 04:59:21] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 20 ms.
[2024-06-01 04:59:22] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 34 ms.
[2024-06-01 04:59:22] [INFO ] Unfolded 26 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
Reduction of identical properties reduced properties to check from 24 to 22
RANDOM walk for 40000 steps (1485 resets) in 2860 ms. (13 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 308 ms. (12 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 103 ms. (38 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (11 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 162 ms. (24 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
// Phase 1: matrix 356 rows 1966 cols
[2024-06-01 04:59:23] [INFO ] Computed 1611 invariants in 101 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1869 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1869 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 74/1943 variables, 4/1060 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 529/1589 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:27] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 42 ms to minimize.
[2024-06-01 04:59:27] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 5 ms to minimize.
[2024-06-01 04:59:28] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 4 ms to minimize.
[2024-06-01 04:59:28] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 6 ms to minimize.
[2024-06-01 04:59:28] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 4 ms to minimize.
[2024-06-01 04:59:28] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1943/2322 variables, and 1595 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1585/1607 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1869 variables, 1056/1056 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1869 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 74/1943 variables, 4/1060 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 529/1589 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1943 variables, 6/1595 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:30] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 4 ms to minimize.
[2024-06-01 04:59:31] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 3 ms to minimize.
[2024-06-01 04:59:31] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 3 ms to minimize.
[2024-06-01 04:59:31] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 4 ms to minimize.
[2024-06-01 04:59:31] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-06-01 04:59:31] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 4 ms to minimize.
[2024-06-01 04:59:32] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 4 ms to minimize.
[2024-06-01 04:59:32] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 4 ms to minimize.
[2024-06-01 04:59:32] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1943 variables, 9/1604 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1943/2322 variables, and 1604 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1585/1607 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 15/15 constraints]
After SMT, in 10730ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1869 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1916 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.9 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1916/1966 places, 356/356 transitions.
RANDOM walk for 4000000 steps (148598 resets) in 63804 ms. (62 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (701 resets) in 1100 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (700 resets) in 1085 ms. (368 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (707 resets) in 1228 ms. (325 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (701 resets) in 1095 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (702 resets) in 1083 ms. (369 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (894 resets) in 668 ms. (597 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (906 resets) in 675 ms. (591 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (883 resets) in 672 ms. (594 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (882 resets) in 688 ms. (580 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (860 resets) in 5705 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (881 resets) in 5783 ms. (69 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (857 resets) in 1202 ms. (332 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (892 resets) in 1127 ms. (354 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (893 resets) in 887 ms. (450 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (879 resets) in 5633 ms. (70 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (894 resets) in 901 ms. (443 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (896 resets) in 887 ms. (450 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (882 resets) in 885 ms. (451 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (348 resets) in 859 ms. (465 steps per ms) remains 18/19 properties
Finished probabilistic random walk after 6846 steps, run visited all 18 properties in 174 ms. (steps per millisecond=39 )
Probabilistic random walk after 6846 steps, saw 6682 distinct states, run finished after 180 ms. (steps per millisecond=38 ) properties seen :18
Able to resolve query QuasiLiveness after proving 26 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 38295 ms.
ITS solved all properties within timeout

BK_STOP 1717217999587

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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-22"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-22, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-171662353100022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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