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.r287-smll-167863553800078.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 Peterson-PT-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 68K Feb 25 22:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 323K Feb 25 22:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Feb 25 22:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Feb 25 22:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 138K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 255K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 225K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 298K Mar 5 18:23 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 Peterson-PT-4-UpperBounds-00
FORMULA_NAME Peterson-PT-4-UpperBounds-01
FORMULA_NAME Peterson-PT-4-UpperBounds-02
FORMULA_NAME Peterson-PT-4-UpperBounds-03
FORMULA_NAME Peterson-PT-4-UpperBounds-04
FORMULA_NAME Peterson-PT-4-UpperBounds-05
FORMULA_NAME Peterson-PT-4-UpperBounds-06
FORMULA_NAME Peterson-PT-4-UpperBounds-07
FORMULA_NAME Peterson-PT-4-UpperBounds-08
FORMULA_NAME Peterson-PT-4-UpperBounds-09
FORMULA_NAME Peterson-PT-4-UpperBounds-10
FORMULA_NAME Peterson-PT-4-UpperBounds-11
FORMULA_NAME Peterson-PT-4-UpperBounds-12
FORMULA_NAME Peterson-PT-4-UpperBounds-13
FORMULA_NAME Peterson-PT-4-UpperBounds-14
FORMULA_NAME Peterson-PT-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678922404007

Running Version 202205111006
[2023-03-15 23:20:06] [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-15 23:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:20:07] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2023-03-15 23:20:07] [INFO ] Transformed 480 places.
[2023-03-15 23:20:07] [INFO ] Transformed 690 transitions.
[2023-03-15 23:20:07] [INFO ] Found NUPN structural information;
[2023-03-15 23:20:07] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_0_3_4, IsEndLoop_1_3_4, TestAlone_3_1_4, TestAlone_2_2_4, TestIdentity_2_3_4, TestIdentity_4_0_4, AskForSection_0_3, AskForSection_0_2]
[2023-03-15 23:20:07] [INFO ] Parsed PT model containing 480 places and 690 transitions in 549 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
FORMULA Peterson-PT-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 23:20:07] [INFO ] Computed 19 place invariants in 44 ms
FORMULA Peterson-PT-4-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 10) seen :20
FORMULA Peterson-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :14
[2023-03-15 23:20:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-15 23:20:08] [INFO ] Computed 19 place invariants in 14 ms
[2023-03-15 23:20:08] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned unsat
[2023-03-15 23:20:08] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned unsat
[2023-03-15 23:20:09] [INFO ] [Real]Absence check using 14 positive place invariants in 43 ms returned unsat
[2023-03-15 23:20:09] [INFO ] [Real]Absence check using 14 positive place invariants in 39 ms returned sat
[2023-03-15 23:20:09] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-15 23:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:09] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-15 23:20:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-15 23:20:10] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 23:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:10] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2023-03-15 23:20:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-15 23:20:10] [INFO ] [Nat]Added 116 Read/Feed constraints in 61 ms returned sat
[2023-03-15 23:20:11] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 111 ms.
[2023-03-15 23:20:15] [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: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 23:20:15] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-15 23:20:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-15 23:20:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:15] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-15 23:20:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-15 23:20:15] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 23:20:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:16] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-15 23:20:16] [INFO ] [Nat]Added 116 Read/Feed constraints in 38 ms returned sat
[2023-03-15 23:20:16] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 48 ms.
[2023-03-15 23:20:17] [INFO ] Added : 81 causal constraints over 17 iterations in 1282 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 1, 1] Max seen :[5, 5, 5, 0, 0]
FORMULA Peterson-PT-4-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 480 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 480/480 places, 689/689 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 479 transition count 490
Reduce places removed 199 places and 2 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 280 transition count 488
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 279 transition count 487
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 278 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 401 place count 277 transition count 484
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 98 Pre rules applied. Total rules applied 401 place count 277 transition count 386
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 5 with 196 rules applied. Total rules applied 597 place count 179 transition count 386
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 635 place count 160 transition count 367
Applied a total of 635 rules in 169 ms. Remains 160 /480 variables (removed 320) and now considering 367/689 (removed 322) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/480 places, 367/689 transitions.
Normalized transition count is 307 out of 367 initially.
// Phase 1: matrix 307 rows 160 cols
[2023-03-15 23:20:18] [INFO ] Computed 19 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties (out of 1) seen :0
[2023-03-15 23:20:20] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
// Phase 1: matrix 307 rows 160 cols
[2023-03-15 23:20:20] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-15 23:20:20] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 23:20:20] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-15 23:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:21] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-15 23:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-15 23:20:21] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-15 23:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:21] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-15 23:20:21] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-15 23:20:21] [INFO ] [Nat]Added 114 Read/Feed constraints in 14 ms returned sat
[2023-03-15 23:20:21] [INFO ] Computed and/alt/rep : 266/776/266 causal constraints (skipped 36 transitions) in 30 ms.
[2023-03-15 23:20:21] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 6 ms to minimize.
[2023-03-15 23:20:21] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 2 ms to minimize.
[2023-03-15 23:20:21] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2023-03-15 23:20:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 462 ms
[2023-03-15 23:20:22] [INFO ] Added : 45 causal constraints over 10 iterations in 785 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 367/367 transitions.
Applied a total of 0 rules in 33 ms. Remains 160 /160 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 367/367 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 367/367 transitions.
Applied a total of 0 rules in 29 ms. Remains 160 /160 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2023-03-15 23:20:22] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
// Phase 1: matrix 307 rows 160 cols
[2023-03-15 23:20:22] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-15 23:20:22] [INFO ] Implicit Places using invariants in 409 ms returned [150, 151, 152, 153, 154]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 412 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 155/160 places, 367/367 transitions.
Applied a total of 0 rules in 24 ms. Remains 155 /155 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 155/160 places, 367/367 transitions.
Normalized transition count is 307 out of 367 initially.
// Phase 1: matrix 307 rows 155 cols
[2023-03-15 23:20:22] [INFO ] Computed 14 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 1) seen :0
[2023-03-15 23:20:25] [INFO ] Flow matrix only has 307 transitions (discarded 60 similar events)
// Phase 1: matrix 307 rows 155 cols
[2023-03-15 23:20:25] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-15 23:20:25] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-15 23:20:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:25] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-15 23:20:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-15 23:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:25] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-15 23:20:25] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-15 23:20:25] [INFO ] [Nat]Added 114 Read/Feed constraints in 13 ms returned sat
[2023-03-15 23:20:25] [INFO ] Computed and/alt/rep : 266/776/266 causal constraints (skipped 36 transitions) in 27 ms.
[2023-03-15 23:20:25] [INFO ] Added : 10 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA Peterson-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 19073 ms.

BK_STOP 1678922425758

--------------------
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="Peterson-PT-4"
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 Peterson-PT-4, 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 r287-smll-167863553800078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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