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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 04:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 04:10 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 93K 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 1717217943140

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-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 04:59:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:04] [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:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 04:59:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2024-06-01 04:59:05] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1398 PT places and 296.0 transition bindings in 19 ms.
[2024-06-01 04:59:05] [INFO ] Unfolded HLPN to a Petri net with 1398 places and 296 transitions 3119 arcs in 30 ms.
[2024-06-01 04:59:05] [INFO ] Unfolded 26 HLPN properties in 1 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 (1768 resets) in 2005 ms. (19 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 166 ms. (23 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 167 ms. (23 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 173 ms. (23 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 172 ms. (23 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 73 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 72 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 85 ms. (46 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (13 resets) in 139 ms. (28 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (12 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
// Phase 1: matrix 296 rows 1398 cols
[2024-06-01 04:59:06] [INFO ] Computed 1103 invariants in 67 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1317 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1317 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 62/1379 variables, 4/724 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 361/1085 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:08] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 31 ms to minimize.
[2024-06-01 04:59:09] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 4 ms to minimize.
[2024-06-01 04:59:09] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 3/1088 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 4 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 3 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 3 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2024-06-01 04:59:10] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-06-01 04:59:11] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 3 ms to minimize.
[2024-06-01 04:59:11] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 2 ms to minimize.
[2024-06-01 04:59:11] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1379/1694 variables, and 1097 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5075 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1081/1099 constraints, State Equation: 0/1398 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1317 variables, 720/720 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1317 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 62/1379 variables, 4/724 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 361/1085 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1379 variables, 12/1097 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:12] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1379 variables, 1/1098 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:13] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-06-01 04:59:13] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1379 variables, 2/1100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 04:59:14] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1379 variables, 1/1101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1379 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 19/1398 variables, 18/1119 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1398 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 296/1694 variables, 1398/2517 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1694 variables, 19/2536 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2536 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1099/1099 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 16/16 constraints]
After SMT, in 10465ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1317 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1356 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.9 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 53 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 1356/1398 places, 296/296 transitions.
RANDOM walk for 4000000 steps (176772 resets) in 54152 ms. (73 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (972 resets) in 1017 ms. (392 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (969 resets) in 995 ms. (401 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (973 resets) in 1000 ms. (399 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (959 resets) in 978 ms. (408 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (961 resets) in 1068 ms. (374 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1284 resets) in 670 ms. (596 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1289 resets) in 683 ms. (584 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1294 resets) in 659 ms. (606 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1297 resets) in 683 ms. (584 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1287 resets) in 3940 ms. (101 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1316 resets) in 4108 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1270 resets) in 1234 ms. (323 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1287 resets) in 1370 ms. (291 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1302 resets) in 995 ms. (401 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (1282 resets) in 3995 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1295 resets) in 860 ms. (464 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1277 resets) in 836 ms. (477 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1291 resets) in 861 ms. (464 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (504 resets) in 791 ms. (505 steps per ms) remains 18/19 properties
Finished probabilistic random walk after 4746 steps, run visited all 18 properties in 127 ms. (steps per millisecond=37 )
Probabilistic random walk after 4746 steps, saw 4610 distinct states, run finished after 134 ms. (steps per millisecond=35 ) 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 33518 ms.
ITS solved all properties within timeout

BK_STOP 1717217977846

--------------------
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 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-18"
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-18, 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-171662353100017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-18.tgz
mv QuasiCertifProtocol-COL-18 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 ;