About the Execution of 2023-gold for MedleyA-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 482.323 | 21274.00 | 34622.00 | 535.10 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r597-smll-171734926400036.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 MedleyA-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 MedleyA-PT-08-UpperBounds-00
FORMULA_NAME MedleyA-PT-08-UpperBounds-01
FORMULA_NAME MedleyA-PT-08-UpperBounds-02
FORMULA_NAME MedleyA-PT-08-UpperBounds-03
FORMULA_NAME MedleyA-PT-08-UpperBounds-04
FORMULA_NAME MedleyA-PT-08-UpperBounds-05
FORMULA_NAME MedleyA-PT-08-UpperBounds-06
FORMULA_NAME MedleyA-PT-08-UpperBounds-07
FORMULA_NAME MedleyA-PT-08-UpperBounds-08
FORMULA_NAME MedleyA-PT-08-UpperBounds-09
FORMULA_NAME MedleyA-PT-08-UpperBounds-10
FORMULA_NAME MedleyA-PT-08-UpperBounds-11
FORMULA_NAME MedleyA-PT-08-UpperBounds-12
FORMULA_NAME MedleyA-PT-08-UpperBounds-13
FORMULA_NAME MedleyA-PT-08-UpperBounds-14
FORMULA_NAME MedleyA-PT-08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717361927565
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=MedleyA-PT-08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 20:58:50] [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-06-02 20:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:58:50] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-02 20:58:50] [INFO ] Transformed 147 places.
[2024-06-02 20:58:50] [INFO ] Transformed 312 transitions.
[2024-06-02 20:58:50] [INFO ] Found NUPN structural information;
[2024-06-02 20:58:50] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 20:58:50] [INFO ] Computed 11 invariants in 31 ms
Incomplete random walk after 10000 steps, including 500 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :7
FORMULA MedleyA-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
[2024-06-02 20:58:50] [INFO ] Invariant cache hit.
[2024-06-02 20:58:51] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2024-06-02 20:58:51] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-02 20:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:51] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-06-02 20:58:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:51] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:51] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-06-02 20:58:52] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 7 ms to minimize.
[2024-06-02 20:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2024-06-02 20:58:52] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 59 ms.
[2024-06-02 20:58:52] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2024-06-02 20:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-06-02 20:58:52] [INFO ] Added : 86 causal constraints over 19 iterations in 897 ms. Result :sat
Minimization took 103 ms.
[2024-06-02 20:58:53] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:53] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:53] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-02 20:58:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:53] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:53] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-02 20:58:53] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 46 ms.
[2024-06-02 20:58:54] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:58:54] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:58:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2024-06-02 20:58:54] [INFO ] Added : 71 causal constraints over 16 iterations in 819 ms. Result :sat
Minimization took 94 ms.
[2024-06-02 20:58:54] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:54] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:54] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-06-02 20:58:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 20:58:54] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:54] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-06-02 20:58:54] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 41 ms.
[2024-06-02 20:58:55] [INFO ] Added : 79 causal constraints over 16 iterations in 507 ms. Result :sat
Minimization took 91 ms.
[2024-06-02 20:58:55] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:58:55] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:55] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-02 20:58:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:55] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:55] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-06-02 20:58:55] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:58:55] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:58:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2024-06-02 20:58:56] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 28 ms.
[2024-06-02 20:58:56] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:58:56] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:58:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2024-06-02 20:58:56] [INFO ] Added : 74 causal constraints over 15 iterations in 665 ms. Result :sat
Minimization took 85 ms.
[2024-06-02 20:58:56] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 20:58:56] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:56] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-02 20:58:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:58:56] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:57] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-06-02 20:58:57] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 28 ms.
[2024-06-02 20:58:57] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:58:57] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 0 ms to minimize.
[2024-06-02 20:58:57] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 0 ms to minimize.
[2024-06-02 20:58:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 359 ms
[2024-06-02 20:58:57] [INFO ] Added : 82 causal constraints over 18 iterations in 885 ms. Result :sat
Minimization took 84 ms.
[2024-06-02 20:58:58] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 20:58:58] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:58] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-06-02 20:58:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:58:58] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:58] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-02 20:58:58] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 27 ms.
[2024-06-02 20:58:58] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 0 ms to minimize.
[2024-06-02 20:58:58] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 512 ms
[2024-06-02 20:58:59] [INFO ] Added : 75 causal constraints over 16 iterations in 925 ms. Result :sat
Minimization took 87 ms.
[2024-06-02 20:58:59] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:59] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:59] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-06-02 20:58:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:58:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:58:59] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:58:59] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-06-02 20:58:59] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 25 ms.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 680 ms
[2024-06-02 20:59:00] [INFO ] Added : 78 causal constraints over 17 iterations in 1148 ms. Result :sat
Minimization took 90 ms.
[2024-06-02 20:59:01] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-02 20:59:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:01] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-06-02 20:59:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:59:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:59:01] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:01] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-06-02 20:59:01] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 28 ms.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 0 ms to minimize.
[2024-06-02 20:59:02] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-06-02 20:59:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2024-06-02 20:59:02] [INFO ] Added : 78 causal constraints over 17 iterations in 709 ms. Result :sat
Minimization took 81 ms.
[2024-06-02 20:59:02] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-06-02 20:59:02] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:02] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-06-02 20:59:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:59:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-06-02 20:59:02] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:02] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-02 20:59:02] [INFO ] Computed and/alt/rep : 141/562/141 causal constraints (skipped 170 transitions) in 27 ms.
[2024-06-02 20:59:03] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-06-02 20:59:03] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:59:03] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2024-06-02 20:59:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2024-06-02 20:59:03] [INFO ] Added : 81 causal constraints over 17 iterations in 970 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 147 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 311/311 transitions.
Graph (complete) has 507 edges and 147 vertex of which 140 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 140 transition count 273
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 66 place count 116 transition count 267
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 116 transition count 264
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 113 transition count 264
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 101 place count 84 transition count 227
Iterating global reduction 2 with 29 rules applied. Total rules applied 130 place count 84 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 130 place count 84 transition count 225
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 82 transition count 225
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 143 place count 73 transition count 202
Iterating global reduction 2 with 9 rules applied. Total rules applied 152 place count 73 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 69 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 69 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 162 place count 67 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 67 transition count 186
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 192 place count 53 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 53 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 51 transition count 168
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 51 transition count 168
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 206 place count 47 transition count 176
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 214 place count 47 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
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 218 place count 45 transition count 191
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 224 place count 45 transition count 185
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 230 place count 39 transition count 185
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 234 place count 39 transition count 181
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 39 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 238 place count 37 transition count 180
Applied a total of 238 rules in 158 ms. Remains 37 /147 variables (removed 110) and now considering 180/311 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 37/147 places, 180/311 transitions.
Normalized transition count is 146 out of 180 initially.
// Phase 1: matrix 146 rows 37 cols
[2024-06-02 20:59:04] [INFO ] Computed 11 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 29 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 68 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :0
[2024-06-02 20:59:05] [INFO ] Flow matrix only has 146 transitions (discarded 34 similar events)
// Phase 1: matrix 146 rows 37 cols
[2024-06-02 20:59:05] [INFO ] Computed 11 invariants in 6 ms
[2024-06-02 20:59:05] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 20:59:05] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:05] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-06-02 20:59:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:59:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:05] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 20:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:05] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-02 20:59:05] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-02 20:59:05] [INFO ] [Nat]Added 80 Read/Feed constraints in 14 ms returned sat
[2024-06-02 20:59:05] [INFO ] Computed and/alt/rep : 4/20/4 causal constraints (skipped 138 transitions) in 15 ms.
[2024-06-02 20:59:05] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 180/180 transitions.
Applied a total of 0 rules in 9 ms. Remains 37 /37 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 37/37 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-02 20:59:05] [INFO ] Flow matrix only has 146 transitions (discarded 34 similar events)
[2024-06-02 20:59:05] [INFO ] Invariant cache hit.
[2024-06-02 20:59:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:59:06] [INFO ] Flow matrix only has 146 transitions (discarded 34 similar events)
[2024-06-02 20:59:06] [INFO ] Invariant cache hit.
[2024-06-02 20:59:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-02 20:59:06] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-02 20:59:06] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 20:59:06] [INFO ] Flow matrix only has 146 transitions (discarded 34 similar events)
[2024-06-02 20:59:06] [INFO ] Invariant cache hit.
[2024-06-02 20:59:06] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 46 transitions.
Found 46 dead transitions using SMT.
Drop transitions removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 37/37 places, 134/180 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 134
Applied a total of 1 rules in 5 ms. Remains 36 /37 variables (removed 1) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 36 cols
[2024-06-02 20:59:06] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:59:06] [INFO ] Implicit Places using invariants in 77 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 35/37 places, 134/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 35 /35 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 492 ms. Remains : 35/37 places, 134/180 transitions.
// Phase 1: matrix 134 rows 35 cols
[2024-06-02 20:59:06] [INFO ] Computed 9 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 44 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :0
[2024-06-02 20:59:07] [INFO ] Invariant cache hit.
[2024-06-02 20:59:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:07] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:07] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 20:59:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:59:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:07] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 20:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:59:07] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-06-02 20:59:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 20:59:07] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2024-06-02 20:59:07] [INFO ] Computed and/alt/rep : 6/24/6 causal constraints (skipped 124 transitions) in 13 ms.
[2024-06-02 20:59:07] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA MedleyA-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 17258 ms.
BK_STOP 1717361948839
--------------------
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="MedleyA-PT-08"
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 MedleyA-PT-08, 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 r597-smll-171734926400036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 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 '
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 ;