Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472293000334.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SieveSingleMsgMbox-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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 SieveSingleMsgMbox-PT-d1m04-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654794430811

Running Version 0
[2022-06-09 17:07:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 17:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:07:13] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-06-09 17:07:13] [INFO ] Transformed 1295 places.
[2022-06-09 17:07:13] [INFO ] Transformed 749 transitions.
[2022-06-09 17:07:13] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:07:13] [INFO ] Computed 6 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2198 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 946 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:07:13] [INFO ] Computed 6 place invariants in 17 ms
[2022-06-09 17:07:13] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 17:07:13] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:14] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-09 17:07:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:07:14] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:14] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-06-09 17:07:14] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-09 17:07:14] [INFO ] [Nat]Added 587 Read/Feed constraints in 402 ms returned sat
[2022-06-09 17:07:14] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2022-06-09 17:07:15] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 6 ms to minimize.
[2022-06-09 17:07:15] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2022-06-09 17:07:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 654 ms
[2022-06-09 17:07:15] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 132 ms.
[2022-06-09 17:07:16] [INFO ] Deduced a trap composed of 150 places in 86 ms of which 2 ms to minimize.
[2022-06-09 17:07:16] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 1 ms to minimize.
[2022-06-09 17:07:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2022-06-09 17:07:16] [INFO ] Added : 47 causal constraints over 10 iterations in 965 ms. Result :sat
Minimization took 500 ms.
[2022-06-09 17:07:16] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:07:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:17] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-06-09 17:07:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:17] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-06-09 17:07:17] [INFO ] [Nat]Added 587 Read/Feed constraints in 605 ms returned sat
[2022-06-09 17:07:17] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2022-06-09 17:07:18] [INFO ] Deduced a trap composed of 154 places in 74 ms of which 1 ms to minimize.
[2022-06-09 17:07:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2022-06-09 17:07:18] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 58 ms.
[2022-06-09 17:07:18] [INFO ] Added : 47 causal constraints over 10 iterations in 530 ms. Result :sat
Minimization took 478 ms.
[2022-06-09 17:07:19] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:07:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:19] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-06-09 17:07:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:19] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-06-09 17:07:20] [INFO ] [Nat]Added 587 Read/Feed constraints in 648 ms returned sat
[2022-06-09 17:07:20] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2022-06-09 17:07:20] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 0 ms to minimize.
[2022-06-09 17:07:20] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2022-06-09 17:07:20] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 0 ms to minimize.
[2022-06-09 17:07:20] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2022-06-09 17:07:21] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2022-06-09 17:07:21] [INFO ] Deduced a trap composed of 95 places in 41 ms of which 0 ms to minimize.
[2022-06-09 17:07:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1070 ms
[2022-06-09 17:07:21] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 61 ms.
[2022-06-09 17:07:21] [INFO ] Added : 43 causal constraints over 9 iterations in 568 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 29] Max seen :[0, 0, 0]
Incomplete Parikh walk after 34200 steps, including 7056 resets, run finished after 186 ms. (steps per millisecond=183 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 1993 resets, run finished after 63 ms. (steps per millisecond=212 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 1895 resets, run finished after 63 ms. (steps per millisecond=206 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 231
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 225
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 411 place count 139 transition count 183
Iterating global reduction 2 with 42 rules applied. Total rules applied 453 place count 139 transition count 183
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 467 place count 139 transition count 169
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 493 place count 113 transition count 141
Iterating global reduction 3 with 26 rules applied. Total rules applied 519 place count 113 transition count 141
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 534 place count 113 transition count 126
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 541 place count 106 transition count 117
Iterating global reduction 4 with 7 rules applied. Total rules applied 548 place count 106 transition count 117
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 555 place count 99 transition count 110
Iterating global reduction 4 with 7 rules applied. Total rules applied 562 place count 99 transition count 110
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 566 place count 95 transition count 105
Iterating global reduction 4 with 4 rules applied. Total rules applied 570 place count 95 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 572 place count 95 transition count 103
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 576 place count 91 transition count 99
Iterating global reduction 5 with 4 rules applied. Total rules applied 580 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 582 place count 89 transition count 97
Iterating global reduction 5 with 2 rules applied. Total rules applied 584 place count 89 transition count 97
Applied a total of 584 rules in 91 ms. Remains 89 /259 variables (removed 170) and now considering 97/749 (removed 652) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/259 places, 97/749 transitions.
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:22] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224717 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102971 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103831 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103440 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 3) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:24] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:07:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:24] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:07:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 17:07:25] [INFO ] [Nat]Added 37 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 268 ms
[2022-06-09 17:07:25] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 7 ms.
[2022-06-09 17:07:25] [INFO ] Added : 22 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 26 ms.
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2022-06-09 17:07:25] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 6 ms.
[2022-06-09 17:07:25] [INFO ] Added : 21 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 23 ms.
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:07:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:25] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:07:25] [INFO ] [Nat]Added 37 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2022-06-09 17:07:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2022-06-09 17:07:25] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 6 ms.
[2022-06-09 17:07:25] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 29] Max seen :[0, 0, 0]
Incomplete Parikh walk after 14100 steps, including 2141 resets, run finished after 20 ms. (steps per millisecond=705 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 2037 resets, run finished after 15 ms. (steps per millisecond=866 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14500 steps, including 2242 resets, run finished after 17 ms. (steps per millisecond=852 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 97/97 transitions.
Starting structural reductions, iteration 0 : 89/89 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:25] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:26] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:26] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 17:07:26] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2022-06-09 17:07:26] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:26] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 17:07:26] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 97/97 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-07
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:26] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1007 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:26] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:07:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:26] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:07:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:26] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:07:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 17:07:26] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:07:26] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-06-09 17:07:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-06-09 17:07:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 8 ms to minimize.
[2022-06-09 17:07:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-06-09 17:07:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2022-06-09 17:07:26] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2022-06-09 17:07:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 239 ms
[2022-06-09 17:07:26] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 7 ms.
[2022-06-09 17:07:26] [INFO ] Added : 22 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Incomplete Parikh walk after 14500 steps, including 2268 resets, run finished after 19 ms. (steps per millisecond=763 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 97/97 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 85 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 85 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 85 transition count 91
Applied a total of 10 rules in 26 ms. Remains 85 /89 variables (removed 4) and now considering 91/97 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/89 places, 91/97 transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:07:26] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224087 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 104143 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :0
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:07:27] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:27] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:07:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:28] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:07:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:07:28] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:07:28] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2022-06-09 17:07:28] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2022-06-09 17:07:28] [INFO ] Deduced a trap composed of 25 places in 16 ms of which 0 ms to minimize.
[2022-06-09 17:07:28] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2022-06-09 17:07:28] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2022-06-09 17:07:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 176 ms
[2022-06-09 17:07:28] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 6 ms.
[2022-06-09 17:07:28] [INFO ] Added : 20 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Incomplete Parikh walk after 12800 steps, including 1917 resets, run finished after 20 ms. (steps per millisecond=640 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:07:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:28] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:07:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:07:28] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-06-09 17:07:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-09 17:07:28] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:07:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 in 2311 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:28] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 981 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:28] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:07:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:28] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:07:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 17:07:28] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:07:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
[2022-06-09 17:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-09 17:07:28] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 6 ms.
[2022-06-09 17:07:28] [INFO ] Added : 21 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Incomplete Parikh walk after 13000 steps, including 2028 resets, run finished after 13 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 97/97 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 86 transition count 92
Applied a total of 8 rules in 10 ms. Remains 86 /89 variables (removed 3) and now considering 92/97 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/89 places, 92/97 transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:07:28] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224465 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103588 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 1) seen :0
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:07:29] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:07:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:30] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:07:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:07:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:07:30] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:07:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2022-06-09 17:07:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-06-09 17:07:30] [INFO ] Computed and/alt/rep : 24/52/24 causal constraints (skipped 67 transitions) in 6 ms.
[2022-06-09 17:07:30] [INFO ] Added : 20 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 13000 steps, including 1905 resets, run finished after 19 ms. (steps per millisecond=684 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 10 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Starting structural reductions, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:07:30] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:07:30] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:07:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:07:30] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2022-06-09 17:07:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:07:30] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 in 1892 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:30] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2246 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1052 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:07:30] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:07:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:07:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:30] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:07:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 17:07:30] [INFO ] [Nat]Added 37 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:07:30] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2022-06-09 17:07:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2022-06-09 17:07:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2022-06-09 17:07:30] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 7 ms.
[2022-06-09 17:07:30] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 14100 steps, including 2118 resets, run finished after 17 ms. (steps per millisecond=829 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 97/97 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 87 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 87 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 85 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 85 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 84 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 83 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 83 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 82 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 81 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 80 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 79 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 78 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 78 transition count 82
Applied a total of 24 rules in 22 ms. Remains 78 /89 variables (removed 11) and now considering 82/97 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/89 places, 82/97 transitions.
// Phase 1: matrix 82 rows 78 cols
[2022-06-09 17:07:30] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224016 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103198 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :0
// Phase 1: matrix 82 rows 78 cols
[2022-06-09 17:07:31] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:07:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:07:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:07:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:31] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:07:31] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 17:07:31] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:07:31] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2022-06-09 17:07:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-09 17:07:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-06-09 17:07:31] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 60 transitions) in 5 ms.
[2022-06-09 17:07:32] [INFO ] Added : 20 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 15500 steps, including 2706 resets, run finished after 19 ms. (steps per millisecond=815 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 82/82 transitions.
Starting structural reductions, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 78 /78 variables (removed 0) and now considering 82/82 (removed 0) transitions.
// Phase 1: matrix 82 rows 78 cols
[2022-06-09 17:07:32] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 17:07:32] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 82 rows 78 cols
[2022-06-09 17:07:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:32] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 17:07:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2022-06-09 17:07:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 82 rows 78 cols
[2022-06-09 17:07:32] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:07:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 82/82 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 in 1833 ms.
[2022-06-09 17:07:32] [INFO ] Flatten gal took : 38 ms
[2022-06-09 17:07:32] [INFO ] Applying decomposition
[2022-06-09 17:07:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16235785074125915715.txt, -o, /tmp/graph16235785074125915715.bin, -w, /tmp/graph16235785074125915715.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16235785074125915715.bin, -l, -1, -v, -w, /tmp/graph16235785074125915715.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:07:32] [INFO ] Decomposing Gal with order
[2022-06-09 17:07:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:07:32] [INFO ] Removed a total of 99 redundant transitions.
[2022-06-09 17:07:32] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:07:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 8 ms.
[2022-06-09 17:07:32] [INFO ] Time to serialize gal into /tmp/UpperBounds17856298308143776076.gal : 5 ms
[2022-06-09 17:07:32] [INFO ] Time to serialize properties into /tmp/UpperBounds12419913239482135327.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17856298308143776076.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12419913239482135327.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17856298308143776076.gal -t CGAL -reachable-file /tmp/UpperBounds12419913239482135327.prop --nowitness
Loading property file /tmp/UpperBounds12419913239482135327.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,915,0.037313,4936,251,66,1785,229,293,2455,78,520,0
Total reachable state count : 915

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 :0 <= i2.u8.l130 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 0 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
SieveSingleMsgMbox-PT-d1m04-UpperBounds-07,0,0.039537,4936,1,0,1785,229,401,2455,93,520,527
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 :0 <= i2.u9.p29 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 0 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
SieveSingleMsgMbox-PT-d1m04-UpperBounds-11,0,0.039812,4936,1,0,1785,229,419,2455,102,520,553
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 :0 <= i7.u21.p54 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 0 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
SieveSingleMsgMbox-PT-d1m04-UpperBounds-14,0,0.039997,4936,1,0,1785,229,443,2455,102,520,579

BK_STOP 1654794453818

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is SieveSingleMsgMbox-PT-d1m04, 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 r323-tall-165472293000334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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