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.r361-smll-167891811800582.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 SharedMemory-COL-000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811800582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 00:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 16K 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

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

=== Now, execution of the tool begins

BK_START 1679386266598

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 08:11:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 08:11:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 08:11:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-21 08:11:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-21 08:11:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 753 ms
[2023-03-21 08:11:10] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 10401 PT places and 30200.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 08:11:11] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 7 ms.
[2023-03-21 08:11:11] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
[2023-03-21 08:11:11] [INFO ] Flatten gal took : 21 ms
[2023-03-21 08:11:11] [INFO ] Flatten gal took : 4 ms
Domain [P(100), P(100)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-21 08:11:11] [INFO ] Unfolded HLPN to a Petri net with 10401 places and 20200 transitions 80400 arcs in 360 ms.
[2023-03-21 08:11:11] [INFO ] Unfolded 15 HLPN properties in 47 ms.
Deduced a syphon composed of 100 places in 29 ms
Reduce places removed 100 places and 100 transitions.
Interrupted random walk after 4315 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=0 ) properties seen 5
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 6450 steps, including 1 resets, run timeout after 5221 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 2661 steps, including 0 resets, run timeout after 5637 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2441 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2675 ms. (steps per millisecond=3 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Interrupted Best-First random walk after 2072 steps, including 0 resets, run timeout after 5351 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 10 properties.
// Phase 1: matrix 20100 rows 10301 cols
[2023-03-21 08:12:08] [INFO ] Computed 201 place invariants in 4041 ms
[2023-03-21 08:12:17] [INFO ] [Real]Absence check using 201 positive place invariants in 1073 ms returned sat
[2023-03-21 08:12:17] [INFO ] After 8978ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2023-03-21 08:12:24] [INFO ] [Nat]Absence check using 201 positive place invariants in 843 ms returned sat
[2023-03-21 08:12:42] [INFO ] After 7985ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2023-03-21 08:12:43] [INFO ] After 8026ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-21 08:12:43] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SharedMemory-COL-000100-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 10301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 312 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Interrupted random walk after 4492 steps, including 1 resets, run timeout after 30016 ms. (steps per millisecond=0 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 1975 steps, including 0 resets, run timeout after 5066 ms. (steps per millisecond=0 ) properties seen 0
Interrupted probabilistic random walk after 131591 steps, run timeout after 105455 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 131591 steps, saw 130444 distinct states, run finished after 105465 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 08:15:04] [INFO ] Invariant cache hit.
[2023-03-21 08:15:08] [INFO ] [Real]Absence check using 201 positive place invariants in 1032 ms returned sat
[2023-03-21 08:15:29] [INFO ] After 20368ms SMT Verify possible using state equation in real domain returned unsat :0 sat :0 real:1
[2023-03-21 08:15:29] [INFO ] After 20386ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 08:15:29] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 08:15:33] [INFO ] [Nat]Absence check using 201 positive place invariants in 1067 ms returned sat
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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.Application.startNoEx(Application.java:902)
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-21 08:15:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 08:15:54] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10301 out of 10301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 204 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 156 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
[2023-03-21 08:15:54] [INFO ] Invariant cache hit.
[2023-03-21 08:15:56] [INFO ] Implicit Places using invariants in 1705 ms returned []
Implicit Place search using SMT only with invariants took 1706 ms to find 0 implicit places.
[2023-03-21 08:15:56] [INFO ] Invariant cache hit.
[2023-03-21 08:15:58] [INFO ] Dead Transitions using invariants and state equation in 1666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3534 ms. Remains : 10301/10301 places, 20100/20100 transitions.
Applied a total of 0 rules in 236 ms. Remains 10301 /10301 variables (removed 0) and now considering 20100/20100 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-21 08:15:58] [INFO ] Invariant cache hit.
[2023-03-21 08:16:02] [INFO ] [Real]Absence check using 201 positive place invariants in 835 ms returned sat
[2023-03-21 08:16:28] [INFO ] After 25561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-21 08:16:30] [INFO ] After 27321ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 1157 ms.
[2023-03-21 08:16:31] [INFO ] After 33074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-21 08:16:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 797 ms returned sat
[2023-03-21 08:17:06] [INFO ] After 28475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 08:17:10] [INFO ] After 31995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1824 ms.
[2023-03-21 08:17:12] [INFO ] After 40652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 08:17:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 112 ms.
[2023-03-21 08:17:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10301 places, 20100 transitions and 80000 arcs took 118 ms.
[2023-03-21 08:17:14] [INFO ] Flatten gal took : 1450 ms
Total runtime 364542 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/494/inv_0_ --invariant=/tmp/494/inv_1_ --inv-par
Could not compute solution for formula : SharedMemory-COL-000100-ReachabilityCardinality-10
Could not compute solution for formula : SharedMemory-COL-000100-ReachabilityCardinality-15

BK_STOP 1679387041649

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name SharedMemory-COL-000100-ReachabilityCardinality-10
rfs formula type EF
rfs formula formula --invariant=/tmp/494/inv_0_
rfs formula name SharedMemory-COL-000100-ReachabilityCardinality-15
rfs formula type AG
rfs formula formula --invariant=/tmp/494/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 10301 places, 20100 transitions and 80000 arcs
pnml2lts-sym: Petri net SharedMemory_COL_000100_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.500 real 0.310 user 0.200 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 20100->20000 groups
pnml2lts-sym: Regrouping took 403.770 real 402.950 user 0.760 sys
pnml2lts-sym: state vector length is 10301; there are 20000 groups

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-COL-000100"
export BK_EXAMINATION="ReachabilityCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SharedMemory-COL-000100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r361-smll-167891811800582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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