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.r496-tall-171640603100293.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 ltsminxred
Input is FunctionPointer-PT-c008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 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 4.2M 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 FunctionPointer-PT-c008-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717191532004

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:38:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:38:53] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-31 21:38:53] [INFO ] Transformed 2826 places.
[2024-05-31 21:38:53] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:38:53] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1198 places in 35 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:38:53] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:38:53] [INFO ] Computed 4 invariants in 85 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 10000 steps (2 resets) in 201 ms. (49 steps per ms)
BEST_FIRST walk for 130013 steps (31 resets) in 366 ms. (354 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 1, 2, 1, 1, 1, 4, 0, 2, 2, 1] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:38:54] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-31 21:38:54] [INFO ] Invariant cache hit.
[2024-05-31 21:38:54] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-31 21:38:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:38:55] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2024-05-31 21:38:55] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-31 21:38:55] [INFO ] [Real]Added 479 Read/Feed constraints in 118 ms returned sat
[2024-05-31 21:38:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:38:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:38:56] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2024-05-31 21:38:57] [INFO ] [Nat]Added 479 Read/Feed constraints in 106 ms returned sat
[2024-05-31 21:38:57] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 712 ms.
[2024-05-31 21:38:58] [INFO ] Added : 2 causal constraints over 1 iterations in 1081 ms. Result :sat
Minimization took 592 ms.
[2024-05-31 21:38:59] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:38:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:38:59] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-31 21:39:00] [INFO ] [Real]Added 479 Read/Feed constraints in 182 ms returned sat
[2024-05-31 21:39:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 21:39:01] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2024-05-31 21:39:01] [INFO ] [Nat]Added 479 Read/Feed constraints in 108 ms returned sat
[2024-05-31 21:39:01] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 475 ms.
[2024-05-31 21:39:03] [INFO ] Deduced a trap composed of 142 places in 1214 ms of which 87 ms to minimize.
[2024-05-31 21:39:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1444 ms
[2024-05-31 21:39:03] [INFO ] Added : 2 causal constraints over 1 iterations in 2341 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 21:39:04] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:04] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:05] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-05-31 21:39:05] [INFO ] [Real]Added 479 Read/Feed constraints in 156 ms returned sat
[2024-05-31 21:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:05] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:06] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2024-05-31 21:39:06] [INFO ] [Nat]Added 479 Read/Feed constraints in 266 ms returned sat
[2024-05-31 21:39:07] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 406 ms.
[2024-05-31 21:39:07] [INFO ] Added : 1 causal constraints over 1 iterations in 737 ms. Result :sat
Minimization took 592 ms.
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:08] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2024-05-31 21:39:09] [INFO ] [Real]Added 479 Read/Feed constraints in 169 ms returned sat
[2024-05-31 21:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:39:10] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2024-05-31 21:39:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 135 ms returned sat
[2024-05-31 21:39:11] [INFO ] Deduced a trap composed of 147 places in 1158 ms of which 12 ms to minimize.
[2024-05-31 21:39:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1359 ms
[2024-05-31 21:39:12] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 498 ms.
[2024-05-31 21:39:12] [INFO ] Added : 2 causal constraints over 1 iterations in 825 ms. Result :sat
Minimization took 581 ms.
[2024-05-31 21:39:13] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:14] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2024-05-31 21:39:14] [INFO ] [Real]Added 479 Read/Feed constraints in 167 ms returned sat
[2024-05-31 21:39:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:39:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:15] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-05-31 21:39:15] [INFO ] [Nat]Added 479 Read/Feed constraints in 152 ms returned sat
[2024-05-31 21:39:16] [INFO ] Deduced a trap composed of 142 places in 1171 ms of which 12 ms to minimize.
[2024-05-31 21:39:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1351 ms
[2024-05-31 21:39:17] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 434 ms.
[2024-05-31 21:39:17] [INFO ] Added : 2 causal constraints over 1 iterations in 756 ms. Result :sat
Minimization took 581 ms.
[2024-05-31 21:39:18] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:39:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:19] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-05-31 21:39:19] [INFO ] [Real]Added 479 Read/Feed constraints in 167 ms returned sat
[2024-05-31 21:39:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:39:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:20] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2024-05-31 21:39:20] [INFO ] [Nat]Added 479 Read/Feed constraints in 125 ms returned sat
[2024-05-31 21:39:21] [INFO ] Deduced a trap composed of 142 places in 1117 ms of which 11 ms to minimize.
[2024-05-31 21:39:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1325 ms
[2024-05-31 21:39:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 420 ms.
[2024-05-31 21:39:22] [INFO ] Added : 2 causal constraints over 1 iterations in 736 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 21:39:23] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:24] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-31 21:39:24] [INFO ] [Real]Added 479 Read/Feed constraints in 121 ms returned sat
[2024-05-31 21:39:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:25] [INFO ] [Nat]Absence check using state equation in 699 ms returned sat
[2024-05-31 21:39:25] [INFO ] [Nat]Added 479 Read/Feed constraints in 108 ms returned sat
[2024-05-31 21:39:25] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 452 ms.
[2024-05-31 21:39:26] [INFO ] Added : 2 causal constraints over 1 iterations in 774 ms. Result :sat
Minimization took 583 ms.
[2024-05-31 21:39:26] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:39:27] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2024-05-31 21:39:27] [INFO ] [Real]Added 479 Read/Feed constraints in 183 ms returned sat
[2024-05-31 21:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:39:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:39:28] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2024-05-31 21:39:29] [INFO ] [Nat]Added 479 Read/Feed constraints in 243 ms returned sat
[2024-05-31 21:39:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 398 ms.
[2024-05-31 21:39:29] [INFO ] Added : 1 causal constraints over 1 iterations in 726 ms. Result :sat
Minimization took 582 ms.
[2024-05-31 21:39:30] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:39:31] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2024-05-31 21:39:31] [INFO ] [Real]Added 479 Read/Feed constraints in 113 ms returned sat
[2024-05-31 21:39:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:32] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2024-05-31 21:39:32] [INFO ] [Nat]Added 479 Read/Feed constraints in 98 ms returned sat
[2024-05-31 21:39:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 404 ms.
[2024-05-31 21:39:33] [INFO ] Added : 2 causal constraints over 1 iterations in 720 ms. Result :sat
Minimization took 580 ms.
[2024-05-31 21:39:34] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:35] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2024-05-31 21:39:35] [INFO ] [Real]Added 479 Read/Feed constraints in 126 ms returned sat
[2024-05-31 21:39:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 21:39:36] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-05-31 21:39:36] [INFO ] [Nat]Added 479 Read/Feed constraints in 260 ms returned sat
[2024-05-31 21:39:37] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 465 ms.
[2024-05-31 21:39:37] [INFO ] Added : 1 causal constraints over 1 iterations in 783 ms. Result :sat
Minimization took 604 ms.
[2024-05-31 21:39:38] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:39:38] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-05-31 21:39:39] [INFO ] [Real]Added 479 Read/Feed constraints in 154 ms returned sat
[2024-05-31 21:39:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:40] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-05-31 21:39:40] [INFO ] [Nat]Added 479 Read/Feed constraints in 162 ms returned sat
[2024-05-31 21:39:41] [INFO ] Deduced a trap composed of 134 places in 1130 ms of which 11 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 147 places in 1124 ms of which 11 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2525 ms
[2024-05-31 21:39:43] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 456 ms.
[2024-05-31 21:39:43] [INFO ] Added : 2 causal constraints over 1 iterations in 771 ms. Result :sat
Minimization took 577 ms.
[2024-05-31 21:39:44] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:39:45] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2024-05-31 21:39:45] [INFO ] [Real]Added 479 Read/Feed constraints in 153 ms returned sat
[2024-05-31 21:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:39:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:46] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2024-05-31 21:39:46] [INFO ] [Nat]Added 479 Read/Feed constraints in 136 ms returned sat
[2024-05-31 21:39:47] [INFO ] Deduced a trap composed of 147 places in 1139 ms of which 10 ms to minimize.
[2024-05-31 21:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1325 ms
[2024-05-31 21:39:48] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 406 ms.
[2024-05-31 21:39:48] [INFO ] Added : 2 causal constraints over 1 iterations in 743 ms. Result :sat
Minimization took 581 ms.
[2024-05-31 21:39:49] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:39:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:39:50] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2024-05-31 21:39:50] [INFO ] [Real]Added 479 Read/Feed constraints in 159 ms returned sat
[2024-05-31 21:39:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 18 ms returned sat
[2024-05-31 21:39:50] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:39:51] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2024-05-31 21:39:51] [INFO ] [Nat]Added 479 Read/Feed constraints in 111 ms returned sat
[2024-05-31 21:39:51] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 397 ms.
[2024-05-31 21:39:52] [INFO ] Added : 2 causal constraints over 1 iterations in 711 ms. Result :sat
Minimization took 579 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 1, 2, 1, 1, 1, 4, 0, 2, 2, 1] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 1, 2, 1, 1, 1, 4, 0, 2, 2, 1] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 13 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.12 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 676 place count 1125 transition count 3340
Iterating global reduction 1 with 297 rules applied. Total rules applied 973 place count 1125 transition count 3340
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Iterating post reduction 1 with 382 rules applied. Total rules applied 1355 place count 1125 transition count 2958
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1509 place count 971 transition count 2650
Iterating global reduction 2 with 154 rules applied. Total rules applied 1663 place count 971 transition count 2650
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 1739 place count 971 transition count 2574
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1753 place count 957 transition count 2546
Iterating global reduction 3 with 14 rules applied. Total rules applied 1767 place count 957 transition count 2546
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1780 place count 944 transition count 2520
Iterating global reduction 3 with 13 rules applied. Total rules applied 1793 place count 944 transition count 2520
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1806 place count 931 transition count 2494
Iterating global reduction 3 with 13 rules applied. Total rules applied 1819 place count 931 transition count 2494
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1832 place count 918 transition count 2468
Iterating global reduction 3 with 13 rules applied. Total rules applied 1845 place count 918 transition count 2468
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1858 place count 905 transition count 2442
Iterating global reduction 3 with 13 rules applied. Total rules applied 1871 place count 905 transition count 2442
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1884 place count 892 transition count 2416
Iterating global reduction 3 with 13 rules applied. Total rules applied 1897 place count 892 transition count 2416
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1908 place count 881 transition count 2394
Iterating global reduction 3 with 11 rules applied. Total rules applied 1919 place count 881 transition count 2394
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1967 place count 833 transition count 2212
Iterating global reduction 3 with 48 rules applied. Total rules applied 2015 place count 833 transition count 2212
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2068 place count 780 transition count 2000
Iterating global reduction 3 with 53 rules applied. Total rules applied 2121 place count 780 transition count 2000
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2174 place count 727 transition count 1874
Iterating global reduction 3 with 53 rules applied. Total rules applied 2227 place count 727 transition count 1874
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2280 place count 674 transition count 1768
Iterating global reduction 3 with 53 rules applied. Total rules applied 2333 place count 674 transition count 1768
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2386 place count 621 transition count 1662
Iterating global reduction 3 with 53 rules applied. Total rules applied 2439 place count 621 transition count 1662
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2492 place count 568 transition count 1556
Iterating global reduction 3 with 53 rules applied. Total rules applied 2545 place count 568 transition count 1556
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2598 place count 515 transition count 1450
Iterating global reduction 3 with 53 rules applied. Total rules applied 2651 place count 515 transition count 1450
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2661 place count 505 transition count 1430
Iterating global reduction 3 with 10 rules applied. Total rules applied 2671 place count 505 transition count 1430
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 2693 place count 505 transition count 1408
Applied a total of 2693 rules in 1215 ms. Remains 505 /1628 variables (removed 1123) and now considering 1408/5962 (removed 4554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1232 ms. Remains : 505/1628 places, 1408/5962 transitions.
[2024-05-31 21:39:54] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :[2, 2, 0, 1, 2, 4, 0, 2, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 2, 1, 1, 2, 4, 1, 2, 4, 0, 2, 2, 1] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:39:54] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:39:54] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 1, 1, 2, 4, 1, 2, 4, 0, 2, 2, 1] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2571 ms. (388 steps per ms)
BEST_FIRST walk for 13000012 steps (26 resets) in 9746 ms. (1333 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 5, 1, 1, 87, 101, 3, 204, 6, 1, 2, 2, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:40:06] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:40:06] [INFO ] Invariant cache hit.
[2024-05-31 21:40:06] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:07] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:40:07] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:40:07] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:07] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:40:07] [INFO ] [Nat]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:40:07] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 82 ms.
[2024-05-31 21:40:07] [INFO ] Added : 2 causal constraints over 1 iterations in 189 ms. Result :sat
Minimization took 464 ms.
[2024-05-31 21:40:08] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:08] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:40:08] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:40:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:08] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:40:08] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:40:08] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:40:08] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 459 ms.
[2024-05-31 21:40:09] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:09] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:40:09] [INFO ] [Real]Added 106 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:40:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:40:09] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:40:10] [INFO ] [Nat]Added 106 Read/Feed constraints in 86 ms returned sat
[2024-05-31 21:40:10] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-31 21:40:10] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 468 ms.
[2024-05-31 21:40:10] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:10] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-31 21:40:11] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:40:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:11] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-31 21:40:11] [INFO ] [Nat]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:40:11] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 76 ms.
[2024-05-31 21:40:11] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 473 ms.
[2024-05-31 21:40:12] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:40:12] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:40:12] [INFO ] [Real]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:12] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:40:12] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:40:12] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:40:12] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 456 ms.
[2024-05-31 21:40:13] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:13] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:40:13] [INFO ] [Real]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:13] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:40:13] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:40:13] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:40:14] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 461 ms.
[2024-05-31 21:40:14] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:14] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:40:14] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:40:15] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:40:15] [INFO ] [Nat]Added 106 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:40:15] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-31 21:40:15] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 457 ms.
[2024-05-31 21:40:15] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:40:15] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Real]Added 106 Read/Feed constraints in 55 ms returned sat
[2024-05-31 21:40:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:40:16] [INFO ] [Nat]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:40:16] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 74 ms.
[2024-05-31 21:40:16] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 464 ms.
[2024-05-31 21:40:17] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:40:17] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:40:17] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:40:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:17] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:40:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:40:17] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-31 21:40:17] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 465 ms.
[2024-05-31 21:40:18] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:18] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:40:18] [INFO ] [Real]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:40:18] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-31 21:40:18] [INFO ] [Nat]Added 106 Read/Feed constraints in 65 ms returned sat
[2024-05-31 21:40:19] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 78 ms.
[2024-05-31 21:40:19] [INFO ] Added : 1 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 468 ms.
[2024-05-31 21:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:19] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:40:19] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:20] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:40:20] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:40:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:40:20] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 460 ms.
[2024-05-31 21:40:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:21] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-31 21:40:21] [INFO ] [Real]Added 106 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:40:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:21] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-31 21:40:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:40:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-31 21:40:21] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 464 ms.
[2024-05-31 21:40:22] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:40:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:40:22] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:40:22] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:40:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:40:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:40:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:40:22] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:40:22] [INFO ] [Nat]Added 106 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:40:22] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-31 21:40:22] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 455 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 5, 1, 1, 87, 101, 3, 204, 6, 1, 2, 2, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144, 5, 1, 6, 87, 101, 3, 204, 6, 1, 7, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 13 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 56 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 58 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-31 21:40:23] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:40:23] [INFO ] Invariant cache hit.
[2024-05-31 21:40:24] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-31 21:40:24] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:40:24] [INFO ] Invariant cache hit.
[2024-05-31 21:40:24] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:40:25] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2024-05-31 21:40:25] [INFO ] Redundant transitions in 88 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-31 21:40:25] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:40:25] [INFO ] Invariant cache hit.
[2024-05-31 21:40:25] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 35053ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 35079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37274 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-31 21:41:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 13) seen :[0, 0, 0, 1, 2, 2, 0, 3, 0, 1, 0, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[144, 5, 1, 6, 87, 101, 3, 204, 6, 1, 7, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:41:01] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:41:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[144, 5, 1, 6, 87, 101, 3, 204, 6, 1, 7, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2324 ms. (430 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 9427 ms. (1378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 7, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:41:12] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:41:12] [INFO ] Invariant cache hit.
[2024-05-31 21:41:13] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:41:13] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:41:13] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Nat]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:41:13] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-31 21:41:13] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 474 ms.
[2024-05-31 21:41:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:14] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:41:14] [INFO ] [Real]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:41:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:14] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:41:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:41:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 80 ms.
[2024-05-31 21:41:15] [INFO ] Added : 2 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 460 ms.
[2024-05-31 21:41:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:15] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:41:15] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:41:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:16] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-31 21:41:16] [INFO ] [Nat]Added 106 Read/Feed constraints in 71 ms returned sat
[2024-05-31 21:41:16] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:41:16] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 444 ms.
[2024-05-31 21:41:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:17] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-31 21:41:17] [INFO ] [Real]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:41:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:17] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-31 21:41:17] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:41:17] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:41:17] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 467 ms.
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Real]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:41:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:41:18] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:41:18] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:41:18] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 450 ms.
[2024-05-31 21:41:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:19] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:41:19] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:41:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:19] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:41:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:41:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:41:20] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 440 ms.
[2024-05-31 21:41:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:20] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:41:20] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:41:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:21] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:41:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:41:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-31 21:41:21] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 437 ms.
[2024-05-31 21:41:21] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Real]Added 106 Read/Feed constraints in 58 ms returned sat
[2024-05-31 21:41:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:41:22] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:41:22] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:41:22] [INFO ] Added : 1 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 436 ms.
[2024-05-31 21:41:23] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:23] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:41:23] [INFO ] [Real]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:41:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:23] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:41:23] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:41:23] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-31 21:41:23] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 441 ms.
[2024-05-31 21:41:24] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:24] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:41:24] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:41:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:24] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:41:24] [INFO ] [Nat]Added 106 Read/Feed constraints in 63 ms returned sat
[2024-05-31 21:41:24] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:41:25] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 442 ms.
[2024-05-31 21:41:25] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:25] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:41:25] [INFO ] [Real]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:41:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:26] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-31 21:41:26] [INFO ] [Nat]Added 106 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:41:26] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 85 ms.
[2024-05-31 21:41:26] [INFO ] Added : 2 causal constraints over 1 iterations in 189 ms. Result :sat
Minimization took 456 ms.
[2024-05-31 21:41:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:41:27] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-05-31 21:41:27] [INFO ] [Real]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:41:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:27] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-05-31 21:41:27] [INFO ] [Nat]Added 106 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:41:27] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 84 ms.
[2024-05-31 21:41:27] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 452 ms.
[2024-05-31 21:41:28] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:28] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:41:28] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:41:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:41:28] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:41:28] [INFO ] [Nat]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:41:28] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 76 ms.
[2024-05-31 21:41:28] [INFO ] Added : 2 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 571 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 7, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 13 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 55 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 54 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-31 21:41:29] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:41:29] [INFO ] Invariant cache hit.
[2024-05-31 21:41:30] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-31 21:41:30] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:41:30] [INFO ] Invariant cache hit.
[2024-05-31 21:41:30] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:41:31] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2024-05-31 21:41:31] [INFO ] Redundant transitions in 31 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-31 21:41:31] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:41:31] [INFO ] Invariant cache hit.
[2024-05-31 21:41:31] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 34705ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 34718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36751 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-31 21:42:06] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :[0, 0, 1, 0, 2, 2, 3, 3, 0, 0, 0, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:42:06] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:42:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2323 ms. (430 steps per ms)
BEST_FIRST walk for 13000013 steps (26 resets) in 9349 ms. (1390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
[2024-05-31 21:42:18] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:42:18] [INFO ] Invariant cache hit.
[2024-05-31 21:42:18] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:18] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:42:18] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:42:18] [INFO ] [Real]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:42:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:19] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-31 21:42:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:42:19] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 76 ms.
[2024-05-31 21:42:19] [INFO ] Added : 2 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 477 ms.
[2024-05-31 21:42:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:20] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:42:20] [INFO ] [Real]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:42:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:20] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:42:20] [INFO ] [Nat]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:42:20] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 72 ms.
[2024-05-31 21:42:20] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 442 ms.
[2024-05-31 21:42:21] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:21] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:42:21] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:42:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:21] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:42:21] [INFO ] [Nat]Added 106 Read/Feed constraints in 70 ms returned sat
[2024-05-31 21:42:21] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 68 ms.
[2024-05-31 21:42:21] [INFO ] Added : 1 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 446 ms.
[2024-05-31 21:42:22] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:22] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-31 21:42:22] [INFO ] [Real]Added 106 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:42:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:22] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2024-05-31 21:42:22] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:42:23] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 75 ms.
[2024-05-31 21:42:23] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 453 ms.
[2024-05-31 21:42:23] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:23] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:42:23] [INFO ] [Real]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:24] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:42:24] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:42:24] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:42:24] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 445 ms.
[2024-05-31 21:42:24] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:25] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:42:25] [INFO ] [Real]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:42:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:25] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:42:25] [INFO ] [Nat]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:42:25] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:42:25] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 439 ms.
[2024-05-31 21:42:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:26] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:42:26] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:26] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:42:26] [INFO ] [Nat]Added 106 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:42:26] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-31 21:42:26] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 449 ms.
[2024-05-31 21:42:27] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:27] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:42:27] [INFO ] [Real]Added 106 Read/Feed constraints in 54 ms returned sat
[2024-05-31 21:42:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:27] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:42:27] [INFO ] [Nat]Added 106 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:42:27] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:42:28] [INFO ] Added : 1 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 446 ms.
[2024-05-31 21:42:28] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:28] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:42:28] [INFO ] [Real]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:42:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:29] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:42:29] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:42:29] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:42:29] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 440 ms.
[2024-05-31 21:42:29] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:29] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:42:30] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:30] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:42:30] [INFO ] [Nat]Added 106 Read/Feed constraints in 65 ms returned sat
[2024-05-31 21:42:30] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-31 21:42:30] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 460 ms.
[2024-05-31 21:42:31] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Nat]Added 106 Read/Feed constraints in 51 ms returned sat
[2024-05-31 21:42:31] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 3 ms to minimize.
[2024-05-31 21:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 21:42:31] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-31 21:42:31] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 439 ms.
[2024-05-31 21:42:32] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:32] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-31 21:42:32] [INFO ] [Real]Added 106 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:42:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:42:33] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-31 21:42:33] [INFO ] [Nat]Added 106 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:42:33] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-31 21:42:33] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 442 ms.
[2024-05-31 21:42:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:33] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-31 21:42:34] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:42:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:42:34] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:42:34] [INFO ] [Nat]Added 106 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:42:34] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:42:34] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 440 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
Support contains 13 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 60 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 505/505 places, 1408/1408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 52 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
[2024-05-31 21:42:35] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:42:35] [INFO ] Invariant cache hit.
[2024-05-31 21:42:35] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-31 21:42:35] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:42:35] [INFO ] Invariant cache hit.
[2024-05-31 21:42:35] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:42:37] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
[2024-05-31 21:42:37] [INFO ] Redundant transitions in 17 ms returned []
Running 1406 sub problems to find dead transitions.
[2024-05-31 21:42:37] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:42:37] [INFO ] Invariant cache hit.
[2024-05-31 21:42:37] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/505 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/505 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 823/1328 variables, 505/507 constraints. Problems are: Problem set: 0 solved, 1406 unsolved
SMT process timed out in 34889ms, After SMT, problems are : Problem set: 0 solved, 1406 unsolved
Search for dead transitions found 0 dead transitions in 34903ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36875 ms. Remains : 505/505 places, 1408/1408 transitions.
[2024-05-31 21:43:12] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
Found an invariant !
This invariant on transitions {209=1, 374=1, 711=1, 811=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {253=1, 418=1, 627=1, 807=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :[0, 2, 0, 1, 2, 2, 0, 2, 0, 0, 0, 0, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 6, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, 8, +inf]
RANDOM walk for 40004 steps (8 resets) in 1110 ms. (36 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
[2024-05-31 21:43:12] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:43:12] [INFO ] Invariant cache hit.
[2024-05-31 21:43:12] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 381/393 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 662/1055 variables, 393/394 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 122/1177 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1177 variables, 93/507 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1177 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 130/1307 variables, 75/582 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1307 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1307 variables, 13/596 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1307 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 20/1327 variables, 16/612 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1327 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1/1328 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1328 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/1328 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 613 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 505/505 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 381/393 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 662/1055 variables, 393/394 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 122/1177 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1177 variables, 93/507 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1177 variables, 15/522 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1177 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 130/1307 variables, 75/597 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1307 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1307 variables, 13/611 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1307 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 20/1327 variables, 16/627 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1327 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 1/1328 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1328 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/1328 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 628 constraints, problems are : Problem set: 0 solved, 15 unsolved in 2695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 505/505 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 5022ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 2 properties in 50161 ms.
Support contains 12 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Applied a total of 0 rules in 65 ms. Remains 505 /505 variables (removed 0) and now considering 1408/1408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 505/505 places, 1408/1408 transitions.
RANDOM walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 176865 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 12
Probabilistic random walk after 176865 steps, saw 108470 distinct states, run finished after 3004 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-31 21:44:11] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:44:11] [INFO ] Invariant cache hit.
[2024-05-31 21:44:11] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 381/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 660/1052 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 121/1173 variables, 19/412 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1173 variables, 93/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1173 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 133/1306 variables, 76/581 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1306 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 13/595 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1306 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 21/1327 variables, 17/612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1327 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 1/1328 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1328 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/1328 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1328/1328 variables, and 613 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 505/505 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 381/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 660/1052 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 121/1173 variables, 19/412 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1173 variables, 93/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1173 variables, 12/517 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1173 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 133/1306 variables, 76/593 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1306 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1306 variables, 13/607 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 21:44:14] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1306 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1306 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 21/1327 variables, 17/625 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1327 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 1/1328 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1328 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/1328 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1328/1328 variables, and 626 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 505/505 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 4448ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 49389 ms.
Support contains 11 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 504 transition count 1406
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 504 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 503 transition count 1404
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 503 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 502 transition count 1400
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 502 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 501 transition count 1398
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 501 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 500 transition count 1396
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 500 transition count 1396
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 499 transition count 1394
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 499 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 498 transition count 1392
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 498 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 497 transition count 1390
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 497 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 496 transition count 1388
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 496 transition count 1388
Applied a total of 18 rules in 157 ms. Remains 496 /505 variables (removed 9) and now considering 1388/1408 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 496/505 places, 1388/1408 transitions.
FORMULA FunctionPointer-PT-c008-UpperBounds-14 8 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[144, 63, 1, 6, 165, 101, 3, 204, 6, 1, 8, 135] Max Struct:[+inf, +inf, 8, 8, +inf, +inf, +inf, +inf, +inf, 8, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:45:05] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:45:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:45:05] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:45:05] [INFO ] Invariant cache hit.
[2024-05-31 21:45:05] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:45:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:45:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:45:05] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:45:05] [INFO ] [Real]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:45:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:45:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:45:06] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-31 21:45:06] [INFO ] [Nat]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:45:06] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 82 ms.
[2024-05-31 21:45:06] [INFO ] Added : 2 causal constraints over 1 iterations in 182 ms. Result :sat
Minimization took 439 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1388
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 495 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 488 transition count 1368
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 488 transition count 1368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 481 transition count 1348
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 472 transition count 1322
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 472 transition count 1322
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 463 transition count 1304
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 463 transition count 1304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 454 transition count 1286
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 454 transition count 1286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 445 transition count 1266
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 445 transition count 1266
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 436 transition count 1248
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 436 transition count 1248
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 151 place count 428 transition count 1232
Iterating global reduction 2 with 8 rules applied. Total rules applied 159 place count 428 transition count 1232
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 423 transition count 1222
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 420 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 420 transition count 1216
Applied a total of 175 rules in 175 ms. Remains 420 /505 variables (removed 85) and now considering 1216/1408 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 420/505 places, 1216/1408 transitions.
[2024-05-31 21:45:07] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:45:07] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-31 21:45:07] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1990 ms. (502 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 617 ms. (1618 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[435] Max Struct:[+inf]
[2024-05-31 21:45:09] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:09] [INFO ] Invariant cache hit.
[2024-05-31 21:45:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:45:10] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:45:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:45:10] [INFO ] [Real]Added 75 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:45:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:45:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:45:10] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-31 21:45:10] [INFO ] [Nat]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 113 places in 182 ms of which 2 ms to minimize.
[2024-05-31 21:45:10] [INFO ] Deduced a trap composed of 103 places in 170 ms of which 3 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 3 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 85 places in 169 ms of which 2 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 3 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 3 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 3 ms to minimize.
[2024-05-31 21:45:11] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 2 ms to minimize.
[2024-05-31 21:45:12] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 2 ms to minimize.
[2024-05-31 21:45:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1754 ms
[2024-05-31 21:45:12] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 62 ms.
[2024-05-31 21:45:12] [INFO ] Added : 10 causal constraints over 3 iterations in 230 ms. Result :sat
Minimization took 307 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[435] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[435] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 43 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 45 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 21:45:14] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:14] [INFO ] Invariant cache hit.
[2024-05-31 21:45:14] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 21:45:14] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:14] [INFO ] Invariant cache hit.
[2024-05-31 21:45:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:45:15] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2024-05-31 21:45:15] [INFO ] Redundant transitions in 13 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 21:45:15] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:15] [INFO ] Invariant cache hit.
[2024-05-31 21:45:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 21:45:29] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34199ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35765 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-31 21:45:49] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[435] Max Struct:[+inf]
[2024-05-31 21:45:50] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[435] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 1943 ms. (514 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 611 ms. (1633 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[435] Max Struct:[+inf]
[2024-05-31 21:45:52] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:52] [INFO ] Invariant cache hit.
[2024-05-31 21:45:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:45:52] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-31 21:45:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:45:53] [INFO ] [Real]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:45:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:45:53] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-31 21:45:53] [INFO ] [Nat]Added 75 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:45:53] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 3 ms to minimize.
[2024-05-31 21:45:53] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 3 ms to minimize.
[2024-05-31 21:45:53] [INFO ] Deduced a trap composed of 87 places in 176 ms of which 3 ms to minimize.
[2024-05-31 21:45:54] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-31 21:45:54] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 2 ms to minimize.
[2024-05-31 21:45:54] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 2 ms to minimize.
[2024-05-31 21:45:54] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 3 ms to minimize.
[2024-05-31 21:45:54] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 3 ms to minimize.
[2024-05-31 21:45:55] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 3 ms to minimize.
[2024-05-31 21:45:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1824 ms
[2024-05-31 21:45:55] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 63 ms.
[2024-05-31 21:45:55] [INFO ] Added : 10 causal constraints over 3 iterations in 224 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[435] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[435] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 21:45:57] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:57] [INFO ] Invariant cache hit.
[2024-05-31 21:45:57] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-31 21:45:57] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:57] [INFO ] Invariant cache hit.
[2024-05-31 21:45:57] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:45:58] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2024-05-31 21:45:58] [INFO ] Redundant transitions in 18 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 21:45:58] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:45:58] [INFO ] Invariant cache hit.
[2024-05-31 21:45:58] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 21:46:12] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33800ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33811ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35400 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-31 21:46:32] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[435] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 616931 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 616931 steps, saw 378290 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
[2024-05-31 21:46:35] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:46:35] [INFO ] Invariant cache hit.
[2024-05-31 21:46:35] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1871 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1216/1216 transitions.
RANDOM walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 611913 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 1
Probabilistic random walk after 611913 steps, saw 375214 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
[2024-05-31 21:46:41] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:46:41] [INFO ] Invariant cache hit.
[2024-05-31 21:46:41] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1891 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 43 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 21:46:43] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:46:43] [INFO ] Invariant cache hit.
[2024-05-31 21:46:44] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-31 21:46:44] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:46:44] [INFO ] Invariant cache hit.
[2024-05-31 21:46:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:46:45] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2024-05-31 21:46:45] [INFO ] Redundant transitions in 17 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 21:46:45] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:46:45] [INFO ] Invariant cache hit.
[2024-05-31 21:46:45] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 21:46:58] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33668ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35218 ms. Remains : 420/420 places, 1216/1216 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 420 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 549 place count 410 transition count 677
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 549 place count 410 transition count 605
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 693 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 947 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1011 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1075 place count 147 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1077 place count 147 transition count 348
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 84 transition count 222
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 84 transition count 222
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1266 place count 21 transition count 96
Iterating global reduction 3 with 63 rules applied. Total rules applied 1329 place count 21 transition count 96
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1392 place count 21 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1392 place count 21 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1394 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 19 transition count 31
Applied a total of 1396 rules in 70 ms. Remains 19 /420 variables (removed 401) and now considering 31/1216 (removed 1185) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 21:47:19] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:47:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:47:19] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:47:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:47:19] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:47:19] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:47:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:47:19] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:47:19] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:47:19] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:47:19] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[435] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-00 in 133597 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:47:19] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:47:19] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:47:19] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:47:19] [INFO ] Invariant cache hit.
[2024-05-31 21:47:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:47:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:47:19] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2024-05-31 21:47:19] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:47:19] [INFO ] [Real]Added 106 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:47:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:47:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:47:19] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:47:19] [INFO ] [Nat]Added 106 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:47:19] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 84 ms.
[2024-05-31 21:47:20] [INFO ] Added : 2 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 452 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 495 transition count 1382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 488 transition count 1366
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 488 transition count 1366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 481 transition count 1348
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 472 transition count 1322
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 472 transition count 1322
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 463 transition count 1304
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 463 transition count 1304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 454 transition count 1286
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 454 transition count 1286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 445 transition count 1266
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 445 transition count 1266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 133 place count 437 transition count 1250
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 437 transition count 1250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 430 transition count 1236
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 430 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 425 transition count 1226
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 422 transition count 1220
Applied a total of 171 rules in 182 ms. Remains 422 /505 variables (removed 83) and now considering 1220/1408 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 422/505 places, 1220/1408 transitions.
[2024-05-31 21:47:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:47:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 21:47:20] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2064 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 630 ms. (1584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:47:23] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:47:23] [INFO ] Invariant cache hit.
[2024-05-31 21:47:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:47:23] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:47:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:47:23] [INFO ] [Real]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:47:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:47:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:47:24] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:47:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:47:24] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 3 ms to minimize.
[2024-05-31 21:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-31 21:47:24] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 69 ms.
[2024-05-31 21:47:24] [INFO ] Added : 10 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 21:47:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:47:25] [INFO ] Invariant cache hit.
[2024-05-31 21:47:25] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-31 21:47:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:47:25] [INFO ] Invariant cache hit.
[2024-05-31 21:47:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:47:26] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
[2024-05-31 21:47:26] [INFO ] Redundant transitions in 12 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 21:47:26] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:47:26] [INFO ] Invariant cache hit.
[2024-05-31 21:47:26] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 21:47:39] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33783ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33793ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35366 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 21:48:00] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39159 steps (8 resets) in 30 ms. (1263 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-01 in 41526 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:48:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:48:00] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 22 ms. (434 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:[0] Max Struct:[8]
[2024-05-31 21:48:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:48:00] [INFO ] Invariant cache hit.
[2024-05-31 21:48:00] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:48:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:48:00] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:48:01] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:48:01] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:48:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:48:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:48:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:48:01] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:48:01] [INFO ] [Nat]Added 106 Read/Feed constraints in 55 ms returned sat
[2024-05-31 21:48:01] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 77 ms.
[2024-05-31 21:48:01] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 446 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[8]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 15 place count 494 transition count 1384
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 494 transition count 1384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 494 transition count 1380
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 486 transition count 1362
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 486 transition count 1362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 478 transition count 1340
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 478 transition count 1340
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 468 transition count 1312
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 468 transition count 1312
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 458 transition count 1292
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 458 transition count 1292
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 109 place count 448 transition count 1272
Iterating global reduction 2 with 10 rules applied. Total rules applied 119 place count 448 transition count 1272
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 129 place count 438 transition count 1250
Iterating global reduction 2 with 10 rules applied. Total rules applied 139 place count 438 transition count 1250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 148 place count 429 transition count 1232
Iterating global reduction 2 with 9 rules applied. Total rules applied 157 place count 429 transition count 1232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 165 place count 421 transition count 1216
Iterating global reduction 2 with 8 rules applied. Total rules applied 173 place count 421 transition count 1216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 416 transition count 1206
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 415 transition count 1204
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 414 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 413 transition count 1200
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 413 transition count 1200
Applied a total of 189 rules in 185 ms. Remains 413 /505 variables (removed 92) and now considering 1200/1408 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 413/505 places, 1200/1408 transitions.
[2024-05-31 21:48:02] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-31 21:48:02] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[8]
FORMULA FunctionPointer-PT-c008-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 2018 ms. (495 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-02 in 3573 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:48:04] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:48:04] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 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:[0] Max Struct:[8]
[2024-05-31 21:48:04] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:48:04] [INFO ] Invariant cache hit.
[2024-05-31 21:48:04] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:48:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:48:04] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-05-31 21:48:04] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:48:04] [INFO ] [Real]Added 106 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:48:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:48:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:48:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:48:04] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-31 21:48:04] [INFO ] [Nat]Added 106 Read/Feed constraints in 73 ms returned sat
[2024-05-31 21:48:05] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 71 ms.
[2024-05-31 21:48:05] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[8]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 15 place count 494 transition count 1384
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 494 transition count 1384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 494 transition count 1380
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 486 transition count 1362
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 486 transition count 1362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 478 transition count 1340
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 478 transition count 1340
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 468 transition count 1312
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 468 transition count 1312
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 458 transition count 1292
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 458 transition count 1292
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 109 place count 448 transition count 1272
Iterating global reduction 2 with 10 rules applied. Total rules applied 119 place count 448 transition count 1272
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 129 place count 438 transition count 1250
Iterating global reduction 2 with 10 rules applied. Total rules applied 139 place count 438 transition count 1250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 148 place count 429 transition count 1232
Iterating global reduction 2 with 9 rules applied. Total rules applied 157 place count 429 transition count 1232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 165 place count 421 transition count 1216
Iterating global reduction 2 with 8 rules applied. Total rules applied 173 place count 421 transition count 1216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 416 transition count 1206
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 415 transition count 1204
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 414 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 413 transition count 1200
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 413 transition count 1200
Applied a total of 189 rules in 173 ms. Remains 413 /505 variables (removed 92) and now considering 1200/1408 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 413/505 places, 1200/1408 transitions.
[2024-05-31 21:48:05] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-31 21:48:05] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[8]
RANDOM walk for 1000001 steps (2 resets) in 2044 ms. (488 steps per ms)
FORMULA FunctionPointer-PT-c008-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 608 ms. (1642 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-03 in 4288 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:48:08] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:48:08] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10006 steps (2 resets) in 27 ms. (357 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:[4] Max Struct:[+inf]
[2024-05-31 21:48:08] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:48:08] [INFO ] Invariant cache hit.
[2024-05-31 21:48:08] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:48:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:48:08] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:48:08] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:48:08] [INFO ] [Real]Added 106 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:48:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:48:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:48:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:48:09] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:48:09] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:48:09] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 76 ms.
[2024-05-31 21:48:09] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 495 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 488 transition count 1368
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 488 transition count 1368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 44 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 481 transition count 1348
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 473 transition count 1328
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 473 transition count 1328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 465 transition count 1312
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 465 transition count 1312
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 457 transition count 1296
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 457 transition count 1296
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 108 place count 448 transition count 1274
Iterating global reduction 2 with 9 rules applied. Total rules applied 117 place count 448 transition count 1274
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 125 place count 440 transition count 1258
Iterating global reduction 2 with 8 rules applied. Total rules applied 133 place count 440 transition count 1258
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 140 place count 433 transition count 1244
Iterating global reduction 2 with 7 rules applied. Total rules applied 147 place count 433 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 429 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 157 place count 427 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 425 transition count 1228
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 425 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 423 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 423 transition count 1224
Applied a total of 167 rules in 172 ms. Remains 423 /505 variables (removed 82) and now considering 1224/1408 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 423/505 places, 1224/1408 transitions.
[2024-05-31 21:48:10] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-31 21:48:10] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-31 21:48:10] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2119 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 654 ms. (1526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[212] Max Struct:[+inf]
[2024-05-31 21:48:13] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:13] [INFO ] Invariant cache hit.
[2024-05-31 21:48:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:48:13] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 21:48:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:48:13] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:48:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:48:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 21:48:13] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-31 21:48:13] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:48:13] [INFO ] Deduced a trap composed of 120 places in 184 ms of which 3 ms to minimize.
[2024-05-31 21:48:13] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 3 ms to minimize.
[2024-05-31 21:48:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 416 ms
[2024-05-31 21:48:14] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 63 ms.
[2024-05-31 21:48:14] [INFO ] Added : 29 causal constraints over 7 iterations in 348 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[212] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[212] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:48:15] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:15] [INFO ] Invariant cache hit.
[2024-05-31 21:48:16] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 21:48:16] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:16] [INFO ] Invariant cache hit.
[2024-05-31 21:48:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:48:17] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-05-31 21:48:17] [INFO ] Redundant transitions in 16 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:48:17] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:17] [INFO ] Invariant cache hit.
[2024-05-31 21:48:17] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:48:31] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 4 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34099ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35778 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 21:48:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[212] Max Struct:[+inf]
[2024-05-31 21:48:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[212] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2091 ms. (478 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 701 ms. (1424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[243] Max Struct:[+inf]
[2024-05-31 21:48:54] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:54] [INFO ] Invariant cache hit.
[2024-05-31 21:48:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:48:54] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:48:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:48:55] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:48:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:48:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:48:55] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-31 21:48:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:48:55] [INFO ] Deduced a trap composed of 120 places in 188 ms of which 3 ms to minimize.
[2024-05-31 21:48:55] [INFO ] Deduced a trap composed of 120 places in 179 ms of which 2 ms to minimize.
[2024-05-31 21:48:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2024-05-31 21:48:55] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 68 ms.
[2024-05-31 21:48:56] [INFO ] Added : 29 causal constraints over 7 iterations in 354 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[243] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[243] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 52 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:48:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:57] [INFO ] Invariant cache hit.
[2024-05-31 21:48:58] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-31 21:48:58] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:58] [INFO ] Invariant cache hit.
[2024-05-31 21:48:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:48:59] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-05-31 21:48:59] [INFO ] Redundant transitions in 16 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:48:59] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:48:59] [INFO ] Invariant cache hit.
[2024-05-31 21:48:59] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:49:12] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 33755ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 33765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35445 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 21:49:33] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[243] Max Struct:[+inf]
[2024-05-31 21:49:33] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:49:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[243] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1943 ms. (514 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 611 ms. (1633 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[243] Max Struct:[+inf]
[2024-05-31 21:49:36] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:49:36] [INFO ] Invariant cache hit.
[2024-05-31 21:49:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:49:36] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:49:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:49:36] [INFO ] [Real]Added 75 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:49:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:49:36] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:49:36] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:49:36] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 3 ms to minimize.
[2024-05-31 21:49:37] [INFO ] Deduced a trap composed of 120 places in 185 ms of which 3 ms to minimize.
[2024-05-31 21:49:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2024-05-31 21:49:37] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 58 ms.
[2024-05-31 21:49:37] [INFO ] Added : 29 causal constraints over 7 iterations in 347 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[243] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[243] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:49:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:49:39] [INFO ] Invariant cache hit.
[2024-05-31 21:49:39] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 21:49:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:49:39] [INFO ] Invariant cache hit.
[2024-05-31 21:49:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:49:40] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned []
Implicit Place search using SMT with State Equation took 1577 ms to find 0 implicit places.
[2024-05-31 21:49:40] [INFO ] Redundant transitions in 16 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:49:40] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:49:40] [INFO ] Invariant cache hit.
[2024-05-31 21:49:40] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:49:53] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 33840ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 33850ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35492 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 21:50:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[243] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 578720 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 1
Probabilistic random walk after 578720 steps, saw 354862 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-31 21:50:17] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:50:17] [INFO ] Invariant cache hit.
[2024-05-31 21:50:17] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1300 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40006 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 570875 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 1
Probabilistic random walk after 570875 steps, saw 350053 distinct states, run finished after 3002 ms. (steps per millisecond=190 ) properties seen :0
[2024-05-31 21:50:22] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:50:22] [INFO ] Invariant cache hit.
[2024-05-31 21:50:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1375 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:50:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:50:25] [INFO ] Invariant cache hit.
[2024-05-31 21:50:25] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-31 21:50:25] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:50:25] [INFO ] Invariant cache hit.
[2024-05-31 21:50:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:50:26] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
[2024-05-31 21:50:26] [INFO ] Redundant transitions in 14 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:50:26] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:50:26] [INFO ] Invariant cache hit.
[2024-05-31 21:50:26] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:50:40] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34166ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35901 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 25 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 21:51:00] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:51:00] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:51:00] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:51:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:51:00] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:51:00] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:51:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:51:00] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:51:00] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:51:00] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:51:00] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 88 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[243] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-04 in 172399 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:51:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:51:00] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 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:[9] Max Struct:[+inf]
[2024-05-31 21:51:00] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:51:00] [INFO ] Invariant cache hit.
[2024-05-31 21:51:01] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:51:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:51:01] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:51:01] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:51:01] [INFO ] [Real]Added 106 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:51:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:51:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 21:51:01] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:51:01] [INFO ] [Nat]Added 106 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:51:01] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-31 21:51:01] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 495 transition count 1384
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 488 transition count 1368
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 488 transition count 1368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 44 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 481 transition count 1348
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 59 place count 473 transition count 1328
Iterating global reduction 2 with 8 rules applied. Total rules applied 67 place count 473 transition count 1328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 465 transition count 1312
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 465 transition count 1312
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 457 transition count 1296
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 457 transition count 1296
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 108 place count 448 transition count 1274
Iterating global reduction 2 with 9 rules applied. Total rules applied 117 place count 448 transition count 1274
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 125 place count 440 transition count 1258
Iterating global reduction 2 with 8 rules applied. Total rules applied 133 place count 440 transition count 1258
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 140 place count 433 transition count 1244
Iterating global reduction 2 with 7 rules applied. Total rules applied 147 place count 433 transition count 1244
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 429 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 157 place count 427 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 159 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 425 transition count 1228
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 425 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 423 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 423 transition count 1224
Applied a total of 167 rules in 178 ms. Remains 423 /505 variables (removed 82) and now considering 1224/1408 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 423/505 places, 1224/1408 transitions.
[2024-05-31 21:51:02] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[9] Max Struct:[+inf]
[2024-05-31 21:51:02] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-31 21:51:02] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1994 ms. (501 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 688 ms. (1451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[+inf]
[2024-05-31 21:51:05] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:05] [INFO ] Invariant cache hit.
[2024-05-31 21:51:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:51:05] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:51:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:51:05] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:51:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:51:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:51:05] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:51:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:51:06] [INFO ] Deduced a trap composed of 113 places in 209 ms of which 3 ms to minimize.
[2024-05-31 21:51:06] [INFO ] Deduced a trap composed of 90 places in 183 ms of which 2 ms to minimize.
[2024-05-31 21:51:06] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 3 ms to minimize.
[2024-05-31 21:51:06] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 2 ms to minimize.
[2024-05-31 21:51:06] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2024-05-31 21:51:07] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2024-05-31 21:51:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1256 ms
[2024-05-31 21:51:07] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 74 ms.
[2024-05-31 21:51:07] [INFO ] Added : 29 causal constraints over 7 iterations in 342 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 57 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:51:09] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:09] [INFO ] Invariant cache hit.
[2024-05-31 21:51:09] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 21:51:09] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:09] [INFO ] Invariant cache hit.
[2024-05-31 21:51:09] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:51:10] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-05-31 21:51:10] [INFO ] Redundant transitions in 14 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:51:10] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:10] [INFO ] Invariant cache hit.
[2024-05-31 21:51:10] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:51:24] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34220ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35929 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 21:51:44] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[201] Max Struct:[+inf]
[2024-05-31 21:51:45] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2076 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 703 ms. (1420 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[+inf]
[2024-05-31 21:51:47] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:47] [INFO ] Invariant cache hit.
[2024-05-31 21:51:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:51:48] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:51:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:51:48] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:51:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:51:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:51:48] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:51:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:51:48] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 2 ms to minimize.
[2024-05-31 21:51:48] [INFO ] Deduced a trap composed of 90 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:51:49] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 3 ms to minimize.
[2024-05-31 21:51:49] [INFO ] Deduced a trap composed of 73 places in 195 ms of which 3 ms to minimize.
[2024-05-31 21:51:49] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 2 ms to minimize.
[2024-05-31 21:51:49] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 2 ms to minimize.
[2024-05-31 21:51:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1305 ms
[2024-05-31 21:51:49] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 68 ms.
[2024-05-31 21:51:50] [INFO ] Added : 29 causal constraints over 7 iterations in 351 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:51:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:51] [INFO ] Invariant cache hit.
[2024-05-31 21:51:51] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-31 21:51:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:51] [INFO ] Invariant cache hit.
[2024-05-31 21:51:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:51:53] [INFO ] Implicit Places using invariants and state equation in 1313 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2024-05-31 21:51:53] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:51:53] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:51:53] [INFO ] Invariant cache hit.
[2024-05-31 21:51:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:52:07] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34176ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35924 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-31 21:52:27] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[201] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 585102 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 585102 steps, saw 358774 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-05-31 21:52:30] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:52:30] [INFO ] Invariant cache hit.
[2024-05-31 21:52:30] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 619ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1076 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 50 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40001 steps (8 resets) in 118 ms. (336 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
Interrupted probabilistic random walk after 578706 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 1
Probabilistic random walk after 578706 steps, saw 354854 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
[2024-05-31 21:52:35] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:52:35] [INFO ] Invariant cache hit.
[2024-05-31 21:52:35] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1061 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-31 21:52:37] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:52:37] [INFO ] Invariant cache hit.
[2024-05-31 21:52:37] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-31 21:52:37] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:52:37] [INFO ] Invariant cache hit.
[2024-05-31 21:52:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:52:39] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-31 21:52:39] [INFO ] Redundant transitions in 19 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-31 21:52:39] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-31 21:52:39] [INFO ] Invariant cache hit.
[2024-05-31 21:52:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-31 21:52:52] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34107ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35863 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 28 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 21:53:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:53:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:53:13] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:53:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:53:13] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:53:13] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:53:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:53:13] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:53:13] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:53:13] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:53:13] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 102 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[201] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-05 in 132388 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:53:13] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:53:13] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 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:[5] Max Struct:[+inf]
[2024-05-31 21:53:13] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:53:13] [INFO ] Invariant cache hit.
[2024-05-31 21:53:13] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:53:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:53:13] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-31 21:53:13] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:53:13] [INFO ] [Real]Added 106 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:53:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:53:13] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:53:13] [INFO ] [Nat]Added 106 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:53:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:53:14] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 451 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 495 transition count 1382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 488 transition count 1366
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 488 transition count 1366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 481 transition count 1348
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 472 transition count 1322
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 472 transition count 1322
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 463 transition count 1304
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 463 transition count 1304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 454 transition count 1286
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 454 transition count 1286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 445 transition count 1266
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 445 transition count 1266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 133 place count 437 transition count 1250
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 437 transition count 1250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 430 transition count 1236
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 430 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 425 transition count 1226
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 422 transition count 1220
Applied a total of 171 rules in 163 ms. Remains 422 /505 variables (removed 83) and now considering 1220/1408 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 422/505 places, 1220/1408 transitions.
[2024-05-31 21:53:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 21:53:15] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 21:53:15] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1962 ms. (509 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 21:53:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:53:17] [INFO ] Invariant cache hit.
[2024-05-31 21:53:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:53:17] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:53:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:53:17] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:53:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:53:18] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 21:53:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:53:18] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2024-05-31 21:53:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-31 21:53:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-31 21:53:18] [INFO ] Added : 10 causal constraints over 4 iterations in 241 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 21:53:18] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:53:18] [INFO ] Invariant cache hit.
[2024-05-31 21:53:19] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-31 21:53:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:53:19] [INFO ] Invariant cache hit.
[2024-05-31 21:53:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:53:20] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2024-05-31 21:53:20] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 21:53:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:53:20] [INFO ] Invariant cache hit.
[2024-05-31 21:53:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 21:53:33] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33608ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33617ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35207 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 21:53:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 590934 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 590934 steps, saw 362351 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2024-05-31 21:53:57] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:53:57] [INFO ] Invariant cache hit.
[2024-05-31 21:53:57] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 38208 steps (8 resets) in 146 ms. (259 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-06 in 44733 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:53:58] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:53:58] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 27 ms. (357 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:[1] Max Struct:[+inf]
[2024-05-31 21:53:58] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:53:58] [INFO ] Invariant cache hit.
[2024-05-31 21:53:58] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:53:58] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:53:58] [INFO ] [Real]Added 106 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:53:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:53:58] [INFO ] [Nat]Added 106 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:53:58] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 81 ms.
[2024-05-31 21:53:58] [INFO ] Added : 1 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 495 transition count 1382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 488 transition count 1366
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 488 transition count 1366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 481 transition count 1346
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 481 transition count 1346
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 472 transition count 1320
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 472 transition count 1320
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 463 transition count 1302
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 463 transition count 1302
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 454 transition count 1284
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 454 transition count 1284
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 445 transition count 1266
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 445 transition count 1266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 133 place count 437 transition count 1250
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 437 transition count 1250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 430 transition count 1236
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 430 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 159 place count 426 transition count 1228
Iterating global reduction 2 with 4 rules applied. Total rules applied 163 place count 426 transition count 1228
Applied a total of 163 rules in 144 ms. Remains 426 /505 variables (removed 79) and now considering 1228/1408 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 426/505 places, 1228/1408 transitions.
[2024-05-31 21:53:59] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
Found an invariant !
This invariant on transitions {239=1, 335=1, 534=1, 689=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 348=1, 547=1, 690=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 21:53:59] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
// Phase 1: matrix 694 rows 426 cols
[2024-05-31 21:53:59] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2146 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 658 ms. (1517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[175] Max Struct:[+inf]
[2024-05-31 21:54:02] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:02] [INFO ] Invariant cache hit.
[2024-05-31 21:54:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:54:02] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:54:02] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-31 21:54:02] [INFO ] [Real]Added 76 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:54:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:54:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:54:03] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 21:54:03] [INFO ] [Nat]Added 76 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:54:03] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:54:03] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 3 ms to minimize.
[2024-05-31 21:54:03] [INFO ] Deduced a trap composed of 88 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:54:03] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 3 ms to minimize.
[2024-05-31 21:54:04] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:54:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1029 ms
[2024-05-31 21:54:04] [INFO ] Computed and/alt/rep : 340/1258/333 causal constraints (skipped 359 transitions) in 58 ms.
[2024-05-31 21:54:04] [INFO ] Added : 33 causal constraints over 7 iterations in 339 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[175] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[175] Max Struct:[+inf]
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 42 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 426/426 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 44 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-31 21:54:05] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:05] [INFO ] Invariant cache hit.
[2024-05-31 21:54:06] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-31 21:54:06] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:06] [INFO ] Invariant cache hit.
[2024-05-31 21:54:06] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-31 21:54:07] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1538 ms to find 0 implicit places.
[2024-05-31 21:54:07] [INFO ] Redundant transitions in 16 ms returned []
Running 1226 sub problems to find dead transitions.
[2024-05-31 21:54:07] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:07] [INFO ] Invariant cache hit.
[2024-05-31 21:54:07] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
[2024-05-31 21:54:22] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 694/1120 variables, 426/430 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
SMT process timed out in 34337ms, After SMT, problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 34346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35950 ms. Remains : 426/426 places, 1228/1228 transitions.
[2024-05-31 21:54:41] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
Found an invariant !
This invariant on transitions {239=1, 335=1, 534=1, 689=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 348=1, 547=1, 690=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[175] Max Struct:[+inf]
[2024-05-31 21:54:42] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[175] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2040 ms. (489 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 645 ms. (1547 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[175] Max Struct:[+inf]
[2024-05-31 21:54:44] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:44] [INFO ] Invariant cache hit.
[2024-05-31 21:54:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:54:44] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:54:44] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-31 21:54:45] [INFO ] [Real]Added 76 Read/Feed constraints in 50 ms returned sat
[2024-05-31 21:54:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:54:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:54:45] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-31 21:54:45] [INFO ] [Nat]Added 76 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:54:45] [INFO ] Deduced a trap composed of 113 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:54:45] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 3 ms to minimize.
[2024-05-31 21:54:45] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 3 ms to minimize.
[2024-05-31 21:54:46] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 3 ms to minimize.
[2024-05-31 21:54:46] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 3 ms to minimize.
[2024-05-31 21:54:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1008 ms
[2024-05-31 21:54:46] [INFO ] Computed and/alt/rep : 340/1258/333 causal constraints (skipped 359 transitions) in 69 ms.
[2024-05-31 21:54:46] [INFO ] Added : 33 causal constraints over 7 iterations in 351 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[175] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[175] Max Struct:[+inf]
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 43 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 426/426 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 47 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-31 21:54:48] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:48] [INFO ] Invariant cache hit.
[2024-05-31 21:54:48] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-31 21:54:48] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:48] [INFO ] Invariant cache hit.
[2024-05-31 21:54:48] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-31 21:54:49] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2024-05-31 21:54:49] [INFO ] Redundant transitions in 17 ms returned []
Running 1226 sub problems to find dead transitions.
[2024-05-31 21:54:49] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:54:49] [INFO ] Invariant cache hit.
[2024-05-31 21:54:49] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
[2024-05-31 21:55:03] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (OVERLAPS) 694/1120 variables, 426/430 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
SMT process timed out in 34109ms, After SMT, problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 34122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35692 ms. Remains : 426/426 places, 1228/1228 transitions.
[2024-05-31 21:55:23] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
Found an invariant !
This invariant on transitions {239=1, 335=1, 534=1, 689=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 348=1, 547=1, 690=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[175] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 606316 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 606316 steps, saw 371782 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-05-31 21:55:26] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:55:27] [INFO ] Invariant cache hit.
[2024-05-31 21:55:27] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/353 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/363 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 604/967 variables, 338/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1029 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1029 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 74/1103 variables, 69/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1103 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/1114 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1120 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 426/426 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/353 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/363 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 604/967 variables, 338/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 74/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1029 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1103 variables, 69/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1103 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/1114 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1120 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1120 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1120 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 426/426 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 48 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 426/426 places, 1228/1228 transitions.
RANDOM walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 603878 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :0 out of 1
Probabilistic random walk after 603878 steps, saw 370286 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :0
[2024-05-31 21:55:30] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:55:30] [INFO ] Invariant cache hit.
[2024-05-31 21:55:30] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/353 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/363 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 604/967 variables, 338/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1029 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1029 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 74/1103 variables, 69/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1103 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/1114 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1120 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 426/426 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/353 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/363 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 604/967 variables, 338/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 74/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1029 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 74/1103 variables, 69/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1103 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/1114 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1120 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1120 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1120 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 506 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 426/426 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 47 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 426/426 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1228/1228 transitions.
Applied a total of 0 rules in 42 ms. Remains 426 /426 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2024-05-31 21:55:31] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:55:31] [INFO ] Invariant cache hit.
[2024-05-31 21:55:31] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 21:55:31] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:55:31] [INFO ] Invariant cache hit.
[2024-05-31 21:55:31] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-31 21:55:32] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2024-05-31 21:55:32] [INFO ] Redundant transitions in 18 ms returned []
Running 1226 sub problems to find dead transitions.
[2024-05-31 21:55:32] [INFO ] Flow matrix only has 694 transitions (discarded 534 similar events)
[2024-05-31 21:55:32] [INFO ] Invariant cache hit.
[2024-05-31 21:55:32] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
[2024-05-31 21:55:46] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 3 (OVERLAPS) 694/1120 variables, 426/430 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
SMT process timed out in 33728ms, After SMT, problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 33738ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35316 ms. Remains : 426/426 places, 1228/1228 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 534 transitions
Reduce isomorphic transitions removed 534 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 426 transition count 679
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 564 place count 411 transition count 679
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 564 place count 411 transition count 607
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 708 place count 339 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 962 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1026 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1090 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1091 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1154 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1217 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1280 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1343 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1406 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1406 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1408 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1410 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1412 place count 19 transition count 34
Applied a total of 1412 rules in 32 ms. Remains 19 /426 variables (removed 407) and now considering 34/1228 (removed 1194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 19 cols
[2024-05-31 21:56:06] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 21:56:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:56:06] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:56:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:56:06] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:56:06] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:56:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:56:06] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:56:06] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:56:06] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:56:06] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[175] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-07 in 128714 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:56:06] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:56:06] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 22 ms. (434 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:[0] Max Struct:[+inf]
[2024-05-31 21:56:06] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:56:06] [INFO ] Invariant cache hit.
[2024-05-31 21:56:06] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:56:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:56:07] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-31 21:56:07] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:56:07] [INFO ] [Real]Added 106 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:56:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:56:07] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-31 21:56:07] [INFO ] [Nat]Added 106 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:56:07] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 73 ms.
[2024-05-31 21:56:07] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 516 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 495 transition count 1382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 488 transition count 1366
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 488 transition count 1366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 481 transition count 1348
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 472 transition count 1322
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 472 transition count 1322
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 463 transition count 1304
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 463 transition count 1304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 454 transition count 1286
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 454 transition count 1286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 445 transition count 1266
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 445 transition count 1266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 133 place count 437 transition count 1250
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 437 transition count 1250
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 148 place count 430 transition count 1236
Iterating global reduction 2 with 7 rules applied. Total rules applied 155 place count 430 transition count 1236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 425 transition count 1226
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 424 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 422 transition count 1220
Applied a total of 171 rules in 166 ms. Remains 422 /505 variables (removed 83) and now considering 1220/1408 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 422/505 places, 1220/1408 transitions.
[2024-05-31 21:56:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:56:08] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 21:56:08] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1959 ms. (510 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 600 ms. (1663 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 21:56:11] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:11] [INFO ] Invariant cache hit.
[2024-05-31 21:56:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:56:11] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-31 21:56:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:56:11] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:56:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:56:11] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-31 21:56:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 3 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 109 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 3 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1713 ms
[2024-05-31 21:56:13] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 59 ms.
[2024-05-31 21:56:13] [INFO ] Added : 14 causal constraints over 5 iterations in 277 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 21:56:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:14] [INFO ] Invariant cache hit.
[2024-05-31 21:56:14] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-31 21:56:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:14] [INFO ] Invariant cache hit.
[2024-05-31 21:56:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:56:15] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2024-05-31 21:56:15] [INFO ] Redundant transitions in 19 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 21:56:15] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:15] [INFO ] Invariant cache hit.
[2024-05-31 21:56:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 21:56:28] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33535ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35086 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 21:56:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 21:56:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1994 ms. (501 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 600 ms. (1663 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 21:56:51] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:51] [INFO ] Invariant cache hit.
[2024-05-31 21:56:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:56:52] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:56:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:56:52] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:56:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:56:52] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:56:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:56:52] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:56:52] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:56:53] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 3 ms to minimize.
[2024-05-31 21:56:53] [INFO ] Deduced a trap composed of 78 places in 180 ms of which 2 ms to minimize.
[2024-05-31 21:56:53] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 3 ms to minimize.
[2024-05-31 21:56:53] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 3 ms to minimize.
[2024-05-31 21:56:53] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 2 ms to minimize.
[2024-05-31 21:56:54] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 3 ms to minimize.
[2024-05-31 21:56:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1638 ms
[2024-05-31 21:56:54] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 55 ms.
[2024-05-31 21:56:54] [INFO ] Added : 14 causal constraints over 5 iterations in 286 ms. Result :sat
Minimization took 250 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 21:56:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:54] [INFO ] Invariant cache hit.
[2024-05-31 21:56:55] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-31 21:56:55] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:55] [INFO ] Invariant cache hit.
[2024-05-31 21:56:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:56:56] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
[2024-05-31 21:56:56] [INFO ] Redundant transitions in 16 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 21:56:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:56:56] [INFO ] Invariant cache hit.
[2024-05-31 21:56:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 21:57:10] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34293ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35821 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 21:57:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 98 ms. (404 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
Interrupted probabilistic random walk after 607509 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 607509 steps, saw 372514 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2024-05-31 21:57:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:57:33] [INFO ] Invariant cache hit.
[2024-05-31 21:57:33] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 586233 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 586233 steps, saw 359468 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-31 21:57:37] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:57:37] [INFO ] Invariant cache hit.
[2024-05-31 21:57:37] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 57 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 21:57:38] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:57:38] [INFO ] Invariant cache hit.
[2024-05-31 21:57:38] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-31 21:57:38] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:57:38] [INFO ] Invariant cache hit.
[2024-05-31 21:57:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:57:39] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2024-05-31 21:57:39] [INFO ] Redundant transitions in 14 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 21:57:39] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:57:39] [INFO ] Invariant cache hit.
[2024-05-31 21:57:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 21:57:53] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 timeout
0.0)
(s387 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34111ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35687 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 24 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-31 21:58:14] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:58:14] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:58:14] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:58:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:58:14] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:58:14] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:58:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:58:14] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:58:14] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:58:14] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:58:14] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-10 in 127391 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:58:14] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:58:14] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10002 steps (2 resets) in 26 ms. (370 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:[2] Max Struct:[8]
[2024-05-31 21:58:14] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:58:14] [INFO ] Invariant cache hit.
[2024-05-31 21:58:14] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:58:14] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:58:14] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:58:14] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:58:14] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:58:14] [INFO ] [Nat]Added 106 Read/Feed constraints in 62 ms returned sat
[2024-05-31 21:58:14] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 69 ms.
[2024-05-31 21:58:15] [INFO ] Added : 1 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 453 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[8]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 15 place count 494 transition count 1384
Iterating global reduction 1 with 8 rules applied. Total rules applied 23 place count 494 transition count 1384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 494 transition count 1380
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 35 place count 486 transition count 1362
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 486 transition count 1362
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 478 transition count 1340
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 478 transition count 1340
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 69 place count 468 transition count 1312
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 468 transition count 1312
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 89 place count 458 transition count 1292
Iterating global reduction 2 with 10 rules applied. Total rules applied 99 place count 458 transition count 1292
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 109 place count 448 transition count 1272
Iterating global reduction 2 with 10 rules applied. Total rules applied 119 place count 448 transition count 1272
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 129 place count 438 transition count 1250
Iterating global reduction 2 with 10 rules applied. Total rules applied 139 place count 438 transition count 1250
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 148 place count 429 transition count 1232
Iterating global reduction 2 with 9 rules applied. Total rules applied 157 place count 429 transition count 1232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 165 place count 421 transition count 1216
Iterating global reduction 2 with 8 rules applied. Total rules applied 173 place count 421 transition count 1216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 178 place count 416 transition count 1206
Iterating global reduction 2 with 5 rules applied. Total rules applied 183 place count 416 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 184 place count 415 transition count 1204
Iterating global reduction 2 with 1 rules applied. Total rules applied 185 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 186 place count 414 transition count 1202
Iterating global reduction 2 with 1 rules applied. Total rules applied 187 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 413 transition count 1200
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 413 transition count 1200
Applied a total of 189 rules in 156 ms. Remains 413 /505 variables (removed 92) and now considering 1200/1408 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 413/505 places, 1200/1408 transitions.
[2024-05-31 21:58:15] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-31 21:58:15] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[8]
FORMULA FunctionPointer-PT-c008-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1859 ms. (537 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-12 in 3366 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:58:17] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:58:17] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 23 ms. (416 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:[0] Max Struct:[+inf]
[2024-05-31 21:58:17] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:58:17] [INFO ] Invariant cache hit.
[2024-05-31 21:58:17] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:58:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:58:17] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:58:17] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:58:17] [INFO ] [Real]Added 106 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:58:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:58:18] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:58:18] [INFO ] [Nat]Added 106 Read/Feed constraints in 50 ms returned sat
[2024-05-31 21:58:18] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 70 ms.
[2024-05-31 21:58:18] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 463 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 497 transition count 1390
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 497 transition count 1390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 497 transition count 1386
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 489 transition count 1368
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 489 transition count 1368
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 481 transition count 1346
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 481 transition count 1346
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 471 transition count 1318
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 471 transition count 1318
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 461 transition count 1298
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 461 transition count 1298
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 451 transition count 1278
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 451 transition count 1278
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 441 transition count 1256
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 441 transition count 1256
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 141 place count 432 transition count 1238
Iterating global reduction 1 with 9 rules applied. Total rules applied 150 place count 432 transition count 1238
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 158 place count 424 transition count 1222
Iterating global reduction 1 with 8 rules applied. Total rules applied 166 place count 424 transition count 1222
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 171 place count 419 transition count 1212
Iterating global reduction 1 with 5 rules applied. Total rules applied 176 place count 419 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 418 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 179 place count 417 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 180 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 181 place count 416 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 182 place count 416 transition count 1206
Applied a total of 182 rules in 163 ms. Remains 416 /505 variables (removed 89) and now considering 1206/1408 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 416/505 places, 1206/1408 transitions.
[2024-05-31 21:58:19] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 21:58:19] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-31 21:58:19] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1936 ms. (516 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 621 ms. (1607 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 21:58:21] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:58:21] [INFO ] Invariant cache hit.
[2024-05-31 21:58:21] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:58:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:58:22] [INFO ] [Real]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:58:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:58:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:58:22] [INFO ] [Nat]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:58:22] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 59 ms.
[2024-05-31 21:58:22] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 2 ms to minimize.
[2024-05-31 21:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2024-05-31 21:58:22] [INFO ] Added : 5 causal constraints over 2 iterations in 416 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-31 21:58:23] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:58:23] [INFO ] Invariant cache hit.
[2024-05-31 21:58:23] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-31 21:58:23] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:58:23] [INFO ] Invariant cache hit.
[2024-05-31 21:58:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:58:24] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2024-05-31 21:58:24] [INFO ] Redundant transitions in 16 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-31 21:58:24] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:58:24] [INFO ] Invariant cache hit.
[2024-05-31 21:58:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34023ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35588 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-31 21:58:58] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-31 21:58:59] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:58:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1892 ms. (528 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 601 ms. (1661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2024-05-31 21:59:01] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:59:01] [INFO ] Invariant cache hit.
[2024-05-31 21:59:01] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:59:01] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-31 21:59:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:59:01] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:59:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:59:02] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-31 21:59:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:59:02] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 2 ms to minimize.
[2024-05-31 21:59:02] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
[2024-05-31 21:59:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2024-05-31 21:59:02] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 59 ms.
[2024-05-31 21:59:02] [INFO ] Added : 4 causal constraints over 1 iterations in 139 ms. Result :sat
Minimization took 387 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-31 21:59:03] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:59:03] [INFO ] Invariant cache hit.
[2024-05-31 21:59:03] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-31 21:59:03] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:59:03] [INFO ] Invariant cache hit.
[2024-05-31 21:59:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:59:04] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2024-05-31 21:59:04] [INFO ] Redundant transitions in 18 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-31 21:59:04] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-31 21:59:04] [INFO ] Invariant cache hit.
[2024-05-31 21:59:04] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/418 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34595ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34605ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36136 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-31 21:59:39] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {220=1, 304=1, 502=1, 676=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {208=1, 292=1, 490=1, 676=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 30165 steps (6 resets) in 79 ms. (377 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[8] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-13 in 81971 ms.
Starting property specific reduction for FunctionPointer-PT-c008-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:59:39] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
// Phase 1: matrix 823 rows 505 cols
[2024-05-31 21:59:39] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 30 ms. (322 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:[0] Max Struct:[+inf]
[2024-05-31 21:59:39] [INFO ] Flow matrix only has 823 transitions (discarded 585 similar events)
[2024-05-31 21:59:39] [INFO ] Invariant cache hit.
[2024-05-31 21:59:39] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2024-05-31 21:59:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:59:39] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:59:39] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-31 21:59:39] [INFO ] [Real]Added 106 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:59:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 21:59:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:59:40] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-31 21:59:40] [INFO ] [Nat]Added 106 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:59:40] [INFO ] Computed and/alt/rep : 107/112/91 causal constraints (skipped 730 transitions) in 101 ms.
[2024-05-31 21:59:40] [INFO ] Added : 2 causal constraints over 1 iterations in 194 ms. Result :sat
Minimization took 446 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1408/1408 transitions.
Graph (complete) has 2401 edges and 505 vertex of which 502 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 502 transition count 1402
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 14 place count 495 transition count 1386
Iterating global reduction 1 with 7 rules applied. Total rules applied 21 place count 495 transition count 1386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 495 transition count 1382
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 488 transition count 1368
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 488 transition count 1368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 481 transition count 1348
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 481 transition count 1348
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 472 transition count 1322
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 472 transition count 1322
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 80 place count 463 transition count 1304
Iterating global reduction 2 with 9 rules applied. Total rules applied 89 place count 463 transition count 1304
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 98 place count 454 transition count 1286
Iterating global reduction 2 with 9 rules applied. Total rules applied 107 place count 454 transition count 1286
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 116 place count 445 transition count 1266
Iterating global reduction 2 with 9 rules applied. Total rules applied 125 place count 445 transition count 1266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 133 place count 437 transition count 1250
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 437 transition count 1250
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 149 place count 429 transition count 1234
Iterating global reduction 2 with 8 rules applied. Total rules applied 157 place count 429 transition count 1234
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 162 place count 424 transition count 1224
Iterating global reduction 2 with 5 rules applied. Total rules applied 167 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 421 transition count 1218
Applied a total of 173 rules in 165 ms. Remains 421 /505 variables (removed 84) and now considering 1218/1408 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 421/505 places, 1218/1408 transitions.
[2024-05-31 21:59:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:59:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 21:59:41] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2200 ms. (454 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 680 ms. (1468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:59:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:59:44] [INFO ] Invariant cache hit.
[2024-05-31 21:59:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:44] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:59:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:59:44] [INFO ] [Real]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:59:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:59:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:59:44] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:59:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:59:44] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 69 ms.
[2024-05-31 21:59:45] [INFO ] Added : 10 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 54 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:59:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:59:45] [INFO ] Invariant cache hit.
[2024-05-31 21:59:45] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 21:59:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:59:45] [INFO ] Invariant cache hit.
[2024-05-31 21:59:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:59:46] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
[2024-05-31 21:59:46] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:59:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:59:46] [INFO ] Invariant cache hit.
[2024-05-31 21:59:46] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 22:00:00] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33963ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33975ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35574 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 22:00:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 14272 steps (2 resets) in 15 ms. (892 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c008-UpperBounds-15 in 41694 ms.
[2024-05-31 22:00:21] [INFO ] Flatten gal took : 119 ms
[2024-05-31 22:00:21] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 22:00:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 505 places, 1408 transitions and 5758 arcs took 10 ms.
Total runtime 1288380 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-00
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-01
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-04
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-05
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-06
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-07
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-10
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-13
Could not compute solution for formula : FunctionPointer-PT-c008-UpperBounds-15

BK_STOP 1717192821858

--------------------
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
mcc2024
ub formula name FunctionPointer-PT-c008-UpperBounds-00
ub formula formula --maxsum=/tmp/1961/ub_0_
ub formula name FunctionPointer-PT-c008-UpperBounds-01
ub formula formula --maxsum=/tmp/1961/ub_1_
ub formula name FunctionPointer-PT-c008-UpperBounds-04
ub formula formula --maxsum=/tmp/1961/ub_2_
ub formula name FunctionPointer-PT-c008-UpperBounds-05
ub formula formula --maxsum=/tmp/1961/ub_3_
ub formula name FunctionPointer-PT-c008-UpperBounds-06
ub formula formula --maxsum=/tmp/1961/ub_4_
ub formula name FunctionPointer-PT-c008-UpperBounds-07
ub formula formula --maxsum=/tmp/1961/ub_5_
ub formula name FunctionPointer-PT-c008-UpperBounds-10
ub formula formula --maxsum=/tmp/1961/ub_6_
ub formula name FunctionPointer-PT-c008-UpperBounds-13
ub formula formula --maxsum=/tmp/1961/ub_7_
ub formula name FunctionPointer-PT-c008-UpperBounds-15
ub formula formula --maxsum=/tmp/1961/ub_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FunctionPointer-PT-c008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c008, 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 r496-tall-171640603100293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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