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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 09:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 130K Feb 26 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 NoC3x3-PT-7B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-7B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678917817115

Running Version 202205111006
[2023-03-15 22:03:39] [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 22:03:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:03:40] [INFO ] Load time of PNML (sax parser for PT used): 775 ms
[2023-03-15 22:03:40] [INFO ] Transformed 7014 places.
[2023-03-15 22:03:40] [INFO ] Transformed 8833 transitions.
[2023-03-15 22:03:40] [INFO ] Found NUPN structural information;
[2023-03-15 22:03:40] [INFO ] Parsed PT model containing 7014 places and 8833 transitions in 1122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 8833 rows 7014 cols
[2023-03-15 22:03:41] [INFO ] Computed 66 place invariants in 112 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 16) seen :6
FORMULA NoC3x3-PT-7B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
// Phase 1: matrix 8833 rows 7014 cols
[2023-03-15 22:03:41] [INFO ] Computed 66 place invariants in 56 ms
[2023-03-15 22:03:44] [INFO ] [Real]Absence check using 66 positive place invariants in 375 ms returned sat
[2023-03-15 22:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:46] [INFO ] [Real]Absence check using state equation in 2126 ms returned unknown
[2023-03-15 22:03:49] [INFO ] [Real]Absence check using 66 positive place invariants in 565 ms returned sat
[2023-03-15 22:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:51] [INFO ] [Real]Absence check using state equation in 2671 ms returned unknown
[2023-03-15 22:03:54] [INFO ] [Real]Absence check using 66 positive place invariants in 412 ms returned sat
[2023-03-15 22:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:03:56] [INFO ] [Real]Absence check using state equation in 2687 ms returned unknown
[2023-03-15 22:03:58] [INFO ] [Real]Absence check using 66 positive place invariants in 344 ms returned sat
[2023-03-15 22:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04:01] [INFO ] [Real]Absence check using state equation in 2919 ms returned unknown
[2023-03-15 22:04:03] [INFO ] [Real]Absence check using 66 positive place invariants in 359 ms returned sat
[2023-03-15 22:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04:06] [INFO ] [Real]Absence check using state equation in 2925 ms returned unknown
[2023-03-15 22:04:09] [INFO ] [Real]Absence check using 66 positive place invariants in 362 ms returned sat
[2023-03-15 22:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04:11] [INFO ] [Real]Absence check using state equation in 2599 ms returned unknown
[2023-03-15 22:04:14] [INFO ] [Real]Absence check using 66 positive place invariants in 458 ms returned sat
[2023-03-15 22:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04:16] [INFO ] [Real]Absence check using state equation in 2802 ms returned unknown
[2023-03-15 22:04:18] [INFO ] [Real]Absence check using 66 positive place invariants in 392 ms returned sat
[2023-03-15 22:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04:21] [INFO ] [Real]Absence check using state equation in 3020 ms returned unknown
[2023-03-15 22:04:23] [INFO ] [Real]Absence check using 66 positive place invariants in 337 ms returned sat
[2023-03-15 22:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04: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 8
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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 22:04:28] [INFO ] [Real]Absence check using 66 positive place invariants in 344 ms returned sat
[2023-03-15 22:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:04:31] [INFO ] [Real]Absence check using state equation in 2943 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 7014 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7801 edges and 7014 vertex of which 4828 / 7014 are part of one of the 33 SCC in 31 ms
Free SCC test removed 4795 places
Drop transitions removed 5878 transitions
Reduce isomorphic transitions removed 5878 transitions.
Drop transitions removed 380 transitions
Trivial Post-agglo rules discarded 380 transitions
Performed 380 trivial Post agglomeration. Transition count delta: 380
Iterating post reduction 0 with 380 rules applied. Total rules applied 381 place count 2219 transition count 2575
Reduce places removed 380 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 392 rules applied. Total rules applied 773 place count 1839 transition count 2563
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 787 place count 1831 transition count 2557
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 790 place count 1828 transition count 2557
Discarding 761 places :
Symmetric choice reduction at 4 with 761 rule applications. Total rules 1551 place count 1067 transition count 1796
Iterating global reduction 4 with 761 rules applied. Total rules applied 2312 place count 1067 transition count 1796
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 2312 place count 1067 transition count 1734
Deduced a syphon composed of 62 places in 9 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 2436 place count 1005 transition count 1734
Discarding 489 places :
Symmetric choice reduction at 4 with 489 rule applications. Total rules 2925 place count 516 transition count 1020
Iterating global reduction 4 with 489 rules applied. Total rules applied 3414 place count 516 transition count 1020
Ensure Unique test removed 429 transitions
Reduce isomorphic transitions removed 429 transitions.
Iterating post reduction 4 with 429 rules applied. Total rules applied 3843 place count 516 transition count 591
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3844 place count 515 transition count 589
Iterating global reduction 5 with 1 rules applied. Total rules applied 3845 place count 515 transition count 589
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3846 place count 514 transition count 588
Iterating global reduction 5 with 1 rules applied. Total rules applied 3847 place count 514 transition count 588
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3848 place count 513 transition count 587
Iterating global reduction 5 with 1 rules applied. Total rules applied 3849 place count 513 transition count 587
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3850 place count 512 transition count 585
Iterating global reduction 5 with 1 rules applied. Total rules applied 3851 place count 512 transition count 585
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 5 with 222 rules applied. Total rules applied 4073 place count 401 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4075 place count 401 transition count 472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4077 place count 400 transition count 471
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 4085 place count 396 transition count 485
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 4088 place count 396 transition count 482
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 4101 place count 396 transition count 469
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 4104 place count 393 transition count 466
Iterating global reduction 7 with 3 rules applied. Total rules applied 4107 place count 393 transition count 466
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4109 place count 392 transition count 477
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 4112 place count 392 transition count 474
Free-agglomeration rule applied 201 times.
Iterating global reduction 7 with 201 rules applied. Total rules applied 4313 place count 392 transition count 273
Reduce places removed 201 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 517 edges and 191 vertex of which 57 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.3 ms
Discarding 134 places :
Also discarding 86 output transitions
Drop transitions removed 86 transitions
Iterating post reduction 7 with 239 rules applied. Total rules applied 4552 place count 57 transition count 150
Drop transitions removed 90 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 8 with 93 rules applied. Total rules applied 4645 place count 57 transition count 57
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4646 place count 57 transition count 56
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 4647 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 117 edges and 56 vertex of which 48 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 9 with 2 rules applied. Total rules applied 4649 place count 48 transition count 51
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 4654 place count 48 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4655 place count 47 transition count 45
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 15 edges and 38 vertex of which 9 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 11 rules applied. Total rules applied 4666 place count 31 transition count 44
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 4679 place count 30 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4681 place count 29 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4682 place count 29 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 4683 place count 28 transition count 30
Applied a total of 4683 rules in 1099 ms. Remains 28 /7014 variables (removed 6986) and now considering 30/8833 (removed 8803) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/7014 places, 30/8833 transitions.
// Phase 1: matrix 30 rows 28 cols
[2023-03-15 22:04:33] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 10) seen :10
FORMULA NoC3x3-PT-7B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 54858 ms.

BK_STOP 1678917874598

--------------------
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="NoC3x3-PT-7B"
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 NoC3x3-PT-7B, 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-167863553800042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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