fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r343-tall-167889215100091
Last Updated
May 14, 2023

About the Execution of LTSMin+red for RERS17pb115-PT-1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8646.783 1800000.00 1894037.00 4273.70 [undef] Time out reached

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 13:48 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 13:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:39 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 69M 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 1679127648264

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=RERS17pb115-PT-1
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 08:20:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 08:20:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 08:20:51] [INFO ] Load time of PNML (sax parser for PT used): 1901 ms
[2023-03-18 08:20:52] [INFO ] Transformed 1399 places.
[2023-03-18 08:20:52] [INFO ] Transformed 144369 transitions.
[2023-03-18 08:20:52] [INFO ] Found NUPN structural information;
[2023-03-18 08:20:52] [INFO ] Parsed PT model containing 1399 places and 144369 transitions and 577414 arcs in 2741 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 38 ms.338607KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1399/1399 places, 144369/144369 transitions.
Computed a total of 19 stabilizing places and 1 stable transitions
Ensure Unique test removed 18 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1381 transition count 144369
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 19 place count 1380 transition count 144368
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 19 rules in 3928 ms. Remains 1380 /1399 variables (removed 19) and now considering 144368/144369 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3945 ms. Remains : 1380/1399 places, 144368/144369 transitions.
Interrupted Random walk after 320778 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 08:21:27] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
// Phase 1: matrix 81237 rows 1380 cols
[2023-03-18 08:21:28] [INFO ] Computed 19 place invariants in 474 ms
[2023-03-18 08:21:54] [INFO ] [Real]Absence check using 19 positive place invariants in 235 ms returned sat
[2023-03-18 08:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:22:13] [INFO ] [Real]Absence check using state equation in 19023 ms returned sat
[2023-03-18 08:22:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:22:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 50 ms returned sat
[2023-03-18 08:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:22:59] [INFO ] [Nat]Absence check using state equation in 19493 ms returned sat
[2023-03-18 08:23:00] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 08:23:07] [INFO ] [Nat]Added 741 Read/Feed constraints in 7047 ms returned sat
[2023-03-18 08:23:18] [INFO ] Deduced a trap composed of 40 places in 9928 ms of which 19 ms to minimize.
[2023-03-18 08:23:30] [INFO ] Deduced a trap composed of 72 places in 10320 ms of which 2 ms to minimize.
[2023-03-18 08:23:42] [INFO ] Deduced a trap composed of 64 places in 10902 ms of which 3 ms to minimize.
[2023-03-18 08:23:54] [INFO ] Deduced a trap composed of 16 places in 10593 ms of which 15 ms to minimize.
[2023-03-18 08:24:06] [INFO ] Deduced a trap composed of 128 places in 10796 ms of which 5 ms to minimize.
[2023-03-18 08:24:17] [INFO ] Deduced a trap composed of 48 places in 10319 ms of which 16 ms to minimize.
[2023-03-18 08:24:29] [INFO ] Deduced a trap composed of 96 places in 10341 ms of which 2 ms to minimize.
[2023-03-18 08:24:42] [INFO ] Deduced a trap composed of 96 places in 11311 ms of which 4 ms to minimize.
[2023-03-18 08:24:55] [INFO ] Deduced a trap composed of 72 places in 12537 ms of which 3 ms to minimize.
[2023-03-18 08:25:06] [INFO ] Deduced a trap composed of 48 places in 10023 ms of which 2 ms to minimize.
[2023-03-18 08:25:19] [INFO ] Deduced a trap composed of 72 places in 10901 ms of which 2 ms to minimize.
[2023-03-18 08:25:31] [INFO ] Deduced a trap composed of 72 places in 10882 ms of which 7 ms to minimize.
[2023-03-18 08:25:41] [INFO ] Deduced a trap composed of 64 places in 9185 ms of which 1 ms to minimize.
[2023-03-18 08:25:53] [INFO ] Deduced a trap composed of 40 places in 10381 ms of which 1 ms to minimize.
[2023-03-18 08:26:05] [INFO ] Deduced a trap composed of 96 places in 10755 ms of which 5 ms to minimize.
[2023-03-18 08:26:15] [INFO ] Deduced a trap composed of 128 places in 8937 ms of which 1 ms to minimize.
[2023-03-18 08:26:27] [INFO ] Deduced a trap composed of 96 places in 10331 ms of which 2 ms to minimize.
[2023-03-18 08:26:37] [INFO ] Deduced a trap composed of 176 places in 8953 ms of which 1 ms to minimize.
[2023-03-18 08:26:47] [INFO ] Deduced a trap composed of 64 places in 8773 ms of which 1 ms to minimize.
[2023-03-18 08:26:57] [INFO ] Deduced a trap composed of 128 places in 8714 ms of which 1 ms to minimize.
[2023-03-18 08:27:07] [INFO ] Deduced a trap composed of 96 places in 8926 ms of which 2 ms to minimize.
[2023-03-18 08:27:18] [INFO ] Deduced a trap composed of 128 places in 10129 ms of which 1 ms to minimize.
[2023-03-18 08:27:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 166913 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=5 )
Interrupted Random walk after 262699 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Interrupted Random directed walk after 161990 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=5 )
Interrupted Random walk after 240391 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 1380/1380 places, 144368/144368 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 1415 ms. Remains 1380 /1380 variables (removed 0) and now considering 144368/144368 (removed 0) transitions.
[2023-03-18 08:29:20] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 08:29:20] [INFO ] Invariant cache hit.
[2023-03-18 08:29:29] [INFO ] Implicit Places using invariants in 9445 ms returned []
Implicit Place search using SMT only with invariants took 9448 ms to find 0 implicit places.
[2023-03-18 08:29:29] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 08:29:29] [INFO ] Invariant cache hit.
[2023-03-18 08:29:59] [INFO ] Performed 86519/144368 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 08:30:20] [INFO ] Dead Transitions using invariants and state equation in 50831 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61702 ms. Remains : 1380/1380 places, 144368/144368 transitions.
Interrupted Random walk after 291603 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
[2023-03-18 08:30:50] [INFO ] Flow matrix only has 81237 transitions (discarded 63131 similar events)
[2023-03-18 08:30:50] [INFO ] Invariant cache hit.
[2023-03-18 08:31:15] [INFO ] [Real]Absence check using 19 positive place invariants in 201 ms returned sat
[2023-03-18 08:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 08:31:34] [INFO ] [Real]Absence check using state equation in 19078 ms returned sat
[2023-03-18 08:31:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 08:32:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 57 ms returned sat
[2023-03-18 08:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 08:32:20] [INFO ] [Nat]Absence check using state equation in 18883 ms returned sat
[2023-03-18 08:32:21] [INFO ] State equation strengthened by 741 read => feed constraints.
[2023-03-18 08:32:27] [INFO ] [Nat]Added 741 Read/Feed constraints in 6024 ms returned sat
[2023-03-18 08:32:38] [INFO ] Deduced a trap composed of 16 places in 9404 ms of which 1 ms to minimize.
[2023-03-18 08:32:48] [INFO ] Deduced a trap composed of 64 places in 9359 ms of which 1 ms to minimize.
[2023-03-18 08:32:58] [INFO ] Deduced a trap composed of 128 places in 9026 ms of which 1 ms to minimize.
[2023-03-18 08:33:09] [INFO ] Deduced a trap composed of 34 places in 9250 ms of which 2 ms to minimize.
[2023-03-18 08:33:19] [INFO ] Deduced a trap composed of 40 places in 9453 ms of which 2 ms to minimize.
[2023-03-18 08:33:30] [INFO ] Deduced a trap composed of 72 places in 9605 ms of which 2 ms to minimize.
[2023-03-18 08:33:42] [INFO ] Deduced a trap composed of 80 places in 10900 ms of which 4 ms to minimize.
[2023-03-18 08:33:54] [INFO ] Deduced a trap composed of 72 places in 11248 ms of which 2 ms to minimize.
[2023-03-18 08:34:06] [INFO ] Deduced a trap composed of 128 places in 10651 ms of which 2 ms to minimize.
[2023-03-18 08:34:17] [INFO ] Deduced a trap composed of 128 places in 10090 ms of which 2 ms to minimize.
[2023-03-18 08:34:29] [INFO ] Deduced a trap composed of 64 places in 10750 ms of which 2 ms to minimize.
[2023-03-18 08:34:42] [INFO ] Deduced a trap composed of 72 places in 11452 ms of which 1 ms to minimize.
[2023-03-18 08:34:52] [INFO ] Deduced a trap composed of 64 places in 8855 ms of which 4 ms to minimize.
[2023-03-18 08:35:04] [INFO ] Deduced a trap composed of 72 places in 10621 ms of which 2 ms to minimize.
[2023-03-18 08:35:15] [INFO ] Deduced a trap composed of 64 places in 9554 ms of which 2 ms to minimize.
[2023-03-18 08:35:25] [INFO ] Deduced a trap composed of 128 places in 9413 ms of which 4 ms to minimize.
[2023-03-18 08:35:35] [INFO ] Deduced a trap composed of 72 places in 8778 ms of which 1 ms to minimize.
[2023-03-18 08:35:45] [INFO ] Deduced a trap composed of 40 places in 8565 ms of which 1 ms to minimize.
[2023-03-18 08:35:55] [INFO ] Deduced a trap composed of 128 places in 8193 ms of which 1 ms to minimize.
[2023-03-18 08:36:05] [INFO ] Deduced a trap composed of 48 places in 9180 ms of which 2 ms to minimize.
[2023-03-18 08:36:14] [INFO ] Deduced a trap composed of 96 places in 7949 ms of which 1 ms to minimize.
[2023-03-18 08:36:23] [INFO ] Deduced a trap composed of 40 places in 7468 ms of which 1 ms to minimize.
[2023-03-18 08:36:32] [INFO ] Deduced a trap composed of 96 places in 7709 ms of which 1 ms to minimize.
[2023-03-18 08:36:43] [INFO ] Deduced a trap composed of 96 places in 8789 ms of which 1 ms to minimize.
[2023-03-18 08:36:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Interrupted Random directed walk after 206479 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 347715 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
Interrupted Random directed walk after 212727 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 )
Interrupted Random walk after 346832 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=11 )
[2023-03-18 08:38:47] [INFO ] Flatten gal took : 3993 ms
[2023-03-18 08:38:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2023-03-18 08:38:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1399 places, 144369 transitions and 577414 arcs took 297 ms.
Total runtime 1078315 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14959048 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15944504 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="RERS17pb115-PT-1"
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 RERS17pb115-PT-1, 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-167889215100091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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