Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292500010.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BugTracking-PT-q3m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.0K Jun 7 16:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 16:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 7 16:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 16:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Jun 7 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 7 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q3m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654730177877

Running Version 0
[2022-06-08 23:16:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 23:16:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:16:20] [INFO ] Load time of PNML (sax parser for PT used): 817 ms
[2022-06-08 23:16:20] [INFO ] Transformed 754 places.
[2022-06-08 23:16:20] [INFO ] Transformed 27370 transitions.
[2022-06-08 23:16:20] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 967 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 514 places in 135 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 23:16:20] [INFO ] Computed 10 place invariants in 50 ms
Incomplete random walk after 10002 steps, including 37 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :1
FORMULA BugTracking-PT-q3m016-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
[2022-06-08 23:16:20] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 23:16:21] [INFO ] Computed 10 place invariants in 17 ms
[2022-06-08 23:16:21] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 23:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:21] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-06-08 23:16:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:22] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2022-06-08 23:16:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 23:16:22] [INFO ] [Nat]Added 268 Read/Feed constraints in 134 ms returned sat
[2022-06-08 23:16:22] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 4 ms to minimize.
[2022-06-08 23:16:22] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 2 ms to minimize.
[2022-06-08 23:16:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2022-06-08 23:16:23] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 287 ms.
[2022-06-08 23:16:25] [INFO ] Added : 92 causal constraints over 19 iterations in 2563 ms. Result :sat
Minimization took 365 ms.
[2022-06-08 23:16:26] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-06-08 23:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:26] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2022-06-08 23:16:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:16:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:26] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2022-06-08 23:16:26] [INFO ] [Nat]Added 268 Read/Feed constraints in 134 ms returned sat
[2022-06-08 23:16:27] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 2 ms to minimize.
[2022-06-08 23:16:27] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 2 ms to minimize.
[2022-06-08 23:16:27] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2022-06-08 23:16:27] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 0 ms to minimize.
[2022-06-08 23:16:28] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2022-06-08 23:16:28] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2022-06-08 23:16:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1371 ms
[2022-06-08 23:16:28] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 151 ms.
[2022-06-08 23:16:30] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 0 ms to minimize.
[2022-06-08 23:16:31] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 0 ms to minimize.
[2022-06-08 23:16:31] [INFO ] Deduced a trap composed of 52 places in 290 ms of which 0 ms to minimize.
[2022-06-08 23:16:31] [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 1
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, -1] Max seen :[0, 0]
Incomplete Parikh walk after 1080800 steps, including 8659 resets, run finished after 8079 ms. (steps per millisecond=133 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 285 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:16:40] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 2970 ms. (steps per millisecond=336 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2175 ms. (steps per millisecond=459 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2128 ms. (steps per millisecond=469 ) properties (out of 2) seen :0
[2022-06-08 23:16:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:16:47] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 23:16:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:47] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2022-06-08 23:16:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:48] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-08 23:16:48] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:16:48] [INFO ] [Nat]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 23:16:48] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:16:48] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2022-06-08 23:16:48] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2022-06-08 23:16:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 702 ms
[2022-06-08 23:16:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 168 ms.
[2022-06-08 23:16:51] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-06-08 23:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2022-06-08 23:16:51] [INFO ] Added : 99 causal constraints over 20 iterations in 2676 ms. Result :sat
Minimization took 394 ms.
[2022-06-08 23:16:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:16:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:52] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-06-08 23:16:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:16:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:16:52] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-06-08 23:16:52] [INFO ] [Nat]Added 254 Read/Feed constraints in 132 ms returned sat
[2022-06-08 23:16:53] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:16:53] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:16:53] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:16:53] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:16:54] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 0 ms to minimize.
[2022-06-08 23:16:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1380 ms
[2022-06-08 23:16:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 147 ms.
[2022-06-08 23:16:55] [INFO ] Added : 60 causal constraints over 12 iterations in 1508 ms. Result :sat
Minimization took 305 ms.
Current structural bounds on expressions (after SMT) : [1, -1] Max seen :[0, 0]
Incomplete Parikh walk after 503000 steps, including 887 resets, run finished after 5555 ms. (steps per millisecond=90 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 943500 steps, including 1000 resets, run finished after 8622 ms. (steps per millisecond=109 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:17:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:10] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:17:10] [INFO ] Implicit Places using invariants in 334 ms returned []
[2022-06-08 23:17:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:10] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-08 23:17:11] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:14] [INFO ] Implicit Places using invariants and state equation in 4060 ms returned []
Implicit Place search using SMT with State Equation took 4408 ms to find 0 implicit places.
[2022-06-08 23:17:15] [INFO ] Redundant transitions in 213 ms returned []
[2022-06-08 23:17:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:15] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 23:17:15] [INFO ] Dead Transitions using invariants and state equation in 721 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m016-UpperBounds-09
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:15] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2022-06-08 23:17:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:15] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:17:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:16] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2022-06-08 23:17:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:16] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2022-06-08 23:17:16] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:16] [INFO ] [Nat]Added 254 Read/Feed constraints in 124 ms returned sat
[2022-06-08 23:17:16] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:17:17] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2022-06-08 23:17:17] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 0 ms to minimize.
[2022-06-08 23:17:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 704 ms
[2022-06-08 23:17:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-08 23:17:19] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-06-08 23:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-06-08 23:17:20] [INFO ] Added : 99 causal constraints over 20 iterations in 2657 ms. Result :sat
Minimization took 396 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 943500 steps, including 1000 resets, run finished after 8557 ms. (steps per millisecond=110 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:29] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2895 ms. (steps per millisecond=345 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2059 ms. (steps per millisecond=485 ) properties (out of 1) seen :0
[2022-06-08 23:17:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:34] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-08 23:17:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:34] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2022-06-08 23:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:34] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2022-06-08 23:17:34] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:35] [INFO ] [Nat]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2022-06-08 23:17:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 711 ms
[2022-06-08 23:17:35] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 140 ms.
[2022-06-08 23:17:38] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2022-06-08 23:17:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2022-06-08 23:17:38] [INFO ] Added : 99 causal constraints over 20 iterations in 2700 ms. Result :sat
Minimization took 406 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 943500 steps, including 1000 resets, run finished after 8514 ms. (steps per millisecond=110 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:17:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:47] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-08 23:17:47] [INFO ] Implicit Places using invariants in 303 ms returned []
[2022-06-08 23:17:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:47] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:17:48] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:52] [INFO ] Implicit Places using invariants and state equation in 4556 ms returned []
Implicit Place search using SMT with State Equation took 4862 ms to find 0 implicit places.
[2022-06-08 23:17:52] [INFO ] Redundant transitions in 145 ms returned []
[2022-06-08 23:17:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:52] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:17:53] [INFO ] Dead Transitions using invariants and state equation in 741 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m016-UpperBounds-09 in 37508 ms.
Starting property specific reduction for BugTracking-PT-q3m016-UpperBounds-10
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:53] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) 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 1) seen :0
[2022-06-08 23:17:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:53] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 23:17:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-08 23:17:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:53] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-06-08 23:17:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:54] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-08 23:17:54] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:54] [INFO ] [Nat]Added 254 Read/Feed constraints in 128 ms returned sat
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1446 ms
[2022-06-08 23:17:55] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 166 ms.
[2022-06-08 23:17:57] [INFO ] Added : 60 causal constraints over 12 iterations in 1574 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 503000 steps, including 891 resets, run finished after 5530 ms. (steps per millisecond=90 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:03] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000010 steps, including 2 resets, run finished after 2689 ms. (steps per millisecond=371 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2079 ms. (steps per millisecond=481 ) properties (out of 1) seen :0
[2022-06-08 23:18:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:08] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:18:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:08] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-08 23:18:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:08] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2022-06-08 23:18:08] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:18:08] [INFO ] [Nat]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 4 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1325 ms
[2022-06-08 23:18:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-08 23:18:11] [INFO ] Added : 60 causal constraints over 12 iterations in 1516 ms. Result :sat
Minimization took 295 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 503000 steps, including 899 resets, run finished after 5466 ms. (steps per millisecond=92 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:18:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:17] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-08 23:18:17] [INFO ] Implicit Places using invariants in 327 ms returned []
[2022-06-08 23:18:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:17] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:18:18] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:18:22] [INFO ] Implicit Places using invariants and state equation in 4746 ms returned []
Implicit Place search using SMT with State Equation took 5075 ms to find 0 implicit places.
[2022-06-08 23:18:22] [INFO ] Redundant transitions in 69 ms returned []
[2022-06-08 23:18:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:22] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 23:18:23] [INFO ] Dead Transitions using invariants and state equation in 691 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m016-UpperBounds-10 in 30184 ms.
[2022-06-08 23:18:24] [INFO ] Flatten gal took : 346 ms
[2022-06-08 23:18:24] [INFO ] Applying decomposition
[2022-06-08 23:18:24] [INFO ] Flatten gal took : 154 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9017158774701562952.txt, -o, /tmp/graph9017158774701562952.bin, -w, /tmp/graph9017158774701562952.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9017158774701562952.bin, -l, -1, -v, -w, /tmp/graph9017158774701562952.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:18:24] [INFO ] Decomposing Gal with order
[2022-06-08 23:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:18:25] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-08 23:18:25] [INFO ] Flatten gal took : 385 ms
[2022-06-08 23:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 33 ms.
[2022-06-08 23:18:25] [INFO ] Time to serialize gal into /tmp/UpperBounds12423902253734442364.gal : 68 ms
[2022-06-08 23:18:25] [INFO ] Time to serialize properties into /tmp/UpperBounds1827511045483788513.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12423902253734442364.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1827511045483788513.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12423902253734442364.gal -t CGAL -reachable-file /tmp/UpperBounds1827511045483788513.prop --nowitness
Loading property file /tmp/UpperBounds1827511045483788513.prop.
Detected timeout of ITS tools.
[2022-06-08 23:39:15] [INFO ] Flatten gal took : 520 ms
[2022-06-08 23:39:15] [INFO ] Time to serialize gal into /tmp/UpperBounds9518317256162525866.gal : 76 ms
[2022-06-08 23:39:15] [INFO ] Time to serialize properties into /tmp/UpperBounds7097291631835602627.prop : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9518317256162525866.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7097291631835602627.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9518317256162525866.gal -t CGAL -reachable-file /tmp/UpperBounds7097291631835602627.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds7097291631835602627.prop.
Detected timeout of ITS tools.
[2022-06-08 23:59:57] [INFO ] Flatten gal took : 573 ms
[2022-06-09 00:00:00] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-09 00:00:00] [INFO ] Transformed 229 places.
[2022-06-09 00:00:00] [INFO ] Transformed 2747 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 00:00:01] [INFO ] Time to serialize gal into /tmp/UpperBounds14231927757392471.gal : 28 ms
[2022-06-09 00:00:01] [INFO ] Time to serialize properties into /tmp/UpperBounds17769468442049497025.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14231927757392471.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17769468442049497025.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14231927757392471.gal -t CGAL -reachable-file /tmp/UpperBounds17769468442049497025.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17769468442049497025.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q3m016, 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 r323-tall-165472292500010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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