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.r312-tall-165472282900893.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 itstools
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 r312-tall-165472282900893
=====================================================================

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

Running Version 202205111006
[2022-06-11 12:38:39] [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-11 12:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:38:40] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2022-06-11 12:38:40] [INFO ] Transformed 1295 places.
[2022-06-11 12:38:40] [INFO ] Transformed 749 transitions.
[2022-06-11 12:38:40] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 247 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-11 12:38:40] [INFO ] Computed 6 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 2211 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 986 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 1001 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 12:38:40] [INFO ] Computed 6 place invariants in 10 ms
[2022-06-11 12:38:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-11 12:38:40] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-11 12:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:40] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-06-11 12:38:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:41] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:41] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-06-11 12:38:41] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-11 12:38:41] [INFO ] [Nat]Added 587 Read/Feed constraints in 143 ms returned sat
[2022-06-11 12:38:41] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 4 ms to minimize.
[2022-06-11 12:38:41] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2022-06-11 12:38:41] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-06-11 12:38:42] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2022-06-11 12:38:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 648 ms
[2022-06-11 12:38:42] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 124 ms.
[2022-06-11 12:38:42] [INFO ] Added : 21 causal constraints over 5 iterations in 450 ms. Result :sat
Minimization took 179 ms.
[2022-06-11 12:38:42] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:38:42] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:42] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-06-11 12:38:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:42] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:43] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-06-11 12:38:43] [INFO ] [Nat]Added 587 Read/Feed constraints in 119 ms returned sat
[2022-06-11 12:38:43] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2022-06-11 12:38:43] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2022-06-11 12:38:43] [INFO ] Deduced a trap composed of 168 places in 97 ms of which 1 ms to minimize.
[2022-06-11 12:38:43] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 1 ms to minimize.
[2022-06-11 12:38:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 556 ms
[2022-06-11 12:38:43] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 70 ms.
[2022-06-11 12:38:44] [INFO ] Added : 20 causal constraints over 4 iterations in 318 ms. Result :sat
Minimization took 120 ms.
[2022-06-11 12:38:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:44] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-11 12:38:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:44] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-11 12:38:44] [INFO ] [Nat]Added 587 Read/Feed constraints in 148 ms returned sat
[2022-06-11 12:38:44] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 1 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 0 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 0 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
[2022-06-11 12:38:45] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 0 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 0 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 0 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2022-06-11 12:38:46] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-06-11 12:38:47] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-06-11 12:38:47] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-06-11 12:38:47] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 0 ms to minimize.
[2022-06-11 12:38:47] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 1 ms to minimize.
[2022-06-11 12:38:47] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 0 ms to minimize.
[2022-06-11 12:38:47] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-06-11 12:38:48] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 0 ms to minimize.
[2022-06-11 12:38:48] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 0 ms to minimize.
[2022-06-11 12:38:49] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 4675 ms
Current structural bounds on expressions (after SMT) : [1, 1, 29] Max seen :[0, 0, 0]
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 71 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-11 12:38:49] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223964 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103425 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103218 resets, run finished after 419 ms. (steps per millisecond=2386 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103663 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 3) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:38:51] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:38:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:38:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-11 12:38:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 12:38:51] [INFO ] [Nat]Added 37 Read/Feed constraints in 9 ms returned sat
[2022-06-11 12:38:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2022-06-11 12:38:52] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2022-06-11 12:38:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-06-11 12:38:52] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 7 ms.
[2022-06-11 12:38:52] [INFO ] Added : 20 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 18 ms.
[2022-06-11 12:38:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:38:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:52] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2022-06-11 12:38:52] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 10 ms.
[2022-06-11 12:38:52] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2022-06-11 12:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-11 12:38:52] [INFO ] Added : 21 causal constraints over 5 iterations in 116 ms. Result :sat
Minimization took 21 ms.
[2022-06-11 12:38:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-11 12:38:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:38:52] [INFO ] [Nat]Added 37 Read/Feed constraints in 8 ms returned sat
[2022-06-11 12:38:52] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 9 ms.
[2022-06-11 12:38:52] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2022-06-11 12:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-11 12:38:52] [INFO ] Added : 13 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 29] Max seen :[0, 0, 0]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, 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-11 12:38:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:38:52] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:38:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:38:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 12:38:52] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-06-11 12:38:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:38:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
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-11 12:38:53] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 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-11 12:38:53] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:38:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:38:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:53] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:38:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 12:38:53] [INFO ] [Nat]Added 37 Read/Feed constraints in 13 ms returned sat
[2022-06-11 12:38:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2022-06-11 12:38:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2022-06-11 12:38:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-06-11 12:38:53] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 5 ms.
[2022-06-11 12:38:53] [INFO ] Added : 20 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 8 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-11 12:38:53] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224141 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103301 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 1) seen :0
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:38:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:38:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-11 12:38:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 12:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:38:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:38:54] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-11 12:38:54] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2022-06-11 12:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-11 12:38:54] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 5 ms.
[2022-06-11 12:38:54] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2022-06-11 12:38:54] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2022-06-11 12:38:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2022-06-11 12:38:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 126 ms
[2022-06-11 12:38:54] [INFO ] Added : 21 causal constraints over 5 iterations in 168 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 4 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 in SAFETY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:38:54] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:38:54] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:38:54] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:38:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:38:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-11 12:38:55] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:38:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 12:38:55] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 in 2161 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-11
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:38:55] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2175 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 1084 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-11 12:38:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:38:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:38:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:38:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 12:38:55] [INFO ] [Nat]Added 37 Read/Feed constraints in 7 ms returned sat
[2022-06-11 12:38:55] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 6 ms.
[2022-06-11 12:38:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-06-11 12:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-11 12:38:55] [INFO ] Added : 21 causal constraints over 5 iterations in 108 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 8 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-11 12:38:55] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224216 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103479 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 1) seen :0
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:38:56] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:38:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 12:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-11 12:38:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 12:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:38:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:38:56] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2022-06-11 12:38:56] [INFO ] Computed and/alt/rep : 24/52/24 causal constraints (skipped 67 transitions) in 6 ms.
[2022-06-11 12:38:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2022-06-11 12:38:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-11 12:38:56] [INFO ] Added : 21 causal constraints over 6 iterations in 132 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 3 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 in SAFETY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:38:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:56] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:38:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:38:57] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2022-06-11 12:38:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:38:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 in 2001 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-14
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:38:57] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-11 12:38:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-11 12:38:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:57] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:38:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 12:38:57] [INFO ] [Nat]Added 37 Read/Feed constraints in 16 ms returned sat
[2022-06-11 12:38:57] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 7 ms.
[2022-06-11 12:38:57] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2022-06-11 12:38:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-11 12:38:57] [INFO ] Added : 13 causal constraints over 3 iterations in 103 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 15 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-11 12:38:57] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224175 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103389 resets, run finished after 358 ms. (steps per millisecond=2793 ) properties (out of 1) seen :0
// Phase 1: matrix 82 rows 78 cols
[2022-06-11 12:38:58] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:38:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-11 12:38:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:38:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:38:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:38:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-11 12:38:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-11 12:38:58] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2022-06-11 12:38:58] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 60 transitions) in 4 ms.
[2022-06-11 12:38:58] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2022-06-11 12:38:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-11 12:38:58] [INFO ] Added : 13 causal constraints over 3 iterations in 92 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 82/82 transitions.
Applied a total of 0 rules in 2 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 in SAFETY mode, 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-11 12:38:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:58] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 82 rows 78 cols
[2022-06-11 12:38:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-11 12:38:58] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-06-11 12:38:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 82 rows 78 cols
[2022-06-11 12:38:58] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:38:59] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 82/82 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 in 1849 ms.
[2022-06-11 12:38:59] [INFO ] Flatten gal took : 35 ms
[2022-06-11 12:38:59] [INFO ] Applying decomposition
[2022-06-11 12:38:59] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8944432032643409249.txt' '-o' '/tmp/graph8944432032643409249.bin' '-w' '/tmp/graph8944432032643409249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8944432032643409249.bin' '-l' '-1' '-v' '-w' '/tmp/graph8944432032643409249.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:38:59] [INFO ] Decomposing Gal with order
[2022-06-11 12:38:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:38:59] [INFO ] Removed a total of 92 redundant transitions.
[2022-06-11 12:38:59] [INFO ] Flatten gal took : 40 ms
[2022-06-11 12:38:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 7 ms.
[2022-06-11 12:38:59] [INFO ] Time to serialize gal into /tmp/UpperBounds10284032616196157623.gal : 5 ms
[2022-06-11 12:38:59] [INFO ] Time to serialize properties into /tmp/UpperBounds14254212694761097451.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10284032616196157623.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14254212694761097451.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds14254212694761097451.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.044553,4920,290,83,2275,262,306,3564,81,773,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 <= i3.u11.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.047292,4920,1,0,2275,262,413,3564,100,773,544
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 :0 <= i3.u12.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.047478,4920,1,0,2275,262,430,3564,109,773,570
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 :0 <= i0.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.047637,4920,1,0,2275,262,460,3564,109,773,622
Total runtime 19504 ms.

BK_STOP 1654951139497

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="itstools"
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 itstools"
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 r312-tall-165472282900893"
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 ;