Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r334-tall-171679080200397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SafeBus-COL-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080200397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K Apr 12 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 12 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 14:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 14:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 14:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SafeBus-COL-50-UpperBounds-00
FORMULA_NAME SafeBus-COL-50-UpperBounds-01
FORMULA_NAME SafeBus-COL-50-UpperBounds-02
FORMULA_NAME SafeBus-COL-50-UpperBounds-03
FORMULA_NAME SafeBus-COL-50-UpperBounds-04
FORMULA_NAME SafeBus-COL-50-UpperBounds-05
FORMULA_NAME SafeBus-COL-50-UpperBounds-06
FORMULA_NAME SafeBus-COL-50-UpperBounds-07
FORMULA_NAME SafeBus-COL-50-UpperBounds-08
FORMULA_NAME SafeBus-COL-50-UpperBounds-09
FORMULA_NAME SafeBus-COL-50-UpperBounds-10
FORMULA_NAME SafeBus-COL-50-UpperBounds-11
FORMULA_NAME SafeBus-COL-50-UpperBounds-12
FORMULA_NAME SafeBus-COL-50-UpperBounds-13
FORMULA_NAME SafeBus-COL-50-UpperBounds-14
FORMULA_NAME SafeBus-COL-50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716825386172

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-27 15:56:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 15:56:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 15:56:27] [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.
[2024-05-27 15:56:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 15:56:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 609 ms
[2024-05-27 15:56:28] [INFO ] Detected 1 constant HL places corresponding to 50 PT places.
[2024-05-27 15:56:28] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 5606 PT places and 6520101.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 15:56:28] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 11 ms.
[2024-05-27 15:56:28] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 15:56:28] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 50, 0, 0] Max Struct:[50, 1, 1, 1, 1, 1, 1, 50, 1, 5, 3, 50, 1, 50, 50, 1]
FORMULA SafeBus-COL-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 15:56:28] [INFO ] Invariant cache hit.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-27 15:56:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:56:28] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:56:28] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 13 ms.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:28] [INFO ] Added : 8 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 7 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 15:56:28] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:28] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:56:28] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:56:28] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:29] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:29] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:29] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2024-05-27 15:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:29] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 15:56:29] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 15:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 15:56:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 15:56:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 15:56:29] [INFO ] Added : 12 causal constraints over 5 iterations in 18 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 1, 1, 1, 1, 50, 1, 5, 3, 50, 50, 1]
Domain [It(50), It(50)] of place AMC breaks symmetries in sort It
[2024-05-27 15:56:30] [INFO ] Unfolded HLPN to a Petri net with 5606 places and 140251 transitions 1078454 arcs in 839 ms.
[2024-05-27 15:56:30] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 50 places in 194 ms
Reduce places removed 100 places and 100 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 1, 1, 1, 1, 50, 1, 5, 3, 50, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 1, 1, 1, 1, 50, 1, 5, 3, 50, 50, 1]
[2024-05-27 15:56:31] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2024-05-27 15:56:32] [INFO ] Computed 205 invariants in 1525 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 1, 1, 1, 1, 50, 1, 5, 3, 50, 50, 1]
RANDOM walk for 10000 steps (2 resets) in 7235 ms. (1 steps per ms)
FORMULA SafeBus-COL-50-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1950 ms. (20 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[49, 1, 1, 28] Max Struct:[50, 5, 3, 50]
[2024-05-27 15:56:42] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 15:56:42] [INFO ] Invariant cache hit.
[2024-05-27 15:56:42] [INFO ] [Real]Absence check using 101 positive place invariants in 124 ms returned sat
[2024-05-27 15:56:43] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 233 ms returned sat
[2024-05-27 15:56:47] [INFO ] [Real]Absence check using state equation in 4129 ms returned unknown
[2024-05-27 15:56:48] [INFO ] [Real]Absence check using 101 positive place invariants in 156 ms returned sat
[2024-05-27 15:56:48] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 164 ms returned unsat
[2024-05-27 15:56:48] [INFO ] [Real]Absence check using 101 positive place invariants in 141 ms returned sat
[2024-05-27 15:56:49] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 124 ms returned unsat
[2024-05-27 15:56:49] [INFO ] [Real]Absence check using 101 positive place invariants in 128 ms returned sat
[2024-05-27 15:56:49] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 243 ms returned sat
[2024-05-27 15:56:54] [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 3
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[49, 1, 1, 28] Max Struct:[50, 1, 1, 50]
FORMULA SafeBus-COL-50-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 28] Max Struct:[50, 50]
Support contains 100 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 25327 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25355 ms. Remains : 5506/5506 places, 140151/140151 transitions.
[2024-05-27 15:57:19] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 15:57:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[49, 28] Max Struct:[50, 50]
RANDOM walk for 46983 steps (0 resets) in 30005 ms. (1 steps per ms)
BEST_FIRST walk for 165681 steps (0 resets) in 10005 ms. (16 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[49, 49] Max Struct:[50, 50]
[2024-05-27 15:57:59] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 15:57:59] [INFO ] Invariant cache hit.
[2024-05-27 15:58:00] [INFO ] [Real]Absence check using 101 positive place invariants in 122 ms returned sat
[2024-05-27 15:58:00] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 207 ms returned sat
[2024-05-27 15:58:18] [INFO ] [Real]Absence check using state equation in 17325 ms returned sat
[2024-05-27 15:58:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:58:19] [INFO ] [Nat]Absence check using 101 positive place invariants in 116 ms returned sat
[2024-05-27 15:58:19] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 198 ms returned sat
[2024-05-27 15:58:37] [INFO ] [Nat]Absence check using state equation in 18303 ms returned sat
[2024-05-27 15:58:39] [INFO ] State equation strengthened by 2551 read => feed constraints.
[2024-05-27 15:58:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 15:58:55] [INFO ] [Nat]Added 2551 Read/Feed constraints in 15657 ms returned unknown
[2024-05-27 15:58:56] [INFO ] [Real]Absence check using 101 positive place invariants in 115 ms returned sat
[2024-05-27 15:58:56] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 318 ms returned sat
[2024-05-27 15:59:10] [INFO ] [Real]Absence check using state equation in 14291 ms returned sat
[2024-05-27 15:59:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 15:59:11] [INFO ] [Nat]Absence check using 101 positive place invariants in 120 ms returned sat
[2024-05-27 15:59:12] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 307 ms returned sat
[2024-05-27 15:59:26] [INFO ] [Nat]Absence check using state equation in 14378 ms returned sat
[2024-05-27 15:59:36] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 15:59:41] [INFO ] [Nat]Added 2551 Read/Feed constraints in 14711 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[49, 49] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 49] Max Struct:[50, 50]
Support contains 100 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 23813 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23813 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 22679 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-27 16:00:27] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 16:00:27] [INFO ] Invariant cache hit.
[2024-05-27 16:00:58] [INFO ] Performed 134/5506 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 16:01:28] [INFO ] Performed 2674/5506 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-27 16:01:54] [INFO ] Implicit Places using invariants in 86464 ms returned [5151, 5152, 5153, 5154, 5155, 5156, 5157, 5158, 5159, 5160, 5161, 5162, 5163, 5164, 5165, 5166, 5167, 5168, 5169, 5170, 5171, 5172, 5173, 5174, 5175, 5176, 5177, 5178, 5179, 5180, 5181, 5182, 5183, 5184, 5185, 5186, 5187, 5188, 5189, 5190, 5191, 5192, 5193, 5194, 5195, 5196, 5197, 5198, 5199, 5200]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 86616 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 5456/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 22547 ms. Remains 5456 /5456 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 131858 ms. Remains : 5456/5506 places, 140151/140151 transitions.
[2024-05-27 16:02:16] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5456 cols
[2024-05-27 16:02:17] [INFO ] Computed 155 invariants in 739 ms
Current structural bounds on expressions (after invariants) : Max Seen:[49, 49] Max Struct:[50, 50]
RANDOM walk for 58377 steps (0 resets) in 30002 ms. (1 steps per ms)
BEST_FIRST walk for 213804 steps (0 resets) in 10006 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[49, 49] Max Struct:[50, 50]
[2024-05-27 16:02:57] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 16:02:57] [INFO ] Invariant cache hit.
[2024-05-27 16:02:58] [INFO ] [Real]Absence check using 54 positive place invariants in 124 ms returned sat
[2024-05-27 16:02:58] [INFO ] [Real]Absence check using 54 positive and 101 generalized place invariants in 127 ms returned sat
[2024-05-27 16:03:10] [INFO ] [Real]Absence check using state equation in 11636 ms returned sat
[2024-05-27 16:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 16:03:11] [INFO ] [Nat]Absence check using 54 positive place invariants in 133 ms returned sat
[2024-05-27 16:03:11] [INFO ] [Nat]Absence check using 54 positive and 101 generalized place invariants in 121 ms returned sat
[2024-05-27 16:03:31] [INFO ] [Nat]Absence check using state equation in 19769 ms returned unknown
[2024-05-27 16:03:31] [INFO ] [Real]Absence check using 54 positive place invariants in 157 ms returned sat
[2024-05-27 16:03:31] [INFO ] [Real]Absence check using 54 positive and 101 generalized place invariants in 128 ms returned sat
[2024-05-27 16:03:40] [INFO ] [Real]Absence check using state equation in 8056 ms returned sat
[2024-05-27 16:03:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 16:03:40] [INFO ] [Nat]Absence check using 54 positive place invariants in 122 ms returned sat
[2024-05-27 16:03:41] [INFO ] [Nat]Absence check using 54 positive and 101 generalized place invariants in 132 ms returned sat
[2024-05-27 16:03:53] [INFO ] [Nat]Absence check using state equation in 12214 ms returned sat
[2024-05-27 16:03:55] [INFO ] State equation strengthened by 2551 read => feed constraints.
[2024-05-27 16:04:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-27 16:04:09] [INFO ] [Nat]Added 2551 Read/Feed constraints in 14923 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[49, 49] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 49] Max Struct:[50, 50]
Support contains 100 out of 5456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5456/5456 places, 140151/140151 transitions.
Applied a total of 0 rules in 22833 ms. Remains 5456 /5456 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22833 ms. Remains : 5456/5456 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5456/5456 places, 140151/140151 transitions.
Applied a total of 0 rules in 22874 ms. Remains 5456 /5456 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2024-05-27 16:04:55] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 16:04:55] [INFO ] Invariant cache hit.
[2024-05-27 16:05:26] [INFO ] Performed 131/5456 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 16:05:56] [INFO ] Performed 2648/5456 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-27 16:06:20] [INFO ] Implicit Places using invariants in 84768 ms returned []
Implicit Place search using SMT only with invariants took 84780 ms to find 0 implicit places.
Running 140101 sub problems to find dead transitions.
[2024-05-27 16:06:22] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2024-05-27 16:06:22] [INFO ] Invariant cache hit.
[2024-05-27 16:06:26] [INFO ] State equation strengthened by 2551 read => feed constraints.

BK_STOP 1716826251305

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SafeBus-COL-50, 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 r334-tall-171679080200397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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