About the Execution of LTSMin+red for LeafsetExtension-PT-S08C3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
358.924 | 6091.00 | 12406.00 | 25.30 | 3 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 | normal |
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.r504-tall-171649612500325.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 LeafsetExtension-PT-S08C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612500325
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 254K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S08C3-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717228247035
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S08C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:50:48] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-06-01 07:50:48] [INFO ] Transformed 462 places.
[2024-06-01 07:50:48] [INFO ] Transformed 409 transitions.
[2024-06-01 07:50:48] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 409 rows 462 cols
[2024-06-01 07:50:48] [INFO ] Computed 53 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, 1, +inf, 1, 1, 1, 1, +inf, 1, 1, +inf, 1, +inf, +inf]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (380 resets) in 47 ms. (208 steps per ms)
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (448 resets) in 75 ms. (921 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1, 1, 2, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 07:50:48] [INFO ] Invariant cache hit.
[2024-06-01 07:50:48] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-06-01 07:50:48] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 21 ms returned sat
[2024-06-01 07:50:49] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-06-01 07:50:49] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 35 ms.
[2024-06-01 07:50:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:50:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 07:50:49] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned sat
[2024-06-01 07:50:49] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-01 07:50:49] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 26 ms.
[2024-06-01 07:50:49] [INFO ] Added : 13 causal constraints over 3 iterations in 141 ms. Result :sat
Minimization took 164 ms.
[2024-06-01 07:50:49] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 07:50:49] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 14 ms returned unsat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned unsat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned sat
[2024-06-01 07:50:50] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-01 07:50:50] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 26 ms.
[2024-06-01 07:50:50] [INFO ] Added : 9 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 174 ms.
[2024-06-01 07:50:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:50:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-01 07:50:50] [INFO ] [Nat]Absence check using 11 positive and 42 generalized place invariants in 11 ms returned sat
[2024-06-01 07:50:50] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-01 07:50:50] [INFO ] Computed and/alt/rep : 398/600/398 causal constraints (skipped 2 transitions) in 35 ms.
[2024-06-01 07:50:51] [INFO ] Added : 9 causal constraints over 2 iterations in 118 ms. Result :sat
Minimization took 156 ms.
[2024-06-01 07:50:51] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 07:50:51] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 10 ms returned unsat
[2024-06-01 07:50:51] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 07:50:51] [INFO ] [Real]Absence check using 11 positive and 42 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1, 1, 2, 1, 1] Max Struct:[+inf, 1, 1, 1, +inf, 1, 1]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 409/409 transitions.
Graph (complete) has 849 edges and 462 vertex of which 46 are kept as prefixes of interest. Removing 416 places using SCC suffix rule.1 ms
Discarding 416 places :
Also discarding 235 output transitions
Drop transitions (Output transitions of discarded places.) removed 235 transitions
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 38 transition count 79
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 110 place count 32 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 110 place count 32 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 120 place count 27 transition count 74
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 126 place count 21 transition count 68
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 21 transition count 68
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 21 transition count 60
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 148 place count 13 transition count 60
Applied a total of 148 rules in 44 ms. Remains 13 /462 variables (removed 449) and now considering 60/409 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 13/462 places, 60/409 transitions.
[2024-06-01 07:50:51] [INFO ] Flow matrix only has 20 transitions (discarded 40 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-06-01 07:50:51] [INFO ] Flow matrix only has 20 transitions (discarded 40 similar events)
// Phase 1: matrix 20 rows 13 cols
[2024-06-01 07:50:51] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
RANDOM walk for 1000001 steps (139176 resets) in 956 ms. (1044 steps per ms)
BEST_FIRST walk for 2000002 steps (35747 resets) in 594 ms. (3361 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[+inf, +inf]
[2024-06-01 07:50:53] [INFO ] Flow matrix only has 20 transitions (discarded 40 similar events)
[2024-06-01 07:50:53] [INFO ] Invariant cache hit.
[2024-06-01 07:50:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 07:50:53] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2024-06-01 07:50:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 07:50:53] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[3, 3]
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S08C3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 4868 ms.
ITS solved all properties within timeout
BK_STOP 1717228253126
--------------------
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 UpperBounds -timeout 360 -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="LeafsetExtension-PT-S08C3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 LeafsetExtension-PT-S08C3, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612500325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S08C3.tgz
mv LeafsetExtension-PT-S08C3 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;