About the Execution of LTSMin+red for StigmergyCommit-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
249.147 | 9036.00 | 18342.00 | 457.20 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r471-smll-167912659800268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is StigmergyCommit-PT-04a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r471-smll-167912659800268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 11:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 11:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 227K Mar 5 18:23 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 StableMarking
=== Now, execution of the tool begins
BK_START 1679381842339
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-04a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 06:57:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-21 06:57:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 06:57:25] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-21 06:57:25] [INFO ] Transformed 184 places.
[2023-03-21 06:57:25] [INFO ] Transformed 592 transitions.
[2023-03-21 06:57:25] [INFO ] Found NUPN structural information;
[2023-03-21 06:57:25] [INFO ] Parsed PT model containing 184 places and 592 transitions and 4011 arcs in 467 ms.
Structural test allowed to assert that 12 places are NOT stable. Took 17 ms.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 1180 ms. (steps per millisecond=8 ) properties (out of 172) seen :166
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-21 06:57:27] [INFO ] Flow matrix only has 286 transitions (discarded 15 similar events)
// Phase 1: matrix 286 rows 184 cols
[2023-03-21 06:57:27] [INFO ] Computed 6 place invariants in 15 ms
[2023-03-21 06:57:27] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 06:57:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-21 06:57:28] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 06:57:28] [INFO ] State equation strengthened by 131 read => feed constraints.
[2023-03-21 06:57:28] [INFO ] After 67ms SMT Verify possible using 131 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 06:57:28] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 13 ms to minimize.
[2023-03-21 06:57:28] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2023-03-21 06:57:28] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 2 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-21 06:57:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1564 ms
[2023-03-21 06:57:29] [INFO ] After 1654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-21 06:57:29] [INFO ] After 2116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 301/301 transitions.
Graph (complete) has 363 edges and 184 vertex of which 179 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 179 transition count 250
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 54 rules applied. Total rules applied 101 place count 149 transition count 226
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 144 transition count 226
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 106 place count 144 transition count 191
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 176 place count 109 transition count 191
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 202 place count 83 transition count 165
Iterating global reduction 3 with 26 rules applied. Total rules applied 228 place count 83 transition count 165
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 254 place count 57 transition count 139
Iterating global reduction 3 with 26 rules applied. Total rules applied 280 place count 57 transition count 139
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 316 place count 57 transition count 103
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 322 place count 51 transition count 97
Iterating global reduction 4 with 6 rules applied. Total rules applied 328 place count 51 transition count 97
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 334 place count 45 transition count 91
Iterating global reduction 4 with 6 rules applied. Total rules applied 340 place count 45 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 345 place count 45 transition count 86
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 363 place count 36 transition count 77
Drop transitions removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 371 place count 36 transition count 69
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 375 place count 32 transition count 65
Iterating global reduction 6 with 4 rules applied. Total rules applied 379 place count 32 transition count 65
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 383 place count 28 transition count 61
Iterating global reduction 6 with 4 rules applied. Total rules applied 387 place count 28 transition count 61
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 391 place count 24 transition count 57
Iterating global reduction 6 with 4 rules applied. Total rules applied 395 place count 24 transition count 57
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 397 place count 24 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 399 place count 24 transition count 55
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 400 place count 24 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 401 place count 23 transition count 53
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 5 rules applied. Total rules applied 406 place count 22 transition count 49
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 410 place count 18 transition count 49
Performed 6 Post agglomeration using F-continuation condition with reduction of 25 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 422 place count 12 transition count 18
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 427 place count 12 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 439 place count 4 transition count 9
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 3 edges and 4 vertex of which 2 / 4 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 5 rules applied. Total rules applied 444 place count 3 transition count 5
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 446 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 447 place count 3 transition count 3
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 448 place count 2 transition count 2
Iterating global reduction 11 with 1 rules applied. Total rules applied 449 place count 2 transition count 2
Applied a total of 449 rules in 126 ms. Remains 2 /184 variables (removed 182) and now considering 2/301 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 2/184 places, 2/301 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Able to resolve query StableMarking after proving 173 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 4725 ms.
ITS solved all properties within timeout
BK_STOP 1679381851375
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="StigmergyCommit-PT-04a"
export BK_EXAMINATION="StableMarking"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-04a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r471-smll-167912659800268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04a.tgz
mv StigmergyCommit-PT-04a execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;