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-165472292600085.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 DBSingleClientW-PT-d1m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745300079

Running Version 0
[2022-06-09 03:28:21] [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-09 03:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:28:21] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-06-09 03:28:21] [INFO ] Transformed 1440 places.
[2022-06-09 03:28:21] [INFO ] Transformed 672 transitions.
[2022-06-09 03:28:21] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:28:22] [INFO ] Computed 6 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:28:22] [INFO ] Computed 6 place invariants in 22 ms
[2022-06-09 03:28:22] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2022-06-09 03:28:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned unsat
[2022-06-09 03:28:22] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:28:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-06-09 03:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:22] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-09 03:28:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:28:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:23] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-09 03:28:23] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:28:23] [INFO ] [Nat]Added 418 Read/Feed constraints in 364 ms returned sat
[2022-06-09 03:28:23] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 4 ms to minimize.
[2022-06-09 03:28:23] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 1 ms to minimize.
[2022-06-09 03:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2022-06-09 03:28:23] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 134 ms.
[2022-06-09 03:28:25] [INFO ] Added : 118 causal constraints over 24 iterations in 1280 ms. Result :sat
Minimization took 696 ms.
[2022-06-09 03:28:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:28:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:26] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-06-09 03:28:26] [INFO ] [Real]Added 418 Read/Feed constraints in 157 ms returned sat
[2022-06-09 03:28:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:28:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:26] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-06-09 03:28:26] [INFO ] [Nat]Added 418 Read/Feed constraints in 327 ms returned sat
[2022-06-09 03:28:26] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 1 ms to minimize.
[2022-06-09 03:28:27] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2022-06-09 03:28:27] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2022-06-09 03:28:27] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 0 ms to minimize.
[2022-06-09 03:28:27] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 0 ms to minimize.
[2022-06-09 03:28:27] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2022-06-09 03:28:27] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 2 ms to minimize.
[2022-06-09 03:28:28] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2022-06-09 03:28:28] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-06-09 03:28:28] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2022-06-09 03:28:28] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-06-09 03:28:28] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2022-06-09 03:28:29] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-06-09 03:28:29] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2022-06-09 03:28:29] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2022-06-09 03:28:29] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-06-09 03:28:29] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2022-06-09 03:28:29] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2022-06-09 03:28:30] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2022-06-09 03:28:30] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3665 ms
[2022-06-09 03:28:30] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 61 ms.
[2022-06-09 03:28: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: Broken pipe ... while checking expression at index 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
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, 9, 4] Max seen :[1, 0, 1]
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 44400 steps, including 8676 resets, run finished after 228 ms. (steps per millisecond=194 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.6 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 326 transition count 592
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 176 place count 231 transition count 333
Iterating global reduction 1 with 95 rules applied. Total rules applied 271 place count 231 transition count 333
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 274 place count 231 transition count 330
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 348 place count 157 transition count 256
Iterating global reduction 2 with 74 rules applied. Total rules applied 422 place count 157 transition count 256
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 428 place count 157 transition count 250
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 470 place count 115 transition count 183
Iterating global reduction 3 with 42 rules applied. Total rules applied 512 place count 115 transition count 183
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 535 place count 115 transition count 160
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 547 place count 103 transition count 139
Iterating global reduction 4 with 12 rules applied. Total rules applied 559 place count 103 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 561 place count 103 transition count 137
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 569 place count 95 transition count 129
Iterating global reduction 5 with 8 rules applied. Total rules applied 577 place count 95 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 580 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 586 place count 89 transition count 120
Iterating global reduction 6 with 6 rules applied. Total rules applied 592 place count 89 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 593 place count 89 transition count 119
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 595 place count 87 transition count 111
Iterating global reduction 7 with 2 rules applied. Total rules applied 597 place count 87 transition count 111
Applied a total of 597 rules in 96 ms. Remains 87 /347 variables (removed 260) and now considering 111/672 (removed 561) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/347 places, 111/672 transitions.
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:28:31] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229620 resets, run finished after 1000 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98418 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98153 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 2) seen :2
// Phase 1: matrix 111 rows 87 cols
[2022-06-09 03:28:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:28:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:33] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2022-06-09 03:28:33] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 03:28:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-09 03:28:33] [INFO ] [Real]Added 36 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:28:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:33] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:28:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:28:33] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2022-06-09 03:28:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-06-09 03:28:33] [INFO ] Computed and/alt/rep : 33/75/33 causal constraints (skipped 77 transitions) in 7 ms.
[2022-06-09 03:28:34] [INFO ] Added : 28 causal constraints over 6 iterations in 76 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1, 4] Max seen :[1, 2]
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 19000 steps, including 3350 resets, run finished after 37 ms. (steps per millisecond=513 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 87/87 places, 111/111 transitions.
Graph (complete) has 272 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 86 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 85 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 85 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 85 transition count 106
Applied a total of 7 rules in 23 ms. Remains 85 /87 variables (removed 2) and now considering 106/111 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/87 places, 106/111 transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:34] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229921 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98259 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 1) seen :2
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:28:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:28:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:28:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:35] [INFO ] [Nat]Added 31 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:28:35] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:28:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-09 03:28:35] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 75 transitions) in 6 ms.
[2022-06-09 03:28:35] [INFO ] Added : 28 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[2]
Incomplete Parikh walk after 18700 steps, including 3417 resets, run finished after 25 ms. (steps per millisecond=748 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:28:35] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:28:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:35] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-06-09 03:28:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:28:36] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:36] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1029 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:36] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:28:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:36] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:28:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:36] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:28:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:36] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:28:36] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2022-06-09 03:28:36] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:28:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2022-06-09 03:28:36] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 75 transitions) in 6 ms.
[2022-06-09 03:28:36] [INFO ] Added : 28 causal constraints over 6 iterations in 69 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 19000 steps, including 3424 resets, run finished after 30 ms. (steps per millisecond=633 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:36] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229818 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98027 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :1
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:28:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:37] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:28:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:28:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:37] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:28:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:37] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:28:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-06-09 03:28:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-09 03:28:37] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 75 transitions) in 9 ms.
[2022-06-09 03:28:38] [INFO ] Added : 28 causal constraints over 6 iterations in 74 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 18700 steps, including 3330 resets, run finished after 20 ms. (steps per millisecond=935 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:28:38] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:28:38] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-06-09 03:28:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:28:38] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229519 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98496 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 1) seen :2
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:28:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:28:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:28:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:28:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:28:39] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:39] [INFO ] [Nat]Added 31 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:28:39] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-06-09 03:28:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-06-09 03:28:39] [INFO ] Computed and/alt/rep : 30/69/30 causal constraints (skipped 75 transitions) in 8 ms.
[2022-06-09 03:28:39] [INFO ] Added : 28 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 18700 steps, including 3374 resets, run finished after 22 ms. (steps per millisecond=850 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 13 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 106/106 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:28:40] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:28:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 03:28:40] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2022-06-09 03:28:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 85 cols
[2022-06-09 03:28:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:28:40] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 106/106 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12 in 4332 ms.
[2022-06-09 03:28:40] [INFO ] Flatten gal took : 43 ms
[2022-06-09 03:28:40] [INFO ] Applying decomposition
[2022-06-09 03:28:40] [INFO ] Flatten gal took : 12 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/graph3507768919341053815.txt, -o, /tmp/graph3507768919341053815.bin, -w, /tmp/graph3507768919341053815.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/graph3507768919341053815.bin, -l, -1, -v, -w, /tmp/graph3507768919341053815.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:28:40] [INFO ] Decomposing Gal with order
[2022-06-09 03:28:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:28:40] [INFO ] Removed a total of 103 redundant transitions.
[2022-06-09 03:28:40] [INFO ] Flatten gal took : 41 ms
[2022-06-09 03:28:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 9 ms.
[2022-06-09 03:28:40] [INFO ] Time to serialize gal into /tmp/UpperBounds8859389797870950963.gal : 7 ms
[2022-06-09 03:28:40] [INFO ] Time to serialize properties into /tmp/UpperBounds10306242279789874896.prop : 0 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/UpperBounds8859389797870950963.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10306242279789874896.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/UpperBounds8859389797870950963.gal -t CGAL -reachable-file /tmp/UpperBounds10306242279789874896.prop --nowitness
Loading property file /tmp/UpperBounds10306242279789874896.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,8.24113e+07,165.169,2223708,3984,3357,660705,448012,329,2.22933e+07,105,5.47838e+06,0
Total reachable state count : 82411284

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d1m09-UpperBounds-12 :0 <= i2.u0.l950 <= 4
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-12 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m09-UpperBounds-12,0,166.476,2223972,1,0,660705,448012,417,2.22933e+07,137,5.47838e+06,2149

BK_STOP 1654745488733

--------------------
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="DBSingleClientW-PT-d1m09"
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 DBSingleClientW-PT-d1m09, 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-165472292600085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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