fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631151600331
Last Updated
July 7, 2024

About the Execution of 2023-gold for DoubleExponent-PT-002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
532.659 18860.00 28598.00 414.60 4 1 1 1 1 1 2 1 1 1 1 1 1 1 4 1 normal

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.r153-tall-171631151600331.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 gold2023
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 r153-tall-171631151600331
=====================================================================

--------------------
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 1716421814136

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 23:50:15] [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 23:50:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:50:15] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2024-05-22 23:50:15] [INFO ] Transformed 110 places.
[2024-05-22 23:50:15] [INFO ] Transformed 98 transitions.
[2024-05-22 23:50:15] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 98 rows 110 cols
[2024-05-22 23:50:15] [INFO ] Computed 14 invariants in 16 ms
Incomplete random walk after 10000 steps, including 330 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :14
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :5
[2024-05-22 23:50:16] [INFO ] Invariant cache hit.
[2024-05-22 23:50:16] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2024-05-22 23:50:16] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-22 23:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:16] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-22 23:50:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:16] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 23:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:16] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-22 23:50:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-05-22 23:50:16] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-22 23:50:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-22 23:50:16] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 23:50:16] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-22 23:50:16] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-05-22 23:50:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2024-05-22 23:50:16] [INFO ] Added : 84 causal constraints over 17 iterations in 356 ms. Result :sat
Minimization took 29 ms.
[2024-05-22 23:50:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:16] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 23:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:17] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-22 23:50:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:17] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-22 23:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2024-05-22 23:50:17] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-05-22 23:50:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 312 ms
[2024-05-22 23:50:17] [INFO ] Added : 95 causal constraints over 20 iterations in 554 ms. Result :sat
Minimization took 37 ms.
[2024-05-22 23:50:17] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:17] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-22 23:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:17] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-22 23:50:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:17] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 23:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:18] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 187 ms
[2024-05-22 23:50:18] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 23:50:18] [INFO ] Added : 84 causal constraints over 18 iterations in 194 ms. Result :sat
Minimization took 32 ms.
[2024-05-22 23:50:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:18] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-22 23:50:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-22 23:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:18] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-22 23:50:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 178 ms
[2024-05-22 23:50:18] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 23:50:18] [INFO ] Added : 67 causal constraints over 14 iterations in 137 ms. Result :sat
Minimization took 24 ms.
[2024-05-22 23:50:18] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2024-05-22 23:50:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-22 23:50:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2024-05-22 23:50:19] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 23:50:19] [INFO ] Added : 87 causal constraints over 18 iterations in 176 ms. Result :sat
Minimization took 39 ms.
[2024-05-22 23:50:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned unsat
[2024-05-22 23:50:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 52 places in 31 ms of which 1 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
[2024-05-22 23:50:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-22 23:50:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 0 ms to minimize.
[2024-05-22 23:50:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 142 ms
[2024-05-22 23:50:19] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 4 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 220 ms
[2024-05-22 23:50:20] [INFO ] Added : 95 causal constraints over 21 iterations in 448 ms. Result :sat
Minimization took 35 ms.
[2024-05-22 23:50:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:20] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:20] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 23:50:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-22 23:50:20] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-22 23:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-22 23:50:20] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 0 ms to minimize.
[2024-05-22 23:50:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2024-05-22 23:50:20] [INFO ] Added : 94 causal constraints over 20 iterations in 358 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1, 1, -1] Max seen :[4, 0, 0, 0, 0, 1, 0, 0]
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 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.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 103 transition count 75
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 47 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 81 transition count 74
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 48 place count 81 transition count 69
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 76 transition count 69
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 102 place count 54 transition count 47
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 106 place count 52 transition count 47
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 52 transition count 41
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 118 place count 46 transition count 41
Partial Free-agglomeration rule applied 8 times.
Drop transitions 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 35 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 35 ms. Remains : 45/110 places, 40/98 transitions.
// Phase 1: matrix 40 rows 45 cols
[2024-05-22 23:50:21] [INFO ] Computed 10 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 113069 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 3) seen :9
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 77865 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77810 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 2) seen :8
[2024-05-22 23:50:22] [INFO ] Invariant cache hit.
[2024-05-22 23:50:22] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:22] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 23:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:22] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:22] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-22 23:50:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 23:50:22] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 23:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-22 23:50:22] [INFO ] Computed and/alt/rep : 38/157/38 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 23:50:22] [INFO ] Added : 17 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 22 ms.
[2024-05-22 23:50:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:23] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-22 23:50:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:23] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:23] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 23:50:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 23:50:23] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-22 23:50:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-22 23:50:23] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-22 23:50:23] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 23:50:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 23:50:23] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-22 23:50:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 201 ms
[2024-05-22 23:50:23] [INFO ] Computed and/alt/rep : 38/157/38 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-22 23:50:23] [INFO ] Added : 36 causal constraints over 8 iterations in 74 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
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 3 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 18 ms. Remains : 45/45 places, 40/40 transitions.
[2024-05-22 23:50:23] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 113035 resets, run finished after 635 ms. (steps per millisecond=1574 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77872 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 77844 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 2) seen :8
[2024-05-22 23:50:25] [INFO ] Invariant cache hit.
[2024-05-22 23:50:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 23:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:25] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-22 23:50:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:25] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-22 23:50:25] [INFO ] Computed and/alt/rep : 38/157/38 causal constraints (skipped 1 transitions) in 3 ms.
[2024-05-22 23:50:25] [INFO ] Added : 17 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 28 ms.
[2024-05-22 23:50:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 23:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 9 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-22 23:50:25] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-22 23:50:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 199 ms
[2024-05-22 23:50:25] [INFO ] Computed and/alt/rep : 38/157/38 causal constraints (skipped 1 transitions) in 4 ms.
[2024-05-22 23:50:25] [INFO ] Added : 36 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
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 2 ms. Remains 45 /45 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-22 23:50:25] [INFO ] Invariant cache hit.
[2024-05-22 23:50:25] [INFO ] Implicit Places using invariants in 49 ms returned [16, 21, 33, 39]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 51 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 41/45 places, 40/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 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 40 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 39 transition count 38
Applied a total of 4 rules in 6 ms. Remains 39 /41 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 39 cols
[2024-05-22 23:50:25] [INFO ] Computed 7 invariants in 2 ms
[2024-05-22 23:50:25] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:50:25] [INFO ] Invariant cache hit.
[2024-05-22 23:50:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:25] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/45 places, 38/40 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 155 ms. Remains : 39/45 places, 38/40 transitions.
[2024-05-22 23:50:25] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 125127 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83568 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000000 steps, including 83598 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 2) seen :8
[2024-05-22 23:50:27] [INFO ] Invariant cache hit.
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-22 23:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:50:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 118 ms
[2024-05-22 23:50:27] [INFO ] Computed and/alt/rep : 37/155/37 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 23:50:27] [INFO ] Added : 30 causal constraints over 6 iterations in 99 ms. Result :sat
Minimization took 14 ms.
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-22 23:50:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 156 ms
[2024-05-22 23:50:27] [INFO ] Computed and/alt/rep : 37/155/37 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 23:50:27] [INFO ] Added : 36 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[4, 4]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 39/39 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-22 23:50:27] [INFO ] Invariant cache hit.
[2024-05-22 23:50:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:50:27] [INFO ] Invariant cache hit.
[2024-05-22 23:50:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-22 23:50:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:50:27] [INFO ] Invariant cache hit.
[2024-05-22 23:50:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 39/39 places, 38/38 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-00
[2024-05-22 23:50:27] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1244 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
[2024-05-22 23:50:27] [INFO ] Invariant cache hit.
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:50:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 23:50:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-22 23:50:28] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-22 23:50:28] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-22 23:50:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-22 23:50:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 136 ms
[2024-05-22 23:50:28] [INFO ] Computed and/alt/rep : 37/155/37 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 23:50:28] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 4 ms to minimize.
[2024-05-22 23:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-22 23:50:28] [INFO ] Added : 30 causal constraints over 6 iterations in 102 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 39/39 places, 38/38 transitions.
[2024-05-22 23:50:28] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 125025 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83355 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :4
[2024-05-22 23:50:29] [INFO ] Invariant cache hit.
[2024-05-22 23:50:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:29] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 23:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:29] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-22 23:50:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:29] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 119 ms
[2024-05-22 23:50:29] [INFO ] Computed and/alt/rep : 37/155/37 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-22 23:50:29] [INFO ] Added : 30 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 39/39 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2024-05-22 23:50:29] [INFO ] Invariant cache hit.
[2024-05-22 23:50:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:50:29] [INFO ] Invariant cache hit.
[2024-05-22 23:50:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-22 23:50:29] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:50:29] [INFO ] Invariant cache hit.
[2024-05-22 23:50:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 39/39 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-00 in 1793 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-14
[2024-05-22 23:50:29] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1272 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
[2024-05-22 23:50:29] [INFO ] Invariant cache hit.
[2024-05-22 23:50:29] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-22 23:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 23:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:50:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:50:29] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-22 23:50:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 163 ms
[2024-05-22 23:50:29] [INFO ] Computed and/alt/rep : 37/155/37 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 23:50:29] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 38/38 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 38
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 38 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 36 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 36 transition count 36
Applied a total of 7 rules in 6 ms. Remains 36 /39 variables (removed 3) and now considering 36/38 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 36/39 places, 36/38 transitions.
// Phase 1: matrix 36 rows 36 cols
[2024-05-22 23:50:30] [INFO ] Computed 7 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156373 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 96361 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :4
[2024-05-22 23:50:31] [INFO ] Invariant cache hit.
[2024-05-22 23:50:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-22 23:50:31] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 23:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 23:50:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:50:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-22 23:50:31] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 23:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 23:50:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-22 23:50:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 23:50:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-22 23:50:31] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 23:50:31] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-22 23:50:31] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-22 23:50:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 23:50:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 108 ms
[2024-05-22 23:50:31] [INFO ] Computed and/alt/rep : 35/186/35 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 23:50:31] [INFO ] Added : 25 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 36/36 transitions.
Applied a total of 0 rules in 4 ms. Remains 36 /36 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 36/36 places, 36/36 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-22 23:50:31] [INFO ] Invariant cache hit.
[2024-05-22 23:50:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:50:31] [INFO ] Invariant cache hit.
[2024-05-22 23:50:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 23:50:31] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-22 23:50:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:50:31] [INFO ] Invariant cache hit.
[2024-05-22 23:50:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 36/36 places, 36/36 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-14 in 1885 ms.
[2024-05-22 23:50:31] [INFO ] Flatten gal took : 29 ms
[2024-05-22 23:50:31] [INFO ] Applying decomposition
[2024-05-22 23:50:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4702578077201836165.txt' '-o' '/tmp/graph4702578077201836165.bin' '-w' '/tmp/graph4702578077201836165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4702578077201836165.bin' '-l' '-1' '-v' '-w' '/tmp/graph4702578077201836165.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:50:31] [INFO ] Decomposing Gal with order
[2024-05-22 23:50:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:50:31] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 23:50:31] [INFO ] Flatten gal took : 29 ms
[2024-05-22 23:50:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 23:50:31] [INFO ] Time to serialize gal into /tmp/UpperBounds598761595378934200.gal : 2 ms
[2024-05-22 23:50:31] [INFO ] Time to serialize properties into /tmp/UpperBounds4080233586253426487.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds598761595378934200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4080233586253426487.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds4080233586253426487.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1123,0.094536,7652,472,157,9264,457,190,8637,65,1853,0
Total reachable state count : 1123

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-00 :0 <= i5.u5.p57 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-00 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-00,0,0.09862,7652,1,0,9264,457,252,8637,83,1853,322
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-14 :0 <= i3.u6.p59 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-14 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-14,0,0.102414,7652,1,0,9264,491,271,8637,96,2277,499
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 16493 ms.

BK_STOP 1716421832996

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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 gold2023"
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 r153-tall-171631151600331"
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 ;