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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 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 450K 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 1717248040461

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:20:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:20:43] [INFO ] Load time of PNML (sax parser for PT used): 503 ms
[2024-06-01 13:20:43] [INFO ] Transformed 1295 places.
[2024-06-01 13:20:43] [INFO ] Transformed 749 transitions.
[2024-06-01 13:20:43] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 738 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1295/1295 places, 749/749 transitions.
Reduce places removed 1053 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 1293 rules applied. Total rules applied 1293 place count 242 transition count 509
Applied a total of 1293 rules in 88 ms. Remains 242 /1295 variables (removed 1053) and now considering 509/749 (removed 240) transitions.
// Phase 1: matrix 509 rows 242 cols
[2024-06-01 13:20:43] [INFO ] Computed 5 invariants in 60 ms
[2024-06-01 13:20:44] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2024-06-01 13:20:44] [INFO ] Invariant cache hit.
[2024-06-01 13:20:45] [INFO ] State equation strengthened by 347 read => feed constraints.
[2024-06-01 13:20:47] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 3621 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2024-06-01 13:20:47] [INFO ] Invariant cache hit.
[2024-06-01 13:20:47] [INFO ] State equation strengthened by 347 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-01 13:20:58] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 55 ms to minimize.
[2024-06-01 13:20:58] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-01 13:20:59] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:21:03] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-01 13:21:08] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (OVERLAPS) 1/242 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/751 variables, and 10 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/242 constraints, ReadFeed: 0/347 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-01 13:21:21] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 4 ms to minimize.
[2024-06-01 13:21:21] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-06-01 13:21:21] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 4 ms to minimize.
[2024-06-01 13:21:21] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-06-01 13:21:21] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 13:21:22] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-06-01 13:21:22] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (OVERLAPS) 1/242 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-01 13:21:34] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 3 ms to minimize.
[2024-06-01 13:21:34] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 3 ms to minimize.
[2024-06-01 13:21:34] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 13:21:34] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 4 ms to minimize.
[2024-06-01 13:21:35] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2024-06-01 13:21:35] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 3 ms to minimize.
[2024-06-01 13:21:35] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 3 ms to minimize.
[2024-06-01 13:21:35] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 3 ms to minimize.
[2024-06-01 13:21:36] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 4 ms to minimize.
[2024-06-01 13:21:36] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-06-01 13:21:36] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 508 unsolved
[2024-06-01 13:21:37] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 9 (OVERLAPS) 509/751 variables, 242/271 constraints. Problems are: Problem set: 13 solved, 495 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 347/618 constraints. Problems are: Problem set: 13 solved, 495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 1113 constraints, problems are : Problem set: 13 solved, 495 unsolved in 30343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 242/242 constraints, ReadFeed: 347/347 constraints, PredecessorRefiner: 495/508 constraints, Known Traps: 24/24 constraints]
After SMT, in 62616ms problems are : Problem set: 13 solved, 495 unsolved
Search for dead transitions found 13 dead transitions in 62666ms
Found 13 dead transitions using SMT.
FORMULA QuasiLiveness FALSE TECHNIQUES STRUCTURAL_REDUCTION
Total runtime 67297 ms.
ITS solved all properties within timeout

BK_STOP 1717248110111

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

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