Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649610600045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is JoinFreeModules-PT-0050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610600045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 152K May 18 16:42 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 JoinFreeModules-PT-0050-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716498151165

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 21:02:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 21:02:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:02:32] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-23 21:02:32] [INFO ] Transformed 251 places.
[2024-05-23 21:02:32] [INFO ] Transformed 401 transitions.
[2024-05-23 21:02:32] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[2, 0, 0, 1, 0, 50, 0, 50, 1, 2, 1, 0, 0, 50, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 0, 0, 1, 0, 50, 0, 50, 1, 2, 1, 0, 0, 50, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 401 rows 250 cols
[2024-05-23 21:02:32] [INFO ] Computed 50 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 0, 1, 0, 50, 0, 50, 1, 2, 1, 0, 0, 50, 1, 2] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 10001 steps (2 resets) in 58 ms. (169 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 469 ms. (340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[27, 49, 25, 51, 27, 50, 49, 50, 51, 27, 51, 49, 25, 50, 51, 27] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-05-23 21:02:33] [INFO ] Invariant cache hit.
[2024-05-23 21:02:33] [INFO ] [Real]Absence check using 50 positive place invariants in 17 ms returned sat
[2024-05-23 21:02:33] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-23 21:02:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-23 21:02:33] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-23 21:02:33] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-23 21:02:33] [INFO ] [Nat]Added 50 Read/Feed constraints in 23 ms returned sat
[2024-05-23 21:02:33] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-23 21:02:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 7 ms to minimize.
[2024-05-23 21:02:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:02:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-05-23 21:02:34] [INFO ] Added : 105 causal constraints over 22 iterations in 732 ms. Result :sat
Minimization took 146 ms.
[2024-05-23 21:02:34] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-23 21:02:34] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 21:02:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:34] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-23 21:02:34] [INFO ] [Nat]Added 50 Read/Feed constraints in 23 ms returned sat
[2024-05-23 21:02:34] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-23 21:02:35] [INFO ] Added : 49 causal constraints over 12 iterations in 311 ms. Result :sat
Minimization took 74 ms.
[2024-05-23 21:02:35] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:35] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 21:02:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:35] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 21:02:35] [INFO ] [Nat]Added 50 Read/Feed constraints in 55 ms returned sat
[2024-05-23 21:02:35] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-23 21:02:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 21:02:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:02:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 21:02:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-23 21:02:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 21:02:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:02:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 324 ms
[2024-05-23 21:02:36] [INFO ] Added : 132 causal constraints over 28 iterations in 1023 ms. Result :sat
Minimization took 164 ms.
[2024-05-23 21:02:36] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-23 21:02:36] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-23 21:02:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:37] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-23 21:02:37] [INFO ] [Nat]Added 50 Read/Feed constraints in 34 ms returned sat
[2024-05-23 21:02:37] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 21:02:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-23 21:02:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 21:02:37] [INFO ] Added : 72 causal constraints over 15 iterations in 442 ms. Result :sat
Minimization took 71 ms.
[2024-05-23 21:02:37] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:37] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 21:02:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:38] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-23 21:02:38] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2024-05-23 21:02:38] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-23 21:02:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:02:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 21:02:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2024-05-23 21:02:38] [INFO ] Added : 85 causal constraints over 19 iterations in 554 ms. Result :sat
Minimization took 142 ms.
[2024-05-23 21:02:38] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:38] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-23 21:02:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:39] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-23 21:02:39] [INFO ] [Nat]Added 50 Read/Feed constraints in 19 ms returned sat
[2024-05-23 21:02:39] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-23 21:02:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 21:02:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:02:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-23 21:02:39] [INFO ] Added : 98 causal constraints over 21 iterations in 608 ms. Result :sat
Minimization took 73 ms.
[2024-05-23 21:02:39] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:39] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-23 21:02:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:40] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-23 21:02:40] [INFO ] [Nat]Added 50 Read/Feed constraints in 43 ms returned sat
[2024-05-23 21:02:40] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-23 21:02:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 21:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 21:02:40] [INFO ] Added : 101 causal constraints over 21 iterations in 606 ms. Result :sat
Minimization took 86 ms.
[2024-05-23 21:02:40] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:41] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-23 21:02:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:41] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-23 21:02:41] [INFO ] [Nat]Added 50 Read/Feed constraints in 29 ms returned sat
[2024-05-23 21:02:41] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-23 21:02:41] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-05-23 21:02:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-23 21:02:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2024-05-23 21:02:41] [INFO ] Added : 76 causal constraints over 17 iterations in 631 ms. Result :sat
Minimization took 69 ms.
[2024-05-23 21:02:42] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:42] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 21:02:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:42] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-23 21:02:42] [INFO ] [Nat]Added 50 Read/Feed constraints in 22 ms returned sat
[2024-05-23 21:02:42] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-23 21:02:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:02:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 21:02:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-05-23 21:02:42] [INFO ] Added : 90 causal constraints over 19 iterations in 554 ms. Result :sat
Minimization took 71 ms.
[2024-05-23 21:02:43] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:43] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-23 21:02:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:43] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-23 21:02:43] [INFO ] [Nat]Added 50 Read/Feed constraints in 32 ms returned sat
[2024-05-23 21:02:43] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-23 21:02:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-23 21:02:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:02:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2024-05-23 21:02:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2024-05-23 21:02:43] [INFO ] Added : 84 causal constraints over 18 iterations in 634 ms. Result :sat
Minimization took 140 ms.
[2024-05-23 21:02:44] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:44] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-23 21:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:44] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-23 21:02:44] [INFO ] [Nat]Added 50 Read/Feed constraints in 6 ms returned sat
[2024-05-23 21:02:44] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-23 21:02:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 21:02:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-23 21:02:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-23 21:02:45] [INFO ] Added : 96 causal constraints over 20 iterations in 613 ms. Result :sat
Minimization took 75 ms.
[2024-05-23 21:02:45] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:45] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-23 21:02:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:45] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-23 21:02:45] [INFO ] [Nat]Added 50 Read/Feed constraints in 6 ms returned sat
[2024-05-23 21:02:45] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-23 21:02:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 21:02:45] [INFO ] Added : 72 causal constraints over 15 iterations in 477 ms. Result :sat
Minimization took 80 ms.
[2024-05-23 21:02:46] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:46] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-23 21:02:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-23 21:02:46] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 21:02:46] [INFO ] [Nat]Added 50 Read/Feed constraints in 40 ms returned sat
[2024-05-23 21:02:46] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-23 21:02:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-23 21:02:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-05-23 21:02:46] [INFO ] Added : 86 causal constraints over 19 iterations in 585 ms. Result :sat
Minimization took 158 ms.
[2024-05-23 21:02:47] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:47] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 21:02:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-23 21:02:47] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-23 21:02:47] [INFO ] [Nat]Added 50 Read/Feed constraints in 42 ms returned sat
[2024-05-23 21:02:47] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-23 21:02:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:02:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:02:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 21:02:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 21:02:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:02:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 260 ms
[2024-05-23 21:02:48] [INFO ] Added : 115 causal constraints over 24 iterations in 880 ms. Result :sat
Minimization took 77 ms.
[2024-05-23 21:02:48] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:48] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-23 21:02:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:48] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-23 21:02:48] [INFO ] [Nat]Added 50 Read/Feed constraints in 41 ms returned sat
[2024-05-23 21:02:48] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-23 21:02:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:02:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-23 21:02:49] [INFO ] Added : 85 causal constraints over 18 iterations in 546 ms. Result :sat
Minimization took 70 ms.
[2024-05-23 21:02:49] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:49] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 21:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:02:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-05-23 21:02:49] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-23 21:02:49] [INFO ] [Nat]Added 50 Read/Feed constraints in 38 ms returned sat
[2024-05-23 21:02:49] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-23 21:02:50] [INFO ] Added : 102 causal constraints over 21 iterations in 536 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[27, 49, 25, 51, 27, 50, 49, 50, 51, 27, 51, 49, 25, 50, 51, 27] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 49, 51, 51, 51, 50, 49, 50, 51, 52, 51, 49, 51, 50, 51, 52] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 16 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 401/401 transitions.
Graph (complete) has 600 edges and 250 vertex of which 65 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.2 ms
Discarding 185 places :
Also discarding 296 output transitions
Drop transitions (Output transitions of discarded places.) removed 296 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 104
Applied a total of 2 rules in 22 ms. Remains 65 /250 variables (removed 185) and now considering 104/401 (removed 297) transitions.
Running 78 sub problems to find dead transitions.
// Phase 1: matrix 104 rows 65 cols
[2024-05-23 21:03:11] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 21:03:11] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-23 21:03:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-23 21:03:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 171 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3914 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
After SMT, in 5212ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5224ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5258 ms. Remains : 65/250 places, 104/401 transitions.
[2024-05-23 21:03:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[52, 49, 51, 51, 51, 50, 49, 50, 51, 52, 51, 49, 51, 50, 51, 52] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000009 steps (2 resets) in 1303 ms. (766 steps per ms)
FORMULA JoinFreeModules-PT-0050-UpperBounds-11 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-06 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-01 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 13000013 steps (26 resets) in 12877 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 51, 51, 50, 50, 51, 52, 51, 51, 50, 51, 52] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-05-23 21:03:30] [INFO ] Invariant cache hit.
[2024-05-23 21:03:30] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:30] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 21:03:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-23 21:03:30] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:03:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:03:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
Minimization took 15 ms.
[2024-05-23 21:03:30] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:30] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 8 ms returned sat
[2024-05-23 21:03:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:03:31] [INFO ] Added : 64 causal constraints over 14 iterations in 153 ms. Result :sat
Minimization took 36 ms.
[2024-05-23 21:03:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-23 21:03:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:03:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-23 21:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-23 21:03:31] [INFO ] Added : 68 causal constraints over 16 iterations in 212 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 21:03:31] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-05-23 21:03:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:03:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-23 21:03:31] [INFO ] Added : 51 causal constraints over 11 iterations in 123 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:03:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:31] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 21:03:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 46 ms returned sat
[2024-05-23 21:03:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:03:32] [INFO ] Added : 59 causal constraints over 13 iterations in 113 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 21:03:32] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 68 ms returned sat
[2024-05-23 21:03:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:03:32] [INFO ] Added : 57 causal constraints over 13 iterations in 100 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 21:03:32] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 21:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:03:32] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:03:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-23 21:03:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-23 21:03:32] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-05-23 21:03:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 21:03:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 110 ms
[2024-05-23 21:03:32] [INFO ] Added : 66 causal constraints over 15 iterations in 225 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 21:03:32] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 21:03:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:03:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:03:33] [INFO ] Added : 58 causal constraints over 13 iterations in 91 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 21:03:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2024-05-23 21:03:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:03:33] [INFO ] Added : 54 causal constraints over 13 iterations in 87 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:03:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 21:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2024-05-23 21:03:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:03:33] [INFO ] Added : 59 causal constraints over 13 iterations in 89 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 21:03:33] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-23 21:03:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2024-05-23 21:03:33] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-23 21:03:34] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-23 21:03:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 21:03:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2024-05-23 21:03:34] [INFO ] Added : 37 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 21:03:34] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2024-05-23 21:03:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:03:34] [INFO ] Added : 50 causal constraints over 12 iterations in 85 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 21:03:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:03:34] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:03:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-23 21:03:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 51, 51, 50, 50, 51, 52, 51, 51, 50, 51, 52] Max Struct:[52, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-15 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-00 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 51, 52, 50, 50, 51, 52, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 11 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 50 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 50 /65 variables (removed 15) and now considering 80/104 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 50/65 places, 80/104 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-05-23 21:03:35] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[51, 51, 52, 50, 50, 51, 52, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000002 steps (2 resets) in 942 ms. (1060 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 8019 ms. (1371 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51, 51, 52, 50, 50, 51, 52, 51, 52, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-05-23 21:03:44] [INFO ] Invariant cache hit.
[2024-05-23 21:03:44] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:44] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:03:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-23 21:03:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2024-05-23 21:03:44] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:03:45] [INFO ] Added : 37 causal constraints over 9 iterations in 83 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:45] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:45] [INFO ] Added : 28 causal constraints over 6 iterations in 97 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-23 21:03:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 80 ms returned sat
[2024-05-23 21:03:45] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:45] [INFO ] Added : 23 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 55 ms returned sat
[2024-05-23 21:03:45] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-23 21:03:45] [INFO ] Added : 26 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-23 21:03:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:03:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:03:45] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:03:46] [INFO ] Added : 32 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:46] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:03:46] [INFO ] Added : 41 causal constraints over 10 iterations in 70 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-23 21:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:46] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:03:46] [INFO ] Added : 35 causal constraints over 9 iterations in 109 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:46] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:03:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 38 ms returned sat
[2024-05-23 21:03:46] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:03:46] [INFO ] Added : 27 causal constraints over 6 iterations in 41 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:46] [INFO ] [Nat]Added 10 Read/Feed constraints in 101 ms returned sat
[2024-05-23 21:03:46] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:47] [INFO ] Added : 30 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51, 51, 52, 50, 50, 51, 52, 51, 52, 50, 51] Max Struct:[53, 53, 52, 53, 53, 53, 53, 53, 52, 53, 53]
FORMULA JoinFreeModules-PT-0050-UpperBounds-12 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-04 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 9 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 40 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /50 variables (removed 10) and now considering 64/80 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 40/50 places, 64/80 transitions.
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:03:47] [INFO ] Computed 8 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[51, 51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000017 steps (2 resets) in 788 ms. (1267 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 5274 ms. (1706 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51, 51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-05-23 21:03:53] [INFO ] Invariant cache hit.
[2024-05-23 21:03:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:03:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:53] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 21:03:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:03:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-23 21:03:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:03:53] [INFO ] Added : 26 causal constraints over 6 iterations in 36 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 21:03:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:53] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:53] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:03:53] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:53] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:54] [INFO ] Added : 35 causal constraints over 9 iterations in 47 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:03:54] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:03:54] [INFO ] Added : 30 causal constraints over 7 iterations in 143 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:03:54] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:54] [INFO ] Added : 36 causal constraints over 10 iterations in 48 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:03:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:54] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:54] [INFO ] Added : 41 causal constraints over 9 iterations in 314 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 46 ms returned sat
[2024-05-23 21:03:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:03:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2024-05-23 21:03:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:03:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:03:55] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:03:55] [INFO ] Added : 36 causal constraints over 9 iterations in 41 ms. Result :sat
Minimization took 18 ms.
[2024-05-23 21:03:55] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:03:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-23 21:03:55] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:55] [INFO ] Added : 25 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:03:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:03:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:03:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:03:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:03:55] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:03:55] [INFO ] Added : 45 causal constraints over 11 iterations in 106 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51, 51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 52, 53, 53, 53]
FORMULA JoinFreeModules-PT-0050-UpperBounds-09 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 40/40 places, 64/64 transitions.
[2024-05-23 21:03:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000000 steps (2 resets) in 819 ms. (1219 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5050 ms. (1583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
[2024-05-23 21:04:01] [INFO ] Invariant cache hit.
[2024-05-23 21:04:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 35 ms returned sat
[2024-05-23 21:04:02] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:04:02] [INFO ] Added : 20 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 11 ms.
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:02] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:04:02] [INFO ] Added : 35 causal constraints over 9 iterations in 45 ms. Result :sat
Minimization took 22 ms.
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:04:02] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:04:02] [INFO ] Added : 30 causal constraints over 7 iterations in 132 ms. Result :sat
Minimization took 21 ms.
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:04:02] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:04:02] [INFO ] Added : 36 causal constraints over 10 iterations in 48 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:02] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:04:03] [INFO ] Added : 41 causal constraints over 9 iterations in 326 ms. Result :sat
Minimization took 23 ms.
[2024-05-23 21:04:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:03] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:03] [INFO ] Added : 36 causal constraints over 9 iterations in 42 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:04:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-23 21:04:03] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:04:03] [INFO ] Added : 25 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:04:03] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:03] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:03] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:03] [INFO ] Added : 45 causal constraints over 11 iterations in 101 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 21:04:04] [INFO ] Invariant cache hit.
[2024-05-23 21:04:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 21:04:04] [INFO ] Invariant cache hit.
[2024-05-23 21:04:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-23 21:04:04] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-23 21:04:04] [INFO ] Invariant cache hit.
[2024-05-23 21:04:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1292ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1359 ms. Remains : 40/40 places, 64/64 transitions.
[2024-05-23 21:04:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000004 steps (2 resets) in 785 ms. (1272 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 4705 ms. (1699 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
[2024-05-23 21:04:10] [INFO ] Invariant cache hit.
[2024-05-23 21:04:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 35 ms returned sat
[2024-05-23 21:04:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:04:11] [INFO ] Added : 20 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 11 ms.
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:04:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:11] [INFO ] Added : 35 causal constraints over 9 iterations in 40 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:04:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-23 21:04:11] [INFO ] Added : 30 causal constraints over 7 iterations in 138 ms. Result :sat
Minimization took 19 ms.
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 19 ms returned sat
[2024-05-23 21:04:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:11] [INFO ] Added : 36 causal constraints over 10 iterations in 48 ms. Result :sat
Minimization took 24 ms.
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:12] [INFO ] Added : 41 causal constraints over 9 iterations in 311 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:04:12] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:12] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:12] [INFO ] Added : 36 causal constraints over 9 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2024-05-23 21:04:12] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 21 ms returned sat
[2024-05-23 21:04:12] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-23 21:04:12] [INFO ] Added : 25 causal constraints over 7 iterations in 53 ms. Result :sat
Minimization took 16 ms.
[2024-05-23 21:04:12] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:04:12] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:04:12] [INFO ] Added : 45 causal constraints over 11 iterations in 102 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-23 21:04:13] [INFO ] Invariant cache hit.
[2024-05-23 21:04:13] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 21:04:13] [INFO ] Invariant cache hit.
[2024-05-23 21:04:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-23 21:04:13] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-23 21:04:13] [INFO ] Invariant cache hit.
[2024-05-23 21:04:13] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1934ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1935ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2012 ms. Remains : 40/40 places, 64/64 transitions.
RANDOM walk for 40022 steps (8 resets) in 840 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 184565 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 16
Probabilistic random walk after 184565 steps, saw 161382 distinct states, run finished after 3004 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-23 21:04:18] [INFO ] Invariant cache hit.
[2024-05-23 21:04:18] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
Problem MAX1 is UNSAT
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-23 21:04:18] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 8/16 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 64/104 variables, 40/56 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 8/64 constraints. Problems are: Problem set: 9 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 64 constraints, problems are : Problem set: 9 solved, 7 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 9 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 7/14 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/49 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/56 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/63 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/63 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/63 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/104 variables, and 63 constraints, problems are : Problem set: 9 solved, 7 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 35/40 constraints, ReadFeed: 7/8 constraints, PredecessorRefiner: 7/16 constraints, Known Traps: 7/8 constraints]
After SMT, in 610ms problems are : Problem set: 9 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1172 ms.
Support contains 7 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 35 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 35 /40 variables (removed 5) and now considering 56/64 (removed 8) transitions.
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-05-23 21:04:20] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 21:04:20] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1316ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1317ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1320 ms. Remains : 35/40 places, 56/64 transitions.
RANDOM walk for 40010 steps (8 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 248588 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 7
Probabilistic random walk after 248588 steps, saw 212653 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-23 21:04:24] [INFO ] Invariant cache hit.
[2024-05-23 21:04:24] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 7 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 21:04:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:04:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 21:04:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-23 21:04:25] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-05-23 21:04:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 61 constraints, problems are : Problem set: 0 solved, 7 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 834 ms.
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-23 21:04:26] [INFO ] Invariant cache hit.
[2024-05-23 21:04:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 21:04:26] [INFO ] Invariant cache hit.
[2024-05-23 21:04:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 21:04:26] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-23 21:04:26] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-23 21:04:26] [INFO ] Invariant cache hit.
[2024-05-23 21:04:26] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1167 ms. Remains : 35/35 places, 56/56 transitions.
FORMULA JoinFreeModules-PT-0050-UpperBounds-02 52 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53]
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:04:27] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:04:27] [INFO ] Invariant cache hit.
[2024-05-23 21:04:27] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:27] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:27] [INFO ] Added : 35 causal constraints over 9 iterations in 40 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:04:27] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:04:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:04:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000001 steps (2 resets) in 189 ms. (5263 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 214 ms. (4651 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:04:28] [INFO ] Invariant cache hit.
[2024-05-23 21:04:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:04:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:04:28] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:04:28] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:04:28] [INFO ] Invariant cache hit.
[2024-05-23 21:04:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 21:04:28] [INFO ] Invariant cache hit.
[2024-05-23 21:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:28] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-23 21:04:28] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:28] [INFO ] Invariant cache hit.
[2024-05-23 21:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40012 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2122160 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :0 out of 2
Probabilistic random walk after 2122160 steps, saw 385847 distinct states, run finished after 3001 ms. (steps per millisecond=707 ) properties seen :0
[2024-05-23 21:04:31] [INFO ] Invariant cache hit.
[2024-05-23 21:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:04:31] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 87ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:31] [INFO ] Invariant cache hit.
[2024-05-23 21:04:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40013 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1568 ms. (steps per millisecond=1851 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1647 ms. (steps per millisecond=1764 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-03 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-03 in 7427 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:04:34] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 10018 steps (2 resets) in 8 ms. (1113 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-05-23 21:04:34] [INFO ] Invariant cache hit.
[2024-05-23 21:04:34] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 25 ms returned sat
[2024-05-23 21:04:35] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 21:04:35] [INFO ] Added : 30 causal constraints over 7 iterations in 135 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:04:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:04:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:04:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 1000013 steps (2 resets) in 213 ms. (4672 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 167 ms. (5952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-05-23 21:04:35] [INFO ] Invariant cache hit.
[2024-05-23 21:04:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:35] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:04:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:04:35] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:04:35] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:04:35] [INFO ] Invariant cache hit.
[2024-05-23 21:04:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 21:04:35] [INFO ] Invariant cache hit.
[2024-05-23 21:04:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:35] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 21:04:35] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:35] [INFO ] Invariant cache hit.
[2024-05-23 21:04:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40009 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1663208 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :0 out of 2
Probabilistic random walk after 1663208 steps, saw 379734 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :0
[2024-05-23 21:04:38] [INFO ] Invariant cache hit.
[2024-05-23 21:04:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 99ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:39] [INFO ] Invariant cache hit.
[2024-05-23 21:04:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40013 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1765 ms. (steps per millisecond=1644 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1141 ms. (steps per millisecond=2546 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-05 50 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-05 in 7226 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:04:42] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 10002 steps (2 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-05-23 21:04:42] [INFO ] Invariant cache hit.
[2024-05-23 21:04:42] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-23 21:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-23 21:04:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:04:42] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:42] [INFO ] Added : 36 causal constraints over 10 iterations in 47 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:04:42] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:04:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:04:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 1000005 steps (2 resets) in 192 ms. (5181 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 143 ms. (6944 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-05-23 21:04:42] [INFO ] Invariant cache hit.
[2024-05-23 21:04:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:04:42] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:04:42] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:04:42] [INFO ] Invariant cache hit.
[2024-05-23 21:04:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 21:04:42] [INFO ] Invariant cache hit.
[2024-05-23 21:04:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-23 21:04:42] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:42] [INFO ] Invariant cache hit.
[2024-05-23 21:04:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40013 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 2721 ms. (steps per millisecond=1066 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 2691 ms. (steps per millisecond=1079 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-07 50 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-07 in 6410 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:04:48] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10020 steps (2 resets) in 10 ms. (910 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:04:48] [INFO ] Invariant cache hit.
[2024-05-23 21:04:48] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:48] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-23 21:04:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:48] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:48] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:04:48] [INFO ] Added : 41 causal constraints over 9 iterations in 330 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:04:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:04:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000000 steps (2 resets) in 188 ms. (5291 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 179 ms. (5555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:04:49] [INFO ] Invariant cache hit.
[2024-05-23 21:04:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 21:04:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:04:49] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:04:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:04:49] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:04:49] [INFO ] Invariant cache hit.
[2024-05-23 21:04:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 21:04:49] [INFO ] Invariant cache hit.
[2024-05-23 21:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-23 21:04:49] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:49] [INFO ] Invariant cache hit.
[2024-05-23 21:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40014 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1289603 steps, run timeout after 3001 ms. (steps per millisecond=429 ) properties seen :0 out of 2
Probabilistic random walk after 1289603 steps, saw 374050 distinct states, run finished after 3001 ms. (steps per millisecond=429 ) properties seen :0
[2024-05-23 21:04:52] [INFO ] Invariant cache hit.
[2024-05-23 21:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:52] [INFO ] Invariant cache hit.
[2024-05-23 21:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40008 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1604 ms. (steps per millisecond=1809 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1213 ms. (steps per millisecond=2395 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-08 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08 in 7272 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:04:55] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10013 steps (2 resets) in 8 ms. (1112 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:04:55] [INFO ] Invariant cache hit.
[2024-05-23 21:04:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:04:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-23 21:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:04:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:04:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:04:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:55] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:04:56] [INFO ] Added : 36 causal constraints over 9 iterations in 95 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:04:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 21:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:04:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000000 steps (2 resets) in 186 ms. (5347 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 143 ms. (6944 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:04:56] [INFO ] Invariant cache hit.
[2024-05-23 21:04:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:04:56] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-23 21:04:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:04:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:04:56] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:04:56] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:04:56] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:04:56] [INFO ] Invariant cache hit.
[2024-05-23 21:04:56] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 21:04:56] [INFO ] Invariant cache hit.
[2024-05-23 21:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:04:56] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-23 21:04:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:56] [INFO ] Invariant cache hit.
[2024-05-23 21:04:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 80ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40020 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2699300 steps, run timeout after 3001 ms. (steps per millisecond=899 ) properties seen :0 out of 2
Probabilistic random walk after 2699300 steps, saw 391982 distinct states, run finished after 3001 ms. (steps per millisecond=899 ) properties seen :0
[2024-05-23 21:04:59] [INFO ] Invariant cache hit.
[2024-05-23 21:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:04:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 69ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:04:59] [INFO ] Invariant cache hit.
[2024-05-23 21:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40048 steps (8 resets) in 17 ms. (2224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1630 ms. (steps per millisecond=1780 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1286 ms. (steps per millisecond=2259 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-10 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-10 in 7018 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:05:02] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 10012 steps (2 resets) in 7 ms. (1251 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-05-23 21:05:02] [INFO ] Invariant cache hit.
[2024-05-23 21:05:02] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:05:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:05:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:05:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-23 21:05:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:05:02] [INFO ] [Nat]Added 8 Read/Feed constraints in 20 ms returned sat
[2024-05-23 21:05:02] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-23 21:05:02] [INFO ] Added : 25 causal constraints over 7 iterations in 57 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:05:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:05:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:05:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 1000001 steps (2 resets) in 236 ms. (4219 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 142 ms. (6993 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-05-23 21:05:03] [INFO ] Invariant cache hit.
[2024-05-23 21:05:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:05:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-23 21:05:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:05:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:05:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:05:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:05:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-23 21:05:03] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 21:05:03] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:05:03] [INFO ] Invariant cache hit.
[2024-05-23 21:05:03] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 21:05:03] [INFO ] Invariant cache hit.
[2024-05-23 21:05:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:05:03] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-23 21:05:03] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:05:03] [INFO ] Invariant cache hit.
[2024-05-23 21:05:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40007 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2609466 steps, run timeout after 3001 ms. (steps per millisecond=869 ) properties seen :0 out of 2
Probabilistic random walk after 2609466 steps, saw 391101 distinct states, run finished after 3001 ms. (steps per millisecond=869 ) properties seen :0
[2024-05-23 21:05:06] [INFO ] Invariant cache hit.
[2024-05-23 21:05:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 21:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 72ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2024-05-23 21:05:06] [INFO ] Invariant cache hit.
[2024-05-23 21:05:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40017 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12 ms. (3077 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1616 ms. (steps per millisecond=1796 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1281 ms. (steps per millisecond=2268 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-13 50 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-13 in 7074 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 64 rows 40 cols
[2024-05-23 21:05:09] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10000 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:05:09] [INFO ] Invariant cache hit.
[2024-05-23 21:05:09] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-23 21:05:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:05:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:05:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-23 21:05:09] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-23 21:05:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 21:05:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-23 21:05:09] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 21:05:10] [INFO ] Added : 45 causal constraints over 11 iterations in 102 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-23 21:05:10] [INFO ] Computed 1 invariants in 0 ms
[2024-05-23 21:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 5/40 places, 8/64 transitions.
[2024-05-23 21:05:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000014 steps (2 resets) in 190 ms. (5235 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-05-23 21:05:10] [INFO ] Invariant cache hit.
[2024-05-23 21:05:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:05:10] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:05:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 21:05:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 21:05:10] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-23 21:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:05:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 21:05:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 21:05:10] [INFO ] Added : 6 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 21:05:10] [INFO ] Invariant cache hit.
[2024-05-23 21:05:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 21:05:10] [INFO ] Invariant cache hit.
[2024-05-23 21:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:05:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-23 21:05:10] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 21:05:10] [INFO ] Invariant cache hit.
[2024-05-23 21:05:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40027 steps (8 resets) in 19 ms. (2001 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 2986 ms. (steps per millisecond=972 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 2394 ms. (steps per millisecond=1213 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-14 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14 in 6384 ms.
[2024-05-23 21:05:16] [INFO ] Flatten gal took : 126 ms
Total runtime 164204 ms.
ITS solved all properties within timeout

BK_STOP 1716498316534

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="JoinFreeModules-PT-0050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is JoinFreeModules-PT-0050, 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 r223-tall-171649610600045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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