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

About the Execution of 2022-gold for MultiCrashLeafsetExtension-PT-S24C08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1037.147 99881.00 121551.00 1593.00 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.r255-tall-167856440400107.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 gold2022
Input is MultiCrashLeafsetExtension-PT-S24C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 12K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 02:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 02:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 26 02:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 02:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15M 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 MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678762122480

Running Version 202205111006
[2023-03-14 02:48:43] [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]
[2023-03-14 02:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 02:48:44] [INFO ] Load time of PNML (sax parser for PT used): 719 ms
[2023-03-14 02:48:44] [INFO ] Transformed 15180 places.
[2023-03-14 02:48:44] [INFO ] Transformed 22267 transitions.
[2023-03-14 02:48:44] [INFO ] Parsed PT model containing 15180 places and 22267 transitions in 925 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 21667 out of 22267 initially.
// Phase 1: matrix 21667 rows 15180 cols
[2023-03-14 02:48:46] [INFO ] Computed 1137 place invariants in 1672 ms
Incomplete random walk after 10000 steps, including 121 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :5
[2023-03-14 02:48:47] [INFO ] Flow matrix only has 21667 transitions (discarded 600 similar events)
// Phase 1: matrix 21667 rows 15180 cols
[2023-03-14 02:48:49] [INFO ] Computed 1137 place invariants in 1477 ms
[2023-03-14 02:48:51] [INFO ] [Real]Absence check using 70 positive place invariants in 320 ms returned sat
[2023-03-14 02:48:51] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 455 ms returned unsat
[2023-03-14 02:48:53] [INFO ] [Real]Absence check using 70 positive place invariants in 306 ms returned sat
[2023-03-14 02:48:53] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 458 ms returned unsat
[2023-03-14 02:48:55] [INFO ] [Real]Absence check using 70 positive place invariants in 312 ms returned sat
[2023-03-14 02:48:56] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 706 ms returned sat
[2023-03-14 02:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:48:58] [INFO ] [Real]Absence check using state equation in 2626 ms returned unknown
[2023-03-14 02:49:00] [INFO ] [Real]Absence check using 70 positive place invariants in 293 ms returned sat
[2023-03-14 02:49:00] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 453 ms returned unsat
[2023-03-14 02:49:02] [INFO ] [Real]Absence check using 70 positive place invariants in 303 ms returned sat
[2023-03-14 02:49:02] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 489 ms returned unsat
[2023-03-14 02:49:04] [INFO ] [Real]Absence check using 70 positive place invariants in 294 ms returned sat
[2023-03-14 02:49:05] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 481 ms returned unsat
[2023-03-14 02:49:06] [INFO ] [Real]Absence check using 70 positive place invariants in 302 ms returned sat
[2023-03-14 02:49:07] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 447 ms returned unsat
[2023-03-14 02:49:08] [INFO ] [Real]Absence check using 70 positive place invariants in 300 ms returned sat
[2023-03-14 02:49:09] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 479 ms returned unsat
[2023-03-14 02:49:11] [INFO ] [Real]Absence check using 70 positive place invariants in 304 ms returned sat
[2023-03-14 02:49:11] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 434 ms returned unsat
[2023-03-14 02:49:13] [INFO ] [Real]Absence check using 70 positive place invariants in 304 ms returned sat
[2023-03-14 02:49:13] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 501 ms returned unsat
[2023-03-14 02:49:15] [INFO ] [Real]Absence check using 70 positive place invariants in 297 ms returned sat
[2023-03-14 02:49:15] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 449 ms returned unsat
[2023-03-14 02:49:17] [INFO ] [Real]Absence check using 70 positive place invariants in 300 ms returned sat
[2023-03-14 02:49:18] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 707 ms returned sat
[2023-03-14 02:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:49:20] [INFO ] [Real]Absence check using state equation in 2629 ms returned unknown
[2023-03-14 02:49:22] [INFO ] [Real]Absence check using 70 positive place invariants in 293 ms returned sat
[2023-03-14 02:49:22] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 451 ms returned unsat
[2023-03-14 02:49:24] [INFO ] [Real]Absence check using 70 positive place invariants in 297 ms returned sat
[2023-03-14 02:49:25] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 670 ms returned sat
[2023-03-14 02:49:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:49:28] [INFO ] [Real]Absence check using state equation in 2663 ms returned unknown
[2023-03-14 02:49:29] [INFO ] [Real]Absence check using 70 positive place invariants in 285 ms returned sat
[2023-03-14 02:49:30] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 444 ms returned unsat
[2023-03-14 02:49:31] [INFO ] [Real]Absence check using 70 positive place invariants in 310 ms returned sat
[2023-03-14 02:49:32] [INFO ] [Real]Absence check using 70 positive and 1067 generalized place invariants in 744 ms returned sat
[2023-03-14 02:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:49:35] [INFO ] [Real]Absence check using state equation in 2612 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 25, 1, 1, 1, 1, 1, 1, 1, 1, 75, 1, 25, 1, 75] Max seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 15180 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15180/15180 places, 22267/22267 transitions.
Graph (complete) has 49169 edges and 15180 vertex of which 15136 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.47 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions removed 4796 transitions
Trivial Post-agglo rules discarded 4796 transitions
Performed 4796 trivial Post agglomeration. Transition count delta: 4796
Iterating post reduction 0 with 4796 rules applied. Total rules applied 4797 place count 15136 transition count 17471
Reduce places removed 4796 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4798 rules applied. Total rules applied 9595 place count 10340 transition count 17469
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9597 place count 10338 transition count 17469
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 9597 place count 10338 transition count 17069
Deduced a syphon composed of 400 places in 15 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 10397 place count 9938 transition count 17069
Discarding 4396 places :
Symmetric choice reduction at 3 with 4396 rule applications. Total rules 14793 place count 5542 transition count 12673
Iterating global reduction 3 with 4396 rules applied. Total rules applied 19189 place count 5542 transition count 12673
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 19189 place count 5542 transition count 12661
Deduced a syphon composed of 12 places in 10 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 19213 place count 5530 transition count 12661
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 19760 place count 4983 transition count 8285
Iterating global reduction 3 with 547 rules applied. Total rules applied 20307 place count 4983 transition count 8285
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 6 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 20357 place count 4958 transition count 8260
Free-agglomeration rule (complex) applied 339 times.
Iterating global reduction 3 with 339 rules applied. Total rules applied 20696 place count 4958 transition count 11750
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 3 with 339 rules applied. Total rules applied 21035 place count 4619 transition count 11750
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 4 with 100 rules applied. Total rules applied 21135 place count 4619 transition count 11750
Applied a total of 21135 rules in 5358 ms. Remains 4619 /15180 variables (removed 10561) and now considering 11750/22267 (removed 10517) transitions.
Finished structural reductions, in 1 iterations. Remains : 4619/15180 places, 11750/22267 transitions.
Normalized transition count is 10864 out of 11750 initially.
// Phase 1: matrix 10864 rows 4619 cols
[2023-03-14 02:49:40] [INFO ] Computed 1093 place invariants in 261 ms
Finished random walk after 676942 steps, including 13684 resets, run visited all 4 properties in 30001 ms. (steps per millisecond=22 )
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 743869 steps, including 1929 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 0
Interrupted Best-First random walk after 747158 steps, including 1938 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 0
[2023-03-14 02:50:20] [INFO ] Flow matrix only has 10864 transitions (discarded 886 similar events)
// Phase 1: matrix 10864 rows 4619 cols
[2023-03-14 02:50:21] [INFO ] Computed 1093 place invariants in 289 ms
[2023-03-14 02:50:21] [INFO ] [Real]Absence check using 49 positive place invariants in 94 ms returned sat
[2023-03-14 02:50:21] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 151 ms returned unsat
[2023-03-14 02:50:22] [INFO ] [Real]Absence check using 49 positive place invariants in 95 ms returned sat
[2023-03-14 02:50:22] [INFO ] [Real]Absence check using 49 positive and 1044 generalized place invariants in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 98760 ms.

BK_STOP 1678762222361

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="MultiCrashLeafsetExtension-PT-S24C08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is MultiCrashLeafsetExtension-PT-S24C08, 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 r255-tall-167856440400107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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