fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r305-smll-165463878500165
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for AutonomousCar-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
211.340 10837.00 23264.00 232.20 TFTFTTTFTTTTFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878500165.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is AutonomousCar-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878500165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.2K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 49K Jun 3 16:02 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 AutonomousCar-PT-02b-ReachabilityFireability-00
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-01
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-02
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-03
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-04
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-05
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-06
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-07
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-08
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-09
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-10
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-11
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-12
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-13
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-14
FORMULA_NAME AutonomousCar-PT-02b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654735778629

Running Version 0
[2022-06-09 00:49:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 00:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:49:42] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-06-09 00:49:42] [INFO ] Transformed 155 places.
[2022-06-09 00:49:42] [INFO ] Transformed 194 transitions.
[2022-06-09 00:49:42] [INFO ] Found NUPN structural information;
[2022-06-09 00:49:42] [INFO ] Parsed PT model containing 155 places and 194 transitions in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :6
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :2
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :1
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 194 rows 155 cols
[2022-06-09 00:49:42] [INFO ] Computed 7 place invariants in 26 ms
[2022-06-09 00:49:43] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2022-06-09 00:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:43] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2022-06-09 00:49:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:49:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2022-06-09 00:49:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:43] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-06-09 00:49:43] [INFO ] Computed and/alt/rep : 151/208/151 causal constraints (skipped 42 transitions) in 30 ms.
[2022-06-09 00:49:44] [INFO ] Added : 105 causal constraints over 21 iterations in 592 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-09 00:49:44] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2022-06-09 00:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:44] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-06-09 00:49:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:49:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-06-09 00:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:44] [INFO ] [Nat]Absence check using state equation in 98 ms returned unsat
[2022-06-09 00:49:44] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2022-06-09 00:49:45] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-06-09 00:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:45] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 3 ms to minimize.
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 12 ms to minimize.
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2022-06-09 00:49:45] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 999 ms
[2022-06-09 00:49:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:49:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2022-06-09 00:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:49:46] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2022-06-09 00:49:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 524 ms
[2022-06-09 00:49:46] [INFO ] Computed and/alt/rep : 151/208/151 causal constraints (skipped 42 transitions) in 21 ms.
[2022-06-09 00:49:47] [INFO ] Added : 83 causal constraints over 17 iterations in 364 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2022-06-09 00:49:47] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned unsat
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 34700 steps, including 526 resets, run finished after 139 ms. (steps per millisecond=249 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18600 steps, including 464 resets, run finished after 52 ms. (steps per millisecond=357 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 38 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 194/194 transitions.
Graph (trivial) has 81 edges and 155 vertex of which 2 / 155 are part of one of the 1 SCC in 25 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 310 edges and 154 vertex of which 151 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 151 transition count 157
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 72 place count 118 transition count 153
Reduce places removed 2 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 10 rules applied. Total rules applied 82 place count 116 transition count 145
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 90 place count 108 transition count 145
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 90 place count 108 transition count 136
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 108 place count 99 transition count 136
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 123 place count 84 transition count 121
Iterating global reduction 4 with 15 rules applied. Total rules applied 138 place count 84 transition count 121
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 155 place count 84 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 156 place count 83 transition count 102
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 83 transition count 102
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 175 place count 74 transition count 93
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 73 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 73 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 72 transition count 92
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 183 place count 72 transition count 88
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 72 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 185 place count 71 transition count 87
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 71 transition count 87
Applied a total of 187 rules in 173 ms. Remains 71 /155 variables (removed 84) and now considering 87/194 (removed 107) transitions.
Finished structural reductions, in 1 iterations. Remains : 71/155 places, 87/194 transitions.
[2022-06-09 00:49:48] [INFO ] Flatten gal took : 70 ms
[2022-06-09 00:49:48] [INFO ] Flatten gal took : 19 ms
[2022-06-09 00:49:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13605159995750888046.gal : 10 ms
[2022-06-09 00:49:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3261864234633503210.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13605159995750888046.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3261864234633503210.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13605159995750888046.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3261864234633503210.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3261864234633503210.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :13 after 70
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :70 after 348
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :348 after 3018
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3018 after 6622
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,119574,0.125156,6184,2,1272,13,9551,7,0,443,8752,0
Total reachable state count : 119574

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-02b-ReachabilityFireability-03 does not hold.
FORMULA AutonomousCar-PT-02b-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-02b-ReachabilityFireability-03,1,0.13508,6432,2,72,13,9551,7,0,506,8752,0
All properties solved without resorting to model-checking.

BK_STOP 1654735789466

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="AutonomousCar-PT-02b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is AutonomousCar-PT-02b, 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 r305-smll-165463878500165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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