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

About the Execution of LTSMin+red for DNAwalker-PT-18lozangeBlock

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1757.111 3600000.00 14076195.00 694.40 FFT??TFFTT?TFT?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.r105-tall-167814482001015.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 DNAwalker-PT-18lozangeBlock, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814482001015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 15 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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 DNAwalker-PT-18lozangeBlock-ReachabilityFireability-00
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-01
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-02
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-03
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-04
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-05
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-06
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-07
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-08
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-09
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-10
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-11
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-12
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-13
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-14
FORMULA_NAME DNAwalker-PT-18lozangeBlock-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678410180107

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-18lozangeBlock
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 01:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 01:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 01:03:01] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-10 01:03:01] [INFO ] Transformed 164 places.
[2023-03-10 01:03:01] [INFO ] Transformed 3697 transitions.
[2023-03-10 01:03:01] [INFO ] Parsed PT model containing 164 places and 3697 transitions and 10898 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 97 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 16) seen :12
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-18lozangeBlock-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 3697 rows 164 cols
[2023-03-10 01:03:02] [INFO ] Computed 0 place invariants in 30 ms
[2023-03-10 01:03:03] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 01:03:28] [INFO ] After 24928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 01:03:28] [INFO ] State equation strengthened by 2651 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-10 01:03:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 01:03:28] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 92 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 3697/3697 transitions.
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 164 transition count 3634
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 160 transition count 3630
Applied a total of 67 rules in 275 ms. Remains 160 /164 variables (removed 4) and now considering 3630/3697 (removed 67) transitions.
// Phase 1: matrix 3630 rows 160 cols
[2023-03-10 01:03:28] [INFO ] Computed 0 place invariants in 14 ms
[2023-03-10 01:03:29] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1389 ms. Remains : 160/164 places, 3630/3697 transitions.
Incomplete random walk after 10000 steps, including 82 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 142411 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142411 steps, saw 26747 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 01:03:33] [INFO ] Invariant cache hit.
[2023-03-10 01:03:33] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 01:03:58] [INFO ] After 24956ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 01:03:58] [INFO ] State equation strengthened by 2523 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-10 01:03:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 01:03:58] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 92 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 3630/3630 transitions.
Applied a total of 0 rules in 43 ms. Remains 160 /160 variables (removed 0) and now considering 3630/3630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 160/160 places, 3630/3630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 3630/3630 transitions.
Applied a total of 0 rules in 57 ms. Remains 160 /160 variables (removed 0) and now considering 3630/3630 (removed 0) transitions.
[2023-03-10 01:03:58] [INFO ] Invariant cache hit.
[2023-03-10 01:03:59] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-10 01:03:59] [INFO ] Invariant cache hit.
[2023-03-10 01:03:59] [INFO ] State equation strengthened by 2523 read => feed constraints.
[2023-03-10 01:03:59] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2023-03-10 01:03:59] [INFO ] Redundant transitions in 239 ms returned []
[2023-03-10 01:03:59] [INFO ] Invariant cache hit.
[2023-03-10 01:04:00] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2218 ms. Remains : 160/160 places, 3630/3630 transitions.
Applied a total of 0 rules in 61 ms. Remains 160 /160 variables (removed 0) and now considering 3630/3630 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-10 01:04:01] [INFO ] Invariant cache hit.
[2023-03-10 01:04:01] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 01:04:47] [INFO ] After 45831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-10 01:04:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 21 ms.
[2023-03-10 01:04:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 3630 transitions and 10826 arcs took 18 ms.
[2023-03-10 01:04:47] [INFO ] Flatten gal took : 268 ms
Total runtime 106097 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 --inv-bin-par --invariant=/tmp/495/inv_0_ --invariant=/tmp/495/inv_1_ --invariant=/tmp/495/inv_2_ --invariant=/tmp/495/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 14387352 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097032 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-18lozangeBlock"
export BK_EXAMINATION="ReachabilityFireability"
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 DNAwalker-PT-18lozangeBlock, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814482001015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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