About the Execution of LTSMin+red for ShieldPPPt-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
733.428 | 66632.00 | 78273.00 | 260.80 | [undef] | Cannot compute |
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.r530-tall-171683779300406.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 ShieldPPPt-PT-030B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779300406
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 569K 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 1717225814089
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:10:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 07:10:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:10:15] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 07:10:15] [INFO ] Transformed 2343 places.
[2024-06-01 07:10:15] [INFO ] Transformed 2133 transitions.
[2024-06-01 07:10:15] [INFO ] Found NUPN structural information;
[2024-06-01 07:10:15] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 356 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 6 ms.24659KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 573 transitions
Trivial Post-agglo rules discarded 573 transitions
Performed 573 trivial Post agglomeration. Transition count delta: 573
Iterating post reduction 0 with 573 rules applied. Total rules applied 573 place count 2343 transition count 1560
Reduce places removed 573 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 575 rules applied. Total rules applied 1148 place count 1770 transition count 1558
Reduce places removed 1 places and 0 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 1149 place count 1769 transition count 1558
Computed a total of 360 stabilizing places and 360 stable transitions
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 1149 place count 1769 transition count 1438
Deduced a syphon composed of 120 places in 4 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1389 place count 1649 transition count 1438
Computed a total of 360 stabilizing places and 360 stable transitions
Discarding 210 places :
Symmetric choice reduction at 3 with 210 rule applications. Total rules 1599 place count 1439 transition count 1228
Iterating global reduction 3 with 210 rules applied. Total rules applied 1809 place count 1439 transition count 1228
Computed a total of 240 stabilizing places and 240 stable transitions
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 1809 place count 1439 transition count 1138
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1989 place count 1349 transition count 1138
Computed a total of 241 stabilizing places and 240 stable transitions
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 3 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 3 with 1018 rules applied. Total rules applied 3007 place count 840 transition count 629
Computed a total of 2 stabilizing places and 1 stable transitions
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 3185 place count 751 transition count 629
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3186 place count 750 transition count 628
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 3187 place count 749 transition count 628
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3187 place count 749 transition count 626
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3191 place count 747 transition count 626
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 3191 rules in 825 ms. Remains 747 /2343 variables (removed 1596) and now considering 626/2133 (removed 1507) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 839 ms. Remains : 747/2343 places, 626/2133 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6300 ms (no deadlock found). (steps per millisecond=198 )
Random directed walk for 1250002 steps, including 0 resets, run took 4662 ms (no deadlock found). (steps per millisecond=268 )
// Phase 1: matrix 626 rows 747 cols
[2024-06-01 07:10:27] [INFO ] Computed 330 invariants in 15 ms
[2024-06-01 07:10:28] [INFO ] [Real]Absence check using 330 positive place invariants in 159 ms returned sat
[2024-06-01 07:10:28] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2024-06-01 07:10:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:10:29] [INFO ] [Nat]Absence check using 330 positive place invariants in 131 ms returned sat
[2024-06-01 07:10:30] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2024-06-01 07:10:30] [INFO ] Computed and/alt/rep : 622/979/622 causal constraints (skipped 0 transitions) in 49 ms.
[2024-06-01 07:10:37] [INFO ] Added : 568 causal constraints over 115 iterations in 7135 ms. Result :sat
Parikh directed walk for 253100 steps, including 1025 resets, run took 1481 ms. (steps per millisecond=170 )
Random directed walk for 500001 steps, including 0 resets, run took 2088 ms (no deadlock found). (steps per millisecond=239 )
Random walk for 500000 steps, including 0 resets, run took 2721 ms (no deadlock found). (steps per millisecond=183 )
Random directed walk for 500000 steps, including 0 resets, run took 2055 ms (no deadlock found). (steps per millisecond=243 )
Random walk for 500000 steps, including 0 resets, run took 2662 ms (no deadlock found). (steps per millisecond=187 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 747/747 places, 626/626 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 21 ms. Remains 747 /747 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-06-01 07:10:48] [INFO ] Invariant cache hit.
[2024-06-01 07:10:48] [INFO ] Implicit Places using invariants in 406 ms returned [730, 734]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 409 ms to find 2 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 745/747 places, 626/626 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 743 transition count 624
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 4 rules in 44 ms. Remains 743 /745 variables (removed 2) and now considering 624/626 (removed 2) transitions.
// Phase 1: matrix 624 rows 743 cols
[2024-06-01 07:10:48] [INFO ] Computed 328 invariants in 3 ms
[2024-06-01 07:10:49] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-06-01 07:10:49] [INFO ] Invariant cache hit.
[2024-06-01 07:10:49] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 743/747 places, 624/626 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 1514 ms. Remains : 743/747 places, 624/626 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6326 ms (no deadlock found). (steps per millisecond=197 )
Random directed walk for 1250000 steps, including 0 resets, run took 4672 ms (no deadlock found). (steps per millisecond=267 )
[2024-06-01 07:11:00] [INFO ] Invariant cache hit.
[2024-06-01 07:11:01] [INFO ] [Real]Absence check using 328 positive place invariants in 132 ms returned sat
[2024-06-01 07:11:01] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2024-06-01 07:11:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:11:02] [INFO ] [Nat]Absence check using 328 positive place invariants in 127 ms returned sat
[2024-06-01 07:11:03] [INFO ] [Nat]Absence check using state equation in 809 ms returned sat
[2024-06-01 07:11:03] [INFO ] Computed and/alt/rep : 620/973/620 causal constraints (skipped 0 transitions) in 34 ms.
[2024-06-01 07:11:09] [INFO ] Added : 544 causal constraints over 109 iterations in 6419 ms. Result :sat
Parikh directed walk for 263300 steps, including 1000 resets, run took 1513 ms. (steps per millisecond=174 )
Random directed walk for 500002 steps, including 0 resets, run took 1958 ms (no deadlock found). (steps per millisecond=255 )
Random walk for 500000 steps, including 0 resets, run took 2571 ms (no deadlock found). (steps per millisecond=194 )
Random directed walk for 500002 steps, including 0 resets, run took 1966 ms (no deadlock found). (steps per millisecond=254 )
Random walk for 500000 steps, including 0 resets, run took 2582 ms (no deadlock found). (steps per millisecond=193 )
[2024-06-01 07:11:20] [INFO ] Flatten gal took : 161 ms
[2024-06-01 07:11:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2024-06-01 07:11:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2343 places, 2133 transitions and 5346 arcs took 19 ms.
Total runtime 65300 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ReachabilityDeadlock
BK_STOP 1717225880721
--------------------
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
mcc2024
property name is ReachabilityDeadlock
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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 r530-tall-171683779300406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;