About the Execution of ITS-Tools for BugTracking-PT-q3m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 301005.00 | 0.00 | 0.00 | 0 0 0 0 0 0 0 0 1 0 1 0 256 0 0 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765300541.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
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 r016-smll-174853765300541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 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
echo here is the order used to build the result vector(from xml 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 1749167583096
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 23:53:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 23:53:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 23:53:07] [INFO ] Load time of PNML (sax parser for PT used): 1506 ms
[2025-06-05 23:53:07] [INFO ] Transformed 754 places.
[2025-06-05 23:53:07] [INFO ] Transformed 27370 transitions.
[2025-06-05 23:53:07] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1933 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 514 places in 261 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-11 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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 23:53:08] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 23:53:08] [INFO ] Computed 10 invariants in 79 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, +inf, 1, +inf, 256, 1]
RANDOM walk for 10000 steps (4 resets) in 128 ms. (77 steps per ms)
FORMULA BugTracking-PT-q3m256-UpperBounds-12 256 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BugTracking-PT-q3m256-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 209 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-06-05 23:53:08] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-06-05 23:53:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:08] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-05 23:53:10] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2025-06-05 23:53:10] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-05 23:53:10] [INFO ] [Real]Added 255 Read/Feed constraints in 109 ms returned sat
[2025-06-05 23:53:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 23:53:11] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2025-06-05 23:53:11] [INFO ] [Nat]Added 255 Read/Feed constraints in 136 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:12] [INFO ] Deduced a trap composed of 12 places in 808 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:13] [INFO ] Deduced a trap composed of 11 places in 802 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:13] [INFO ] Deduced a trap composed of 22 places in 343 ms of which 8 ms to minimize.
[2025-06-05 23:53:14] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2800 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:14] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-05 23:53:15] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2025-06-05 23:53:15] [INFO ] [Real]Added 255 Read/Feed constraints in 102 ms returned sat
[2025-06-05 23:53:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 23:53:16] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2025-06-05 23:53:16] [INFO ] [Nat]Added 255 Read/Feed constraints in 177 ms returned sat
[2025-06-05 23:53:17] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 514 ms.
[2025-06-05 23:53:17] [INFO ] Added : 3 causal constraints over 1 iterations in 890 ms. Result :sat
Minimization took 648 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 23:53:19] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2025-06-05 23:53:19] [INFO ] [Real]Added 255 Read/Feed constraints in 127 ms returned sat
[2025-06-05 23:53:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 23:53:20] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2025-06-05 23:53:20] [INFO ] [Nat]Added 255 Read/Feed constraints in 191 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:20] [INFO ] Deduced a trap composed of 7 places in 473 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:21] [INFO ] Deduced a trap composed of 14 places in 353 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:21] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 8 ms to minimize.
[2025-06-05 23:53:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1453 ms
[2025-06-05 23:53:22] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 435 ms.
[2025-06-05 23:53:23] [INFO ] Added : 8 causal constraints over 3 iterations in 1407 ms. Result :sat
Minimization took 638 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 23:53:24] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2025-06-05 23:53:25] [INFO ] [Real]Added 255 Read/Feed constraints in 103 ms returned sat
[2025-06-05 23:53:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 23:53:26] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2025-06-05 23:53:26] [INFO ] [Nat]Added 255 Read/Feed constraints in 258 ms returned sat
[2025-06-05 23:53:26] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 385 ms.
[2025-06-05 23:53:27] [INFO ] Added : 5 causal constraints over 1 iterations in 809 ms. Result :sat
Minimization took 725 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:28] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 23:53:28] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2025-06-05 23:53:29] [INFO ] [Real]Added 255 Read/Feed constraints in 71 ms returned sat
[2025-06-05 23:53:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 23:53:29] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2025-06-05 23:53:30] [INFO ] [Nat]Added 255 Read/Feed constraints in 218 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:30] [INFO ] Deduced a trap composed of 13 places in 477 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:31] [INFO ] Deduced a trap composed of 17 places in 409 ms of which 18 ms to minimize.
[2025-06-05 23:53:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1165 ms
[2025-06-05 23:53:31] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 302 ms.
[2025-06-05 23:53:32] [INFO ] Added : 5 causal constraints over 1 iterations in 814 ms. Result :sat
Minimization took 783 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:32] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 23:53:33] [INFO ] [Real]Absence check using state equation in 768 ms returned sat
[2025-06-05 23:53:33] [INFO ] [Real]Added 255 Read/Feed constraints in 69 ms returned sat
[2025-06-05 23:53:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 23:53:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 23:53:34] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2025-06-05 23:53:34] [INFO ] [Nat]Added 255 Read/Feed constraints in 157 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:53:35] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 18 ms to minimize.
[2025-06-05 23:53:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 605 ms
[2025-06-05 23:53:35] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 365 ms.
[2025-06-05 23:53:36] [INFO ] Added : 11 causal constraints over 3 iterations in 1271 ms. Result :sat
Minimization took 839 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0] Max Struct:[1, +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.12 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 5 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 529 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 545 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-06-05 23:53:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 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 506 ms. (steps per millisecond=19 ) properties (out of 6) seen :[0, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-06-05 23:53:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-06-05 23:53:40] [INFO ] Computed 8 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
RANDOM walk for 1000114 steps (2 resets) in 1062 ms. (940 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 19734 ms. (304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-06-05 23:54:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 23:54:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:54:02] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2025-06-05 23:54:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 23:54:02] [INFO ] [Real]Added 241 Read/Feed constraints in 102 ms returned sat
[2025-06-05 23:54:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 23:54:03] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2025-06-05 23:54:03] [INFO ] [Nat]Added 241 Read/Feed constraints in 207 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:03] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:04] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:04] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 13 ms to minimize.
[2025-06-05 23:54:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1093 ms
[2025-06-05 23:54:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 383 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:06] [INFO ] Deduced a trap composed of 21 places in 601 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:07] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 16 ms to minimize.
[2025-06-05 23:54:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1460 ms
[2025-06-05 23:54:08] [INFO ] Added : 9 causal constraints over 5 iterations in 3501 ms. Result :sat
Minimization took 2375 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:10] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:54:11] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2025-06-05 23:54:11] [INFO ] [Real]Added 241 Read/Feed constraints in 86 ms returned sat
[2025-06-05 23:54:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 23:54:12] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2025-06-05 23:54:12] [INFO ] [Nat]Added 241 Read/Feed constraints in 135 ms returned sat
[2025-06-05 23:54:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 228 ms.
[2025-06-05 23:54:13] [INFO ] Added : 2 causal constraints over 1 iterations in 509 ms. Result :sat
Minimization took 2203 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:54:16] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2025-06-05 23:54:16] [INFO ] [Real]Added 241 Read/Feed constraints in 60 ms returned sat
[2025-06-05 23:54:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 23:54:17] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2025-06-05 23:54:17] [INFO ] [Nat]Added 241 Read/Feed constraints in 258 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:18] [INFO ] Deduced a trap composed of 12 places in 565 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:18] [INFO ] Deduced a trap composed of 30 places in 577 ms of which 26 ms to minimize.
[2025-06-05 23:54:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1460 ms
[2025-06-05 23:54:19] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 364 ms.
[2025-06-05 23:54:19] [INFO ] Added : 3 causal constraints over 1 iterations in 858 ms. Result :sat
Minimization took 2608 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:54:23] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2025-06-05 23:54:23] [INFO ] [Real]Added 241 Read/Feed constraints in 74 ms returned sat
[2025-06-05 23:54:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:54:24] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2025-06-05 23:54:24] [INFO ] [Nat]Added 241 Read/Feed constraints in 73 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:24] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 19 ms to minimize.
[2025-06-05 23:54:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 449 ms
[2025-06-05 23:54:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 284 ms.
[2025-06-05 23:54:25] [INFO ] Added : 2 causal constraints over 1 iterations in 717 ms. Result :sat
Minimization took 2273 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:54:28] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2025-06-05 23:54:28] [INFO ] [Real]Added 241 Read/Feed constraints in 64 ms returned sat
[2025-06-05 23:54:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:54:29] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2025-06-05 23:54:29] [INFO ] [Nat]Added 241 Read/Feed constraints in 278 ms returned sat
[2025-06-05 23:54:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 232 ms.
[2025-06-05 23:54:30] [INFO ] Added : 7 causal constraints over 2 iterations in 645 ms. Result :sat
Minimization took 2170 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:54:33] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2025-06-05 23:54:33] [INFO ] [Real]Added 241 Read/Feed constraints in 63 ms returned sat
[2025-06-05 23:54:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:54:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:54:33] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2025-06-05 23:54:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 190 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:34] [INFO ] Deduced a trap composed of 15 places in 735 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:35] [INFO ] Deduced a trap composed of 19 places in 666 ms of which 20 ms to minimize.
[2025-06-05 23:54:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1716 ms
[2025-06-05 23:54:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 337 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:54:37] [INFO ] Deduced a trap composed of 5 places in 460 ms of which 23 ms to minimize.
[2025-06-05 23:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 748 ms
[2025-06-05 23:54:37] [INFO ] Added : 6 causal constraints over 2 iterations in 1857 ms. Result :sat
Minimization took 2376 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0] Max Struct:[1, +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 83 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 83 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 94 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-06-05 23:54:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 23:54:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:54:42] [INFO ] Implicit Places using invariants in 697 ms returned []
[2025-06-05 23:54:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 23:54:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:54:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 23:54:47] [INFO ] Implicit Places using invariants and state equation in 5476 ms returned []
Implicit Place search using SMT with State Equation took 6177 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:54:48] [INFO ] Redundant transitions in 517 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-06-05 23:54:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 23:54:48] [INFO ] Invariant cache hit.
[2025-06-05 23:54:48] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30173 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:55:38] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:55:44] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 5 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
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:55:44] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 6 ms to minimize.
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:55:44] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 4 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
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
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
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 TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 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 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
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 12 constraints, problems are : Problem set: 206 solved, 2540 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67591ms problems are : Problem set: 206 solved, 2540 unsolved
Search for dead transitions found 206 dead transitions in 67648ms
Found 206 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 206 transitions
Dead transitions reduction (with SMT) removed 206 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2541/2747 transitions.
Reduce places removed 25 places and 534 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 204 transition count 2007
Reduce places removed 19 places and 264 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 44 place count 185 transition count 1743
Reduce places removed 9 places and 198 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 53 place count 176 transition count 1545
Reduce places removed 9 places and 121 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 62 place count 167 transition count 1424
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 164 transition count 1358
Reduce places removed 3 places and 53 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 161 transition count 1305
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 70 place count 159 transition count 1280
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 17 places and 276 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 89 place count 142 transition count 1004
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 89 rules in 112 ms. Remains 142 /229 variables (removed 87) and now considering 1004/2541 (removed 1537) transitions.
[2025-06-05 23:55:55] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 142 cols
[2025-06-05 23:55:55] [INFO ] Computed 10 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:55:56] [INFO ] Implicit Places using invariants in 373 ms returned []
[2025-06-05 23:55:56] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 23:55:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:55:56] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 23:55:57] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/229 places, 1004/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76183 ms. Remains : 142/229 places, 1004/2747 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 23:55:57] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 594=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 594=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :[0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, +inf, 1]
[2025-06-05 23:55:58] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
// Phase 1: matrix 946 rows 140 cols
[2025-06-05 23:55:58] [INFO ] Computed 8 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 2, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
FORMULA BugTracking-PT-q3m256-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000205 steps (2 resets) in 903 ms. (1106 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 4888 ms. (613 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
[2025-06-05 23:56:04] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 23:56:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:04] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 23:56:04] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-05 23:56:04] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 23:56:04] [INFO ] [Real]Added 119 Read/Feed constraints in 41 ms returned sat
[2025-06-05 23:56:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:04] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-05 23:56:05] [INFO ] [Nat]Added 119 Read/Feed constraints in 103 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:05] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:05] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:05] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 14 ms to minimize.
[2025-06-05 23:56:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 937 ms
[2025-06-05 23:56:06] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 126 ms.
[2025-06-05 23:56:06] [INFO ] Added : 6 causal constraints over 2 iterations in 382 ms. Result :sat
Minimization took 605 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:07] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:07] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2025-06-05 23:56:07] [INFO ] [Real]Added 119 Read/Feed constraints in 43 ms returned sat
[2025-06-05 23:56:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:08] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2025-06-05 23:56:08] [INFO ] [Nat]Added 119 Read/Feed constraints in 45 ms returned sat
[2025-06-05 23:56:08] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 120 ms.
[2025-06-05 23:56:08] [INFO ] Added : 1 causal constraints over 1 iterations in 291 ms. Result :sat
Minimization took 534 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:09] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:09] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2025-06-05 23:56:09] [INFO ] [Real]Added 119 Read/Feed constraints in 37 ms returned sat
[2025-06-05 23:56:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:09] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-05 23:56:09] [INFO ] [Nat]Added 119 Read/Feed constraints in 62 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:10] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:10] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 10 ms to minimize.
[2025-06-05 23:56:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 640 ms
[2025-06-05 23:56:10] [INFO ] Computed and/alt/rep : 232/915/231 causal constraints (skipped 714 transitions) in 121 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:11] [INFO ] Deduced a trap composed of 7 places in 359 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:11] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:12] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:12] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 9 ms to minimize.
[2025-06-05 23:56:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1579 ms
[2025-06-05 23:56:12] [INFO ] Added : 14 causal constraints over 5 iterations in 2225 ms. Result :sat
Minimization took 608 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 27 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 140/140 places, 1004/1004 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 1004/1004 transitions.
Applied a total of 0 rules in 23 ms. Remains 140 /140 variables (removed 0) and now considering 1004/1004 (removed 0) transitions.
[2025-06-05 23:56:13] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 23:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:56:14] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-06-05 23:56:14] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 23:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:56:14] [INFO ] State equation strengthened by 119 read => feed constraints.
[2025-06-05 23:56:16] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:56:16] [INFO ] Redundant transitions in 76 ms returned []
Running 1003 sub problems to find dead transitions.
[2025-06-05 23:56:16] [INFO ] Flow matrix only has 946 transitions (discarded 58 similar events)
[2025-06-05 23:56:16] [INFO ] Invariant cache hit.
[2025-06-05 23:56:16] [INFO ] State equation strengthened by 119 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1003 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:24] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:25] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 5 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:26] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 4/12 constraints. Problems are: Problem set: 164 solved, 839 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/12 constraints. Problems are: Problem set: 164 solved, 839 unsolved
Problem TDEAD626 is UNSAT
At refinement iteration 3 (OVERLAPS) 946/1086 variables, 140/152 constraints. Problems are: Problem set: 165 solved, 838 unsolved
SMT process timed out in 31719ms, After SMT, problems are : Problem set: 165 solved, 838 unsolved
Search for dead transitions found 165 dead transitions in 31726ms
Found 165 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 165 transitions
Dead transitions reduction (with SMT) removed 165 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 140/140 places, 839/1004 transitions.
Graph (complete) has 1200 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 138 transition count 821
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 129 transition count 776
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 129 transition count 776
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 122 transition count 720
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 122 transition count 720
Applied a total of 34 rules in 40 ms. Remains 122 /140 variables (removed 18) and now considering 720/839 (removed 119) transitions.
[2025-06-05 23:56:47] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
// Phase 1: matrix 658 rows 122 cols
[2025-06-05 23:56:47] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:56:48] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-05 23:56:48] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
[2025-06-05 23:56:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:56:48] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 23:56:49] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/140 places, 720/1004 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35250 ms. Remains : 122/140 places, 720/1004 transitions.
[2025-06-05 23:56:49] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 360=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 360=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
[2025-06-05 23:56:49] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
[2025-06-05 23:56:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
RANDOM walk for 1000005 steps (2 resets) in 704 ms. (1418 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 4082 ms. (734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
[2025-06-05 23:56:54] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
[2025-06-05 23:56:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 23:56:54] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-05 23:56:54] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 23:56:54] [INFO ] [Real]Added 86 Read/Feed constraints in 17 ms returned sat
[2025-06-05 23:56:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 23:56:54] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-06-05 23:56:54] [INFO ] [Nat]Added 86 Read/Feed constraints in 61 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:54] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:55] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:55] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:55] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:55] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:56] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:56] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:56] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:56] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:56:56] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 10 ms to minimize.
[2025-06-05 23:56:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2034 ms
[2025-06-05 23:56:56] [INFO ] Computed and/alt/rep : 173/541/172 causal constraints (skipped 485 transitions) in 78 ms.
[2025-06-05 23:56:57] [INFO ] Added : 11 causal constraints over 3 iterations in 322 ms. Result :sat
Minimization took 440 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:57] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:57] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-06-05 23:56:58] [INFO ] [Real]Added 86 Read/Feed constraints in 34 ms returned sat
[2025-06-05 23:56:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:56:58] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-06-05 23:56:58] [INFO ] [Nat]Added 86 Read/Feed constraints in 45 ms returned sat
[2025-06-05 23:56:58] [INFO ] Computed and/alt/rep : 173/541/172 causal constraints (skipped 485 transitions) in 79 ms.
[2025-06-05 23:56:58] [INFO ] Added : 1 causal constraints over 1 iterations in 205 ms. Result :sat
Minimization took 394 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:59] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 23:56:59] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2025-06-05 23:56:59] [INFO ] [Real]Added 86 Read/Feed constraints in 27 ms returned sat
[2025-06-05 23:56:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 23:56:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 23:56:59] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2025-06-05 23:56:59] [INFO ] [Nat]Added 86 Read/Feed constraints in 40 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:57:00] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:57:00] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 6 ms to minimize.
[2025-06-05 23:57:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2025-06-05 23:57:00] [INFO ] Computed and/alt/rep : 173/541/172 causal constraints (skipped 485 transitions) in 77 ms.
[2025-06-05 23:57:00] [INFO ] Added : 7 causal constraints over 2 iterations in 256 ms. Result :sat
Minimization took 415 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[1, +inf, 1, +inf, 1]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 720/720 transitions.
Applied a total of 0 rules in 15 ms. Remains 122 /122 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 122/122 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 720/720 transitions.
Applied a total of 0 rules in 15 ms. Remains 122 /122 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2025-06-05 23:57:01] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
[2025-06-05 23:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:57:01] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-05 23:57:01] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
[2025-06-05 23:57:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:57:01] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 23:57:02] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 23:57:02] [INFO ] Redundant transitions in 14 ms returned []
Running 719 sub problems to find dead transitions.
[2025-06-05 23:57:02] [INFO ] Flow matrix only has 658 transitions (discarded 62 similar events)
[2025-06-05 23:57:02] [INFO ] Invariant cache hit.
[2025-06-05 23:57:02] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 658/780 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 719 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/780 variables, 86/216 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 780/780 variables, and 216 constraints, problems are : Problem set: 0 solved, 719 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 719 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (OVERLAPS) 658/780 variables, 122/130 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/780 variables, 86/216 constraints. Problems are: Problem set: 0 solved, 719 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 TDEAD383 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD713 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/780 variables, 719/935 constraints. Problems are: Problem set: 76 solved, 643 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:57:58] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 3 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:58:01] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:58:01] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:58:02] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:58:02] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:58:03] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 23:58:03] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 780/780 variables, and 942 constraints, problems are : Problem set: 103 solved, 616 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61276ms problems are : Problem set: 103 solved, 616 unsolved
Search for dead transitions found 103 dead transitions in 61284ms
Found 103 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 103 transitions
Dead transitions reduction (with SMT) removed 103 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 617/720 transitions.
Graph (complete) has 887 edges and 122 vertex of which 121 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 188 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 107 transition count 429
Reduce places removed 8 places and 74 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 23 place count 99 transition count 355
Reduce places removed 3 places and 29 transitions.
Graph (complete) has 529 edges and 96 vertex of which 3 are kept as prefixes of interest. Removing 93 places using SCC suffix rule.0 ms
Discarding 93 places :
Also discarding 326 output transitions
Drop transitions (Output transitions of discarded places.) removed 326 transitions
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 27 rules in 10 ms. Remains 3 /122 variables (removed 119) and now considering 0/617 (removed 617) transitions.
[2025-06-05 23:58:03] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:58:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-05 23:58:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 23:58:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/122 places, 0/720 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62606 ms. Remains : 3/122 places, 0/720 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 298383 ms.
BK_STOP 1749167884101
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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-5832"
echo " Executing tool itstools"
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 r016-smll-174853765300541"
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.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 ;