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.r534-smll-171683819100002.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 SieveSingleMsgMbox-PT-d0m04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819100002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 1717247663118

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:14:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:14:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:14:26] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 13:14:26] [INFO ] Transformed 262 places.
[2024-06-01 13:14:26] [INFO ] Transformed 73 transitions.
[2024-06-01 13:14:26] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 381 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 42 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-06-01 13:14:26] [INFO ] Computed 5 invariants in 28 ms
[2024-06-01 13:14:26] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-06-01 13:14:26] [INFO ] Invariant cache hit.
[2024-06-01 13:14:27] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:14:27] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-06-01 13:14:27] [INFO ] Invariant cache hit.
[2024-06-01 13:14:27] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 16 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 3 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 4 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 73/143 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 11 (OVERLAPS) 0/143 variables, 2/118 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 118 constraints, problems are : Problem set: 3 solved, 69 unsolved in 5658 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 2/69 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 6/16 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 73/142 variables, 69/85 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 31/116 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 17/133 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 0/133 constraints. Problems are: Problem set: 3 solved, 69 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
At refinement iteration 14 (OVERLAPS) 1/143 variables, 1/134 constraints. Problems are: Problem set: 8 solved, 64 unsolved
Problem TDEAD67 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 52/186 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 1/187 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/187 constraints. Problems are: Problem set: 9 solved, 63 unsolved
At refinement iteration 18 (OVERLAPS) 0/143 variables, 0/187 constraints. Problems are: Problem set: 9 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 187 constraints, problems are : Problem set: 9 solved, 63 unsolved in 6803 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 69/72 constraints, Known Traps: 12/12 constraints]
After SMT, in 12749ms problems are : Problem set: 9 solved, 63 unsolved
Search for dead transitions found 9 dead transitions in 12780ms
Found 9 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 14394 ms.
ITS solved all properties within timeout

BK_STOP 1717247680215

--------------------
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="SieveSingleMsgMbox-PT-d0m04"
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 SieveSingleMsgMbox-PT-d0m04, 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 r534-smll-171683819100002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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