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.r109-tall-171624208600456.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 DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600456
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 97K 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716340266933

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=DES-PT-50a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-22 01:11:08] [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 01:11:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:11:08] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-22 01:11:08] [INFO ] Transformed 314 places.
[2024-05-22 01:11:08] [INFO ] Transformed 271 transitions.
[2024-05-22 01:11:08] [INFO ] Found NUPN structural information;
[2024-05-22 01:11:08] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-22 01:11:08] [INFO ] Computed 59 invariants in 32 ms
Incomplete random walk after 10000 steps, including 232 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :8
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
[2024-05-22 01:11:09] [INFO ] Invariant cache hit.
[2024-05-22 01:11:09] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2024-05-22 01:11:09] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-22 01:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:09] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-22 01:11:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-22 01:11:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 99 ms returned sat
[2024-05-22 01:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:11] [INFO ] [Nat]Absence check using state equation in 1839 ms returned sat
[2024-05-22 01:11:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 01:11:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2024-05-22 01:11:11] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-22 01:11:12] [INFO ] Added : 110 causal constraints over 23 iterations in 909 ms. Result :sat
Minimization took 132 ms.
[2024-05-22 01:11:12] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:12] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-22 01:11:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 01:11:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 342 ms returned sat
[2024-05-22 01:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:13] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2024-05-22 01:11:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2024-05-22 01:11:13] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 16 ms.
[2024-05-22 01:11:14] [INFO ] Added : 64 causal constraints over 13 iterations in 1289 ms. Result :sat
Minimization took 151 ms.
[2024-05-22 01:11:15] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:15] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-22 01:11:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2024-05-22 01:11:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 166 ms returned sat
[2024-05-22 01:11:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:16] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2024-05-22 01:11:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2024-05-22 01:11:16] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 25 ms.
[2024-05-22 01:11:17] [INFO ] Added : 131 causal constraints over 27 iterations in 927 ms. Result :sat
Minimization took 172 ms.
[2024-05-22 01:11:17] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 01:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:17] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-22 01:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 129 ms returned sat
[2024-05-22 01:11:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:19] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2024-05-22 01:11:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 267 ms returned sat
[2024-05-22 01:11:19] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 33 ms.
[2024-05-22 01:11:20] [INFO ] Added : 134 causal constraints over 27 iterations in 818 ms. Result :sat
Minimization took 141 ms.
[2024-05-22 01:11:20] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 01:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:21] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-22 01:11:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 01:11:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2024-05-22 01:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:21] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2024-05-22 01:11:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-22 01:11:21] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-22 01:11:23] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 4 ms to minimize.
[2024-05-22 01:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-22 01:11:23] [INFO ] Added : 118 causal constraints over 24 iterations in 1471 ms. Result :sat
Minimization took 143 ms.
[2024-05-22 01:11:23] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:23] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-22 01:11:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-22 01:11:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 83 ms returned sat
[2024-05-22 01:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:24] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2024-05-22 01:11:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-22 01:11:24] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-22 01:11:25] [INFO ] Added : 104 causal constraints over 21 iterations in 662 ms. Result :sat
Minimization took 246 ms.
[2024-05-22 01:11:25] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 01:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:25] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-22 01:11:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 01:11:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 93 ms returned sat
[2024-05-22 01:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:26] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2024-05-22 01:11:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 58 ms returned sat
[2024-05-22 01:11:26] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2024-05-22 01:11:27] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:11:27] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 01:11:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2024-05-22 01:11:28] [INFO ] Added : 131 causal constraints over 27 iterations in 1063 ms. Result :sat
Minimization took 237 ms.
[2024-05-22 01:11:28] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:28] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-22 01:11:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-22 01:11:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 195 ms returned sat
[2024-05-22 01:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:30] [INFO ] [Nat]Absence check using state equation in 1397 ms returned sat
[2024-05-22 01:11:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2024-05-22 01:11:30] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 16 ms.
[2024-05-22 01:11:31] [INFO ] Added : 144 causal constraints over 29 iterations in 966 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 105 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2024-05-22 01:11:33] [INFO ] Computed 60 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 13705 resets, run finished after 1998 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2275 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2256 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2266 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2248 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2246 resets, run finished after 897 ms. (steps per millisecond=1114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2278 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2279 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 7) seen :0
[2024-05-22 01:11:41] [INFO ] Invariant cache hit.
[2024-05-22 01:11:41] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:41] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-22 01:11:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 01:11:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2024-05-22 01:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:42] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-22 01:11:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 01:11:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-22 01:11:42] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 01:11:43] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-22 01:11:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-22 01:11:43] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-22 01:11:43] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:11:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 385 ms
[2024-05-22 01:11:43] [INFO ] Added : 167 causal constraints over 34 iterations in 1159 ms. Result :sat
Minimization took 90 ms.
[2024-05-22 01:11:43] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 01:11:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 01:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:43] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-22 01:11:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 01:11:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 129 ms returned sat
[2024-05-22 01:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:44] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-05-22 01:11:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2024-05-22 01:11:44] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-22 01:11:44] [INFO ] Added : 125 causal constraints over 26 iterations in 567 ms. Result :sat
Minimization took 71 ms.
[2024-05-22 01:11:44] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 01:11:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:44] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-22 01:11:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2024-05-22 01:11:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:45] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2024-05-22 01:11:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 01:11:45] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-22 01:11:46] [INFO ] Added : 164 causal constraints over 33 iterations in 681 ms. Result :sat
Minimization took 84 ms.
[2024-05-22 01:11:46] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:46] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-22 01:11:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 174 ms returned sat
[2024-05-22 01:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:47] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2024-05-22 01:11:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 38 ms returned sat
[2024-05-22 01:11:47] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-22 01:11:47] [INFO ] Added : 114 causal constraints over 23 iterations in 614 ms. Result :sat
Minimization took 97 ms.
[2024-05-22 01:11:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 01:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:48] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-22 01:11:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-22 01:11:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2024-05-22 01:11:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:48] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2024-05-22 01:11:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 01:11:48] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-22 01:11:48] [INFO ] Added : 91 causal constraints over 19 iterations in 385 ms. Result :sat
Minimization took 51 ms.
[2024-05-22 01:11:48] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:49] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-22 01:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:49] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-22 01:11:49] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-22 01:11:49] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-22 01:11:49] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2024-05-22 01:11:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-22 01:11:49] [INFO ] Added : 73 causal constraints over 15 iterations in 492 ms. Result :sat
Minimization took 51 ms.
[2024-05-22 01:11:49] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-22 01:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:50] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-22 01:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:11:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-22 01:11:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2024-05-22 01:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:11:50] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-05-22 01:11:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-22 01:11:50] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-22 01:11:50] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 01:11:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2024-05-22 01:11:50] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-22 01:11:51] [INFO ] Added : 188 causal constraints over 38 iterations in 770 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 43573 ms.

BK_STOP 1716340313110

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DES-PT-50a"
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 DES-PT-50a, 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 r109-tall-171624208600456"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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