Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690555700061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is StigmergyCommit-PT-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555700061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 17:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 231K May 18 16:43 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 StigmergyCommit-PT-02b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717110676326

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-30 23:11:17] [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]
[2024-05-30 23:11:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 23:11:18] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-30 23:11:18] [INFO ] Transformed 928 places.
[2024-05-30 23:11:18] [INFO ] Transformed 1040 transitions.
[2024-05-30 23:11:18] [INFO ] Found NUPN structural information;
[2024-05-30 23:11:18] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1040 rows 928 cols
[2024-05-30 23:11:18] [INFO ] Computed 4 invariants in 29 ms
Incomplete random walk after 10000 steps, including 158 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
[2024-05-30 23:11:18] [INFO ] Invariant cache hit.
[2024-05-30 23:11:18] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-05-30 23:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:19] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2024-05-30 23:11:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2024-05-30 23:11:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:19] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-30 23:11:19] [INFO ] Deduced a trap composed of 396 places in 273 ms of which 3 ms to minimize.
[2024-05-30 23:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2024-05-30 23:11:19] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 57 ms.
[2024-05-30 23:11:24] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 1 ms to minimize.
[2024-05-30 23:11:24] [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 0
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 23:11:24] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-30 23:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:24] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2024-05-30 23:11:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:25] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2024-05-30 23:11:25] [INFO ] Deduced a trap composed of 398 places in 260 ms of which 2 ms to minimize.
[2024-05-30 23:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2024-05-30 23:11:25] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 57 ms.
[2024-05-30 23:11:29] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 23:11:30] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:30] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-05-30 23:11:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2024-05-30 23:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:30] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-05-30 23:11:31] [INFO ] Deduced a trap composed of 397 places in 257 ms of which 1 ms to minimize.
[2024-05-30 23:11:31] [INFO ] Deduced a trap composed of 401 places in 186 ms of which 1 ms to minimize.
[2024-05-30 23:11:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 582 ms
[2024-05-30 23:11:31] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 58 ms.
[2024-05-30 23:11:34] [INFO ] Added : 320 causal constraints over 64 iterations in 3389 ms. Result :sat
Minimization took 199 ms.
[2024-05-30 23:11:35] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-30 23:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:35] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2024-05-30 23:11:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 18 ms returned sat
[2024-05-30 23:11:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:35] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2024-05-30 23:11:36] [INFO ] Deduced a trap composed of 300 places in 248 ms of which 1 ms to minimize.
[2024-05-30 23:11:36] [INFO ] Deduced a trap composed of 397 places in 229 ms of which 1 ms to minimize.
[2024-05-30 23:11:36] [INFO ] Deduced a trap composed of 297 places in 258 ms of which 1 ms to minimize.
[2024-05-30 23:11:37] [INFO ] Deduced a trap composed of 396 places in 252 ms of which 1 ms to minimize.
[2024-05-30 23:11:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1213 ms
[2024-05-30 23:11:37] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 57 ms.
[2024-05-30 23:11:40] [INFO ] Added : 325 causal constraints over 65 iterations in 3366 ms. Result :unknown
[2024-05-30 23:11:40] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-30 23:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:41] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-05-30 23:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:41] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2024-05-30 23:11:41] [INFO ] Deduced a trap composed of 401 places in 247 ms of which 1 ms to minimize.
[2024-05-30 23:11:42] [INFO ] Deduced a trap composed of 398 places in 185 ms of which 1 ms to minimize.
[2024-05-30 23:11:42] [INFO ] Deduced a trap composed of 396 places in 246 ms of which 1 ms to minimize.
[2024-05-30 23:11:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 862 ms
[2024-05-30 23:11:42] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 49 ms.
[2024-05-30 23:11:46] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 1 ms to minimize.
[2024-05-30 23:11:46] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 23:11:46] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-30 23:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:46] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-05-30 23:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:47] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2024-05-30 23:11:47] [INFO ] Deduced a trap composed of 397 places in 263 ms of which 0 ms to minimize.
[2024-05-30 23:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2024-05-30 23:11:47] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 52 ms.
[2024-05-30 23:11:52] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 0 ms to minimize.
[2024-05-30 23:11:52] [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 5
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 23:11:52] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-05-30 23:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:52] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-30 23:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:53] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2024-05-30 23:11:53] [INFO ] Deduced a trap composed of 396 places in 246 ms of which 0 ms to minimize.
[2024-05-30 23:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2024-05-30 23:11:53] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 50 ms.
[2024-05-30 23:11:57] [INFO ] Deduced a trap composed of 20 places in 267 ms of which 1 ms to minimize.
[2024-05-30 23:11:57] [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 6
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-30 23:11:58] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-30 23:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:58] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2024-05-30 23:11:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:11:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:11:58] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2024-05-30 23:11:59] [INFO ] Deduced a trap composed of 397 places in 246 ms of which 1 ms to minimize.
[2024-05-30 23:11:59] [INFO ] Deduced a trap composed of 420 places in 184 ms of which 1 ms to minimize.
[2024-05-30 23:11:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 570 ms
[2024-05-30 23:11:59] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 51 ms.
[2024-05-30 23:12:03] [INFO ] Added : 370 causal constraints over 74 iterations in 3998 ms. Result :unknown
[2024-05-30 23:12:03] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-30 23:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:12:03] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2024-05-30 23:12:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:12:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2024-05-30 23:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:12:04] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2024-05-30 23:12:04] [INFO ] Deduced a trap composed of 400 places in 246 ms of which 1 ms to minimize.
[2024-05-30 23:12:04] [INFO ] Deduced a trap composed of 396 places in 255 ms of which 0 ms to minimize.
[2024-05-30 23:12:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 637 ms
[2024-05-30 23:12:05] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 67 ms.
[2024-05-30 23:12:08] [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 8
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 909 edges and 928 vertex of which 63 / 928 are part of one of the 9 SCC in 6 ms
Free SCC test removed 54 places
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 1173 edges and 874 vertex of which 868 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 688 rules applied. Total rules applied 690 place count 868 transition count 280
Reduce places removed 685 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 709 rules applied. Total rules applied 1399 place count 183 transition count 256
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 14 rules applied. Total rules applied 1413 place count 174 transition count 251
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1418 place count 169 transition count 251
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1418 place count 169 transition count 221
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1478 place count 139 transition count 221
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1514 place count 103 transition count 185
Iterating global reduction 4 with 36 rules applied. Total rules applied 1550 place count 103 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1550 place count 103 transition count 184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1552 place count 102 transition count 184
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1571 place count 83 transition count 128
Iterating global reduction 4 with 19 rules applied. Total rules applied 1590 place count 83 transition count 128
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1597 place count 83 transition count 121
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1601 place count 79 transition count 117
Iterating global reduction 5 with 4 rules applied. Total rules applied 1605 place count 79 transition count 117
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1609 place count 75 transition count 113
Iterating global reduction 5 with 4 rules applied. Total rules applied 1613 place count 75 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1617 place count 75 transition count 109
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1635 place count 66 transition count 100
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1636 place count 66 transition count 99
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1639 place count 63 transition count 96
Iterating global reduction 7 with 3 rules applied. Total rules applied 1642 place count 63 transition count 96
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1645 place count 60 transition count 93
Iterating global reduction 7 with 3 rules applied. Total rules applied 1648 place count 60 transition count 93
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1650 place count 58 transition count 91
Iterating global reduction 7 with 2 rules applied. Total rules applied 1652 place count 58 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1658 place count 55 transition count 104
Free-agglomeration rule applied 20 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1678 place count 55 transition count 81
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 30 rules applied. Total rules applied 1708 place count 35 transition count 71
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1711 place count 32 transition count 68
Iterating global reduction 8 with 3 rules applied. Total rules applied 1714 place count 32 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1715 place count 32 transition count 67
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 1734 place count 32 transition count 48
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1736 place count 32 transition count 48
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1737 place count 32 transition count 47
Applied a total of 1737 rules in 89 ms. Remains 32 /928 variables (removed 896) and now considering 47/1040 (removed 993) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 32/928 places, 47/1040 transitions.
// Phase 1: matrix 47 rows 32 cols
[2024-05-30 23:12:09] [INFO ] Computed 4 invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 7) seen :7
FORMULA StigmergyCommit-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 52362 ms.

BK_STOP 1717110731269

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="StigmergyCommit-PT-02b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is StigmergyCommit-PT-02b, 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 r417-tall-171690555700061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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