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

About the Execution of Marcie+red for ShieldRVs-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1116.604 56391.00 78149.00 111.40 1 1 1 1 1 1 1 1 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 '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600173.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679345828281

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:57:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 20:57:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:57:10] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2023-03-20 20:57:11] [INFO ] Transformed 4003 places.
[2023-03-20 20:57:11] [INFO ] Transformed 4503 transitions.
[2023-03-20 20:57:11] [INFO ] Found NUPN structural information;
[2023-03-20 20:57:11] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 589 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-20 20:57:11] [INFO ] Computed 401 place invariants in 95 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 16) seen :11
FORMULA ShieldRVs-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
[2023-03-20 20:57:11] [INFO ] Invariant cache hit.
[2023-03-20 20:57:13] [INFO ] [Real]Absence check using 401 positive place invariants in 619 ms returned sat
[2023-03-20 20:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:16] [INFO ] [Real]Absence check using state equation in 2610 ms returned sat
[2023-03-20 20:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:57:17] [INFO ] [Nat]Absence check using 401 positive place invariants in 226 ms returned sat
[2023-03-20 20:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:21] [INFO ] [Nat]Absence check using state equation in 3386 ms returned sat
[2023-03-20 20:57:23] [INFO ] Deduced a trap composed of 33 places in 2255 ms of which 22 ms to minimize.
[2023-03-20 20:57:23] [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 expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 20:57:24] [INFO ] [Real]Absence check using 401 positive place invariants in 336 ms returned sat
[2023-03-20 20:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:28] [INFO ] [Real]Absence check using state equation in 3707 ms returned unknown
[2023-03-20 20:57:29] [INFO ] [Real]Absence check using 401 positive place invariants in 209 ms returned sat
[2023-03-20 20:57:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:31] [INFO ] [Real]Absence check using state equation in 2187 ms returned sat
[2023-03-20 20:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:57:32] [INFO ] [Nat]Absence check using 401 positive place invariants in 225 ms returned sat
[2023-03-20 20:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:36] [INFO ] [Nat]Absence check using state equation in 4116 ms returned unknown
[2023-03-20 20:57:37] [INFO ] [Real]Absence check using 401 positive place invariants in 205 ms returned sat
[2023-03-20 20:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:39] [INFO ] [Real]Absence check using state equation in 2235 ms returned sat
[2023-03-20 20:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:57:40] [INFO ] [Nat]Absence check using 401 positive place invariants in 240 ms returned sat
[2023-03-20 20:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:45] [INFO ] [Nat]Absence check using state equation in 4069 ms returned unknown
[2023-03-20 20:57:46] [INFO ] [Real]Absence check using 401 positive place invariants in 228 ms returned sat
[2023-03-20 20:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:48] [INFO ] [Real]Absence check using state equation in 2230 ms returned sat
[2023-03-20 20:57:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 20:57:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 305 ms returned sat
[2023-03-20 20:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 20:57:53] [INFO ] [Nat]Absence check using state equation in 3756 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 401 transitions
Trivial Post-agglo rules discarded 401 transitions
Performed 401 trivial Post agglomeration. Transition count delta: 401
Iterating post reduction 0 with 401 rules applied. Total rules applied 401 place count 4003 transition count 4102
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 1 with 401 rules applied. Total rules applied 802 place count 3602 transition count 4102
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 499 Pre rules applied. Total rules applied 802 place count 3602 transition count 3603
Deduced a syphon composed of 499 places in 39 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 2 with 998 rules applied. Total rules applied 1800 place count 3103 transition count 3603
Discarding 698 places :
Symmetric choice reduction at 2 with 698 rule applications. Total rules 2498 place count 2405 transition count 2905
Iterating global reduction 2 with 698 rules applied. Total rules applied 3196 place count 2405 transition count 2905
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 299 Pre rules applied. Total rules applied 3196 place count 2405 transition count 2606
Deduced a syphon composed of 299 places in 10 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 3794 place count 2106 transition count 2606
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 18 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 2 with 1400 rules applied. Total rules applied 5194 place count 1406 transition count 1906
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 200 times.
Drop transitions removed 200 transitions
Iterating global reduction 2 with 200 rules applied. Total rules applied 5394 place count 1406 transition count 1906
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5395 place count 1405 transition count 1905
Applied a total of 5395 rules in 2598 ms. Remains 1405 /4003 variables (removed 2598) and now considering 1905/4503 (removed 2598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2600 ms. Remains : 1405/4003 places, 1905/4503 transitions.
// Phase 1: matrix 1905 rows 1405 cols
[2023-03-20 20:57:56] [INFO ] Computed 401 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 873 resets, run finished after 8299 ms. (steps per millisecond=120 ) properties (out of 5) seen :5
FORMULA ShieldRVs-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 53891 ms.
ITS solved all properties within timeout

BK_STOP 1679345884672

--------------------
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 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="ShieldRVs-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVs-PT-100B, 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 r426-tajo-167905978600173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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