Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r195-tall-174889278200089.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SafeBus-COL-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-tall-174889278200089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748952626224

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-03 12:10: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]
[2025-06-03 12:10:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:10: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.
[2025-06-03 12:10:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 12:10:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 582 ms
[2025-06-03 12:10:28] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2025-06-03 12:10:28] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2025-06-03 12:10:28] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 3 ms.
[2025-06-03 12:10:28] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-03 12:10:28] [INFO ] Computed 7 invariants in 11 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 1, 0, 0, 1, 3, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 5, 1, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1]
FORMULA SafeBus-COL-03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 12:10:28] [INFO ] Invariant cache hit.
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 10 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 12:10:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 12:10:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 12:10:28] [INFO ] Added : 8 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 104 ms.
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:28] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:28] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:28] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-03 12:10:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:10:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:28] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 12:10:28] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:29] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 12:10:29] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:29] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:29] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:29] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:10:29] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:10:29] [INFO ] Added : 12 causal constraints over 5 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2025-06-03 12:10:29] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 18 ms.
[2025-06-03 12:10:29] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
[2025-06-03 12:10:29] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-03 12:10:29] [INFO ] Computed 17 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 5, 3, 3, 3, 3, 3, 3, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 46 ms. (212 steps per ms)
FORMULA SafeBus-COL-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50002 steps (10 resets) in 73 ms. (675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 2, 2] Max Struct:[5, 3, 3, 3, 3]
[2025-06-03 12:10:29] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 12:10:29] [INFO ] Invariant cache hit.
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 12:10:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 12:10:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:29] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2025-06-03 12:10:29] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 10 ms to minimize.
[2025-06-03 12:10:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2025-06-03 12:10:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 119 ms
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:29] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned unsat
[2025-06-03 12:10:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-03 12:10:30] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 6 ms.
[2025-06-03 12:10:30] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2025-06-03 12:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-03 12:10:30] [INFO ] Added : 13 causal constraints over 3 iterations in 94 ms. Result :sat
Minimization took 35 ms.
[2025-06-03 12:10:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 12:10:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2025-06-03 12:10:30] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 8 ms.
[2025-06-03 12:10:30] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-03 12:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-03 12:10:30] [INFO ] Added : 16 causal constraints over 4 iterations in 114 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 2, 2] Max Struct:[1, 2, 1, 3, 3]
FORMULA SafeBus-COL-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 14 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 54/54 places, 91/91 transitions.
[2025-06-03 12:10:30] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 12:10:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (2 resets) in 1188 ms. (841 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1012 ms. (1974 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2025-06-03 12:10:32] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 12:10:32] [INFO ] Invariant cache hit.
[2025-06-03 12:10:32] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:32] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2025-06-03 12:10:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-03 12:10:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:32] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:32] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 12:10:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-03 12:10:33] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 5 ms.
[2025-06-03 12:10:33] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2025-06-03 12:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-03 12:10:33] [INFO ] Added : 13 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 34 ms.
[2025-06-03 12:10:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:33] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 12:10:33] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:33] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:33] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 12:10:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2025-06-03 12:10:33] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 6 ms.
[2025-06-03 12:10:33] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2025-06-03 12:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-03 12:10:33] [INFO ] Added : 16 causal constraints over 4 iterations in 81 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-03 12:10:33] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 12:10:33] [INFO ] Invariant cache hit.
[2025-06-03 12:10:33] [INFO ] Implicit Places using invariants in 57 ms returned [28, 29, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 51/54 places, 91/91 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 94
Applied a total of 6 rules in 14 ms. Remains 48 /51 variables (removed 3) and now considering 94/91 (removed -3) transitions.
[2025-06-03 12:10:33] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
// Phase 1: matrix 71 rows 48 cols
[2025-06-03 12:10:33] [INFO ] Computed 14 invariants in 1 ms
[2025-06-03 12:10:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-03 12:10:33] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-03 12:10:33] [INFO ] Invariant cache hit.
[2025-06-03 12:10:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:33] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/54 places, 94/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 214 ms. Remains : 48/54 places, 94/91 transitions.
[2025-06-03 12:10:33] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-03 12:10:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (2 resets) in 1108 ms. (901 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 940 ms. (2125 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2025-06-03 12:10:35] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-03 12:10:35] [INFO ] Invariant cache hit.
[2025-06-03 12:10:35] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-03 12:10:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:35] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2025-06-03 12:10:35] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2025-06-03 12:10:35] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-03 12:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-03 12:10:35] [INFO ] Added : 13 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 29 ms.
[2025-06-03 12:10:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Real]Added 13 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:10:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-03 12:10:36] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 12:10:36] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2025-06-03 12:10:36] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 5 ms.
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2025-06-03 12:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-03 12:10:36] [INFO ] Added : 13 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 48/48 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2025-06-03 12:10:36] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-03 12:10:36] [INFO ] Invariant cache hit.
[2025-06-03 12:10:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-03 12:10:36] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-03 12:10:36] [INFO ] Invariant cache hit.
[2025-06-03 12:10:36] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:36] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2025-06-03 12:10:36] [INFO ] Redundant transitions in 1 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-03 12:10:36] [INFO ] Flow matrix only has 71 transitions (discarded 23 similar events)
[2025-06-03 12:10:36] [INFO ] Invariant cache hit.
[2025-06-03 12:10:36] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2025-06-03 12:10:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 11/25 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2025-06-03 12:10:37] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/27 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/27 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/75 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 13/88 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/88 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/88 constraints. Problems are: Problem set: 9 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 88 constraints, problems are : Problem set: 9 solved, 82 unsolved in 1872 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 9 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 13/27 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-06-03 12:10:38] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/30 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:38] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:39] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 1/32 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:39] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 1/33 constraints. Problems are: Problem set: 9 solved, 82 unsolved
[2025-06-03 12:10:39] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 1/34 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/34 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 71/119 variables, 48/82 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 13/95 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 82/177 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 0/177 constraints. Problems are: Problem set: 9 solved, 82 unsolved
At refinement iteration 14 (OVERLAPS) 0/119 variables, 0/177 constraints. Problems are: Problem set: 9 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 177 constraints, problems are : Problem set: 9 solved, 82 unsolved in 2875 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/91 constraints, Known Traps: 20/20 constraints]
After SMT, in 4842ms problems are : Problem set: 9 solved, 82 unsolved
Search for dead transitions found 9 dead transitions in 4849ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 48/48 places, 85/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-06-03 12:10:41] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5012 ms. Remains : 48/48 places, 85/94 transitions.
[2025-06-03 12:10:41] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-03 12:10:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[3, 3]
RANDOM walk for 1000000 steps (2 resets) in 1080 ms. (925 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 914 ms. (2185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[3, 3]
[2025-06-03 12:10:43] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-03 12:10:43] [INFO ] Invariant cache hit.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 12:10:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:43] [INFO ] [Real]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-03 12:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 6 ms returned sat
[2025-06-03 12:10:43] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 6 ms.
[2025-06-03 12:10:43] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2025-06-03 12:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-03 12:10:43] [INFO ] Added : 29 causal constraints over 6 iterations in 123 ms. Result :sat
Minimization took 33 ms.
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Real]Added 13 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:10:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 12:10:43] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-03 12:10:43] [INFO ] Computed and/alt/rep : 43/252/43 causal constraints (skipped 25 transitions) in 6 ms.
[2025-06-03 12:10:43] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-03 12:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-03 12:10:43] [INFO ] Added : 30 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[3, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[3, 3]
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 48/48 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-06-03 12:10:43] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-03 12:10:43] [INFO ] Invariant cache hit.
[2025-06-03 12:10:43] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-03 12:10:43] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-03 12:10:43] [INFO ] Invariant cache hit.
[2025-06-03 12:10:43] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 12:10:43] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2025-06-03 12:10:43] [INFO ] Redundant transitions in 1 ms returned []
Running 82 sub problems to find dead transitions.
[2025-06-03 12:10:43] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-03 12:10:43] [INFO ] Invariant cache hit.
[2025-06-03 12:10:43] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 5 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2025-06-03 12:10:44] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2025-06-03 12:10:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 71/119 variables, 48/79 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 92 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2317 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 71/119 variables, 48/79 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 82/174 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 174 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 17/17 constraints]
After SMT, in 3935ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3936ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4077 ms. Remains : 48/48 places, 85/85 transitions.
[2025-06-03 12:10:48] [INFO ] Flatten gal took : 65 ms
[2025-06-03 12:10:48] [INFO ] Flatten gal took : 30 ms
[2025-06-03 12:10:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16557404560209880179.gal : 9 ms
[2025-06-03 12:10:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4613968235199885628.prop : 2 ms
RANDOM walk for 40000 steps (8 resets) in 796 ms. (50 steps per ms) remains 4/4 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16557404560209880179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4613968235199885628.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4613968235199885628.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 27
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :27 after 54
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :54 after 79
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :79 after 164
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :164 after 596
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :596 after 1564
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4182,0.110149,7040,2,1052,14,11873,10,0,284,10680,0
Total reachable state count : 4182

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.111159,7040,1,0,14,11873,10,0,290,10680,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.111903,7300,1,0,14,11873,10,0,295,10680,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

BEST_FIRST walk for 40003 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.112518,7300,1,0,14,11873,10,0,300,10680,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.114953,7300,1,0,14,11873,10,0,305,10680,0
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Probably explored full state space saw : 4182 states, properties seen :0
Probabilistic random walk after 15882 steps, saw 4182 distinct states, run finished after 66 ms. (steps per millisecond=240 ) properties seen :0
Explored full state space saw : 4182 states, properties seen :0
Exhaustive walk after 15882 steps, saw 4182 distinct states, run finished after 23 ms. (steps per millisecond=690 ) properties seen :0
FORMULA SafeBus-COL-03-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA SafeBus-COL-03-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 21066 ms.

BK_STOP 1748952648565

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SafeBus-COL-03, 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 r195-tall-174889278200089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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