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

About the Execution of LoLa+red for GPUForwardProgress-PT-16b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
251.256 17615.00 27558.00 533.80 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 '/data/fkordon/mcc2023-input.r199-smll-167840345400061.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 lolaxred
Input is GPUForwardProgress-PT-16b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345400061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 84K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678470508741

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-16b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 17:48:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 17:48:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:48:32] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-10 17:48:32] [INFO ] Transformed 340 places.
[2023-03-10 17:48:32] [INFO ] Transformed 357 transitions.
[2023-03-10 17:48:32] [INFO ] Found NUPN structural information;
[2023-03-10 17:48:32] [INFO ] Parsed PT model containing 340 places and 357 transitions and 877 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 357 rows 340 cols
[2023-03-10 17:48:33] [INFO ] Computed 18 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 68 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :9
FORMULA GPUForwardProgress-PT-16b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :2
FORMULA GPUForwardProgress-PT-16b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
[2023-03-10 17:48:33] [INFO ] Invariant cache hit.
[2023-03-10 17:48:33] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 32 ms returned sat
[2023-03-10 17:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:34] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2023-03-10 17:48:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:48:34] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 29 ms returned sat
[2023-03-10 17:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:34] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-10 17:48:34] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 65 ms.
[2023-03-10 17:48:35] [INFO ] Added : 108 causal constraints over 22 iterations in 868 ms. Result :sat
Minimization took 68 ms.
[2023-03-10 17:48:36] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 21 ms returned sat
[2023-03-10 17:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:36] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-10 17:48:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:48:36] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-10 17:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:36] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-10 17:48:36] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 48 ms.
[2023-03-10 17:48:37] [INFO ] Added : 121 causal constraints over 25 iterations in 1061 ms. Result :sat
Minimization took 110 ms.
[2023-03-10 17:48:38] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-10 17:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:38] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-10 17:48:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:48:38] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 25 ms returned sat
[2023-03-10 17:48:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:38] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-10 17:48:38] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 50 ms.
[2023-03-10 17:48:39] [INFO ] Added : 125 causal constraints over 25 iterations in 1025 ms. Result :sat
Minimization took 107 ms.
[2023-03-10 17:48:40] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 25 ms returned sat
[2023-03-10 17:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:40] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2023-03-10 17:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:48:40] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-10 17:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:40] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-10 17:48:40] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 46 ms.
[2023-03-10 17:48:41] [INFO ] Added : 106 causal constraints over 22 iterations in 895 ms. Result :sat
Minimization took 107 ms.
[2023-03-10 17:48:41] [INFO ] [Real]Absence check using 0 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-10 17:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:42] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2023-03-10 17:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:48:42] [INFO ] [Nat]Absence check using 0 positive and 18 generalized place invariants in 27 ms returned sat
[2023-03-10 17:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:42] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2023-03-10 17:48:42] [INFO ] Computed and/alt/rep : 351/629/351 causal constraints (skipped 5 transitions) in 39 ms.
[2023-03-10 17:48:43] [INFO ] Added : 167 causal constraints over 34 iterations in 1392 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-16b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 357/357 transitions.
Graph (trivial) has 300 edges and 340 vertex of which 7 / 340 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 504 edges and 334 vertex of which 313 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 188 rules applied. Total rules applied 190 place count 313 transition count 158
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 202 rules applied. Total rules applied 392 place count 127 transition count 142
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 394 place count 126 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 395 place count 125 transition count 141
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 395 place count 125 transition count 111
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 455 place count 95 transition count 111
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 474 place count 76 transition count 92
Iterating global reduction 4 with 19 rules applied. Total rules applied 493 place count 76 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 493 place count 76 transition count 90
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 497 place count 74 transition count 90
Graph (complete) has 138 edges and 74 vertex of which 28 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.0 ms
Discarding 46 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 8 rules applied. Total rules applied 505 place count 28 transition count 38
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 529 place count 21 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 529 place count 21 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 533 place count 19 transition count 19
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 535 place count 17 transition count 17
Iterating global reduction 6 with 2 rules applied. Total rules applied 537 place count 17 transition count 17
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 548 place count 11 transition count 12
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 549 place count 11 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 550 place count 11 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 551 place count 10 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 552 place count 9 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 552 place count 9 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 558 place count 6 transition count 6
Applied a total of 558 rules in 105 ms. Remains 6 /340 variables (removed 334) and now considering 6/357 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 6/340 places, 6/357 transitions.
// Phase 1: matrix 6 rows 6 cols
[2023-03-10 17:48:44] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 3) seen :3
FORMULA GPUForwardProgress-PT-16b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-16b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 12598 ms.
ITS solved all properties within timeout

BK_STOP 1678470526356

--------------------
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="GPUForwardProgress-PT-16b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is GPUForwardProgress-PT-16b, 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 r199-smll-167840345400061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-16b.tgz
mv GPUForwardProgress-PT-16b 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 ;