fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r524-tall-171679081200853
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SharedMemory-PT-000200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1363.443 163438.00 230707.00 1076.00 200 200 200 200 200 200 200 200 1 1 1 1 1 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.r524-tall-171679081200853.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 SharedMemory-PT-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679081200853
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 505M
-rw-r--r-- 1 mcc users 18M Apr 14 12:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66M Apr 14 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28M Apr 14 02:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 107M Apr 14 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3M Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12M Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13M Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 39M Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 21M Apr 15 07:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71M Apr 15 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19M Apr 15 01:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70M Apr 15 01:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 57K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-00
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-01
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-02
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-03
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-04
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-05
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-06
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-07
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-08
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-09
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-10
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-11
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-12
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-13
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-14
FORMULA_NAME SharedMemory-PT-000200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717241226381

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-PT-000200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:27:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:27:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:27:09] [INFO ] Load time of PNML (sax parser for PT used): 1581 ms
[2024-06-01 11:27:09] [INFO ] Transformed 40601 places.
[2024-06-01 11:27:09] [INFO ] Transformed 80200 transitions.
[2024-06-01 11:27:09] [INFO ] Found NUPN structural information;
[2024-06-01 11:27:09] [INFO ] Parsed PT model containing 40601 places and 80200 transitions and 320000 arcs in 2007 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 25 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 200, 200, 0, 0, 0, 0, 0, 0, 1, 0, 1] Max Struct:[200, 200, 200, 200, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SharedMemory-PT-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[200, 200, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 80200 rows 40601 cols
[2024-06-01 11:27:46] [INFO ] Computed 401 invariants in 35936 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[200, 200, 1, 1, 1, 1, 1, 1]
RANDOM walk for 930 steps (0 resets) in 30109 ms. (0 steps per ms)
FORMULA SharedMemory-PT-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199, 60, 0, 0] Max Struct:[200, 200, 1, 1]
[2024-06-01 11:28:16] [INFO ] Invariant cache hit.
[2024-06-01 11:28:21] [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: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:826)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[199, 60, 0, 0] Max Struct:[200, 200, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 60, 0, 0] Max Struct:[200, 200, 1, 1]
Support contains 402 out of 40601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40601/40601 places, 80200/80200 transitions.
Performed 37532 Post agglomeration using F-continuation condition.
Performed 39798 Post agglomeration using F-continuation condition.Transition count delta: 39798
Iterating post reduction 0 with 39798 rules applied. Total rules applied 39798 place count 40601 transition count 40402
Reduce places removed 39996 places and 0 transitions.
Ensure Unique test removed 39202 transitions
Reduce isomorphic transitions removed 39202 transitions.
Iterating post reduction 1 with 79198 rules applied. Total rules applied 118996 place count 605 transition count 1200
Drop transitions (Redundant composition of simpler transitions.) removed 396 transitions
Redundant transition composition rules discarded 396 transitions
Iterating global reduction 2 with 396 rules applied. Total rules applied 119392 place count 605 transition count 804
Applied a total of 119392 rules in 32656 ms. Remains 605 /40601 variables (removed 39996) and now considering 804/80200 (removed 79396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32670 ms. Remains : 605/40601 places, 804/80200 transitions.
// Phase 1: matrix 804 rows 605 cols
[2024-06-01 11:29:09] [INFO ] Computed 203 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[199, 60, 0, 0] Max Struct:[200, 200, 1, 1]
RANDOM walk for 797063 steps (2 resets) in 30001 ms. (26 steps per ms)
FORMULA SharedMemory-PT-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1529647 steps (4 resets) in 10003 ms. (152 steps per ms)
FORMULA SharedMemory-PT-000200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-PT-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 161900 ms.
ITS solved all properties within timeout

BK_STOP 1717241389819

--------------------
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="SharedMemory-PT-000200"
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 SharedMemory-PT-000200, 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 r524-tall-171679081200853"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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