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.r136-tall-171631132900533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716385019208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 13:37:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:37:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:37:00] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 13:37:00] [INFO ] Transformed 110 places.
[2024-05-22 13:37:00] [INFO ] Transformed 98 transitions.
[2024-05-22 13:37:00] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
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:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 98 rows 110 cols
[2024-05-22 13:37:00] [INFO ] Computed 14 invariants in 17 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:[+inf, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 5, 1, +inf, 1]
RANDOM walk for 10000 steps (330 resets) in 30 ms. (322 steps per ms)
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (1141 resets) in 57 ms. (689 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 1, 1] Max Struct:[+inf, 1, 5, +inf]
[2024-05-22 13:37:00] [INFO ] Invariant cache hit.
[2024-05-22 13:37:00] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-05-22 13:37:00] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 16 ms returned sat
[2024-05-22 13:37:00] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-22 13:37:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:37:00] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 13:37:00] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 7 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-05-22 13:37:01] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-22 13:37:01] [INFO ] Added : 94 causal constraints over 20 iterations in 382 ms. Result :sat
Minimization took 83 ms.
[2024-05-22 13:37:01] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:37:01] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 13:37:01] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-22 13:37:01] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 13:37:01] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 5 ms to minimize.
[2024-05-22 13:37:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-22 13:37:01] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 13:37:02] [INFO ] Added : 93 causal constraints over 19 iterations in 188 ms. Result :sat
Minimization took 73 ms.
[2024-05-22 13:37:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:37:02] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned unsat
[2024-05-22 13:37:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:37:02] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-22 13:37:02] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 13:37:02] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 4 ms to minimize.
[2024-05-22 13:37:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:37:02] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 13:37:02] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-22 13:37:02] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:37:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:37:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-22 13:37:02] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 13:37:02] [INFO ] Added : 94 causal constraints over 19 iterations in 179 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 1, 1] Max Struct:[+inf, 1, 1, +inf]
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 103 transition count 74
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 81 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 80 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 50 place count 80 transition count 68
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 60 place count 75 transition count 68
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 104 place count 53 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 51 transition count 46
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 51 transition count 41
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 118 place count 46 transition count 41
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 46 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 45 transition count 40
Applied a total of 127 rules in 52 ms. Remains 45 /110 variables (removed 65) and now considering 40/98 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 45/110 places, 40/98 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 5=1, 6=1, 10=1, 11=1, 12=1, 24=1, 25=1, 29=1, 33=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {1=1, 2=1, 3=1, 10=1, 11=1, 12=1, 24=1, 25=1, 33=1, 34=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1159 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :[4, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 2] Max Struct:[+inf, +inf]
// Phase 1: matrix 40 rows 45 cols
[2024-05-22 13:37:03] [INFO ] Computed 10 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 2] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (112928 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 2000001 steps (155393 resets) in 896 ms. (2229 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 13:37:04] [INFO ] Invariant cache hit.
[2024-05-22 13:37:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 13:37:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 13:37:04] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-05-22 13:37:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 0 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:37:04] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:37:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 13:37:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-05-22 13:37:04] [INFO ] Computed and/alt/rep : 38/157/38 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-22 13:37:04] [INFO ] Added : 20 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 17 ms.
[2024-05-22 13:37:04] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:37:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:37:04] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 13:37:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 13:37:05] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 131 ms
[2024-05-22 13:37:05] [INFO ] Computed and/alt/rep : 38/157/38 causal constraints (skipped 1 transitions) in 6 ms.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:37:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 167 ms
[2024-05-22 13:37:05] [INFO ] Added : 37 causal constraints over 8 iterations in 229 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 45/45 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-22 13:37:05] [INFO ] Invariant cache hit.
[2024-05-22 13:37:05] [INFO ] Implicit Places using invariants in 54 ms returned [16, 21, 33, 39]
[2024-05-22 13:37:05] [INFO ] Actually due to overlaps returned [16, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 43/45 places, 40/40 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 39
Applied a total of 2 rules in 4 ms. Remains 42 /43 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 42 cols
[2024-05-22 13:37:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 13:37:05] [INFO ] Implicit Places using invariants in 39 ms returned [30, 36]
[2024-05-22 13:37:05] [INFO ] Actually due to overlaps returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/45 places, 39/40 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 40 transition count 38
Applied a total of 2 rules in 3 ms. Remains 40 /41 variables (removed 1) and now considering 38/39 (removed 1) transitions.
// Phase 1: matrix 38 rows 40 cols
[2024-05-22 13:37:05] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 13:37:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 13:37:05] [INFO ] Invariant cache hit.
[2024-05-22 13:37:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 13:37:05] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 40/45 places, 38/40 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 204 ms. Remains : 40/45 places, 38/40 transitions.
Found an invariant !
This invariant on transitions {0=2, 2=2, 3=1, 5=1, 6=1, 8=1, 9=1, 10=3, 11=2, 12=1, 16=1, 18=1, 19=1, 23=1, 24=2, 25=1, 26=1, 30=2, 34=2, 35=1, 36=1, 37=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 7=1, 8=1, 19=1, 20=1, 28=1, 29=1, 35=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1239 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :[4, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 13:37:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (124993 resets) in 515 ms. (1937 steps per ms)
BEST_FIRST walk for 2000001 steps (166282 resets) in 777 ms. (2570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
[2024-05-22 13:37:07] [INFO ] Invariant cache hit.
[2024-05-22 13:37:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 13:37:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 13:37:07] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:37:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 108 ms
[2024-05-22 13:37:07] [INFO ] Computed and/alt/rep : 37/157/37 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 103 ms
[2024-05-22 13:37:07] [INFO ] Added : 27 causal constraints over 8 iterations in 148 ms. Result :sat
Minimization took 26 ms.
[2024-05-22 13:37:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:37:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:37:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 13:37:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 254 ms
[2024-05-22 13:37:07] [INFO ] Computed and/alt/rep : 37/157/37 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:37:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-22 13:37:07] [INFO ] Added : 34 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-22 13:37:07] [INFO ] Invariant cache hit.
[2024-05-22 13:37:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 13:37:07] [INFO ] Invariant cache hit.
[2024-05-22 13:37:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 13:37:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-22 13:37:08] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-22 13:37:08] [INFO ] Invariant cache hit.
[2024-05-22 13:37:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 38/78 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-22 13:37:08] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-22 13:37:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 37 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 53 constraints, problems are : Problem set: 0 solved, 37 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 38/78 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 37/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 90 constraints, problems are : Problem set: 0 solved, 37 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 2/2 constraints]
After SMT, in 1137ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1239 ms. Remains : 40/40 places, 38/38 transitions.
Found an invariant !
This invariant on transitions {0=2, 2=2, 3=1, 5=1, 6=1, 8=1, 9=1, 10=3, 11=2, 12=1, 16=1, 18=1, 19=1, 23=1, 24=2, 25=1, 26=1, 30=2, 34=2, 35=1, 36=1, 37=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 7=1, 8=1, 19=1, 20=1, 28=1, 29=1, 35=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1239 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :[4, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4] Max Struct:[+inf, +inf]
RANDOM walk for 40000 steps (4983 resets) in 719 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3302 resets) in 471 ms. (84 steps per ms) remains 2/2 properties
[2024-05-22 13:37:09] [INFO ] Flatten gal took : 68 ms
[2024-05-22 13:37:09] [INFO ] Flatten gal took : 9 ms
BEST_FIRST walk for 40002 steps (3334 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
[2024-05-22 13:37:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13198754832522827493.gal : 5 ms
[2024-05-22 13:37:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4003067915179165858.prop : 0 ms
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/ReachabilityCardinality13198754832522827493.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4003067915179165858.prop' '--nowitness' '--gen-order' 'FOLLOW'

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/ReachabilityCardinality4003067915179165858.prop.
Probably explored full state space saw : 1224 states, properties seen :0
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 35
Probabilistic random walk after 2447 steps, saw 1224 distinct states, run finished after 50 ms. (steps per millisecond=48 ) properties seen :0
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :35 after 75
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :75 after 195
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :195 after 483
Explored full state space saw : 1224 states, properties seen :0
Exhaustive walk after 2447 steps, saw 1224 distinct states, run finished after 20 ms. (steps per millisecond=122 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DoubleExponent-PT-002-UpperBounds-14 4 TECHNIQUES REACHABILITY_MIN
FORMULA DoubleExponent-PT-002-UpperBounds-00 4 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 9547 ms.

BK_STOP 1716385029940

--------------------
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="DoubleExponent-PT-002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-002, 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 r136-tall-171631132900533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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