fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987816000526
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for GPPP-PT-C0100N0000100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.320 3600000.00 59218.00 400.50 FFFFTFFFFTTTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987816000526.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is GPPP-PT-C0100N0000100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987816000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Apr 4 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 4 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 4 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 8 14:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 3 21:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 3 21:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 3 13:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 3 13:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1 Mar 24 05:37 large_marking
-rw-r--r-- 1 mcc users 21K Mar 24 05:37 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 GPPP-PT-C0100N0000100000-ReachabilityCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000100000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591484409574

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 23:00:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 23:00:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 23:00:11] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-06-06 23:00:12] [INFO ] Transformed 33 places.
[2020-06-06 23:00:12] [INFO ] Transformed 22 transitions.
[2020-06-06 23:00:12] [INFO ] Parsed PT model containing 33 places and 22 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10130 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=375 ) properties seen :[1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2020-06-06 23:00:12] [INFO ] Computed 12 place invariants in 6 ms
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2020-06-06 23:00:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:00:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-06 23:00:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-06 23:00:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4994 ms returned (error "Failed to check-sat")
[2020-06-06 23:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 23:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-06 23:00:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:00:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2020-06-06 23:00:17] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned unsat
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-06 23:00:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2020-06-06 23:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-06-06 23:00:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:00:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:00:18] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 10 ms returned sat
[2020-06-06 23:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:18] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-06-06 23:00:18] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 6 ms.
[2020-06-06 23:00:18] [INFO ] Added : 15 causal constraints over 3 iterations in 77 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2020-06-06 23:00:18] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-06 23:00:18] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-06 23:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:18] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 72300 steps, including 98 resets, run finished after 366 ms. (steps per millisecond=197 ) properties seen :[0, 1] could not realise parikh vector
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 24 transition count 14
Applied a total of 17 rules in 41 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2020-06-06 23:00:18] [INFO ] Computed 10 place invariants in 3 ms
[2020-06-06 23:00:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/33 places, 14/22 transitions.
Incomplete random walk after 1000181 steps, including 793 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 168 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties seen :[0]
Interrupted probabilistic random walk after 28277657 steps, run timeout after 30001 ms. (steps per millisecond=942 ) properties seen :[0]
Probabilistic random walk after 28277657 steps, saw 4550686 distinct states, run finished after 30001 ms. (steps per millisecond=942 ) properties seen :[0]
// Phase 1: matrix 14 rows 24 cols
[2020-06-06 23:00:50] [INFO ] Computed 10 place invariants in 3 ms
[2020-06-06 23:00:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-06 23:00:50] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 23:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:50] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-06 23:00:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 23:00:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2020-06-06 23:00:50] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2020-06-06 23:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 23:00:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned unsat
FORMULA GPPP-PT-C0100N0000100000-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="GPPP-PT-C0100N0000100000"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is GPPP-PT-C0100N0000100000, 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 r170-smll-158987816000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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