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.r255-tall-167856440300043.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 LamportFastMutEx-COL-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.5K Feb 25 13:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 13:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 38K 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 LamportFastMutEx-COL-2-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678749777396

Running Version 202205111006
[2023-03-13 23:22:58] [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-13 23:22:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:22:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 23:22:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 23:22:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2023-03-13 23:22:59] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-13 23:22:59] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2023-03-13 23:22:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:22:59] [INFO ] Computed 2 place invariants in 5 ms
FORMULA LamportFastMutEx-COL-2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:22:59] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:22:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:22:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 23:22:59] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:22:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:22:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:22:59] [INFO ] Added : 12 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 23:22:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:22:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:22:59] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:22:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:22:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:22:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:22:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 23:23:00] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 11 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:00] [INFO ] Added : 5 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 23:23:00] [INFO ] Added : 7 causal constraints over 2 iterations in 54 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:00] [INFO ] Added : 12 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:00] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:00] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:00] [INFO ] Added : 12 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:00] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:23:00] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:23:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:23:00] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [2, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 2]
Domain [pid(3), pid(3)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-13 23:23:00] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 12 ms.
[2023-03-13 23:23:00] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :20
FORMULA LamportFastMutEx-COL-2-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :10
[2023-03-13 23:23:00] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2023-03-13 23:23:00] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 23:23:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-13 23:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:00] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 23:23:00] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 23:23:00] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:23:00] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
[2023-03-13 23:23:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 176 ms
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 23:23:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 89 ms
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:23:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 122 ms
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:23:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 143 ms
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:23:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:23:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 121 ms
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:23:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:23:01] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 23:23:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 154 ms
[2023-03-13 23:23:02] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:23:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:23:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 5 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 270 ms
[2023-03-13 23:23:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-13 23:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 23:23:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:23:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-13 23:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:23:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:23:02] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2023-03-13 23:23:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 110 ms
Current structural bounds on expressions (after SMT) : [1, 1, 2, 1, 2, 1, 1, 1] Max seen :[1, 1, 2, 1, 2, 1, 1, 1]
FORMULA LamportFastMutEx-COL-2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4062 ms.

BK_STOP 1678749782698

--------------------
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="LamportFastMutEx-COL-2"
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 LamportFastMutEx-COL-2, 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 r255-tall-167856440300043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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 ;