About the Execution of LTSMin+red for PolyORBLF-PT-S02J06T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1832.111 | 45084.00 | 65386.00 | 57.80 | 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-171654455700161.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-S02J06T10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455700161
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.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 1.1M 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 1717269634257
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-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:20:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 19:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:20:35] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 19:20:35] [INFO ] Transformed 844 places.
[2024-06-01 19:20:35] [INFO ] Transformed 1812 transitions.
[2024-06-01 19:20:35] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 267 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.22434KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 844/844 places, 1652/1652 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 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
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 542 rules in 279 ms. Remains 572 /844 variables (removed 272) and now considering 1382/1652 (removed 270) transitions.
Running 1380 sub problems to find dead transitions.
[2024-06-01 19:20:36] [INFO ] Flow matrix only has 1362 transitions (discarded 20 similar events)
// Phase 1: matrix 1362 rows 572 cols
[2024-06-01 19:20:36] [INFO ] Computed 56 invariants in 74 ms
[2024-06-01 19:20:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 17 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:20:51] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:20:52] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 3 ms to minimize.
[2024-06-01 19:20:52] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 4 ms to minimize.
[2024-06-01 19:20:52] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 3 ms to minimize.
[2024-06-01 19:20:53] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:20:53] [INFO ] Deduced a trap composed of 201 places in 343 ms of which 6 ms to minimize.
[2024-06-01 19:20:53] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:20:54] [INFO ] Deduced a trap composed of 89 places in 356 ms of which 3 ms to minimize.
[2024-06-01 19:20:55] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:20:57] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1934 variables, and 70 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20117 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1380/1380 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1934 variables, and 70 constraints, problems are : Problem set: 0 solved, 1380 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/572 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1380 constraints, Known Traps: 16/16 constraints]
After SMT, in 43069ms problems are : Problem set: 0 solved, 1380 unsolved
Search for dead transitions found 0 dead transitions in 43125ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 43459 ms. Remains : 572/844 places, 1382/1652 transitions.
Finished random walk after 149 steps, including 0 resets, run found a deadlock after 5 ms. (steps per millisecond=29 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 43825 ms.
ITS solved all properties within timeout
BK_STOP 1717269679341
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S02J06T10"
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-S02J06T10, 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-171654455700161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 ;