Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604200797.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 ltsminxred
Input is HealthRecord-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604200797
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 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 HealthRecord-PT-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717201569147

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:26:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:26:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:26:10] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 00:26:10] [INFO ] Transformed 161 places.
[2024-06-01 00:26:10] [INFO ] Transformed 341 transitions.
[2024-06-01 00:26:10] [INFO ] Found NUPN structural information;
[2024-06-01 00:26:10] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:26:10] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-06-01 00:26:10] [INFO ] Computed 18 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (777 resets) in 48 ms. (204 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90006 steps (981 resets) in 72 ms. (1232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 00:26:10] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
[2024-06-01 00:26:10] [INFO ] Invariant cache hit.
[2024-06-01 00:26:10] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-01 00:26:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2024-06-01 00:26:10] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 00:26:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:26:10] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:26:11] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 9 ms to minimize.
[2024-06-01 00:26:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:11] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:26:11] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:26:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2024-06-01 00:26:11] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 21 ms.
[2024-06-01 00:26:11] [INFO ] Added : 16 causal constraints over 4 iterations in 109 ms. Result :sat
Minimization took 115 ms.
[2024-06-01 00:26:11] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:11] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-06-01 00:26:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 00:26:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:26:11] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-06-01 00:26:12] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-06-01 00:26:12] [INFO ] Added : 34 causal constraints over 8 iterations in 206 ms. Result :sat
Minimization took 116 ms.
[2024-06-01 00:26:12] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:12] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:26:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:26:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-06-01 00:26:12] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 20 ms.
[2024-06-01 00:26:12] [INFO ] Added : 22 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 106 ms.
[2024-06-01 00:26:12] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 00:26:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 269 ms
[2024-06-01 00:26:13] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 22 ms.
[2024-06-01 00:26:13] [INFO ] Added : 14 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 111 ms.
[2024-06-01 00:26:13] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:13] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 26 ms.
[2024-06-01 00:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:26:14] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 22 ms.
[2024-06-01 00:26:14] [INFO ] Added : 28 causal constraints over 7 iterations in 144 ms. Result :sat
Minimization took 140 ms.
[2024-06-01 00:26:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:26:14] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 20 ms.
[2024-06-01 00:26:14] [INFO ] Added : 10 causal constraints over 2 iterations in 64 ms. Result :sat
Minimization took 109 ms.
[2024-06-01 00:26:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-06-01 00:26:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:15] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2024-06-01 00:26:15] [INFO ] Added : 13 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 122 ms.
[2024-06-01 00:26:15] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:26:15] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 17 ms.
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:26:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-01 00:26:15] [INFO ] Added : 30 causal constraints over 7 iterations in 216 ms. Result :sat
Minimization took 105 ms.
[2024-06-01 00:26:15] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 00:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-01 00:26:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 00:26:16] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 18 ms.
[2024-06-01 00:26:16] [INFO ] Added : 14 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 243 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 148 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 148 transition count 288
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 144 transition count 282
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 142 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 142 transition count 280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 141 transition count 280
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 104 place count 58 transition count 114
Iterating global reduction 3 with 83 rules applied. Total rules applied 187 place count 58 transition count 114
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 195 place count 50 transition count 98
Iterating global reduction 3 with 8 rules applied. Total rules applied 203 place count 50 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 212 place count 50 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 213 place count 49 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 49 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 215 place count 48 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 48 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 219 place count 48 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 221 place count 47 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 231 place count 42 transition count 108
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 236 place count 42 transition count 103
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 241 place count 37 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 37 transition count 101
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 245 place count 37 transition count 271
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 247 place count 35 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 249 place count 35 transition count 269
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 250 place count 34 transition count 224
Iterating global reduction 7 with 1 rules applied. Total rules applied 251 place count 34 transition count 224
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 252 place count 33 transition count 222
Iterating global reduction 7 with 1 rules applied. Total rules applied 253 place count 33 transition count 222
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 269 place count 33 transition count 206
Applied a total of 269 rules in 93 ms. Remains 33 /161 variables (removed 128) and now considering 206/313 (removed 107) transitions.
Running 190 sub problems to find dead transitions.
[2024-06-01 00:26:16] [INFO ] Flow matrix only has 142 transitions (discarded 64 similar events)
// Phase 1: matrix 142 rows 33 cols
[2024-06-01 00:26:16] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 00:26:16] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 2/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Problem TDEAD45 is UNSAT
At refinement iteration 4 (OVERLAPS) 142/175 variables, 33/42 constraints. Problems are: Problem set: 1 solved, 189 unsolved
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 36/78 constraints. Problems are: Problem set: 3 solved, 187 unsolved
[2024-06-01 00:26:18] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 187 unsolved
[2024-06-01 00:26:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 00:26:18] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 2/81 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/81 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/81 constraints. Problems are: Problem set: 5 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 81 constraints, problems are : Problem set: 5 solved, 185 unsolved in 3733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 5 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 142/175 variables, 33/45 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 36/81 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 185/266 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/266 constraints. Problems are: Problem set: 5 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/266 constraints. Problems are: Problem set: 5 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 266 constraints, problems are : Problem set: 5 solved, 185 unsolved in 4214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 185/190 constraints, Known Traps: 3/3 constraints]
After SMT, in 8199ms problems are : Problem set: 5 solved, 185 unsolved
Search for dead transitions found 5 dead transitions in 8215ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/161 places, 201/313 transitions.
Graph (complete) has 160 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 32 transition count 190
Applied a total of 12 rules in 7 ms. Remains 32 /33 variables (removed 1) and now considering 190/201 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8328 ms. Remains : 32/161 places, 190/313 transitions.
[2024-06-01 00:26:24] [INFO ] Flow matrix only has 126 transitions (discarded 64 similar events)
// Phase 1: matrix 126 rows 32 cols
[2024-06-01 00:26:24] [INFO ] Computed 9 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (10 resets) in 1102 ms. (906 steps per ms)
BEST_FIRST walk for 3000002 steps (7 resets) in 1596 ms. (1878 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 00:26:27] [INFO ] Flow matrix only has 126 transitions (discarded 64 similar events)
[2024-06-01 00:26:27] [INFO ] Invariant cache hit.
[2024-06-01 00:26:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 00:26:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-01 00:26:27] [INFO ] [Real]Added 35 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Nat]Added 35 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:26:27] [INFO ] Computed and/alt/rep : 35/259/35 causal constraints (skipped 75 transitions) in 9 ms.
[2024-06-01 00:26:27] [INFO ] Added : 0 causal constraints over 0 iterations in 27 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 00:26:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Real]Added 35 Read/Feed constraints in 3 ms returned sat
[2024-06-01 00:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Nat]Added 35 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:26:27] [INFO ] Computed and/alt/rep : 35/259/35 causal constraints (skipped 75 transitions) in 8 ms.
[2024-06-01 00:26:27] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 00:26:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Real]Added 35 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:26:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 00:26:27] [INFO ] [Nat]Added 35 Read/Feed constraints in 4 ms returned sat
[2024-06-01 00:26:27] [INFO ] Computed and/alt/rep : 35/259/35 causal constraints (skipped 75 transitions) in 8 ms.
[2024-06-01 00:26:27] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 190/190 transitions.
Graph (complete) has 138 edges and 32 vertex of which 25 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 22 transition count 117
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 22 transition count 117
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 22 transition count 106
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 46 place count 22 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 22 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 21 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 20 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 15 transition count 96
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 72 place count 15 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 112 place count 15 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 15 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 114 place count 15 transition count 45
Applied a total of 114 rules in 23 ms. Remains 15 /32 variables (removed 17) and now considering 45/190 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 15/32 places, 45/190 transitions.
[2024-06-01 00:26:27] [INFO ] Flow matrix only has 32 transitions (discarded 13 similar events)
// Phase 1: matrix 32 rows 15 cols
[2024-06-01 00:26:27] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (15 resets) in 508 ms. (1964 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (18 resets) in 409 ms. (2439 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 18586 ms.
ITS solved all properties within timeout

BK_STOP 1717201588867

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="HealthRecord-PT-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is HealthRecord-PT-13, 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 r496-tall-171640604200797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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