About the Execution of GreatSPN+red for BugTracking-PT-q3m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12420.168 | 334266.00 | 421086.00 | 143.10 | 0 ? 0 13 0 0 0 0 0 1 0 0 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398100381.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100381
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K 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 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716296054038
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:54:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 12:54:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:54:16] [INFO ] Load time of PNML (sax parser for PT used): 848 ms
[2024-05-21 12:54:16] [INFO ] Transformed 754 places.
[2024-05-21 12:54:16] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:54:16] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1083 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 514 places in 103 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 12:54:16] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-21 12:54:16] [INFO ] Computed 10 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
RANDOM walk for 10000 steps (4 resets) in 103 ms. (96 steps per ms)
FORMULA BugTracking-PT-q3m256-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 160 ms. (372 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:54:17] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 12:54:17] [INFO ] Invariant cache hit.
[2024-05-21 12:54:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:54:18] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-05-21 12:54:18] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 12:54:18] [INFO ] [Real]Added 255 Read/Feed constraints in 47 ms returned sat
[2024-05-21 12:54:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:54:18] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-21 12:54:19] [INFO ] [Nat]Added 255 Read/Feed constraints in 90 ms returned sat
[2024-05-21 12:54:19] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 301 ms.
[2024-05-21 12:54:19] [INFO ] Added : 2 causal constraints over 1 iterations in 610 ms. Result :sat
Minimization took 652 ms.
[2024-05-21 12:54:20] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:54:21] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2024-05-21 12:54:21] [INFO ] [Real]Added 255 Read/Feed constraints in 62 ms returned sat
[2024-05-21 12:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:54:21] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-21 12:54:21] [INFO ] [Nat]Added 255 Read/Feed constraints in 71 ms returned sat
[2024-05-21 12:54:22] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 240 ms.
[2024-05-21 12:54:22] [INFO ] Added : 2 causal constraints over 1 iterations in 625 ms. Result :sat
Minimization took 878 ms.
[2024-05-21 12:54:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:54:23] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2024-05-21 12:54:24] [INFO ] [Real]Added 255 Read/Feed constraints in 71 ms returned sat
[2024-05-21 12:54:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 12:54:24] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2024-05-21 12:54:24] [INFO ] [Nat]Added 255 Read/Feed constraints in 113 ms returned sat
[2024-05-21 12:54:25] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 19 ms to minimize.
[2024-05-21 12:54:25] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 3 ms to minimize.
[2024-05-21 12:54:26] [INFO ] Deduced a trap composed of 39 places in 347 ms of which 2 ms to minimize.
[2024-05-21 12:54:26] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 2 ms to minimize.
[2024-05-21 12:54:27] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 2 ms to minimize.
[2024-05-21 12:54:27] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 2 ms to minimize.
[2024-05-21 12:54:27] [INFO ] Deduced a trap composed of 52 places in 343 ms of which 4 ms to minimize.
[2024-05-21 12:54:28] [INFO ] Deduced a trap composed of 75 places in 275 ms of which 2 ms to minimize.
[2024-05-21 12:54:28] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 2 ms to minimize.
[2024-05-21 12:54:28] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 14 ms to minimize.
[2024-05-21 12:54:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4003 ms
[2024-05-21 12:54:29] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 180 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 12:54:29] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:54:29] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-05-21 12:54:29] [INFO ] [Real]Added 255 Read/Feed constraints in 43 ms returned sat
[2024-05-21 12:54:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 12:54:30] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-05-21 12:54:30] [INFO ] [Nat]Added 255 Read/Feed constraints in 119 ms returned sat
[2024-05-21 12:54:30] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 168 ms.
[2024-05-21 12:54:30] [INFO ] Added : 3 causal constraints over 1 iterations in 461 ms. Result :sat
Minimization took 693 ms.
[2024-05-21 12:54:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 12:54:32] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2024-05-21 12:54:32] [INFO ] [Real]Added 255 Read/Feed constraints in 57 ms returned sat
[2024-05-21 12:54:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 12:54:32] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-21 12:54:32] [INFO ] [Nat]Added 255 Read/Feed constraints in 84 ms returned sat
[2024-05-21 12:54:33] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 198 ms.
[2024-05-21 12:54:33] [INFO ] Added : 6 causal constraints over 2 iterations in 612 ms. Result :sat
Minimization took 773 ms.
[2024-05-21 12:54:34] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 12:54:34] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2024-05-21 12:54:34] [INFO ] [Real]Added 255 Read/Feed constraints in 41 ms returned sat
[2024-05-21 12:54:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 12:54:35] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-21 12:54:35] [INFO ] [Nat]Added 255 Read/Feed constraints in 107 ms returned sat
[2024-05-21 12:54:35] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 2 ms to minimize.
[2024-05-21 12:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2024-05-21 12:54:36] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 190 ms.
[2024-05-21 12:54:36] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 2 ms to minimize.
[2024-05-21 12:54:37] [INFO ] Deduced a trap composed of 11 places in 363 ms of which 2 ms to minimize.
[2024-05-21 12:54:37] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2024-05-21 12:54:37] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 1 ms to minimize.
[2024-05-21 12:54:38] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 1 ms to minimize.
[2024-05-21 12:54:38] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 2 ms to minimize.
[2024-05-21 12:54:38] [INFO ] Deduced a trap composed of 19 places in 240 ms of which 2 ms to minimize.
[2024-05-21 12:54:39] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2024-05-21 12:54:39] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 1 ms to minimize.
[2024-05-21 12:54:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2968 ms
[2024-05-21 12:54:39] [INFO ] Added : 20 causal constraints over 7 iterations in 4102 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 289 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 229/240 places, 2747/2769 transitions.
[2024-05-21 12:54:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 6) seen :[0, 1, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:54:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-21 12:54:42] [INFO ] Computed 8 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000130 steps (2 resets) in 594 ms. (1680 steps per ms)
BEST_FIRST walk for 6000004 steps (12 resets) in 12912 ms. (464 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 13, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:54:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:54:55] [INFO ] Invariant cache hit.
[2024-05-21 12:54:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:54:56] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2024-05-21 12:54:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 12:54:56] [INFO ] [Real]Added 241 Read/Feed constraints in 63 ms returned sat
[2024-05-21 12:54:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:54:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:54:56] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2024-05-21 12:54:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 121 ms returned sat
[2024-05-21 12:54:57] [INFO ] Deduced a trap composed of 7 places in 492 ms of which 2 ms to minimize.
[2024-05-21 12:54:57] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 2 ms to minimize.
[2024-05-21 12:54:58] [INFO ] Deduced a trap composed of 10 places in 402 ms of which 1 ms to minimize.
[2024-05-21 12:54:58] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 2 ms to minimize.
[2024-05-21 12:54:59] [INFO ] Deduced a trap composed of 38 places in 404 ms of which 2 ms to minimize.
[2024-05-21 12:54:59] [INFO ] Deduced a trap composed of 58 places in 345 ms of which 2 ms to minimize.
[2024-05-21 12:55:00] [INFO ] Deduced a trap composed of 48 places in 344 ms of which 5 ms to minimize.
[2024-05-21 12:55:00] [INFO ] Deduced a trap composed of 39 places in 351 ms of which 2 ms to minimize.
[2024-05-21 12:55:00] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 2 ms to minimize.
[2024-05-21 12:55:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4111 ms
[2024-05-21 12:55:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 227 ms.
[2024-05-21 12:55:01] [INFO ] Added : 10 causal constraints over 4 iterations in 967 ms. Result :sat
Minimization took 2452 ms.
[2024-05-21 12:55:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:55:05] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2024-05-21 12:55:05] [INFO ] [Real]Added 241 Read/Feed constraints in 43 ms returned sat
[2024-05-21 12:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:55:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 12:55:05] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2024-05-21 12:55:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 57 ms returned sat
[2024-05-21 12:55:06] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 172 ms.
[2024-05-21 12:55:06] [INFO ] Added : 2 causal constraints over 1 iterations in 376 ms. Result :sat
Minimization took 2193 ms.
[2024-05-21 12:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:55:09] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-05-21 12:55:09] [INFO ] [Real]Added 241 Read/Feed constraints in 56 ms returned sat
[2024-05-21 12:55:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:55:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:55:09] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-05-21 12:55:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 189 ms returned sat
[2024-05-21 12:55:10] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 2 ms to minimize.
[2024-05-21 12:55:10] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-05-21 12:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 611 ms
[2024-05-21 12:55:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 186 ms.
[2024-05-21 12:55:11] [INFO ] Deduced a trap composed of 51 places in 318 ms of which 2 ms to minimize.
[2024-05-21 12:55:11] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 3 ms to minimize.
[2024-05-21 12:55:12] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 2 ms to minimize.
[2024-05-21 12:55:12] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 5 ms to minimize.
[2024-05-21 12:55:12] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 2 ms to minimize.
[2024-05-21 12:55:13] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 2 ms to minimize.
[2024-05-21 12:55:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2308 ms
[2024-05-21 12:55:13] [INFO ] Added : 7 causal constraints over 3 iterations in 3054 ms. Result :sat
Minimization took 2499 ms.
[2024-05-21 12:55:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:55:16] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-21 12:55:16] [INFO ] [Real]Added 241 Read/Feed constraints in 38 ms returned sat
[2024-05-21 12:55:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:55:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:55:17] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-21 12:55:17] [INFO ] [Nat]Added 241 Read/Feed constraints in 102 ms returned sat
[2024-05-21 12:55:17] [INFO ] Deduced a trap composed of 66 places in 461 ms of which 2 ms to minimize.
[2024-05-21 12:55:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2024-05-21 12:55:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 194 ms.
[2024-05-21 12:55:18] [INFO ] Added : 3 causal constraints over 1 iterations in 504 ms. Result :sat
Minimization took 2436 ms.
[2024-05-21 12:55:21] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 12:55:21] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2024-05-21 12:55:21] [INFO ] [Real]Added 241 Read/Feed constraints in 40 ms returned sat
[2024-05-21 12:55:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:55:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:55:22] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2024-05-21 12:55:22] [INFO ] [Nat]Added 241 Read/Feed constraints in 49 ms returned sat
[2024-05-21 12:55:22] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 160 ms.
[2024-05-21 12:55:22] [INFO ] Added : 1 causal constraints over 1 iterations in 458 ms. Result :sat
Minimization took 2264 ms.
[2024-05-21 12:55:25] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 12:55:25] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-05-21 12:55:25] [INFO ] [Real]Added 241 Read/Feed constraints in 42 ms returned sat
[2024-05-21 12:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:55:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 12:55:26] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2024-05-21 12:55:26] [INFO ] [Nat]Added 241 Read/Feed constraints in 120 ms returned sat
[2024-05-21 12:55:26] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 1 ms to minimize.
[2024-05-21 12:55:26] [INFO ] Deduced a trap composed of 60 places in 307 ms of which 2 ms to minimize.
[2024-05-21 12:55:27] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 2 ms to minimize.
[2024-05-21 12:55:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1210 ms
[2024-05-21 12:55:27] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 178 ms.
[2024-05-21 12:55:27] [INFO ] Added : 6 causal constraints over 2 iterations in 601 ms. Result :sat
Minimization took 2388 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 13, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 13, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 43 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-21 12:55:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:55:31] [INFO ] Invariant cache hit.
[2024-05-21 12:55:31] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-21 12:55:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:55:31] [INFO ] Invariant cache hit.
[2024-05-21 12:55:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 12:55:33] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2024-05-21 12:55:33] [INFO ] Redundant transitions in 214 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-05-21 12:55:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 12:55:34] [INFO ] Invariant cache hit.
[2024-05-21 12:55:34] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-05-21 12:56:22] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-21 12:56:25] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-05-21 12:56:26] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
[2024-05-21 12:56:26] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
[2024-05-21 12:56:27] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-05-21 12:56:27] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
[2024-05-21 12:56:27] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-05-21 12:56:27] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
[2024-05-21 12:56:32] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
Problem TDEAD2683 is UNSAT
Problem TDEAD2695 is UNSAT
[2024-05-21 12:56:33] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 10/18 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 18 constraints, problems are : Problem set: 236 solved, 2510 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 236 solved, 2510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 7/7 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 10/17 constraints. Problems are: Problem set: 236 solved, 2510 unsolved
[2024-05-21 12:56:44] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2024-05-21 12:56:45] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 2/19 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/19 constraints. Problems are: Problem set: 506 solved, 2240 unsolved
SMT process timed out in 91026ms, After SMT, problems are : Problem set: 506 solved, 2240 unsolved
Search for dead transitions found 506 dead transitions in 91096ms
Found 506 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 506 transitions
Dead transitions reduction (with SMT) removed 506 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2241/2747 transitions.
Graph (complete) has 2782 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 650 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 1591
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 45 place count 177 transition count 1320
Reduce places removed 10 places and 132 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 55 place count 167 transition count 1188
Reduce places removed 8 places and 89 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 63 place count 159 transition count 1099
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 158 transition count 1082
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 75 place count 147 transition count 1024
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 15 places and 231 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 101 place count 132 transition count 793
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 108 place count 125 transition count 730
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 115 place count 125 transition count 730
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 115 rules in 50 ms. Remains 125 /229 variables (removed 104) and now considering 730/2241 (removed 1511) transitions.
[2024-05-21 12:57:05] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
// Phase 1: matrix 668 rows 125 cols
[2024-05-21 12:57:05] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 12:57:05] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 12:57:05] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:05] [INFO ] Invariant cache hit.
[2024-05-21 12:57:05] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 12:57:05] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 125/229 places, 730/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 94435 ms. Remains : 125/229 places, 730/2747 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 12:57:05] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
Found an invariant !
This invariant on transitions {4=1, 367=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 367=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :[1, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 13, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-05-21 12:57:06] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
// Phase 1: matrix 668 rows 123 cols
[2024-05-21 12:57:06] [INFO ] Computed 7 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 13, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000016 steps (2 resets) in 413 ms. (2415 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 4127 ms. (968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 13, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2024-05-21 12:57:10] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:10] [INFO ] Invariant cache hit.
[2024-05-21 12:57:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:10] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-21 12:57:10] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 12:57:10] [INFO ] [Real]Added 87 Read/Feed constraints in 10 ms returned sat
[2024-05-21 12:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:57:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:10] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 12:57:10] [INFO ] [Nat]Added 87 Read/Feed constraints in 23 ms returned sat
[2024-05-21 12:57:10] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-21 12:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-21 12:57:11] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 47 ms.
[2024-05-21 12:57:11] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 12:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 12:57:11] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-05-21 12:57:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
[2024-05-21 12:57:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2024-05-21 12:57:11] [INFO ] Added : 21 causal constraints over 7 iterations in 497 ms. Result :sat
Minimization took 171 ms.
[2024-05-21 12:57:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2024-05-21 12:57:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:11] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-21 12:57:11] [INFO ] [Real]Added 87 Read/Feed constraints in 10 ms returned sat
[2024-05-21 12:57:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:57:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:11] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 12:57:11] [INFO ] [Nat]Added 87 Read/Feed constraints in 16 ms returned sat
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 12:57:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-21 12:57:12] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 32 ms.
[2024-05-21 12:57:12] [INFO ] Added : 3 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 148 ms.
[2024-05-21 12:57:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:12] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-21 12:57:12] [INFO ] [Real]Added 87 Read/Feed constraints in 11 ms returned sat
[2024-05-21 12:57:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:57:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:12] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 12:57:12] [INFO ] [Nat]Added 87 Read/Feed constraints in 17 ms returned sat
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2024-05-21 12:57:12] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-21 12:57:13] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2024-05-21 12:57:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 478 ms
[2024-05-21 12:57:13] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 41 ms.
[2024-05-21 12:57:13] [INFO ] Added : 26 causal constraints over 6 iterations in 219 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 13, 0, 0, 0, 0] Max Struct:[+inf, 13, 1, 1, +inf, 1]
FORMULA BugTracking-PT-q3m256-UpperBounds-03 13 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 730/730 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 730/730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 123/123 places, 730/730 transitions.
[2024-05-21 12:57:13] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
Found an invariant !
This invariant on transitions {4=1, 367=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 367=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 12:57:14] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000179 steps (2 resets) in 450 ms. (2217 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3068 ms. (977 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 12:57:17] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:17] [INFO ] Invariant cache hit.
[2024-05-21 12:57:17] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:57:17] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-21 12:57:17] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 12:57:17] [INFO ] [Real]Added 87 Read/Feed constraints in 13 ms returned sat
[2024-05-21 12:57:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:57:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:17] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-21 12:57:17] [INFO ] [Nat]Added 87 Read/Feed constraints in 19 ms returned sat
[2024-05-21 12:57:18] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-21 12:57:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-21 12:57:18] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 58 ms.
[2024-05-21 12:57:18] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 12:57:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-05-21 12:57:18] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 12:57:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 12:57:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2024-05-21 12:57:18] [INFO ] Added : 21 causal constraints over 7 iterations in 518 ms. Result :sat
Minimization took 176 ms.
[2024-05-21 12:57:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:18] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-21 12:57:18] [INFO ] [Real]Added 87 Read/Feed constraints in 9 ms returned sat
[2024-05-21 12:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:57:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:57:19] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-21 12:57:19] [INFO ] [Nat]Added 87 Read/Feed constraints in 18 ms returned sat
[2024-05-21 12:57:19] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 12:57:19] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-21 12:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2024-05-21 12:57:19] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 43 ms.
[2024-05-21 12:57:19] [INFO ] Added : 3 causal constraints over 1 iterations in 97 ms. Result :sat
Minimization took 159 ms.
[2024-05-21 12:57:19] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:57:19] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-21 12:57:19] [INFO ] [Real]Added 87 Read/Feed constraints in 10 ms returned sat
[2024-05-21 12:57:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:57:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-21 12:57:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-21 12:57:19] [INFO ] [Nat]Added 87 Read/Feed constraints in 18 ms returned sat
[2024-05-21 12:57:19] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-21 12:57:19] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-21 12:57:20] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-21 12:57:20] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2024-05-21 12:57:20] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-21 12:57:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 502 ms
[2024-05-21 12:57:20] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 35 ms.
[2024-05-21 12:57:20] [INFO ] Added : 26 causal constraints over 6 iterations in 173 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 730/730 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 730/730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/123 places, 730/730 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 730/730 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 730/730 (removed 0) transitions.
[2024-05-21 12:57:20] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:21] [INFO ] Invariant cache hit.
[2024-05-21 12:57:21] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 12:57:21] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:21] [INFO ] Invariant cache hit.
[2024-05-21 12:57:21] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 12:57:21] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2024-05-21 12:57:21] [INFO ] Redundant transitions in 17 ms returned []
Running 729 sub problems to find dead transitions.
[2024-05-21 12:57:21] [INFO ] Flow matrix only has 668 transitions (discarded 62 similar events)
[2024-05-21 12:57:21] [INFO ] Invariant cache hit.
[2024-05-21 12:57:21] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 729 unsolved
[2024-05-21 12:57:25] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-21 12:57:25] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 725 unsolved
Problem TDEAD413 is UNSAT
At refinement iteration 3 (OVERLAPS) 668/791 variables, 123/132 constraints. Problems are: Problem set: 5 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 87/219 constraints. Problems are: Problem set: 5 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/791 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 724 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/791 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 724 unsolved
No progress, stopping.
After SMT solving in domain Real declared 791/791 variables, and 219 constraints, problems are : Problem set: 5 solved, 724 unsolved in 27498 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 729/729 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 5 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 2/9 constraints. Problems are: Problem set: 5 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 724 unsolved
At refinement iteration 3 (OVERLAPS) 668/791 variables, 123/132 constraints. Problems are: Problem set: 5 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 87/219 constraints. Problems are: Problem set: 5 solved, 724 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD721 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/791 variables, 724/943 constraints. Problems are: Problem set: 79 solved, 650 unsolved
[2024-05-21 12:58:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-21 12:58:02] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 12:58:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/791 variables, 3/946 constraints. Problems are: Problem set: 127 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 946 constraints, problems are : Problem set: 127 solved, 602 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 724/729 constraints, Known Traps: 5/5 constraints]
After SMT, in 59669ms problems are : Problem set: 127 solved, 602 unsolved
Search for dead transitions found 127 dead transitions in 59680ms
Found 127 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 127 transitions
Dead transitions reduction (with SMT) removed 127 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 603/730 transitions.
Graph (complete) has 871 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 17 places and 208 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 103 transition count 395
Reduce places removed 8 places and 75 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 26 place count 95 transition count 320
Reduce places removed 3 places and 29 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 92 transition count 291
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 90 transition count 275
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 32 place count 89 transition count 268
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 37 place count 84 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 42 place count 84 transition count 233
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 42 rules in 15 ms. Remains 84 /123 variables (removed 39) and now considering 233/603 (removed 370) transitions.
[2024-05-21 12:58:21] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
// Phase 1: matrix 217 rows 84 cols
[2024-05-21 12:58:21] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 12:58:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 12:58:21] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
[2024-05-21 12:58:21] [INFO ] Invariant cache hit.
[2024-05-21 12:58:21] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:58:21] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/123 places, 233/730 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60741 ms. Remains : 84/123 places, 233/730 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 12:58:21] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {1=1, 146=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 146=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 :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 12:58:21] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
// Phase 1: matrix 217 rows 82 cols
[2024-05-21 12:58:21] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000045 steps (2 resets) in 371 ms. (2688 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 541 ms. (1845 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 12:58:22] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
[2024-05-21 12:58:22] [INFO ] Invariant cache hit.
[2024-05-21 12:58:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 12:58:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:22] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 12:58:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:58:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:58:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 12:58:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-21 12:58:23] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 12:58:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2024-05-21 12:58:23] [INFO ] Computed and/alt/rep : 180/972/180 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-21 12:58:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 12:58:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-21 12:58:23] [INFO ] Added : 61 causal constraints over 13 iterations in 237 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 233/233 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 233/233 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-21 12:58:23] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
[2024-05-21 12:58:23] [INFO ] Invariant cache hit.
[2024-05-21 12:58:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 12:58:23] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
[2024-05-21 12:58:23] [INFO ] Invariant cache hit.
[2024-05-21 12:58:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 12:58:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-21 12:58:23] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-21 12:58:23] [INFO ] Flow matrix only has 217 transitions (discarded 16 similar events)
[2024-05-21 12:58:23] [INFO ] Invariant cache hit.
[2024-05-21 12:58:23] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 3 (OVERLAPS) 217/299 variables, 82/90 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 48/138 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/138 constraints. Problems are: Problem set: 14 solved, 218 unsolved
[2024-05-21 12:58:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/299 variables, 1/139 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/139 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/299 variables, 0/139 constraints. Problems are: Problem set: 14 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 139 constraints, problems are : Problem set: 14 solved, 218 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 14 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 217/299 variables, 82/91 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 48/139 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 218/357 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/357 constraints. Problems are: Problem set: 14 solved, 218 unsolved
[2024-05-21 12:58:32] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-21 12:58:33] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/299 variables, 2/359 constraints. Problems are: Problem set: 14 solved, 218 unsolved
[2024-05-21 12:58:35] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 1/360 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/360 constraints. Problems are: Problem set: 14 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/299 variables, 0/360 constraints. Problems are: Problem set: 14 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 360 constraints, problems are : Problem set: 14 solved, 218 unsolved in 12333 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 218/232 constraints, Known Traps: 4/4 constraints]
After SMT, in 17960ms problems are : Problem set: 14 solved, 218 unsolved
Search for dead transitions found 14 dead transitions in 17962ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 219/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:58:41] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18244 ms. Remains : 82/82 places, 219/233 transitions.
[2024-05-21 12:58:41] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 12:58:41] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-05-21 12:58:41] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000188 steps (2 resets) in 321 ms. (3106 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 554 ms. (1801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 12:58:42] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:42] [INFO ] Invariant cache hit.
[2024-05-21 12:58:42] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 12:58:42] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:42] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 12:58:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:58:42] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:58:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:42] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:58:42] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 12:58:42] [INFO ] [Nat]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:58:43] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-21 12:58:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 12:58:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-21 12:58:43] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-21 12:58:43] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 12:58:43] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-21 12:58:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 12:58:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-05-21 12:58:43] [INFO ] Added : 52 causal constraints over 12 iterations in 489 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:58:43] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:43] [INFO ] Invariant cache hit.
[2024-05-21 12:58:43] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 12:58:43] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:43] [INFO ] Invariant cache hit.
[2024-05-21 12:58:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:58:44] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-21 12:58:44] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:58:44] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:44] [INFO ] Invariant cache hit.
[2024-05-21 12:58:44] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 5170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:58:51] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-21 12:58:52] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8087 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 13456ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 13460ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13816 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:58:57] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=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:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 39883 steps (8 resets) in 71 ms. (553 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m256-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-21 12:58:57] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10079 steps (2 resets) in 8 ms. (1119 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2024-05-21 12:58:57] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:57] [INFO ] Invariant cache hit.
[2024-05-21 12:58:57] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-21 12:58:57] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:58:57] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 12:58:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:58:57] [INFO ] [Real]Added 45 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:58:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:57] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:58:57] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-21 12:58:57] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:58:58] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-05-21 12:58:58] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 12:58:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-05-21 12:58:58] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 10 ms.
[2024-05-21 12:58:58] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 12:58:58] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-21 12:58:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:58:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 212 ms
[2024-05-21 12:58:58] [INFO ] Added : 52 causal constraints over 12 iterations in 363 ms. Result :sat
Minimization took 41 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:58:58] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-21 12:58:58] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000068 steps (2 resets) in 416 ms. (2398 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[253] Max Struct:[+inf]
[2024-05-21 12:58:59] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:58:59] [INFO ] Invariant cache hit.
[2024-05-21 12:58:59] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:59] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:58:59] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 12:58:59] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:58:59] [INFO ] [Real]Added 45 Read/Feed constraints in 5 ms returned sat
[2024-05-21 12:58:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:58:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:58:59] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:58:59] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 12:58:59] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:58:59] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 12:58:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-21 12:59:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-05-21 12:59:00] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 17 ms.
[2024-05-21 12:59:00] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-21 12:59:00] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 12:59:00] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-21 12:59:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2024-05-21 12:59:00] [INFO ] Added : 52 causal constraints over 12 iterations in 648 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[253] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[253] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 16 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:59:00] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:00] [INFO ] Invariant cache hit.
[2024-05-21 12:59:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 12:59:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:01] [INFO ] Invariant cache hit.
[2024-05-21 12:59:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:59:01] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-21 12:59:01] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:59:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:01] [INFO ] Invariant cache hit.
[2024-05-21 12:59:01] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 3819 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:59:07] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-21 12:59:07] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7407 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 11527ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11530ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11809 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:59:12] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[253] Max Struct:[+inf]
[2024-05-21 12:59:12] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[253] Max Struct:[+inf]
RANDOM walk for 1000204 steps (2 resets) in 308 ms. (3236 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 582 ms. (1715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[253] Max Struct:[+inf]
[2024-05-21 12:59:13] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:13] [INFO ] Invariant cache hit.
[2024-05-21 12:59:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:59:13] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 12:59:13] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 12:59:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:59:13] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2024-05-21 12:59:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:59:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 12:59:13] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 12:59:13] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 12:59:13] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-21 12:59:13] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 12:59:14] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 12:59:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-05-21 12:59:14] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-21 12:59:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 12:59:14] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 12:59:14] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:59:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2024-05-21 12:59:14] [INFO ] Added : 52 causal constraints over 12 iterations in 357 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[253] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[253] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:59:14] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:14] [INFO ] Invariant cache hit.
[2024-05-21 12:59:14] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 12:59:14] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:14] [INFO ] Invariant cache hit.
[2024-05-21 12:59:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:59:14] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-21 12:59:14] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:59:14] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:14] [INFO ] Invariant cache hit.
[2024-05-21 12:59:14] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 3769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:59:20] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-21 12:59:20] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 11069ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11326 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 12:59:25] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[253] Max Struct:[+inf]
RANDOM walk for 40477 steps (8 resets) in 42 ms. (941 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1219864 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :0 out of 1
Probabilistic random walk after 1219864 steps, saw 734227 distinct states, run finished after 3007 ms. (steps per millisecond=405 ) properties seen :0
[2024-05-21 12:59:29] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:29] [INFO ] Invariant cache hit.
[2024-05-21 12:59:29] [INFO ] State equation strengthened by 45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 39/216 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/218 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/221 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/223 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 31/254 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/254 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 31/285 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 39/216 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/218 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/221 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/223 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/223 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 31/254 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 31/285 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
RANDOM walk for 40494 steps (8 resets) in 33 ms. (1191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1255614 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :0 out of 1
Probabilistic random walk after 1255614 steps, saw 743811 distinct states, run finished after 3002 ms. (steps per millisecond=418 ) properties seen :0
[2024-05-21 12:59:32] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:32] [INFO ] Invariant cache hit.
[2024-05-21 12:59:32] [INFO ] State equation strengthened by 45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 39/216 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/218 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/221 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/223 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 31/254 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/254 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 31/285 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 39/216 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/218 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/221 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/223 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/223 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 31/254 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 31/285 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/285 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 260ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 12:59:32] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:32] [INFO ] Invariant cache hit.
[2024-05-21 12:59:33] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 12:59:33] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:33] [INFO ] Invariant cache hit.
[2024-05-21 12:59:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 12:59:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-21 12:59:33] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 12:59:33] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 12:59:33] [INFO ] Invariant cache hit.
[2024-05-21 12:59:33] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 12:59:39] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-21 12:59:39] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 355 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6611 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 2/2 constraints]
After SMT, in 10998ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11243 ms. Remains : 82/82 places, 219/219 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 331 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 201
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 157
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 151
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 71 place count 53 transition count 152
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 53 transition count 148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 79 place count 49 transition count 148
Applied a total of 79 rules in 22 ms. Remains 49 /82 variables (removed 33) and now considering 148/219 (removed 71) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 49 cols
[2024-05-21 12:59:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 12:59:44] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 12:59:44] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 12:59:44] [INFO ] After 43ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-21 12:59:44] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 103 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[253] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-01 in 46583 ms.
[2024-05-21 12:59:44] [INFO ] Flatten gal took : 95 ms
[2024-05-21 12:59:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-21 12:59:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 219 transitions and 1042 arcs took 4 ms.
Total runtime 329104 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BugTracking-PT-q3m256
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 82
TRANSITIONS: 219
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.001s]
SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1277
MODEL NAME: /home/mcc/execution/420/model
82 places, 219 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716296388304
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BugTracking-PT-q3m256, 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 r047-tajo-171620398100381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 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 '
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 ;