Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824700029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is NoC3x3-PT-5B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824700029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 525K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-00
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-01
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-02
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-03
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-04
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-05
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-06
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-07
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-08
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-09
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-10
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-11
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-12
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-13
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-14
FORMULA_NAME NoC3x3-PT-5B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841381146

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:16:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:16:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:16:22] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-06-02 05:16:22] [INFO ] Transformed 1571 places.
[2025-06-02 05:16:22] [INFO ] Transformed 2173 transitions.
[2025-06-02 05:16:22] [INFO ] Found NUPN structural information;
[2025-06-02 05:16:22] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2173 rows 1571 cols
[2025-06-02 05:16:22] [INFO ] Computed 66 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (17 resets) in 65 ms. (151 steps per ms)
FORMULA NoC3x3-PT-5B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 05:16:23] [INFO ] Invariant cache hit.
[2025-06-02 05:16:23] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2025-06-02 05:16:24] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2025-06-02 05:16:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:24] [INFO ] [Nat]Absence check using 66 positive place invariants in 63 ms returned sat
[2025-06-02 05:16:25] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2025-06-02 05:16:25] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 135 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2025-06-02 05:16:29] [INFO ] [Real]Absence check using 66 positive place invariants in 50 ms returned sat
[2025-06-02 05:16:30] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2025-06-02 05:16:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:30] [INFO ] [Nat]Absence check using 66 positive place invariants in 45 ms returned sat
[2025-06-02 05:16:31] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2025-06-02 05:16:31] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 22 ms to minimize.
[2025-06-02 05:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2025-06-02 05:16:31] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 115 ms.
[2025-06-02 05:16:35] [INFO ] Added : 205 causal constraints over 41 iterations in 3810 ms. Result :unknown
[2025-06-02 05:16:35] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2025-06-02 05:16:36] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2025-06-02 05:16:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:36] [INFO ] [Nat]Absence check using 66 positive place invariants in 49 ms returned sat
[2025-06-02 05:16:37] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2025-06-02 05:16:37] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 99 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-02 05:16:42] [INFO ] [Real]Absence check using 66 positive place invariants in 47 ms returned sat
[2025-06-02 05:16:42] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2025-06-02 05:16:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:16:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 49 ms returned sat
[2025-06-02 05:16:43] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2025-06-02 05:16:43] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2025-06-02 05:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2025-06-02 05:16:44] [INFO ] Computed and/alt/rep : 2064/6375/2064 causal constraints (skipped 108 transitions) in 126 ms.
[2025-06-02 05:16:47] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1571 transition count 1837
Reduce places removed 336 places and 0 transitions.
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 1235 transition count 1837
Discarding 271 places :
Symmetric choice reduction at 2 with 271 rule applications. Total rules 943 place count 964 transition count 1566
Iterating global reduction 2 with 271 rules applied. Total rules applied 1214 place count 964 transition count 1566
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 1214 place count 964 transition count 1533
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 1280 place count 931 transition count 1533
Discarding 109 places :
Symmetric choice reduction at 2 with 109 rule applications. Total rules 1389 place count 822 transition count 1338
Iterating global reduction 2 with 109 rules applied. Total rules applied 1498 place count 822 transition count 1338
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 1552 place count 768 transition count 1227
Iterating global reduction 2 with 54 rules applied. Total rules applied 1606 place count 768 transition count 1227
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1629 place count 745 transition count 1181
Iterating global reduction 2 with 23 rules applied. Total rules applied 1652 place count 745 transition count 1181
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1658 place count 739 transition count 1169
Iterating global reduction 2 with 6 rules applied. Total rules applied 1664 place count 739 transition count 1169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1667 place count 736 transition count 1163
Iterating global reduction 2 with 3 rules applied. Total rules applied 1670 place count 736 transition count 1163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1673 place count 733 transition count 1154
Iterating global reduction 2 with 3 rules applied. Total rules applied 1676 place count 733 transition count 1154
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 2016 place count 563 transition count 984
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2019 place count 563 transition count 981
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2221 place count 462 transition count 1008
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 2233 place count 462 transition count 996
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 2311 place count 423 transition count 1004
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2313 place count 423 transition count 1002
Drop transitions (Redundant composition of simpler transitions.) removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 5 with 60 rules applied. Total rules applied 2373 place count 423 transition count 942
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 2382 place count 414 transition count 942
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 2382 place count 414 transition count 937
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 2392 place count 409 transition count 937
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 2428 place count 391 transition count 919
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 2430 place count 390 transition count 919
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 2435 place count 390 transition count 919
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2436 place count 389 transition count 918
Applied a total of 2436 rules in 630 ms. Remains 389 /1571 variables (removed 1182) and now considering 918/2173 (removed 1255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 389/1571 places, 918/2173 transitions.
// Phase 1: matrix 918 rows 389 cols
[2025-06-02 05:16:48] [INFO ] Computed 57 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (4941 resets) in 3605 ms. (277 steps per ms)
FORMULA NoC3x3-PT-5B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NoC3x3-PT-5B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (258 resets) in 1048 ms. (953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 05:16:53] [INFO ] Flatten gal took : 105 ms
[2025-06-02 05:16:53] [INFO ] Flatten gal took : 58 ms
[2025-06-02 05:16:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11262929645632653266.gal : 34 ms
[2025-06-02 05:16:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11559905872360016303.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11262929645632653266.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11559905872360016303.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 31679 ms.

BK_STOP 1748841414131

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is NoC3x3-PT-5B, 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 r153-tall-174876824700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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