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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K 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:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Jun 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:02 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 57K 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-d0m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654793528219

Running Version 0
[2022-06-09 16:52:09] [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 16:52:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 16:52:09] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-06-09 16:52:09] [INFO ] Transformed 262 places.
[2022-06-09 16:52:09] [INFO ] Transformed 73 transitions.
[2022-06-09 16:52:09] [INFO ] Parsed PT model containing 262 places and 73 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2022-06-09 16:52:09] [INFO ] Computed 6 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :2
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1062 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1051 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1037 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1013 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
// Phase 1: matrix 73 rows 72 cols
[2022-06-09 16:52:10] [INFO ] Computed 6 place invariants in 9 ms
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 16:52:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 16:52:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 16:52:10] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2022-06-09 16:52:10] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 9 ms.
[2022-06-09 16:52:10] [INFO ] Added : 15 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 15 ms.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 16:52:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 25 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2022-06-09 16:52:10] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 7 ms.
[2022-06-09 16:52:10] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 5 ms to minimize.
[2022-06-09 16:52:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-09 16:52:10] [INFO ] Added : 18 causal constraints over 4 iterations in 145 ms. Result :sat
Minimization took 14 ms.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:52:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2022-06-09 16:52:10] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 8 ms.
[2022-06-09 16:52:10] [INFO ] Added : 14 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 14 ms.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:52:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 16:52:10] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:52:10] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 16:52:11] [INFO ] Deduced a trap composed of 40 places in 19 ms of which 1 ms to minimize.
[2022-06-09 16:52:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-06-09 16:52:11] [INFO ] Added : 17 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 18 ms.
[2022-06-09 16:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:52:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:52:11] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 16:52:11] [INFO ] Added : 20 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 55 ms.
[2022-06-09 16:52:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:11] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 16:52:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:52:11] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:52:11] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 5 ms.
[2022-06-09 16:52:11] [INFO ] Added : 20 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1, 31, 1, 1, 73, 73] Max seen :[0, 0, 0, 0, 0, 0]
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 11900 steps, including 1704 resets, run finished after 28 ms. (steps per millisecond=425 ) properties (out of 6) seen :3 could not realise parikh vector
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7300 steps, including 833 resets, run finished after 12 ms. (steps per millisecond=608 ) properties (out of 4) seen :1 could not realise parikh vector
Incomplete Parikh walk after 7300 steps, including 830 resets, run finished after 11 ms. (steps per millisecond=663 ) properties (out of 4) seen :1 could not realise parikh vector
Incomplete Parikh walk after 7500 steps, including 808 resets, run finished after 11 ms. (steps per millisecond=681 ) properties (out of 4) seen :1 could not realise parikh vector
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 61 transition count 63
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 60 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 59 transition count 60
Applied a total of 24 rules in 28 ms. Remains 59 /72 variables (removed 13) and now considering 60/73 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/72 places, 60/73 transitions.
// Phase 1: matrix 60 rows 59 cols
[2022-06-09 16:52:11] [INFO ] Computed 4 place invariants in 2 ms
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 223892 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103251 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102813 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102847 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 3) seen :0
// Phase 1: matrix 60 rows 59 cols
[2022-06-09 16:52:13] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-06-09 16:52:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:52:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2022-06-09 16:52:13] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:13] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 44 transitions) in 4 ms.
[2022-06-09 16:52:13] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 16:52:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2022-06-09 16:52:13] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 44 transitions) in 4 ms.
[2022-06-09 16:52:13] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 18 ms.
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 16:52:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:13] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 16:52:13] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:13] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 44 transitions) in 4 ms.
[2022-06-09 16:52:13] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1, 36, 36] Max seen :[0, 0, 0]
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 9800 steps, including 1382 resets, run finished after 15 ms. (steps per millisecond=653 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 60/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 59
Applied a total of 2 rules in 6 ms. Remains 58 /59 variables (removed 1) and now considering 59/60 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/59 places, 59/60 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:13] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223724 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103033 resets, run finished after 318 ms. (steps per millisecond=3144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103189 resets, run finished after 317 ms. (steps per millisecond=3154 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102913 resets, run finished after 315 ms. (steps per millisecond=3174 ) properties (out of 3) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:52:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:15] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:15] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:52:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:15] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:15] [INFO ] Added : 15 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 19 ms.
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 16:52:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2022-06-09 16:52:15] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:15] [INFO ] Added : 15 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1, 36, 36] Max seen :[0, 0, 0]
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 9700 steps, including 1340 resets, run finished after 26 ms. (steps per millisecond=373 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:15] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-06-09 16:52:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-10
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:17] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1027 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 16:52:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:17] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:52:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:17] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2022-06-09 16:52:17] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 5 ms.
[2022-06-09 16:52:17] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 9700 steps, including 1354 resets, run finished after 16 ms. (steps per millisecond=606 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:17] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223528 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102984 resets, run finished after 296 ms. (steps per millisecond=3378 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:52:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:18] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 16:52:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:52:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:18] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:18] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:18] [INFO ] Added : 15 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 9700 steps, including 1334 resets, run finished after 12 ms. (steps per millisecond=808 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:52:19] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:52:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2022-06-09 16:52:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 in 3460 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-13
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:19] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2248 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:52:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:19] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:19] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:19] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:19] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 14 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:19] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223611 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102712 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:20] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:20] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:20] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:20] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 17 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:20] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-09 16:52:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:20] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2022-06-09 16:52:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 16:52:20] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 in 1333 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-14
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 16:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 16:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:20] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 16:52:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:20] [INFO ] [Nat]Added 23 Read/Feed constraints in 12 ms returned sat
[2022-06-09 16:52:20] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 5 ms.
[2022-06-09 16:52:20] [INFO ] Added : 15 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:20] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223690 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103482 resets, run finished after 296 ms. (steps per millisecond=3378 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:21] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:52:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:52:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:52:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:52:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:52:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:21] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:52:21] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:52:21] [INFO ] Added : 15 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [36] Max seen :[0]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 11 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:21] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 16:52:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:52:21] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-06-09 16:52:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:52:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:52:21] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 in 1361 ms.
[2022-06-09 16:52:22] [INFO ] Flatten gal took : 33 ms
[2022-06-09 16:52:22] [INFO ] Applying decomposition
[2022-06-09 16:52:22] [INFO ] Flatten gal took : 8 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/graph2007511277799045861.txt, -o, /tmp/graph2007511277799045861.bin, -w, /tmp/graph2007511277799045861.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/graph2007511277799045861.bin, -l, -1, -v, -w, /tmp/graph2007511277799045861.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 16:52:22] [INFO ] Decomposing Gal with order
[2022-06-09 16:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 16:52:22] [INFO ] Removed a total of 56 redundant transitions.
[2022-06-09 16:52:22] [INFO ] Flatten gal took : 30 ms
[2022-06-09 16:52:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 5 ms.
[2022-06-09 16:52:22] [INFO ] Time to serialize gal into /tmp/UpperBounds9519413056504229739.gal : 3 ms
[2022-06-09 16:52:22] [INFO ] Time to serialize properties into /tmp/UpperBounds8661798800822077103.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9519413056504229739.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8661798800822077103.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/UpperBounds9519413056504229739.gal -t CGAL -reachable-file /tmp/UpperBounds8661798800822077103.prop --nowitness
Loading property file /tmp/UpperBounds8661798800822077103.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,3.50158e+09,892.055,2738292,3916,693,806618,122777,216,3.10242e+07,53,1.7061e+06,0
Total reachable state count : 3501583837

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 :0 <= i4.u11.l211 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 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-d0m36-UpperBounds-10,0,896.484,2738292,1,0,806618,145090,304,3.10242e+07,66,1.7061e+06,1125
Min sum of variable value : 0
Maximum sum along a path : 32
Bounds property SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 :0 <= i0.u12.l207 <= 32
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 32 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-d0m36-UpperBounds-13,0,897.481,2738292,1,0,806618,216415,330,3.10242e+07,102,1.7061e+06,3433
Min sum of variable value : 0
Maximum sum along a path : 32
Bounds property SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 :0 <= i0.u12.l208 <= 32
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 32 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-d0m36-UpperBounds-14,0,898.001,2738292,1,0,806618,263111,350,3.10242e+07,140,1.7061e+06,3577

BK_STOP 1654794447367

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

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