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-165472293000337.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-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 4.9K Jun 7 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 7 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 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-d1m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654794467112

Running Version 0
[2022-06-09 17:07:48] [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:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:07:48] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-06-09 17:07:48] [INFO ] Transformed 1295 places.
[2022-06-09 17:07:48] [INFO ] Transformed 749 transitions.
[2022-06-09 17:07:48] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:07:48] [INFO ] Computed 6 place invariants in 34 ms
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 973 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:07:49] [INFO ] Computed 6 place invariants in 23 ms
[2022-06-09 17:07:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 17:07:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:49] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-06-09 17:07:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:07:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2022-06-09 17:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:50] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-06-09 17:07:50] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-09 17:07:50] [INFO ] [Nat]Added 587 Read/Feed constraints in 410 ms returned sat
[2022-06-09 17:07:50] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 4 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 0 ms to minimize.
[2022-06-09 17:07:51] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 0 ms to minimize.
[2022-06-09 17:07:52] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2022-06-09 17:07:52] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 0 ms to minimize.
[2022-06-09 17:07:52] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2022-06-09 17:07:52] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2022-06-09 17:07:52] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2296 ms
[2022-06-09 17:07:52] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 105 ms.
[2022-06-09 17:07:53] [INFO ] Added : 49 causal constraints over 10 iterations in 670 ms. Result :sat
Minimization took 561 ms.
[2022-06-09 17:07:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:54] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:54] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-06-09 17:07:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:07:54] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:07:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:54] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-06-09 17:07:54] [INFO ] [Nat]Added 587 Read/Feed constraints in 485 ms returned sat
[2022-06-09 17:07:55] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2022-06-09 17:07:55] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-06-09 17:07:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2022-06-09 17:07:55] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 91 ms.
[2022-06-09 17:07:55] [INFO ] Added : 55 causal constraints over 11 iterations in 643 ms. Result :sat
Minimization took 481 ms.
[2022-06-09 17:07:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:07:56] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:56] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-06-09 17:07:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:07:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:07:56] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 17:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:07:56] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 17:07:57] [INFO ] [Nat]Added 587 Read/Feed constraints in 563 ms returned sat
[2022-06-09 17:07:57] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 0 ms to minimize.
[2022-06-09 17:07:57] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 0 ms to minimize.
[2022-06-09 17:07:57] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2022-06-09 17:07:57] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2022-06-09 17:07:57] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2022-06-09 17:07:58] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2022-06-09 17:07:58] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 0 ms to minimize.
[2022-06-09 17:07:58] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2022-06-09 17:07:58] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2022-06-09 17:07:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1449 ms
[2022-06-09 17:07:58] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 56 ms.
[2022-06-09 17:07:59] [INFO ] Added : 52 causal constraints over 11 iterations in 596 ms. Result :sat
Minimization took 685 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 29] Max seen :[0, 0, 0]
Incomplete Parikh walk after 27100 steps, including 4798 resets, run finished after 143 ms. (steps per millisecond=189 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 27500 steps, including 4459 resets, run finished after 127 ms. (steps per millisecond=216 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26200 steps, including 4610 resets, run finished after 118 ms. (steps per millisecond=222 ) 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.5 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 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 302 place count 182 transition count 232
Iterating global reduction 1 with 59 rules applied. Total rules applied 361 place count 182 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 367 place count 182 transition count 226
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 409 place count 140 transition count 184
Iterating global reduction 2 with 42 rules applied. Total rules applied 451 place count 140 transition count 184
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 464 place count 140 transition count 171
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 490 place count 114 transition count 143
Iterating global reduction 3 with 26 rules applied. Total rules applied 516 place count 114 transition count 143
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 531 place count 114 transition count 128
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 536 place count 109 transition count 122
Iterating global reduction 4 with 5 rules applied. Total rules applied 541 place count 109 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 546 place count 104 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 551 place count 104 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 553 place count 102 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 555 place count 102 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 556 place count 102 transition count 113
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 558 place count 100 transition count 111
Iterating global reduction 5 with 2 rules applied. Total rules applied 560 place count 100 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 561 place count 99 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 562 place count 99 transition count 110
Applied a total of 562 rules in 76 ms. Remains 99 /259 variables (removed 160) and now considering 110/749 (removed 639) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/259 places, 110/749 transitions.
// Phase 1: matrix 110 rows 99 cols
[2022-06-09 17:08:00] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224917 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103420 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103331 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103587 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 3) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 110 rows 99 cols
[2022-06-09 17:08:02] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:02] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:08:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-09 17:08:02] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2022-06-09 17:08:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-06-09 17:08:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2022-06-09 17:08:02] [INFO ] Computed and/alt/rep : 29/66/29 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-09 17:08:03] [INFO ] Added : 24 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 30 ms.
[2022-06-09 17:08:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:08:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:08:03] [INFO ] [Nat]Added 43 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2022-06-09 17:08:03] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-06-09 17:08:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2022-06-09 17:08:03] [INFO ] Computed and/alt/rep : 29/66/29 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-09 17:08:03] [INFO ] Added : 24 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1, 29] Max seen :[0, 0]
Incomplete Parikh walk after 19800 steps, including 3188 resets, run finished after 24 ms. (steps per millisecond=825 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11300 steps, including 1670 resets, run finished after 12 ms. (steps per millisecond=941 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 99/99 places, 110/110 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 108
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 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 96 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 95 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 94 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 94 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 93 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 93 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 92 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 92 transition count 101
Applied a total of 15 rules in 22 ms. Remains 92 /99 variables (removed 7) and now considering 101/110 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/99 places, 101/110 transitions.
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:03] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224251 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103320 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103709 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 2) seen :0
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:04] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-09 17:08:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:04] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:08:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 17:08:05] [INFO ] [Nat]Added 39 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:05] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 5 ms.
[2022-06-09 17:08:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-06-09 17:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-09 17:08:05] [INFO ] Added : 25 causal constraints over 5 iterations in 119 ms. Result :sat
Minimization took 25 ms.
[2022-06-09 17:08:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:05] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:05] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:08:05] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2022-06-09 17:08:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2022-06-09 17:08:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2022-06-09 17:08:05] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 6 ms.
[2022-06-09 17:08:05] [INFO ] Added : 25 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1, 29] Max seen :[0, 0]
Incomplete Parikh walk after 20000 steps, including 3250 resets, run finished after 27 ms. (steps per millisecond=740 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15400 steps, including 2484 resets, run finished after 16 ms. (steps per millisecond=962 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 92/92 places, 101/101 transitions.
Starting structural reductions, iteration 0 : 92/92 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:05] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 17:08:05] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2022-06-09 17:08:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:05] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 17:08:05] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 92/92 places, 101/101 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:06] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2236 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1057 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:06] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:08:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:06] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:08:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:06] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:06] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:08:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 17:08:06] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:08:06] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 6 ms.
[2022-06-09 17:08:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-06-09 17:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-09 17:08:06] [INFO ] Added : 25 causal constraints over 5 iterations in 119 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Incomplete Parikh walk after 15400 steps, including 2543 resets, run finished after 22 ms. (steps per millisecond=700 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 91 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 90 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 90 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 90 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 89 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 88 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 87 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 87 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 86 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 86 transition count 92
Applied a total of 15 rules in 14 ms. Remains 86 /92 variables (removed 6) and now considering 92/101 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/92 places, 92/101 transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:07] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224429 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103302 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :0
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:08:08] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:08:08] [INFO ] [Nat]Added 35 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:08:08] [INFO ] Computed and/alt/rep : 24/52/24 causal constraints (skipped 67 transitions) in 5 ms.
[2022-06-09 17:08:08] [INFO ] Added : 23 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 19800 steps, including 3226 resets, run finished after 22 ms. (steps per millisecond=900 ) 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 5 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 4 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:08:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:08] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:08] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-09 17:08:08] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2022-06-09 17:08:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-09 17:08:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 in 2776 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-15
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:08] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2231 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 1106 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 101 rows 92 cols
[2022-06-09 17:08:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:08:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:08:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:08] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-09 17:08:08] [INFO ] [Nat]Added 39 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:08:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-06-09 17:08:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-06-09 17:08:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2022-06-09 17:08:08] [INFO ] Computed and/alt/rep : 26/60/26 causal constraints (skipped 74 transitions) in 6 ms.
[2022-06-09 17:08:08] [INFO ] Added : 25 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 20000 steps, including 3239 resets, run finished after 24 ms. (steps per millisecond=833 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 92/92 places, 101/101 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 91 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 90 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 90 transition count 99
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 90 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 89 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 89 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 88 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 83 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 82 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 82 transition count 88
Applied a total of 21 rules in 19 ms. Remains 82 /92 variables (removed 10) and now considering 88/101 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/92 places, 88/101 transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:08:08] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224041 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103625 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:08:09] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:08:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:08:09] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:08:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:08:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:08:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:08:10] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 17:08:10] [INFO ] [Nat]Added 34 Read/Feed constraints in 12 ms returned sat
[2022-06-09 17:08:10] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2022-06-09 17:08:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 5 ms to minimize.
[2022-06-09 17:08:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2022-06-09 17:08:10] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 4 ms.
[2022-06-09 17:08:10] [INFO ] Added : 21 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16700 steps, including 2727 resets, run finished after 21 ms. (steps per millisecond=795 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:08:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:08:10] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:08:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:10] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 17:08:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-06-09 17:08:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:08:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:08:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 in 1864 ms.
[2022-06-09 17:08:10] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:08:10] [INFO ] Applying decomposition
[2022-06-09 17:08:10] [INFO ] Flatten gal took : 11 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/graph16735250146682533252.txt, -o, /tmp/graph16735250146682533252.bin, -w, /tmp/graph16735250146682533252.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/graph16735250146682533252.bin, -l, -1, -v, -w, /tmp/graph16735250146682533252.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:08:10] [INFO ] Decomposing Gal with order
[2022-06-09 17:08:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:08:10] [INFO ] Removed a total of 93 redundant transitions.
[2022-06-09 17:08:10] [INFO ] Flatten gal took : 37 ms
[2022-06-09 17:08:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2022-06-09 17:08:10] [INFO ] Time to serialize gal into /tmp/UpperBounds1269749972341698592.gal : 5 ms
[2022-06-09 17:08:10] [INFO ] Time to serialize properties into /tmp/UpperBounds2868911608218026814.prop : 0 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/UpperBounds1269749972341698592.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2868911608218026814.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/UpperBounds1269749972341698592.gal -t CGAL -reachable-file /tmp/UpperBounds2868911608218026814.prop --nowitness
Loading property file /tmp/UpperBounds2868911608218026814.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,71729,0.256154,13976,754,318,14937,3021,318,45846,81,12753,0
Total reachable state count : 71729

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 :0 <= i3.u13.p22 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 1 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-d1m06-UpperBounds-03,0,0.273293,13976,1,0,14937,3021,424,45846,102,12753,771
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 :0 <= i0.u19.p72 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 1 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-d1m06-UpperBounds-15,0,0.274821,13976,1,0,14937,3021,449,45846,102,12753,900

BK_STOP 1654794492140

--------------------
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-d1m06"
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-d1m06, 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-165472293000337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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