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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 13K Jun 7 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Jun 7 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 7 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:01 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-d0m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654793285431

Running Version 0
[2022-06-09 16:48:07] [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:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 16:48:07] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-06-09 16:48:07] [INFO ] Transformed 262 places.
[2022-06-09 16:48:07] [INFO ] Transformed 73 transitions.
[2022-06-09 16:48:07] [INFO ] Parsed PT model containing 262 places and 73 transitions in 81 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-d0m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2022-06-09 16:48:07] [INFO ] Computed 6 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 2230 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1067 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 992 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 976 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
// Phase 1: matrix 73 rows 72 cols
[2022-06-09 16:48:07] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-09 16:48:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 16:48:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 16:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:07] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 16:48:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:48:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 16:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 16:48:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 16:48:08] [INFO ] [Nat]Added 31 Read/Feed constraints in 9 ms returned sat
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-09 16:48:08] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 12 ms.
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-09 16:48:08] [INFO ] Added : 20 causal constraints over 4 iterations in 108 ms. Result :sat
Minimization took 15 ms.
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:48:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:48:08] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 7 ms.
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2022-06-09 16:48:08] [INFO ] Added : 20 causal constraints over 4 iterations in 128 ms. Result :sat
Minimization took 16 ms.
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 16:48:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
[2022-06-09 16:48:08] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 16:48:08] [INFO ] Added : 19 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 18 ms.
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 16:48:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:08] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 16:48:08] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2022-06-09 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2022-06-09 16:48:08] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 6 ms.
[2022-06-09 16:48:08] [INFO ] Added : 19 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 7, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 10200 steps, including 1434 resets, run finished after 20 ms. (steps per millisecond=510 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7600 steps, including 925 resets, run finished after 12 ms. (steps per millisecond=633 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8700 steps, including 1098 resets, run finished after 16 ms. (steps per millisecond=543 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 1358 resets, run finished after 16 ms. (steps per millisecond=637 ) properties (out of 4) seen :0 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:48:09] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223566 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 4) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 103177 resets, run finished after 372 ms. (steps per millisecond=2688 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103481 resets, run finished after 312 ms. (steps per millisecond=3205 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102520 resets, run finished after 307 ms. (steps per millisecond=3257 ) properties (out of 3) seen :0
// Phase 1: matrix 60 rows 59 cols
[2022-06-09 16:48:10] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 16:48:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:10] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:10] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:10] [INFO ] Added : 16 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:48:10] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:10] [INFO ] Added : 16 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:10] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 16:48:10] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:48:10] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:11] [INFO ] Added : 16 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 9900 steps, including 1343 resets, run finished after 19 ms. (steps per millisecond=521 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8400 steps, including 1047 resets, run finished after 9 ms. (steps per millisecond=933 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 9800 steps, including 1346 resets, run finished after 10 ms. (steps per millisecond=980 ) 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:48:11] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223538 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102605 resets, run finished after 300 ms. (steps per millisecond=3333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103082 resets, run finished after 302 ms. (steps per millisecond=3311 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103108 resets, run finished after 301 ms. (steps per millisecond=3322 ) properties (out of 3) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:12] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:12] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:12] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:12] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2022-06-09 16:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-06-09 16:48:12] [INFO ] Added : 15 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 14 ms.
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Added 23 Read/Feed constraints in 4 ms returned sat
[2022-06-09 16:48:12] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 5 ms.
[2022-06-09 16:48:12] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2022-06-09 16:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-06-09 16:48:12] [INFO ] Added : 15 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:48:12] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:12] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:12] [INFO ] Added : 15 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 9800 steps, including 1369 resets, run finished after 17 ms. (steps per millisecond=576 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 9000 steps, including 1135 resets, run finished after 9 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 10000 steps, including 1316 resets, run finished after 10 ms. (steps per millisecond=1000 ) 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 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.
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.
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:13] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:48:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:13] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 16:48:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-06-09 16:48:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-03
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:13] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2255 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 1057 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:13] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 16:48:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 16:48:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:13] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:13] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:13] [INFO ] [Nat]Added 23 Read/Feed constraints in 7 ms returned sat
[2022-06-09 16:48:13] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:13] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2022-06-09 16:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-06-09 16:48:13] [INFO ] Added : 15 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10000 steps, including 1338 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 3 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:48:13] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223749 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102634 resets, run finished after 288 ms. (steps per millisecond=3472 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:14] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 16:48:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 16:48:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:14] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:14] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:14] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2022-06-09 16:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-06-09 16:48:14] [INFO ] Added : 15 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10000 steps, including 1382 resets, run finished after 12 ms. (steps per millisecond=833 ) 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.
Starting structural reductions, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 6 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:48:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:14] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:14] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:48:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-06-09 16:48:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:14] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-03 in 1409 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-06
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:14] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:14] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:14] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 16:48:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:14] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:14] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:14] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:14] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-06-09 16:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-09 16:48:14] [INFO ] Added : 15 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Incomplete Parikh walk after 9000 steps, including 1161 resets, run finished after 11 ms. (steps per millisecond=818 ) 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 3 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:48:14] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 223180 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102869 resets, run finished after 290 ms. (steps per millisecond=3448 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:15] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 16:48:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 15 ms returned sat
[2022-06-09 16:48:15] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 4 ms.
[2022-06-09 16:48:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2022-06-09 16:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-06-09 16:48:15] [INFO ] Added : 15 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[0]
Incomplete Parikh walk after 9000 steps, including 1085 resets, run finished after 13 ms. (steps per millisecond=692 ) 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 3 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:48:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:15] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 16:48:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:15] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-06-09 16:48:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:15] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-06 in 1320 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-10
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:15] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2259 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 16:48:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 16:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:15] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:15] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:15] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 3 ms.
[2022-06-09 16:48:15] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 9800 steps, including 1361 resets, run finished after 14 ms. (steps per millisecond=700 ) 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:48:16] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 223830 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102501 resets, run finished after 289 ms. (steps per millisecond=3460 ) properties (out of 1) seen :0
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:16] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 16:48:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 16:48:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:16] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 16:48:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:48:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 16:48:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 16:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:48:16] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 16:48:16] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:16] [INFO ] [Nat]Added 23 Read/Feed constraints in 3 ms returned sat
[2022-06-09 16:48:16] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 3 ms.
[2022-06-09 16:48:16] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 9800 steps, including 1383 resets, run finished after 13 ms. (steps per millisecond=753 ) 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.
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:48:16] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:17] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:17] [INFO ] State equation strengthened by 23 read => feed constraints.
[2022-06-09 16:48:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-06-09 16:48:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 58 cols
[2022-06-09 16:48:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 16:48:17] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/58 places, 59/59 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m06-UpperBounds-10 in 1229 ms.
[2022-06-09 16:48:17] [INFO ] Flatten gal took : 28 ms
[2022-06-09 16:48:17] [INFO ] Applying decomposition
[2022-06-09 16:48:17] [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/graph2589062240597018029.txt, -o, /tmp/graph2589062240597018029.bin, -w, /tmp/graph2589062240597018029.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/graph2589062240597018029.bin, -l, -1, -v, -w, /tmp/graph2589062240597018029.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 16:48:17] [INFO ] Decomposing Gal with order
[2022-06-09 16:48:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 16:48:17] [INFO ] Removed a total of 50 redundant transitions.
[2022-06-09 16:48:17] [INFO ] Flatten gal took : 28 ms
[2022-06-09 16:48:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 6 ms.
[2022-06-09 16:48:17] [INFO ] Time to serialize gal into /tmp/UpperBounds15003338776866432365.gal : 3 ms
[2022-06-09 16:48:17] [INFO ] Time to serialize properties into /tmp/UpperBounds1090358169827871596.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/UpperBounds15003338776866432365.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1090358169827871596.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/UpperBounds15003338776866432365.gal -t CGAL -reachable-file /tmp/UpperBounds1090358169827871596.prop --nowitness
Loading property file /tmp/UpperBounds1090358169827871596.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,19185,0.124758,9400,402,158,9325,721,223,25817,51,3896,0
Total reachable state count : 19185

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m06-UpperBounds-03 :0 <= i6.u12.l202 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d0m06-UpperBounds-03,0,0.132132,9400,1,0,9325,721,313,25817,68,3896,531
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m06-UpperBounds-06 :0 <= i2.u7.l55 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m06-UpperBounds-06 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-d0m06-UpperBounds-06,0,0.13284,9400,1,0,9325,721,335,25817,68,3896,604
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m06-UpperBounds-10 :0 <= i6.u12.l210 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m06-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-d0m06-UpperBounds-10,0,0.133017,9400,1,0,9325,721,352,25817,75,3896,624

BK_STOP 1654793306171

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

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