Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r159-smll-167819445200065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DoubleLock-PT-p1s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445200065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Feb 25 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 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 DoubleLock-PT-p1s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678476765106

Running Version 202205111006
[2023-03-10 19:32:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 19:32:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 19:32:49] [INFO ] Load time of PNML (sax parser for PT used): 1029 ms
[2023-03-10 19:32:49] [INFO ] Transformed 570 places.
[2023-03-10 19:32:49] [INFO ] Transformed 7600 transitions.
[2023-03-10 19:32:49] [INFO ] Parsed PT model containing 570 places and 7600 transitions in 1316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 132 places in 53 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s2-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 5003 out of 7344 initially.
// Phase 1: matrix 5003 rows 438 cols
[2023-03-10 19:32:49] [INFO ] Computed 4 place invariants in 113 ms
Incomplete random walk after 10000 steps, including 87 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :6
FORMULA DoubleLock-PT-p1s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :1
FORMULA DoubleLock-PT-p1s2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :2
FORMULA DoubleLock-PT-p1s2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :3
FORMULA DoubleLock-PT-p1s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 19:32:49] [INFO ] Flow matrix only has 5003 transitions (discarded 2341 similar events)
// Phase 1: matrix 5003 rows 438 cols
[2023-03-10 19:32:49] [INFO ] Computed 4 place invariants in 82 ms
[2023-03-10 19:32:50] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-10 19:32:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-10 19:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:32:52] [INFO ] [Real]Absence check using state equation in 2118 ms returned sat
[2023-03-10 19:32:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:32:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-10 19:32:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 19:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:32:54] [INFO ] [Nat]Absence check using state equation in 2329 ms returned sat
[2023-03-10 19:32:55] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-10 19:32:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:32:57] [INFO ] [Nat]Added 400 Read/Feed constraints in 2483 ms returned unknown
[2023-03-10 19:32:57] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:32:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 19:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:32:59] [INFO ] [Real]Absence check using state equation in 1783 ms returned sat
[2023-03-10 19:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:32:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:32:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 19:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:01] [INFO ] [Nat]Absence check using state equation in 1694 ms returned sat
[2023-03-10 19:33:03] [INFO ] [Nat]Added 400 Read/Feed constraints in 2214 ms returned sat
[2023-03-10 19:33:05] [INFO ] Deduced a trap composed of 101 places in 1471 ms of which 6 ms to minimize.
[2023-03-10 19:33:05] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 19:33:05] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-10 19:33:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 19:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:07] [INFO ] [Real]Absence check using state equation in 1943 ms returned sat
[2023-03-10 19:33:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:33:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 19:33:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 19:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:09] [INFO ] [Nat]Absence check using state equation in 2167 ms returned sat
[2023-03-10 19:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:33:12] [INFO ] [Nat]Added 400 Read/Feed constraints in 2762 ms returned unknown
[2023-03-10 19:33:12] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 19:33:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 19:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:14] [INFO ] [Real]Absence check using state equation in 1462 ms returned sat
[2023-03-10 19:33:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:33:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:33:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 19:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:16] [INFO ] [Nat]Absence check using state equation in 1624 ms returned sat
[2023-03-10 19:33:19] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:33:19] [INFO ] [Nat]Added 400 Read/Feed constraints in 3177 ms returned sat
[2023-03-10 19:33:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1] Max seen :[0, 0, 2, 0]
Support contains 4 out of 438 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 438/438 places, 7344/7344 transitions.
Graph (complete) has 12357 edges and 438 vertex of which 434 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.27 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 434 transition count 7216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 433 transition count 7088
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 433 transition count 7088
Applied a total of 131 rules in 805 ms. Remains 433 /438 variables (removed 5) and now considering 7088/7344 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/438 places, 7088/7344 transitions.
Normalized transition count is 4747 out of 7088 initially.
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:20] [INFO ] Computed 3 place invariants in 44 ms
Incomplete random walk after 1000000 steps, including 8662 resets, run finished after 4759 ms. (steps per millisecond=210 ) properties (out of 4) seen :6
FORMULA DoubleLock-PT-p1s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p1s2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1377 resets, run finished after 1313 ms. (steps per millisecond=761 ) properties (out of 2) seen :3
FORMULA DoubleLock-PT-p1s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 19:33:26] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:26] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-10 19:33:26] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-10 19:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:28] [INFO ] [Real]Absence check using state equation in 2083 ms returned sat
[2023-03-10 19:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:33:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:30] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2023-03-10 19:33:30] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-10 19:33:33] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:33:36] [INFO ] [Nat]Added 400 Read/Feed constraints in 6094 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 231 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Normalized transition count is 4747 out of 7088 initially.
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:36] [INFO ] Computed 3 place invariants in 31 ms
Incomplete random walk after 1000001 steps, including 8671 resets, run finished after 5262 ms. (steps per millisecond=190 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1336 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties (out of 1) seen :4
[2023-03-10 19:33:43] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:43] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-10 19:33:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 19:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:44] [INFO ] [Real]Absence check using state equation in 1392 ms returned sat
[2023-03-10 19:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:33:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-10 19:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:33:46] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2023-03-10 19:33:46] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-10 19:33:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:33:53] [INFO ] [Nat]Added 400 Read/Feed constraints in 6131 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 245 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 405 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
[2023-03-10 19:33:53] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:53] [INFO ] Computed 3 place invariants in 42 ms
[2023-03-10 19:33:55] [INFO ] Implicit Places using invariants in 1823 ms returned []
[2023-03-10 19:33:55] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:55] [INFO ] Computed 3 place invariants in 46 ms
[2023-03-10 19:33:58] [INFO ] Implicit Places using invariants and state equation in 2914 ms returned []
Implicit Place search using SMT with State Equation took 4740 ms to find 0 implicit places.
[2023-03-10 19:33:59] [INFO ] Redundant transitions in 1246 ms returned []
[2023-03-10 19:33:59] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:33:59] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-10 19:34:05] [INFO ] Dead Transitions using invariants and state equation in 5475 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Starting property specific reduction for DoubleLock-PT-p1s2-UpperBounds-13
Normalized transition count is 4747 out of 7088 initially.
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:05] [INFO ] Computed 3 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 89 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
[2023-03-10 19:34:05] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:05] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-10 19:34:05] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:34:07] [INFO ] [Real]Absence check using state equation in 1627 ms returned sat
[2023-03-10 19:34:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:34:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:34:08] [INFO ] [Nat]Absence check using state equation in 1479 ms returned sat
[2023-03-10 19:34:08] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-10 19:34:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:34:12] [INFO ] [Nat]Added 400 Read/Feed constraints in 3432 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 220 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Normalized transition count is 4747 out of 7088 initially.
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:12] [INFO ] Computed 3 place invariants in 28 ms
Incomplete random walk after 1000002 steps, including 8638 resets, run finished after 4926 ms. (steps per millisecond=203 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 1360 resets, run finished after 1235 ms. (steps per millisecond=809 ) properties (out of 1) seen :4
[2023-03-10 19:34:18] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:18] [INFO ] Computed 3 place invariants in 28 ms
[2023-03-10 19:34:18] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 19:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:34:20] [INFO ] [Real]Absence check using state equation in 1786 ms returned sat
[2023-03-10 19:34:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:34:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 19:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:34:22] [INFO ] [Nat]Absence check using state equation in 1622 ms returned sat
[2023-03-10 19:34:22] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-10 19:34:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:34:28] [INFO ] [Nat]Added 400 Read/Feed constraints in 6082 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 318 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 282 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
[2023-03-10 19:34:29] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:29] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-10 19:34:30] [INFO ] Implicit Places using invariants in 1719 ms returned []
[2023-03-10 19:34:30] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:30] [INFO ] Computed 3 place invariants in 50 ms
[2023-03-10 19:34:32] [INFO ] Implicit Places using invariants and state equation in 2167 ms returned []
Implicit Place search using SMT with State Equation took 3890 ms to find 0 implicit places.
[2023-03-10 19:34:33] [INFO ] Redundant transitions in 680 ms returned []
[2023-03-10 19:34:33] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:33] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-10 19:34:38] [INFO ] Dead Transitions using invariants and state equation in 4443 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Normalized transition count is 4747 out of 7088 initially.
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:38] [INFO ] Computed 3 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 8646 resets, run finished after 5073 ms. (steps per millisecond=197 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 1345 resets, run finished after 1544 ms. (steps per millisecond=647 ) properties (out of 1) seen :3
[2023-03-10 19:34:44] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:44] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-10 19:34:44] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 19:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:34:46] [INFO ] [Real]Absence check using state equation in 1627 ms returned sat
[2023-03-10 19:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:34:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 19:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:34:48] [INFO ] [Nat]Absence check using state equation in 1642 ms returned sat
[2023-03-10 19:34:48] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-10 19:34:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:34:54] [INFO ] [Nat]Added 400 Read/Feed constraints in 6088 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 304 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 286 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
[2023-03-10 19:34:55] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:55] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-10 19:34:56] [INFO ] Implicit Places using invariants in 1662 ms returned []
[2023-03-10 19:34:56] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:34:56] [INFO ] Computed 3 place invariants in 42 ms
[2023-03-10 19:34:59] [INFO ] Implicit Places using invariants and state equation in 2924 ms returned []
Implicit Place search using SMT with State Equation took 4594 ms to find 0 implicit places.
[2023-03-10 19:35:00] [INFO ] Redundant transitions in 1286 ms returned []
[2023-03-10 19:35:00] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-10 19:35:00] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-10 19:35:05] [INFO ] Dead Transitions using invariants and state equation in 4468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 433/433 places, 7088/7088 transitions.
Ending property specific reduction for DoubleLock-PT-p1s2-UpperBounds-13 in 60213 ms.
[2023-03-10 19:35:06] [INFO ] Flatten gal took : 812 ms
[2023-03-10 19:35:07] [INFO ] Applying decomposition
[2023-03-10 19:35:07] [INFO ] Flatten gal took : 345 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10854345809340781460.txt' '-o' '/tmp/graph10854345809340781460.bin' '-w' '/tmp/graph10854345809340781460.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10854345809340781460.bin' '-l' '-1' '-v' '-w' '/tmp/graph10854345809340781460.weights' '-q' '0' '-e' '0.001'
[2023-03-10 19:35:08] [INFO ] Decomposing Gal with order
[2023-03-10 19:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 19:35:09] [INFO ] Removed a total of 17144 redundant transitions.
[2023-03-10 19:35:10] [INFO ] Flatten gal took : 1025 ms
[2023-03-10 19:35:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 996 labels/synchronizations in 412 ms.
[2023-03-10 19:35:10] [INFO ] Time to serialize gal into /tmp/UpperBounds18099118982462055368.gal : 59 ms
[2023-03-10 19:35:10] [INFO ] Time to serialize properties into /tmp/UpperBounds13951053681273507413.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18099118982462055368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13951053681273507413.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds13951053681273507413.prop.
Detected timeout of ITS tools.
[2023-03-10 19:55:57] [INFO ] Flatten gal took : 413 ms
[2023-03-10 19:55:58] [INFO ] Time to serialize gal into /tmp/UpperBounds7081838053703122402.gal : 42 ms
[2023-03-10 19:55:58] [INFO ] Time to serialize properties into /tmp/UpperBounds12735114343640563295.prop : 32 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7081838053703122402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12735114343640563295.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds12735114343640563295.prop.
Detected timeout of ITS tools.
[2023-03-10 20:16:51] [INFO ] Flatten gal took : 3016 ms
[2023-03-10 20:17:05] [INFO ] Input system was already deterministic with 7088 transitions.
[2023-03-10 20:17:05] [INFO ] Transformed 433 places.
[2023-03-10 20:17:06] [INFO ] Transformed 7088 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 20:17:06] [INFO ] Time to serialize gal into /tmp/UpperBounds17643489236420207883.gal : 51 ms
[2023-03-10 20:17:06] [INFO ] Time to serialize properties into /tmp/UpperBounds16617527205061051326.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17643489236420207883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16617527205061051326.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16617527205061051326.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DoubleLock-PT-p1s2, 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 r159-smll-167819445200065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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