Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455700144.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J04T08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700144
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K 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 Liveness

=== Now, execution of the tool begins

BK_START 1717269543345

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:04] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-06-01 19:19:04] [INFO ] Transformed 614 places.
[2024-06-01 19:19:04] [INFO ] Transformed 1242 transitions.
[2024-06-01 19:19:04] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 232 ms.
Discarding 128 transitions out of 1242. Remains 1114
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.26909KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 73 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 19:19:05] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-06-01 19:19:05] [INFO ] Computed 50 invariants in 55 ms
[2024-06-01 19:19:05] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 19:19:18] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 27 ms to minimize.
[2024-06-01 19:19:18] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:19:18] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:19:19] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 66 places in 218 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 184 places in 315 ms of which 5 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 334 places in 315 ms of which 7 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 372 places in 294 ms of which 4 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 349 places in 249 ms of which 4 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 422 places in 286 ms of which 3 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 395 places in 296 ms of which 3 ms to minimize.
[2024-06-01 19:19:23] [INFO ] Deduced a trap composed of 339 places in 306 ms of which 5 ms to minimize.
[2024-06-01 19:19:23] [INFO ] Deduced a trap composed of 395 places in 293 ms of which 4 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 330 places in 252 ms of which 4 ms to minimize.
[2024-06-01 19:19:24] [INFO ] Deduced a trap composed of 330 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 295 places in 327 ms of which 4 ms to minimize.
[2024-06-01 19:19:26] [INFO ] Deduced a trap composed of 318 places in 296 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1712 variables, and 68 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 310 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 319 places in 244 ms of which 4 ms to minimize.
[2024-06-01 19:19:41] [INFO ] Deduced a trap composed of 71 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:19:46] [INFO ] Deduced a trap composed of 342 places in 340 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1712 variables, and 72 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 26/26 constraints]
After SMT, in 41649ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41701ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41821 ms. Remains : 614/614 places, 1114/1114 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 48 ms. Remains 614 /614 variables (removed 0) and now considering 1114/1114 (removed 0) transitions.
[2024-06-01 19:19:47] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 19:19:47] [INFO ] Invariant cache hit.
[2024-06-01 19:19:47] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-01 19:19:47] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 19:19:47] [INFO ] Invariant cache hit.
[2024-06-01 19:19:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 19:19:48] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2024-06-01 19:19:48] [INFO ] Redundant transitions in 110 ms returned []
Running 1112 sub problems to find dead transitions.
[2024-06-01 19:19:48] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 19:19:48] [INFO ] Invariant cache hit.
[2024-06-01 19:19:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 19 places in 218 ms of which 3 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 66 places in 40 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:20:00] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 3 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 157 places in 307 ms of which 18 ms to minimize.
[2024-06-01 19:20:01] [INFO ] Deduced a trap composed of 184 places in 338 ms of which 5 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 66 places in 402 ms of which 5 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 303 places in 325 ms of which 4 ms to minimize.
[2024-06-01 19:20:02] [INFO ] Deduced a trap composed of 295 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 328 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 327 places in 250 ms of which 3 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 353 places in 247 ms of which 3 ms to minimize.
[2024-06-01 19:20:03] [INFO ] Deduced a trap composed of 315 places in 245 ms of which 3 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 364 places in 248 ms of which 4 ms to minimize.
[2024-06-01 19:20:04] [INFO ] Deduced a trap composed of 315 places in 258 ms of which 3 ms to minimize.
[2024-06-01 19:20:05] [INFO ] Deduced a trap composed of 395 places in 299 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 310 places in 303 ms of which 4 ms to minimize.
[2024-06-01 19:20:08] [INFO ] Deduced a trap composed of 330 places in 253 ms of which 3 ms to minimize.
[2024-06-01 19:20:09] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 5 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 286 places in 321 ms of which 16 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 410 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:20:19] [INFO ] Deduced a trap composed of 271 places in 270 ms of which 3 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 367 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:20:20] [INFO ] Deduced a trap composed of 350 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 31747ms, After SMT, problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 31773ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 33472 ms. Remains : 614/614 places, 1114/1114 transitions.
Finished random walk after 3969 steps, including 0 resets, run found a deadlock after 24 ms. (steps per millisecond=165 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 75775 ms.
ITS solved all properties within timeout

BK_STOP 1717269620615

--------------------
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 Liveness -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="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="Liveness"
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 PolyORBLF-PT-S02J04T08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455700144"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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