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

About the Execution of Smart+red for ShieldIIPs-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
308.260 30892.00 53607.00 32.80 F normal

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.r409-oct2-167903727400058.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPs-PT-010B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-oct2-167903727400058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 164K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1679770876869

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-25 19:01:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 19:01:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 19:01:19] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-25 19:01:19] [INFO ] Transformed 603 places.
[2023-03-25 19:01:19] [INFO ] Transformed 593 transitions.
[2023-03-25 19:01:19] [INFO ] Found NUPN structural information;
[2023-03-25 19:01:19] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 302 ms.
Structural test allowed to assert that 272 places are NOT stable. Took 17 ms.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 331) seen :329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 593 rows 603 cols
[2023-03-25 19:01:20] [INFO ] Computed 91 place invariants in 17 ms
[2023-03-25 19:01:21] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-25 19:01:21] [INFO ] [Nat]Absence check using 91 positive place invariants in 26 ms returned sat
[2023-03-25 19:01:21] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-25 19:01:22] [INFO ] Deduced a trap composed of 19 places in 319 ms of which 8 ms to minimize.
[2023-03-25 19:01:22] [INFO ] Deduced a trap composed of 25 places in 790 ms of which 1 ms to minimize.
[2023-03-25 19:01:23] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 25 ms to minimize.
[2023-03-25 19:01:23] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 1 ms to minimize.
[2023-03-25 19:01:24] [INFO ] Deduced a trap composed of 20 places in 430 ms of which 2 ms to minimize.
[2023-03-25 19:01:24] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 0 ms to minimize.
[2023-03-25 19:01:24] [INFO ] Deduced a trap composed of 24 places in 379 ms of which 1 ms to minimize.
[2023-03-25 19:01:25] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 22 ms to minimize.
[2023-03-25 19:01:25] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 0 ms to minimize.
[2023-03-25 19:01:25] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2023-03-25 19:01:26] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 0 ms to minimize.
[2023-03-25 19:01:26] [INFO ] Deduced a trap composed of 22 places in 602 ms of which 1 ms to minimize.
[2023-03-25 19:01:27] [INFO ] Deduced a trap composed of 20 places in 941 ms of which 15 ms to minimize.
[2023-03-25 19:01:28] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-25 19:01:28] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 1 ms to minimize.
[2023-03-25 19:01:28] [INFO ] Deduced a trap composed of 11 places in 484 ms of which 1 ms to minimize.
[2023-03-25 19:01:29] [INFO ] Deduced a trap composed of 16 places in 774 ms of which 4 ms to minimize.
[2023-03-25 19:01:32] [INFO ] Deduced a trap composed of 13 places in 3274 ms of which 1 ms to minimize.
[2023-03-25 19:01:33] [INFO ] Deduced a trap composed of 21 places in 232 ms of which 0 ms to minimize.
[2023-03-25 19:01:33] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2023-03-25 19:01:33] [INFO ] Deduced a trap composed of 24 places in 137 ms of which 1 ms to minimize.
[2023-03-25 19:01:33] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2023-03-25 19:01:34] [INFO ] Deduced a trap composed of 25 places in 836 ms of which 1 ms to minimize.
[2023-03-25 19:01:34] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2023-03-25 19:01:35] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-25 19:01:35] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2023-03-25 19:01:36] [INFO ] Deduced a trap composed of 17 places in 711 ms of which 27 ms to minimize.
[2023-03-25 19:01:37] [INFO ] Deduced a trap composed of 13 places in 981 ms of which 2 ms to minimize.
[2023-03-25 19:01:37] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 12 ms to minimize.
[2023-03-25 19:01:38] [INFO ] Deduced a trap composed of 24 places in 731 ms of which 0 ms to minimize.
[2023-03-25 19:01:38] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2023-03-25 19:01:39] [INFO ] Deduced a trap composed of 25 places in 775 ms of which 1 ms to minimize.
[2023-03-25 19:01:39] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 0 ms to minimize.
[2023-03-25 19:01:40] [INFO ] Deduced a trap composed of 18 places in 1064 ms of which 13 ms to minimize.
[2023-03-25 19:01:42] [INFO ] Deduced a trap composed of 26 places in 1600 ms of which 12 ms to minimize.
[2023-03-25 19:01:42] [INFO ] Deduced a trap composed of 27 places in 596 ms of which 1 ms to minimize.
[2023-03-25 19:01:43] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 0 ms to minimize.
[2023-03-25 19:01:43] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2023-03-25 19:01:43] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 0 ms to minimize.
[2023-03-25 19:01:43] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
[2023-03-25 19:01:43] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 1 ms to minimize.
[2023-03-25 19:01:44] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 0 ms to minimize.
[2023-03-25 19:01:44] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 0 ms to minimize.
[2023-03-25 19:01:44] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 0 ms to minimize.
[2023-03-25 19:01:44] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-25 19:01:45] [INFO ] Deduced a trap composed of 22 places in 1008 ms of which 1 ms to minimize.
[2023-03-25 19:01:46] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-25 19:01:46] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2023-03-25 19:01:46] [INFO ] Deduced a trap composed of 25 places in 278 ms of which 15 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-25 19:01:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 19:01:46] [INFO ] After 25307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 762 ms.
Support contains 2 out of 603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 603 transition count 542
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 552 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 552 transition count 491
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 501 transition count 491
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 272 place count 433 transition count 423
Iterating global reduction 2 with 68 rules applied. Total rules applied 340 place count 433 transition count 423
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 340 place count 433 transition count 393
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 400 place count 403 transition count 393
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 11 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 700 place count 253 transition count 243
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 768 place count 253 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 769 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 770 place count 251 transition count 242
Applied a total of 770 rules in 136 ms. Remains 251 /603 variables (removed 352) and now considering 242/593 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 251/603 places, 242/593 transitions.
Finished random walk after 517 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=103 )
Able to resolve query StableMarking after proving 332 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 27966 ms.
ITS solved all properties within timeout

BK_STOP 1679770907761

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -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="ShieldIIPs-PT-010B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldIIPs-PT-010B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r409-oct2-167903727400058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010B.tgz
mv ShieldIIPs-PT-010B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;