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.r107-smll-165260580300052.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 FlexibleBarrier-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580300052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 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 FlexibleBarrier-PT-20b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652645775870

Running Version 0
[2022-05-15 20:16:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-05-15 20:16:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:16:19] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2022-05-15 20:16:19] [INFO ] Transformed 5372 places.
[2022-05-15 20:16:19] [INFO ] Transformed 6193 transitions.
[2022-05-15 20:16:19] [INFO ] Found NUPN structural information;
[2022-05-15 20:16:19] [INFO ] Parsed PT model containing 5372 places and 6193 transitions in 567 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 6193 rows 5372 cols
[2022-05-15 20:16:20] [INFO ] Computed 22 place invariants in 447 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :1
FORMULA FlexibleBarrier-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
// Phase 1: matrix 6193 rows 5372 cols
[2022-05-15 20:16:21] [INFO ] Computed 22 place invariants in 269 ms
[2022-05-15 20:16:23] [INFO ] [Real]Absence check using 22 positive place invariants in 239 ms returned sat
[2022-05-15 20:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 20:16:28] [INFO ] [Real]Absence check using 22 positive place invariants in 294 ms returned sat
[2022-05-15 20:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:31] [INFO ] [Real]Absence check using state equation in 3190 ms returned unknown
[2022-05-15 20:16:33] [INFO ] [Real]Absence check using 22 positive place invariants in 250 ms returned sat
[2022-05-15 20:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:36] [INFO ] [Real]Absence check using state equation in 3323 ms returned unknown
[2022-05-15 20:16:37] [INFO ] [Real]Absence check using 22 positive place invariants in 224 ms returned sat
[2022-05-15 20:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:41] [INFO ] [Real]Absence check using state equation in 3466 ms returned unknown
[2022-05-15 20:16:42] [INFO ] [Real]Absence check using 22 positive place invariants in 259 ms returned sat
[2022-05-15 20:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:46] [INFO ] [Real]Absence check using state equation in 3482 ms returned unknown
[2022-05-15 20:16:48] [INFO ] [Real]Absence check using 22 positive place invariants in 320 ms returned sat
[2022-05-15 20:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:51] [INFO ] [Real]Absence check using state equation in 3275 ms returned unknown
[2022-05-15 20:16:53] [INFO ] [Real]Absence check using 22 positive place invariants in 246 ms returned sat
[2022-05-15 20:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:56] [INFO ] [Real]Absence check using state equation in 3430 ms returned unknown
[2022-05-15 20:16:57] [INFO ] [Real]Absence check using 22 positive place invariants in 215 ms returned sat
[2022-05-15 20:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:01] [INFO ] [Real]Absence check using state equation in 3731 ms returned unknown
[2022-05-15 20:17:02] [INFO ] [Real]Absence check using 22 positive place invariants in 230 ms returned sat
[2022-05-15 20:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:06] [INFO ] [Real]Absence check using state equation in 3510 ms returned unknown
[2022-05-15 20:17:07] [INFO ] [Real]Absence check using 22 positive place invariants in 213 ms returned sat
[2022-05-15 20:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:11] [INFO ] [Real]Absence check using state equation in 3543 ms returned unknown
[2022-05-15 20:17:12] [INFO ] [Real]Absence check using 22 positive place invariants in 220 ms returned sat
[2022-05-15 20:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:16] [INFO ] [Real]Absence check using state equation in 3566 ms returned unknown
[2022-05-15 20:17:17] [INFO ] [Real]Absence check using 22 positive place invariants in 221 ms returned sat
[2022-05-15 20:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:21] [INFO ] [Real]Absence check using state equation in 3529 ms returned unknown
[2022-05-15 20:17:22] [INFO ] [Real]Absence check using 22 positive place invariants in 222 ms returned sat
[2022-05-15 20:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:17:26] [INFO ] [Real]Absence check using state equation in 3664 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 5372 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5290 edges and 5372 vertex of which 122 / 5372 are part of one of the 20 SCC in 51 ms
Free SCC test removed 102 places
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Drop transitions removed 1302 transitions
Trivial Post-agglo rules discarded 1302 transitions
Performed 1302 trivial Post agglomeration. Transition count delta: 1302
Iterating post reduction 0 with 1302 rules applied. Total rules applied 1303 place count 5270 transition count 4768
Reduce places removed 1302 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 1305 rules applied. Total rules applied 2608 place count 3968 transition count 4765
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2611 place count 3965 transition count 4765
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 375 Pre rules applied. Total rules applied 2611 place count 3965 transition count 4390
Deduced a syphon composed of 375 places in 10 ms
Reduce places removed 375 places and 0 transitions.
Iterating global reduction 3 with 750 rules applied. Total rules applied 3361 place count 3590 transition count 4390
Discarding 2201 places :
Symmetric choice reduction at 3 with 2201 rule applications. Total rules 5562 place count 1389 transition count 2189
Iterating global reduction 3 with 2201 rules applied. Total rules applied 7763 place count 1389 transition count 2189
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 7763 place count 1389 transition count 2172
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7797 place count 1372 transition count 2172
Discarding 355 places :
Symmetric choice reduction at 3 with 355 rule applications. Total rules 8152 place count 1017 transition count 1817
Iterating global reduction 3 with 355 rules applied. Total rules applied 8507 place count 1017 transition count 1817
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 3 with 352 rules applied. Total rules applied 8859 place count 1017 transition count 1465
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 9069 place count 912 transition count 1360
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 9109 place count 912 transition count 1320
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 9129 place count 892 transition count 1300
Iterating global reduction 5 with 20 rules applied. Total rules applied 9149 place count 892 transition count 1300
Free-agglomeration rule applied 771 times.
Iterating global reduction 5 with 771 rules applied. Total rules applied 9920 place count 892 transition count 529
Reduce places removed 771 places and 0 transitions.
Drop transitions removed 358 transitions
Reduce isomorphic transitions removed 358 transitions.
Graph (complete) has 335 edges and 121 vertex of which 91 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.4 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1130 rules applied. Total rules applied 11050 place count 91 transition count 171
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 11092 place count 91 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 11093 place count 90 transition count 128
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 70 edges and 89 vertex of which 28 / 89 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 11096 place count 75 transition count 127
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 11125 place count 74 transition count 99
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 14 Pre rules applied. Total rules applied 11125 place count 74 transition count 85
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 9 with 28 rules applied. Total rules applied 11153 place count 60 transition count 85
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 11166 place count 60 transition count 72
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 11192 place count 47 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 11193 place count 47 transition count 58
Free-agglomeration rule applied 14 times.
Iterating global reduction 10 with 14 rules applied. Total rules applied 11207 place count 47 transition count 44
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 10 with 35 rules applied. Total rules applied 11242 place count 25 transition count 31
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 11245 place count 25 transition count 28
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 11248 place count 22 transition count 28
Applied a total of 11248 rules in 3998 ms. Remains 22 /5372 variables (removed 5350) and now considering 28/6193 (removed 6165) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/5372 places, 28/6193 transitions.
// Phase 1: matrix 28 rows 22 cols
[2022-05-15 20:17:30] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1574 ms. (steps per millisecond=635 ) properties (out of 13) seen :13
FORMULA FlexibleBarrier-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652645853237

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="UpperBounds"
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 FlexibleBarrier-PT-20b, 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 r107-smll-165260580300052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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