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.r510-tall-171654365200386.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 NoC3x3-PT-5A, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r510-tall-171654365200386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 07:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 248K 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 1717232187856

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-5A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:56:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 08:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:56:29] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-06-01 08:56:29] [INFO ] Transformed 417 places.
[2024-06-01 08:56:29] [INFO ] Transformed 933 transitions.
[2024-06-01 08:56:29] [INFO ] Found NUPN structural information;
[2024-06-01 08:56:29] [INFO ] Parsed PT model containing 417 places and 933 transitions and 3585 arcs in 237 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 6 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.16196KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 417/417 places, 933/933 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 338 transition count 744
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 338 transition count 744
Computed a total of 10 stabilizing places and 1 stable transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 162 place count 334 transition count 728
Iterating global reduction 0 with 4 rules applied. Total rules applied 166 place count 334 transition count 728
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Computed a total of 10 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 8 rules applied. Total rules applied 174 place count 334 transition count 720
Computed a total of 10 stabilizing places and 1 stable transitions
Computed a total of 10 stabilizing places and 1 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 192 place count 334 transition count 702
Reduce places removed 2 places and 0 transitions.
Computed a total of 8 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 194 place count 332 transition count 702
Computed a total of 8 stabilizing places and 1 stable transitions
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 330 transition count 696
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 330 transition count 696
Computed a total of 8 stabilizing places and 1 stable transitions
Computed a total of 8 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 199 place count 329 transition count 695
Reduce places removed 7 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 2 with 7 rules applied. Total rules applied 206 place count 322 transition count 695
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 206 rules in 202 ms. Remains 322 /417 variables (removed 95) and now considering 695/933 (removed 238) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 217 ms. Remains : 322/417 places, 695/933 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3734 ms (no deadlock found). (steps per millisecond=334 )
Random directed walk for 1250008 steps, including 0 resets, run took 3180 ms (no deadlock found). (steps per millisecond=393 )
// Phase 1: matrix 695 rows 322 cols
[2024-06-01 08:56:36] [INFO ] Computed 57 invariants in 18 ms
[2024-06-01 08:56:37] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-06-01 08:56:37] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-06-01 08:56:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:56:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 14 ms returned sat
[2024-06-01 08:56:37] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2024-06-01 08:56:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 08:56:37] [INFO ] [Nat]Added 18 Read/Feed constraints in 26 ms returned sat
[2024-06-01 08:56:38] [INFO ] Computed and/alt/rep : 630/2391/630 causal constraints (skipped 34 transitions) in 46 ms.
[2024-06-01 08:56:42] [INFO ] Added : 470 causal constraints over 94 iterations in 4165 ms. Result :sat
Parikh directed walk for 120000 steps, including 799 resets, run took 650 ms. (steps per millisecond=184 )
Random directed walk for 500007 steps, including 0 resets, run took 1334 ms (no deadlock found). (steps per millisecond=374 )
Random walk for 500000 steps, including 0 resets, run took 1684 ms (no deadlock found). (steps per millisecond=296 )
Random directed walk for 500003 steps, including 0 resets, run took 1245 ms (no deadlock found). (steps per millisecond=401 )
Random walk for 500000 steps, including 0 resets, run took 1717 ms (no deadlock found). (steps per millisecond=291 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 322/322 places, 695/695 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 13 ms. Remains 322 /322 variables (removed 0) and now considering 695/695 (removed 0) transitions.
[2024-06-01 08:56:48] [INFO ] Invariant cache hit.
[2024-06-01 08:56:49] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 08:56:49] [INFO ] Invariant cache hit.
[2024-06-01 08:56:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 08:56:49] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2024-06-01 08:56:49] [INFO ] Redundant transitions in 34 ms returned []
Running 664 sub problems to find dead transitions.
[2024-06-01 08:56:49] [INFO ] Invariant cache hit.
[2024-06-01 08:56:49] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (OVERLAPS) 695/1017 variables, 322/379 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1017 variables, 18/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 5 (OVERLAPS) 0/1017 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 397 constraints, problems are : Problem set: 0 solved, 664 unsolved in 28040 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 322/322 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 664 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 2 (OVERLAPS) 695/1017 variables, 322/379 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1017 variables, 18/397 constraints. Problems are: Problem set: 0 solved, 664 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1017 variables, 664/1061 constraints. Problems are: Problem set: 0 solved, 664 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 1061 constraints, problems are : Problem set: 0 solved, 664 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 322/322 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 664/664 constraints, Known Traps: 0/0 constraints]
After SMT, in 58351ms problems are : Problem set: 0 solved, 664 unsolved
Search for dead transitions found 0 dead transitions in 58372ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 59021 ms. Remains : 322/322 places, 695/695 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3736 ms (no deadlock found). (steps per millisecond=334 )
Random directed walk for 1250005 steps, including 0 resets, run took 3127 ms (no deadlock found). (steps per millisecond=399 )
[2024-06-01 08:57:54] [INFO ] Invariant cache hit.
[2024-06-01 08:57:54] [INFO ] [Real]Absence check using 57 positive place invariants in 15 ms returned sat
[2024-06-01 08:57:55] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-06-01 08:57:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:57:55] [INFO ] [Nat]Absence check using 57 positive place invariants in 15 ms returned sat
[2024-06-01 08:57:55] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-06-01 08:57:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 08:57:55] [INFO ] [Nat]Added 18 Read/Feed constraints in 114 ms returned sat
[2024-06-01 08:57:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 11 ms to minimize.
[2024-06-01 08:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-06-01 08:57:56] [INFO ] Computed and/alt/rep : 630/2391/630 causal constraints (skipped 34 transitions) in 52 ms.
[2024-06-01 08:58:00] [INFO ] Added : 466 causal constraints over 94 iterations in 4060 ms. Result :sat
Parikh directed walk for 117300 steps, including 761 resets, run took 558 ms. (steps per millisecond=210 )
Random directed walk for 500006 steps, including 0 resets, run took 1300 ms (no deadlock found). (steps per millisecond=384 )
Random walk for 500000 steps, including 0 resets, run took 1711 ms (no deadlock found). (steps per millisecond=292 )
Random directed walk for 500007 steps, including 0 resets, run took 1264 ms (no deadlock found). (steps per millisecond=395 )
Random walk for 500000 steps, including 0 resets, run took 1727 ms (no deadlock found). (steps per millisecond=289 )
[2024-06-01 08:58:07] [INFO ] Flatten gal took : 110 ms
[2024-06-01 08:58:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2024-06-01 08:58:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 417 places, 933 transitions and 3585 arcs took 9 ms.
Total runtime 97837 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ReachabilityDeadlock

BK_STOP 1717232287351

--------------------
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
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="NoC3x3-PT-5A"
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 NoC3x3-PT-5A, 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 r510-tall-171654365200386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-5A.tgz
mv NoC3x3-PT-5A 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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;