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.r343-tall-167889215000006.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 RERS17pb113-PT-2, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215000006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679120788349

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=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb113-PT-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 06:26:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 06:26:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:26:30] [INFO ] Load time of PNML (sax parser for PT used): 582 ms
[2023-03-18 06:26:30] [INFO ] Transformed 639 places.
[2023-03-18 06:26:30] [INFO ] Transformed 31353 transitions.
[2023-03-18 06:26:30] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 760 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 20 ms.73320KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
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 13 rules in 829 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 834 ms. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 977840 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=32 )
[2023-03-18 06:27:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-18 06:27:02] [INFO ] Computed 13 place invariants in 133 ms
[2023-03-18 06:27:05] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2023-03-18 06:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:20] [INFO ] [Real]Absence check using state equation in 14604 ms returned sat
[2023-03-18 06:27:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:27:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-18 06:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:40] [INFO ] [Nat]Absence check using state equation in 16208 ms returned sat
[2023-03-18 06:27:40] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:27:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:27:46] [INFO ] [Nat]Added 268 Read/Feed constraints in 5852 ms returned sat
[2023-03-18 06:27:48] [INFO ] Deduced a trap composed of 24 places in 1309 ms of which 4 ms to minimize.
[2023-03-18 06:27:49] [INFO ] Deduced a trap composed of 65 places in 1188 ms of which 1 ms to minimize.
[2023-03-18 06:27:51] [INFO ] Deduced a trap composed of 40 places in 1467 ms of which 0 ms to minimize.
[2023-03-18 06:27:53] [INFO ] Deduced a trap composed of 48 places in 1368 ms of which 2 ms to minimize.
[2023-03-18 06:27:55] [INFO ] Deduced a trap composed of 48 places in 1709 ms of which 0 ms to minimize.
[2023-03-18 06:27:58] [INFO ] Deduced a trap composed of 64 places in 1480 ms of which 1 ms to minimize.
[2023-03-18 06:28:00] [INFO ] Deduced a trap composed of 40 places in 1953 ms of which 0 ms to minimize.
[2023-03-18 06:28:02] [INFO ] Deduced a trap composed of 64 places in 1688 ms of which 1 ms to minimize.
[2023-03-18 06:28:04] [INFO ] Deduced a trap composed of 48 places in 1409 ms of which 1 ms to minimize.
[2023-03-18 06:28:06] [INFO ] Deduced a trap composed of 40 places in 1798 ms of which 1 ms to minimize.
[2023-03-18 06:28:08] [INFO ] Deduced a trap composed of 48 places in 1516 ms of which 0 ms to minimize.
[2023-03-18 06:28:09] [INFO ] Deduced a trap composed of 64 places in 1107 ms of which 0 ms to minimize.
[2023-03-18 06:28:11] [INFO ] Deduced a trap composed of 64 places in 1057 ms of which 1 ms to minimize.
[2023-03-18 06:28:12] [INFO ] Deduced a trap composed of 64 places in 669 ms of which 1 ms to minimize.
[2023-03-18 06:28:13] [INFO ] Deduced a trap composed of 40 places in 752 ms of which 0 ms to minimize.
[2023-03-18 06:28:14] [INFO ] Deduced a trap composed of 48 places in 719 ms of which 1 ms to minimize.
[2023-03-18 06:28:16] [INFO ] Deduced a trap composed of 64 places in 832 ms of which 1 ms to minimize.
[2023-03-18 06:28:17] [INFO ] Deduced a trap composed of 64 places in 571 ms of which 1 ms to minimize.
[2023-03-18 06:28:18] [INFO ] Deduced a trap composed of 40 places in 523 ms of which 0 ms to minimize.
[2023-03-18 06:28:19] [INFO ] Deduced a trap composed of 40 places in 686 ms of which 1 ms to minimize.
[2023-03-18 06:28:20] [INFO ] Deduced a trap composed of 64 places in 604 ms of which 0 ms to minimize.
[2023-03-18 06:28:21] [INFO ] Deduced a trap composed of 48 places in 511 ms of which 1 ms to minimize.
[2023-03-18 06:28:23] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 36942 ms
[2023-03-18 06:28:25] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2395 ms.
[2023-03-18 06:28:27] [INFO ] Added : 0 causal constraints over 0 iterations in 3595 ms. Result :sat
Interrupted Parikh directed walk after 45892 steps, including 45892 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Parikh directed walk for 45892 steps, including 45892 resets, run took 30002 ms. (steps per millisecond=1 )
Random directed walk for 500005 steps, including 0 resets, run took 19495 ms (no deadlock found). (steps per millisecond=25 )
Random walk for 500000 steps, including 0 resets, run took 13054 ms (no deadlock found). (steps per millisecond=38 )
Random directed walk for 500000 steps, including 0 resets, run took 20119 ms (no deadlock found). (steps per millisecond=24 )
Random walk for 500000 steps, including 0 resets, run took 13753 ms (no deadlock found). (steps per millisecond=36 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 626/626 places, 31352/31352 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 235 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-18 06:30:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:04] [INFO ] Invariant cache hit.
[2023-03-18 06:30:06] [INFO ] Implicit Places using invariants in 1893 ms returned []
Implicit Place search using SMT only with invariants took 1896 ms to find 0 implicit places.
[2023-03-18 06:30:06] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:06] [INFO ] Invariant cache hit.
[2023-03-18 06:30:14] [INFO ] Dead Transitions using invariants and state equation in 8173 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 10306 ms. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 1067526 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=35 )
[2023-03-18 06:30:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:44] [INFO ] Invariant cache hit.
[2023-03-18 06:30:47] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-18 06:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:03] [INFO ] [Real]Absence check using state equation in 15993 ms returned sat
[2023-03-18 06:31:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:31:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-18 06:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:23] [INFO ] [Nat]Absence check using state equation in 15708 ms returned sat
[2023-03-18 06:31:23] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:31:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:31:26] [INFO ] [Nat]Added 268 Read/Feed constraints in 3675 ms returned sat
[2023-03-18 06:31:28] [INFO ] Deduced a trap composed of 48 places in 1454 ms of which 1 ms to minimize.
[2023-03-18 06:31:30] [INFO ] Deduced a trap composed of 40 places in 1590 ms of which 0 ms to minimize.
[2023-03-18 06:31:32] [INFO ] Deduced a trap composed of 40 places in 1444 ms of which 0 ms to minimize.
[2023-03-18 06:31:34] [INFO ] Deduced a trap composed of 64 places in 1498 ms of which 0 ms to minimize.
[2023-03-18 06:31:36] [INFO ] Deduced a trap composed of 40 places in 1477 ms of which 0 ms to minimize.
[2023-03-18 06:31:38] [INFO ] Deduced a trap composed of 64 places in 1603 ms of which 0 ms to minimize.
[2023-03-18 06:31:40] [INFO ] Deduced a trap composed of 48 places in 1396 ms of which 0 ms to minimize.
[2023-03-18 06:31:42] [INFO ] Deduced a trap composed of 64 places in 1243 ms of which 1 ms to minimize.
[2023-03-18 06:31:44] [INFO ] Deduced a trap composed of 64 places in 1771 ms of which 1 ms to minimize.
[2023-03-18 06:31:46] [INFO ] Deduced a trap composed of 64 places in 1350 ms of which 0 ms to minimize.
[2023-03-18 06:31:47] [INFO ] Deduced a trap composed of 40 places in 968 ms of which 1 ms to minimize.
[2023-03-18 06:31:49] [INFO ] Deduced a trap composed of 64 places in 1124 ms of which 1 ms to minimize.
[2023-03-18 06:31:50] [INFO ] Deduced a trap composed of 40 places in 834 ms of which 2 ms to minimize.
[2023-03-18 06:31:52] [INFO ] Deduced a trap composed of 48 places in 840 ms of which 1 ms to minimize.
[2023-03-18 06:31:53] [INFO ] Deduced a trap composed of 48 places in 686 ms of which 1 ms to minimize.
[2023-03-18 06:31:54] [INFO ] Deduced a trap composed of 48 places in 857 ms of which 0 ms to minimize.
[2023-03-18 06:31:55] [INFO ] Deduced a trap composed of 64 places in 767 ms of which 1 ms to minimize.
[2023-03-18 06:31:57] [INFO ] Deduced a trap composed of 48 places in 566 ms of which 0 ms to minimize.
[2023-03-18 06:31:58] [INFO ] Deduced a trap composed of 40 places in 564 ms of which 0 ms to minimize.
[2023-03-18 06:31:58] [INFO ] Deduced a trap composed of 65 places in 485 ms of which 0 ms to minimize.
[2023-03-18 06:32:00] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 0 ms to minimize.
[2023-03-18 06:32:01] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 34133 ms
[2023-03-18 06:32:03] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2067 ms.
[2023-03-18 06:32:04] [INFO ] Added : 0 causal constraints over 0 iterations in 3138 ms. Result :sat
Parikh directed walk for 362600 steps, including 1000 resets, run took 10447 ms. (steps per millisecond=34 )
Random directed walk for 500001 steps, including 0 resets, run took 19110 ms (no deadlock found). (steps per millisecond=26 )
Random walk for 500000 steps, including 0 resets, run took 13155 ms (no deadlock found). (steps per millisecond=38 )
Random directed walk for 500014 steps, including 0 resets, run took 19276 ms (no deadlock found). (steps per millisecond=25 )
Random walk for 500000 steps, including 0 resets, run took 14302 ms (no deadlock found). (steps per millisecond=34 )
[2023-03-18 06:33:22] [INFO ] Flatten gal took : 1104 ms
[2023-03-18 06:33:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 06:33:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 639 places, 31353 transitions and 125418 arcs took 104 ms.
Total runtime 412484 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 15354440 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16116088 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityDeadlock -timeout 180 -rebuildPNML
mcc2023

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="RERS17pb113-PT-2"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb113-PT-2, 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 r343-tall-167889215000006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-2.tgz
mv RERS17pb113-PT-2 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 ;