About the Execution of LTSMin+red for PolyORBLF-PT-S02J04T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1127.792 | 45260.00 | 66746.00 | 83.50 | T | normal |
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-171654455700141.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 ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700141
=====================================================================
--------------------
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 ReachabilityDeadlock
=== Now, execution of the tool begins
BK_START 1717269538963
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
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:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:00] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-06-01 19:19:00] [INFO ] Transformed 614 places.
[2024-06-01 19:19:00] [INFO ] Transformed 1242 transitions.
[2024-06-01 19:19:00] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 300 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.19203KB 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
Ensure Unique test removed 2 places
Computed a total of 0 stabilizing places and 0 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 540 transition count 1042
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 146 place count 540 transition count 978
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 274 place count 476 transition count 978
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 402 place count 412 transition count 914
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 402 rules in 445 ms. Remains 412 /614 variables (removed 202) and now considering 914/1114 (removed 200) transitions.
Running 912 sub problems to find dead transitions.
[2024-06-01 19:19:01] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2024-06-01 19:19:01] [INFO ] Computed 48 invariants in 70 ms
[2024-06-01 19:19:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 16 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 5 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 14 ms to minimize.
[2024-06-01 19:19:12] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 71 places in 323 ms of which 4 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 10 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:19:13] [INFO ] Deduced a trap composed of 145 places in 296 ms of which 3 ms to minimize.
[2024-06-01 19:19:14] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:19:14] [INFO ] Deduced a trap composed of 142 places in 217 ms of which 3 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 2 ms to minimize.
[2024-06-01 19:19:16] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 209 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:19:20] [INFO ] Deduced a trap composed of 181 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 3 ms to minimize.
[2024-06-01 19:19:21] [INFO ] Deduced a trap composed of 175 places in 322 ms of which 2 ms to minimize.
[2024-06-01 19:19:22] [INFO ] Deduced a trap composed of 178 places in 245 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1310 variables, and 66 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1310 variables, and 66 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 20/20 constraints]
After SMT, in 42411ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 42483ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 43029 ms. Remains : 412/614 places, 914/1114 transitions.
Finished random walk after 308 steps, including 0 resets, run found a deadlock after 8 ms. (steps per millisecond=38 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 43483 ms.
ITS solved all properties within timeout
BK_STOP 1717269584223
--------------------
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 ReachabilityDeadlock -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="ReachabilityDeadlock"
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 ReachabilityDeadlock"
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-171654455700141"
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 [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;