About the Execution of 2023-gold for BugTracking-PT-q3m128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.144 | 3600000.00 | 3641645.00 | 32663.20 | 0 0 ? 0 0 0 ? 0 0 ? ? 0 ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414700231.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q3m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700231
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 02:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 02:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716643410357
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 13:23:32] [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]
[2024-05-25 13:23:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:23:32] [INFO ] Load time of PNML (sax parser for PT used): 735 ms
[2024-05-25 13:23:32] [INFO ] Transformed 754 places.
[2024-05-25 13:23:33] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:23:33] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 918 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 156 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2024-05-25 13:23:33] [INFO ] Computed 10 invariants in 40 ms
Incomplete random walk after 10039 steps, including 14 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :10
[2024-05-25 13:23:33] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-25 13:23:33] [INFO ] Computed 10 invariants in 13 ms
[2024-05-25 13:23:33] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 13:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:34] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2024-05-25 13:23:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 13:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:34] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-25 13:23:34] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:23:34] [INFO ] [Nat]Added 255 Read/Feed constraints in 135 ms returned sat
[2024-05-25 13:23:35] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 4 ms to minimize.
[2024-05-25 13:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2024-05-25 13:23:35] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 254 ms.
[2024-05-25 13:23:35] [INFO ] Added : 10 causal constraints over 2 iterations in 668 ms. Result :sat
Minimization took 272 ms.
[2024-05-25 13:23:36] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 13:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:36] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2024-05-25 13:23:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-25 13:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:37] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-25 13:23:37] [INFO ] [Nat]Added 255 Read/Feed constraints in 135 ms returned sat
[2024-05-25 13:23:37] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 1 ms to minimize.
[2024-05-25 13:23:38] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2024-05-25 13:23:38] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 2 ms to minimize.
[2024-05-25 13:23:38] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 0 ms to minimize.
[2024-05-25 13:23:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1534 ms
[2024-05-25 13:23:38] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 143 ms.
[2024-05-25 13:23:39] [INFO ] Added : 8 causal constraints over 2 iterations in 519 ms. Result :sat
Minimization took 330 ms.
[2024-05-25 13:23:39] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:40] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-25 13:23:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 13:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:40] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-25 13:23:40] [INFO ] [Nat]Added 255 Read/Feed constraints in 189 ms returned sat
[2024-05-25 13:23:41] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 0 ms to minimize.
[2024-05-25 13:23:41] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2024-05-25 13:23:41] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2024-05-25 13:23:41] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-25 13:23:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 894 ms
[2024-05-25 13:23:41] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 162 ms.
[2024-05-25 13:23:42] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2024-05-25 13:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-25 13:23:42] [INFO ] Added : 15 causal constraints over 4 iterations in 787 ms. Result :sat
Minimization took 312 ms.
[2024-05-25 13:23:43] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:43] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2024-05-25 13:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:23:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:43] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2024-05-25 13:23:44] [INFO ] [Nat]Added 255 Read/Feed constraints in 122 ms returned sat
[2024-05-25 13:23:44] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 0 ms to minimize.
[2024-05-25 13:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2024-05-25 13:23:44] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 180 ms.
[2024-05-25 13:23:45] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 0 ms to minimize.
[2024-05-25 13:23:45] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2024-05-25 13:23:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 762 ms
[2024-05-25 13:23:46] [INFO ] Added : 17 causal constraints over 5 iterations in 1986 ms. Result :sat
Minimization took 336 ms.
[2024-05-25 13:23:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:47] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2024-05-25 13:23:47] [INFO ] [Real]Added 255 Read/Feed constraints in 32 ms returned sat
[2024-05-25 13:23:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:23:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:47] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-25 13:23:47] [INFO ] [Nat]Added 255 Read/Feed constraints in 37 ms returned sat
[2024-05-25 13:23:48] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 159 ms.
[2024-05-25 13:23:48] [INFO ] Added : 2 causal constraints over 1 iterations in 390 ms. Result :sat
Minimization took 304 ms.
[2024-05-25 13:23:48] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:49] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2024-05-25 13:23:49] [INFO ] [Real]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-05-25 13:23:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 13:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:49] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-25 13:23:49] [INFO ] [Nat]Added 255 Read/Feed constraints in 61 ms returned sat
[2024-05-25 13:23:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 200 ms.
[2024-05-25 13:23:50] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 0 ms to minimize.
[2024-05-25 13:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2024-05-25 13:23:50] [INFO ] Added : 8 causal constraints over 3 iterations in 1127 ms. Result :sat
Minimization took 233 ms.
[2024-05-25 13:23:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:51] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-05-25 13:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:52] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-05-25 13:23:52] [INFO ] [Nat]Added 255 Read/Feed constraints in 131 ms returned sat
[2024-05-25 13:23:52] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2024-05-25 13:23:53] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 1 ms to minimize.
[2024-05-25 13:23:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 722 ms
[2024-05-25 13:23:53] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 174 ms.
[2024-05-25 13:23:53] [INFO ] Added : 6 causal constraints over 2 iterations in 660 ms. Result :sat
Minimization took 352 ms.
[2024-05-25 13:23:54] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:54] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-25 13:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:23:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:23:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:23:55] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2024-05-25 13:23:55] [INFO ] [Nat]Added 255 Read/Feed constraints in 35 ms returned sat
[2024-05-25 13:23:55] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 181 ms.
[2024-05-25 13:23:56] [INFO ] Added : 5 causal constraints over 3 iterations in 794 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, -1, -1, 1] Max seen :[0, 0, 0, 0, 1, 20, 0, 0]
Support contains 8 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.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 237 transition count 2772
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 237 transition count 2765
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 17 place count 230 transition count 2765
Applied a total of 17 rules in 249 ms. Remains 230 /240 variables (removed 10) and now considering 2765/2769 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 230/240 places, 2765/2769 transitions.
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:23:57] [INFO ] Computed 8 invariants in 30 ms
Incomplete random walk after 1000052 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 8) seen :206
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2035 ms. (steps per millisecond=491 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2049 ms. (steps per millisecond=488 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2022 ms. (steps per millisecond=494 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1993 ms. (steps per millisecond=501 ) properties (out of 8) seen :33
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1910 ms. (steps per millisecond=523 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1844 ms. (steps per millisecond=542 ) properties (out of 8) seen :5423
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 8) seen :31
[2024-05-25 13:24:13] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:24:13] [INFO ] Computed 8 invariants in 27 ms
[2024-05-25 13:24:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:14] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2024-05-25 13:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:14] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-25 13:24:14] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:24:14] [INFO ] [Nat]Added 255 Read/Feed constraints in 201 ms returned sat
[2024-05-25 13:24:15] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2024-05-25 13:24:15] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 1 ms to minimize.
[2024-05-25 13:24:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 739 ms
[2024-05-25 13:24:15] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 206 ms.
[2024-05-25 13:24:17] [INFO ] Deduced a trap composed of 61 places in 256 ms of which 1 ms to minimize.
[2024-05-25 13:24:17] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 1 ms to minimize.
[2024-05-25 13:24:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 859 ms
[2024-05-25 13:24:18] [INFO ] Added : 19 causal constraints over 7 iterations in 2478 ms. Result :sat
Minimization took 371 ms.
[2024-05-25 13:24:18] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:19] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-05-25 13:24:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:19] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2024-05-25 13:24:19] [INFO ] [Nat]Added 255 Read/Feed constraints in 141 ms returned sat
[2024-05-25 13:24:20] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 0 ms to minimize.
[2024-05-25 13:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2024-05-25 13:24:20] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 234 ms.
[2024-05-25 13:24:21] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-25 13:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-25 13:24:21] [INFO ] Added : 9 causal constraints over 2 iterations in 1056 ms. Result :sat
Minimization took 362 ms.
[2024-05-25 13:24:21] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:22] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-25 13:24:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:22] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2024-05-25 13:24:22] [INFO ] [Nat]Added 255 Read/Feed constraints in 124 ms returned sat
[2024-05-25 13:24:23] [INFO ] Deduced a trap composed of 32 places in 305 ms of which 0 ms to minimize.
[2024-05-25 13:24:23] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 1 ms to minimize.
[2024-05-25 13:24:23] [INFO ] Deduced a trap composed of 16 places in 282 ms of which 0 ms to minimize.
[2024-05-25 13:24:24] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 0 ms to minimize.
[2024-05-25 13:24:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1412 ms
[2024-05-25 13:24:24] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 200 ms.
[2024-05-25 13:24:24] [INFO ] Added : 4 causal constraints over 1 iterations in 508 ms. Result :sat
Minimization took 494 ms.
[2024-05-25 13:24:25] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:25] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2024-05-25 13:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:26] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2024-05-25 13:24:26] [INFO ] [Nat]Added 255 Read/Feed constraints in 247 ms returned sat
[2024-05-25 13:24:26] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2024-05-25 13:24:27] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 0 ms to minimize.
[2024-05-25 13:24:27] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2024-05-25 13:24:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 628 ms
[2024-05-25 13:24:27] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 244 ms.
[2024-05-25 13:24:28] [INFO ] Added : 10 causal constraints over 3 iterations in 870 ms. Result :sat
Minimization took 304 ms.
[2024-05-25 13:24:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:29] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2024-05-25 13:24:29] [INFO ] [Real]Added 255 Read/Feed constraints in 39 ms returned sat
[2024-05-25 13:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:29] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-05-25 13:24:29] [INFO ] [Nat]Added 255 Read/Feed constraints in 42 ms returned sat
[2024-05-25 13:24:30] [INFO ] Deduced a trap composed of 11 places in 288 ms of which 1 ms to minimize.
[2024-05-25 13:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2024-05-25 13:24:30] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 179 ms.
[2024-05-25 13:24:30] [INFO ] Added : 2 causal constraints over 1 iterations in 488 ms. Result :sat
Minimization took 439 ms.
[2024-05-25 13:24:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:31] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-25 13:24:31] [INFO ] [Real]Added 255 Read/Feed constraints in 48 ms returned sat
[2024-05-25 13:24:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:32] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2024-05-25 13:24:32] [INFO ] [Nat]Added 255 Read/Feed constraints in 47 ms returned sat
[2024-05-25 13:24:32] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 203 ms.
[2024-05-25 13:24:32] [INFO ] Added : 2 causal constraints over 1 iterations in 534 ms. Result :sat
Minimization took 199 ms.
[2024-05-25 13:24:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:33] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-05-25 13:24:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:34] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-25 13:24:34] [INFO ] [Nat]Added 255 Read/Feed constraints in 112 ms returned sat
[2024-05-25 13:24:34] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 0 ms to minimize.
[2024-05-25 13:24:35] [INFO ] Deduced a trap composed of 48 places in 365 ms of which 0 ms to minimize.
[2024-05-25 13:24:35] [INFO ] Deduced a trap composed of 98 places in 400 ms of which 0 ms to minimize.
[2024-05-25 13:24:35] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 1 ms to minimize.
[2024-05-25 13:24:36] [INFO ] Deduced a trap composed of 108 places in 377 ms of which 1 ms to minimize.
[2024-05-25 13:24:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2264 ms
[2024-05-25 13:24:36] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 252 ms.
[2024-05-25 13:24:37] [INFO ] Added : 2 causal constraints over 1 iterations in 588 ms. Result :sat
Minimization took 432 ms.
[2024-05-25 13:24:37] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:38] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2024-05-25 13:24:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:24:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:24:38] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-25 13:24:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 57 ms returned sat
[2024-05-25 13:24:39] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 0 ms to minimize.
[2024-05-25 13:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2024-05-25 13:24:39] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 236 ms.
[2024-05-25 13:24:39] [INFO ] Added : 1 causal constraints over 1 iterations in 508 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, -1, -1, 1] Max seen :[0, 0, 0, 0, 1, 5422, 0, 0]
Support contains 8 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 47 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 47 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2024-05-25 13:24:52] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:24:52] [INFO ] Invariant cache hit.
[2024-05-25 13:24:52] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-25 13:24:52] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:24:52] [INFO ] Invariant cache hit.
[2024-05-25 13:24:53] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:24:54] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2414 ms to find 0 implicit places.
[2024-05-25 13:24:55] [INFO ] Redundant transitions in 265 ms returned []
[2024-05-25 13:24:55] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:24:55] [INFO ] Invariant cache hit.
[2024-05-25 13:24:55] [INFO ] Dead Transitions using invariants and state equation in 887 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3620 ms. Remains : 230/230 places, 2765/2765 transitions.
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:24:55] [INFO ] Computed 8 invariants in 12 ms
Incomplete random walk after 1000069 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 8) seen :524
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 8) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2052 ms. (steps per millisecond=487 ) properties (out of 8) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2033 ms. (steps per millisecond=491 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1951 ms. (steps per millisecond=512 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1977 ms. (steps per millisecond=505 ) properties (out of 8) seen :5385
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2035 ms. (steps per millisecond=491 ) properties (out of 8) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2055 ms. (steps per millisecond=486 ) properties (out of 8) seen :25
[2024-05-25 13:25:12] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:25:12] [INFO ] Computed 8 invariants in 26 ms
[2024-05-25 13:25:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:13] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-05-25 13:25:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:13] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-05-25 13:25:13] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:25:13] [INFO ] [Nat]Added 255 Read/Feed constraints in 163 ms returned sat
[2024-05-25 13:25:14] [INFO ] Deduced a trap composed of 12 places in 293 ms of which 0 ms to minimize.
[2024-05-25 13:25:14] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 0 ms to minimize.
[2024-05-25 13:25:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 773 ms
[2024-05-25 13:25:15] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 254 ms.
[2024-05-25 13:25:16] [INFO ] Deduced a trap composed of 61 places in 224 ms of which 0 ms to minimize.
[2024-05-25 13:25:16] [INFO ] Deduced a trap composed of 61 places in 232 ms of which 0 ms to minimize.
[2024-05-25 13:25:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 735 ms
[2024-05-25 13:25:17] [INFO ] Added : 19 causal constraints over 7 iterations in 2423 ms. Result :sat
Minimization took 357 ms.
[2024-05-25 13:25:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:18] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2024-05-25 13:25:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:18] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-25 13:25:18] [INFO ] [Nat]Added 255 Read/Feed constraints in 115 ms returned sat
[2024-05-25 13:25:19] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 0 ms to minimize.
[2024-05-25 13:25:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 424 ms
[2024-05-25 13:25:19] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 210 ms.
[2024-05-25 13:25:19] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-25 13:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-25 13:25:20] [INFO ] Added : 9 causal constraints over 2 iterations in 977 ms. Result :sat
Minimization took 338 ms.
[2024-05-25 13:25:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:21] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2024-05-25 13:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:21] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-05-25 13:25:21] [INFO ] [Nat]Added 255 Read/Feed constraints in 89 ms returned sat
[2024-05-25 13:25:22] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 0 ms to minimize.
[2024-05-25 13:25:22] [INFO ] Deduced a trap composed of 48 places in 305 ms of which 0 ms to minimize.
[2024-05-25 13:25:22] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2024-05-25 13:25:23] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 1 ms to minimize.
[2024-05-25 13:25:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1586 ms
[2024-05-25 13:25:23] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 232 ms.
[2024-05-25 13:25:23] [INFO ] Added : 4 causal constraints over 1 iterations in 565 ms. Result :sat
Minimization took 486 ms.
[2024-05-25 13:25:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:24] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-25 13:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:25] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2024-05-25 13:25:25] [INFO ] [Nat]Added 255 Read/Feed constraints in 219 ms returned sat
[2024-05-25 13:25:25] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 1 ms to minimize.
[2024-05-25 13:25:26] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 0 ms to minimize.
[2024-05-25 13:25:26] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2024-05-25 13:25:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 851 ms
[2024-05-25 13:25:26] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 240 ms.
[2024-05-25 13:25:27] [INFO ] Added : 10 causal constraints over 3 iterations in 844 ms. Result :sat
Minimization took 320 ms.
[2024-05-25 13:25:27] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:25:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:28] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2024-05-25 13:25:28] [INFO ] [Real]Added 255 Read/Feed constraints in 39 ms returned sat
[2024-05-25 13:25:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:28] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-05-25 13:25:29] [INFO ] [Nat]Added 255 Read/Feed constraints in 56 ms returned sat
[2024-05-25 13:25:29] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 1 ms to minimize.
[2024-05-25 13:25:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2024-05-25 13:25:29] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 248 ms.
[2024-05-25 13:25:30] [INFO ] Added : 2 causal constraints over 1 iterations in 545 ms. Result :sat
Minimization took 453 ms.
[2024-05-25 13:25:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:31] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2024-05-25 13:25:31] [INFO ] [Real]Added 255 Read/Feed constraints in 53 ms returned sat
[2024-05-25 13:25:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:31] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-05-25 13:25:31] [INFO ] [Nat]Added 255 Read/Feed constraints in 41 ms returned sat
[2024-05-25 13:25:31] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 196 ms.
[2024-05-25 13:25:32] [INFO ] Added : 2 causal constraints over 1 iterations in 510 ms. Result :sat
Minimization took 201 ms.
[2024-05-25 13:25:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:33] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2024-05-25 13:25:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:33] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-05-25 13:25:33] [INFO ] [Nat]Added 255 Read/Feed constraints in 111 ms returned sat
[2024-05-25 13:25:34] [INFO ] Deduced a trap composed of 40 places in 422 ms of which 2 ms to minimize.
[2024-05-25 13:25:34] [INFO ] Deduced a trap composed of 48 places in 349 ms of which 0 ms to minimize.
[2024-05-25 13:25:35] [INFO ] Deduced a trap composed of 98 places in 416 ms of which 0 ms to minimize.
[2024-05-25 13:25:35] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 1 ms to minimize.
[2024-05-25 13:25:35] [INFO ] Deduced a trap composed of 108 places in 400 ms of which 1 ms to minimize.
[2024-05-25 13:25:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2317 ms
[2024-05-25 13:25:36] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 209 ms.
[2024-05-25 13:25:36] [INFO ] Added : 2 causal constraints over 1 iterations in 564 ms. Result :sat
Minimization took 376 ms.
[2024-05-25 13:25:37] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:37] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2024-05-25 13:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:38] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-25 13:25:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 54 ms returned sat
[2024-05-25 13:25:38] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 0 ms to minimize.
[2024-05-25 13:25:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2024-05-25 13:25:38] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 215 ms.
[2024-05-25 13:25:39] [INFO ] Added : 1 causal constraints over 1 iterations in 550 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, -1, -1, -1, 1] Max seen :[0, 0, 0, 0, 1, 5422, 0, 0]
Support contains 8 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 46 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 46 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2024-05-25 13:25:51] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:25:51] [INFO ] Invariant cache hit.
[2024-05-25 13:25:52] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 13:25:52] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:25:52] [INFO ] Invariant cache hit.
[2024-05-25 13:25:52] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:25:53] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
[2024-05-25 13:25:54] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-25 13:25:54] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:25:54] [INFO ] Invariant cache hit.
[2024-05-25 13:25:54] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3079 ms. Remains : 230/230 places, 2765/2765 transitions.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-02
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:25:54] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2024-05-25 13:25:55] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:25:55] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 13:25:55] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:55] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-25 13:25:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:25:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:25:56] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-25 13:25:56] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:25:56] [INFO ] [Nat]Added 255 Read/Feed constraints in 174 ms returned sat
[2024-05-25 13:25:56] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 0 ms to minimize.
[2024-05-25 13:25:56] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 1 ms to minimize.
[2024-05-25 13:25:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 798 ms
[2024-05-25 13:25:57] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 247 ms.
[2024-05-25 13:25:58] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 0 ms to minimize.
[2024-05-25 13:25:59] [INFO ] Deduced a trap composed of 61 places in 259 ms of which 1 ms to minimize.
[2024-05-25 13:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 833 ms
[2024-05-25 13:25:59] [INFO ] Added : 19 causal constraints over 7 iterations in 2519 ms. Result :sat
Minimization took 351 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 80 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:00] [INFO ] Computed 8 invariants in 41 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2073 ms. (steps per millisecond=482 ) properties (out of 1) seen :0
[2024-05-25 13:26:03] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:03] [INFO ] Computed 8 invariants in 33 ms
[2024-05-25 13:26:03] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:03] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-25 13:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:04] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-25 13:26:04] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:04] [INFO ] [Nat]Added 240 Read/Feed constraints in 156 ms returned sat
[2024-05-25 13:26:04] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2024-05-25 13:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2024-05-25 13:26:04] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 235 ms.
[2024-05-25 13:26:05] [INFO ] Added : 15 causal constraints over 3 iterations in 879 ms. Result :sat
Minimization took 389 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 53 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:26:06] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:06] [INFO ] Invariant cache hit.
[2024-05-25 13:26:06] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-25 13:26:06] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:06] [INFO ] Invariant cache hit.
[2024-05-25 13:26:07] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:08] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2024-05-25 13:26:08] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-25 13:26:08] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:08] [INFO ] Invariant cache hit.
[2024-05-25 13:26:09] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2898 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-02 in 14366 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-06
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:09] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10067 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=592 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
[2024-05-25 13:26:09] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:09] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 13:26:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:09] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2024-05-25 13:26:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:10] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-05-25 13:26:10] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:26:10] [INFO ] [Nat]Added 255 Read/Feed constraints in 169 ms returned sat
[2024-05-25 13:26:10] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2024-05-25 13:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2024-05-25 13:26:11] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 226 ms.
[2024-05-25 13:26:11] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2024-05-25 13:26:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-25 13:26:11] [INFO ] Added : 9 causal constraints over 2 iterations in 1052 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 46 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 230/230 places, 2765/2765 transitions.
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:12] [INFO ] Computed 8 invariants in 13 ms
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2007 ms. (steps per millisecond=498 ) properties (out of 1) seen :0
[2024-05-25 13:26:15] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:15] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 13:26:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:15] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-05-25 13:26:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:16] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2024-05-25 13:26:16] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:26:16] [INFO ] [Nat]Added 255 Read/Feed constraints in 130 ms returned sat
[2024-05-25 13:26:16] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 0 ms to minimize.
[2024-05-25 13:26:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 394 ms
[2024-05-25 13:26:17] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 183 ms.
[2024-05-25 13:26:17] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-25 13:26:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-25 13:26:17] [INFO ] Added : 9 causal constraints over 2 iterations in 908 ms. Result :sat
Minimization took 367 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 42 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 230/230 places, 2765/2765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Applied a total of 0 rules in 48 ms. Remains 230 /230 variables (removed 0) and now considering 2765/2765 (removed 0) transitions.
[2024-05-25 13:26:18] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:26:18] [INFO ] Invariant cache hit.
[2024-05-25 13:26:18] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-25 13:26:18] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:26:18] [INFO ] Invariant cache hit.
[2024-05-25 13:26:19] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:26:20] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-25 13:26:20] [INFO ] Redundant transitions in 93 ms returned []
[2024-05-25 13:26:20] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
[2024-05-25 13:26:20] [INFO ] Invariant cache hit.
[2024-05-25 13:26:21] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3223 ms. Remains : 230/230 places, 2765/2765 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-06 in 12350 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-09
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:21] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 10077 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1439 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2024-05-25 13:26:21] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:21] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 13:26:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:22] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2024-05-25 13:26:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:22] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2024-05-25 13:26:22] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:26:22] [INFO ] [Nat]Added 255 Read/Feed constraints in 126 ms returned sat
[2024-05-25 13:26:23] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2024-05-25 13:26:23] [INFO ] Deduced a trap composed of 48 places in 309 ms of which 2 ms to minimize.
[2024-05-25 13:26:23] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 0 ms to minimize.
[2024-05-25 13:26:24] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 0 ms to minimize.
[2024-05-25 13:26:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1596 ms
[2024-05-25 13:26:24] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 229 ms.
[2024-05-25 13:26:24] [INFO ] Added : 4 causal constraints over 1 iterations in 529 ms. Result :sat
Minimization took 464 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 70 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:25] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 1000059 steps, including 2 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1990 ms. (steps per millisecond=502 ) properties (out of 1) seen :0
[2024-05-25 13:26:28] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:28] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 13:26:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:29] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2024-05-25 13:26:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:29] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2024-05-25 13:26:29] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:29] [INFO ] [Nat]Added 240 Read/Feed constraints in 118 ms returned sat
[2024-05-25 13:26:30] [INFO ] Deduced a trap composed of 34 places in 442 ms of which 0 ms to minimize.
[2024-05-25 13:26:30] [INFO ] Deduced a trap composed of 48 places in 340 ms of which 0 ms to minimize.
[2024-05-25 13:26:30] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 0 ms to minimize.
[2024-05-25 13:26:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1196 ms
[2024-05-25 13:26:31] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 177 ms.
[2024-05-25 13:26:31] [INFO ] Added : 3 causal constraints over 1 iterations in 400 ms. Result :sat
Minimization took 448 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:26:32] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:32] [INFO ] Invariant cache hit.
[2024-05-25 13:26:32] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 13:26:32] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:32] [INFO ] Invariant cache hit.
[2024-05-25 13:26:32] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:34] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2024-05-25 13:26:34] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-25 13:26:34] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:34] [INFO ] Invariant cache hit.
[2024-05-25 13:26:34] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2745 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-09 in 13219 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-10
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:34] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 10016 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=910 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2024-05-25 13:26:34] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:34] [INFO ] Computed 8 invariants in 18 ms
[2024-05-25 13:26:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:35] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2024-05-25 13:26:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:35] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2024-05-25 13:26:35] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:26:36] [INFO ] [Nat]Added 255 Read/Feed constraints in 171 ms returned sat
[2024-05-25 13:26:36] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2024-05-25 13:26:36] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 0 ms to minimize.
[2024-05-25 13:26:36] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-05-25 13:26:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 699 ms
[2024-05-25 13:26:36] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 188 ms.
[2024-05-25 13:26:37] [INFO ] Added : 10 causal constraints over 3 iterations in 764 ms. Result :sat
Minimization took 289 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 64 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:38] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 1000103 steps, including 2 resets, run finished after 817 ms. (steps per millisecond=1224 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2141 ms. (steps per millisecond=467 ) properties (out of 1) seen :0
[2024-05-25 13:26:41] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:41] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 13:26:41] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:41] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2024-05-25 13:26:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:41] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-05-25 13:26:42] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:42] [INFO ] [Nat]Added 240 Read/Feed constraints in 144 ms returned sat
[2024-05-25 13:26:42] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 0 ms to minimize.
[2024-05-25 13:26:42] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2024-05-25 13:26:43] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 0 ms to minimize.
[2024-05-25 13:26:43] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2024-05-25 13:26:43] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2024-05-25 13:26:43] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 3 ms to minimize.
[2024-05-25 13:26:44] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 0 ms to minimize.
[2024-05-25 13:26:44] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 1 ms to minimize.
[2024-05-25 13:26:44] [INFO ] Deduced a trap composed of 65 places in 220 ms of which 0 ms to minimize.
[2024-05-25 13:26:45] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 1 ms to minimize.
[2024-05-25 13:26:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2982 ms
[2024-05-25 13:26:45] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 237 ms.
[2024-05-25 13:26:45] [INFO ] Added : 8 causal constraints over 2 iterations in 581 ms. Result :sat
Minimization took 359 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:26:46] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:46] [INFO ] Invariant cache hit.
[2024-05-25 13:26:46] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-25 13:26:46] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:46] [INFO ] Invariant cache hit.
[2024-05-25 13:26:47] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:48] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2024-05-25 13:26:48] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-25 13:26:48] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:26:48] [INFO ] Invariant cache hit.
[2024-05-25 13:26:49] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2718 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-10 in 14215 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-12
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:49] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 10095 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2024-05-25 13:26:49] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:26:49] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:26:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:49] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2024-05-25 13:26:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:26:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:49] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2024-05-25 13:26:49] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:26:49] [INFO ] [Nat]Added 255 Read/Feed constraints in 34 ms returned sat
[2024-05-25 13:26:50] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 1 ms to minimize.
[2024-05-25 13:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2024-05-25 13:26:50] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 188 ms.
[2024-05-25 13:26:51] [INFO ] Deduced a trap composed of 50 places in 193 ms of which 1 ms to minimize.
[2024-05-25 13:26:51] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 0 ms to minimize.
[2024-05-25 13:26:52] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 0 ms to minimize.
[2024-05-25 13:26:52] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2024-05-25 13:26:52] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 1 ms to minimize.
[2024-05-25 13:26:52] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 0 ms to minimize.
[2024-05-25 13:26:53] [INFO ] Deduced a trap composed of 54 places in 244 ms of which 1 ms to minimize.
[2024-05-25 13:26:53] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 0 ms to minimize.
[2024-05-25 13:26:53] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 0 ms to minimize.
[2024-05-25 13:26:54] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 1 ms to minimize.
[2024-05-25 13:26:54] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 0 ms to minimize.
[2024-05-25 13:26:54] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 0 ms to minimize.
[2024-05-25 13:26:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 47 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:54] [INFO ] Computed 8 invariants in 8 ms
Incomplete random walk after 1000120 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=1541 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2087 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
[2024-05-25 13:26:57] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:26:57] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:26:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:58] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-05-25 13:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:26:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:26:58] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-25 13:26:58] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:26:58] [INFO ] [Nat]Added 240 Read/Feed constraints in 40 ms returned sat
[2024-05-25 13:26:58] [INFO ] Deduced a trap composed of 11 places in 271 ms of which 0 ms to minimize.
[2024-05-25 13:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2024-05-25 13:26:59] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 234 ms.
[2024-05-25 13:26:59] [INFO ] Added : 2 causal constraints over 1 iterations in 535 ms. Result :sat
Minimization took 3009 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 69 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 51 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:27:02] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:02] [INFO ] Invariant cache hit.
[2024-05-25 13:27:03] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-25 13:27:03] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:03] [INFO ] Invariant cache hit.
[2024-05-25 13:27:03] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:04] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2024-05-25 13:27:04] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-25 13:27:04] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:04] [INFO ] Invariant cache hit.
[2024-05-25 13:27:05] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-12 in 16466 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-13
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:27:05] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :56
[2024-05-25 13:27:05] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:27:05] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 13:27:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:06] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2024-05-25 13:27:06] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:27:06] [INFO ] [Real]Added 255 Read/Feed constraints in 63 ms returned sat
[2024-05-25 13:27:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:27:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:06] [INFO ] [Nat]Absence check using state equation in 334 ms returned sat
[2024-05-25 13:27:06] [INFO ] [Nat]Added 255 Read/Feed constraints in 39 ms returned sat
[2024-05-25 13:27:06] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 196 ms.
[2024-05-25 13:27:07] [INFO ] Added : 2 causal constraints over 1 iterations in 372 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[56]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 53 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:07] [INFO ] Computed 8 invariants in 15 ms
Incomplete random walk after 1000069 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1087 ) properties (out of 1) seen :319
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1907 ms. (steps per millisecond=524 ) properties (out of 1) seen :27
[2024-05-25 13:27:10] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:10] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:27:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:10] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-05-25 13:27:10] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:10] [INFO ] [Real]Added 240 Read/Feed constraints in 53 ms returned sat
[2024-05-25 13:27:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:27:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:11] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-25 13:27:11] [INFO ] [Nat]Added 240 Read/Feed constraints in 37 ms returned sat
[2024-05-25 13:27:11] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 182 ms.
[2024-05-25 13:27:11] [INFO ] Added : 1 causal constraints over 1 iterations in 352 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[319]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 43 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:27:12] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:12] [INFO ] Invariant cache hit.
[2024-05-25 13:27:12] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-25 13:27:12] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:12] [INFO ] Invariant cache hit.
[2024-05-25 13:27:13] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:14] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2024-05-25 13:27:14] [INFO ] Redundant transitions in 54 ms returned []
[2024-05-25 13:27:14] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:14] [INFO ] Invariant cache hit.
[2024-05-25 13:27:15] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2670 ms. Remains : 229/229 places, 2746/2746 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:15] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 1000074 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 1) seen :339
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1962 ms. (steps per millisecond=509 ) properties (out of 1) seen :5314
[2024-05-25 13:27:17] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:17] [INFO ] Computed 8 invariants in 16 ms
[2024-05-25 13:27:17] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:18] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2024-05-25 13:27:18] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:18] [INFO ] [Real]Added 240 Read/Feed constraints in 35 ms returned sat
[2024-05-25 13:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:27:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:18] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-05-25 13:27:18] [INFO ] [Nat]Added 240 Read/Feed constraints in 42 ms returned sat
[2024-05-25 13:27:19] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 185 ms.
[2024-05-25 13:27:19] [INFO ] Added : 1 causal constraints over 1 iterations in 375 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5314]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 33 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 32 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:27:30] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:30] [INFO ] Invariant cache hit.
[2024-05-25 13:27:31] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-25 13:27:31] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:31] [INFO ] Invariant cache hit.
[2024-05-25 13:27:31] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:32] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
[2024-05-25 13:27:32] [INFO ] Redundant transitions in 78 ms returned []
[2024-05-25 13:27:32] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:32] [INFO ] Invariant cache hit.
[2024-05-25 13:27:33] [INFO ] Dead Transitions using invariants and state equation in 917 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2935 ms. Remains : 229/229 places, 2746/2746 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:33] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 1000028 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 1) seen :227
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties (out of 1) seen :55
[2024-05-25 13:27:36] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:36] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:27:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:36] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-25 13:27:36] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:36] [INFO ] [Real]Added 240 Read/Feed constraints in 43 ms returned sat
[2024-05-25 13:27:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:27:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:37] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-25 13:27:37] [INFO ] [Nat]Added 240 Read/Feed constraints in 35 ms returned sat
[2024-05-25 13:27:37] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 195 ms.
[2024-05-25 13:27:37] [INFO ] Added : 1 causal constraints over 1 iterations in 424 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5314]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 72 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:27:49] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:49] [INFO ] Invariant cache hit.
[2024-05-25 13:27:49] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-25 13:27:49] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:49] [INFO ] Invariant cache hit.
[2024-05-25 13:27:49] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:27:50] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2024-05-25 13:27:51] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-25 13:27:51] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:27:51] [INFO ] Invariant cache hit.
[2024-05-25 13:27:51] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2846 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-13 in 46327 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-14
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:27:51] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 10092 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1261 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2024-05-25 13:27:51] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:27:51] [INFO ] Computed 8 invariants in 15 ms
[2024-05-25 13:27:52] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:52] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2024-05-25 13:27:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:27:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:27:52] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2024-05-25 13:27:52] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:27:53] [INFO ] [Nat]Added 255 Read/Feed constraints in 112 ms returned sat
[2024-05-25 13:27:53] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 0 ms to minimize.
[2024-05-25 13:27:53] [INFO ] Deduced a trap composed of 48 places in 408 ms of which 1 ms to minimize.
[2024-05-25 13:27:54] [INFO ] Deduced a trap composed of 98 places in 420 ms of which 0 ms to minimize.
[2024-05-25 13:27:54] [INFO ] Deduced a trap composed of 50 places in 284 ms of which 1 ms to minimize.
[2024-05-25 13:27:55] [INFO ] Deduced a trap composed of 108 places in 394 ms of which 0 ms to minimize.
[2024-05-25 13:27:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2337 ms
[2024-05-25 13:27:55] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 253 ms.
[2024-05-25 13:27:55] [INFO ] Added : 2 causal constraints over 1 iterations in 557 ms. Result :sat
Minimization took 413 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 59 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:56] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 1000122 steps, including 2 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
[2024-05-25 13:27:59] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:27:59] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:27:59] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:28:00] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-25 13:28:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:28:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:28:00] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-05-25 13:28:00] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:28:00] [INFO ] [Nat]Added 240 Read/Feed constraints in 115 ms returned sat
[2024-05-25 13:28:01] [INFO ] Deduced a trap composed of 31 places in 391 ms of which 1 ms to minimize.
[2024-05-25 13:28:01] [INFO ] Deduced a trap composed of 10 places in 411 ms of which 0 ms to minimize.
[2024-05-25 13:28:02] [INFO ] Deduced a trap composed of 10 places in 412 ms of which 0 ms to minimize.
[2024-05-25 13:28:02] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 1 ms to minimize.
[2024-05-25 13:28:03] [INFO ] Deduced a trap composed of 10 places in 400 ms of which 0 ms to minimize.
[2024-05-25 13:28:03] [INFO ] Deduced a trap composed of 70 places in 350 ms of which 1 ms to minimize.
[2024-05-25 13:28:04] [INFO ] Deduced a trap composed of 27 places in 434 ms of which 1 ms to minimize.
[2024-05-25 13:28:04] [INFO ] Deduced a trap composed of 9 places in 330 ms of which 1 ms to minimize.
[2024-05-25 13:28:04] [INFO ] Deduced a trap composed of 21 places in 369 ms of which 1 ms to minimize.
[2024-05-25 13:28:05] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 0 ms to minimize.
[2024-05-25 13:28:05] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 0 ms to minimize.
[2024-05-25 13:28:06] [INFO ] Deduced a trap composed of 64 places in 370 ms of which 1 ms to minimize.
[2024-05-25 13:28:06] [INFO ] Deduced a trap composed of 49 places in 316 ms of which 0 ms to minimize.
[2024-05-25 13:28:06] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 0 ms to minimize.
[2024-05-25 13:28:07] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 0 ms to minimize.
[2024-05-25 13:28:07] [INFO ] Deduced a trap composed of 81 places in 368 ms of which 0 ms to minimize.
[2024-05-25 13:28:08] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 0 ms to minimize.
[2024-05-25 13:28:08] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7697 ms
[2024-05-25 13:28:08] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 250 ms.
[2024-05-25 13:28:09] [INFO ] Added : 3 causal constraints over 1 iterations in 592 ms. Result :sat
Minimization took 384 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 66 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 58 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:28:09] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:28:09] [INFO ] Invariant cache hit.
[2024-05-25 13:28:10] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-25 13:28:10] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:28:10] [INFO ] Invariant cache hit.
[2024-05-25 13:28:10] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:28:11] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2024-05-25 13:28:11] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-25 13:28:11] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:28:11] [INFO ] Invariant cache hit.
[2024-05-25 13:28:12] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-14 in 20721 ms.
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-15
Normalized transition count is 2634 out of 2765 initially.
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:28:12] [INFO ] Computed 8 invariants in 7 ms
Incomplete random walk after 10053 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2024-05-25 13:28:12] [INFO ] Flow matrix only has 2634 transitions (discarded 131 similar events)
// Phase 1: matrix 2634 rows 230 cols
[2024-05-25 13:28:12] [INFO ] Computed 8 invariants in 7 ms
[2024-05-25 13:28:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:28:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:28:13] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2024-05-25 13:28:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:28:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:28:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:28:13] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-05-25 13:28:13] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-25 13:28:13] [INFO ] [Nat]Added 255 Read/Feed constraints in 44 ms returned sat
[2024-05-25 13:28:13] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 0 ms to minimize.
[2024-05-25 13:28:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2024-05-25 13:28:14] [INFO ] Computed and/alt/rep : 345/1349/345 causal constraints (skipped 2288 transitions) in 177 ms.
[2024-05-25 13:28:14] [INFO ] Added : 1 causal constraints over 1 iterations in 356 ms. Result :sat
Minimization took 195 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2765/2765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 2746
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2746
Applied a total of 2 rules in 58 ms. Remains 229 /230 variables (removed 1) and now considering 2746/2765 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 229/230 places, 2746/2765 transitions.
Normalized transition count is 2618 out of 2746 initially.
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:28:14] [INFO ] Computed 8 invariants in 17 ms
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1966 ms. (steps per millisecond=508 ) properties (out of 1) seen :0
[2024-05-25 13:28:17] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-25 13:28:17] [INFO ] Computed 8 invariants in 16 ms
[2024-05-25 13:28:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:28:17] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-05-25 13:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:28:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:28:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:28:18] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-25 13:28:18] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:28:18] [INFO ] [Nat]Added 240 Read/Feed constraints in 40 ms returned sat
[2024-05-25 13:28:18] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2024-05-25 13:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2024-05-25 13:28:18] [INFO ] Computed and/alt/rep : 343/1317/343 causal constraints (skipped 2274 transitions) in 198 ms.
[2024-05-25 13:28:19] [INFO ] Added : 2 causal constraints over 1 iterations in 391 ms. Result :sat
Minimization took 287 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2746/2746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2746/2746 transitions.
Applied a total of 0 rules in 43 ms. Remains 229 /229 variables (removed 0) and now considering 2746/2746 (removed 0) transitions.
[2024-05-25 13:28:19] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:28:19] [INFO ] Invariant cache hit.
[2024-05-25 13:28:20] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-25 13:28:20] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:28:20] [INFO ] Invariant cache hit.
[2024-05-25 13:28:20] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-05-25 13:28:21] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2024-05-25 13:28:21] [INFO ] Redundant transitions in 77 ms returned []
[2024-05-25 13:28:21] [INFO ] Flow matrix only has 2618 transitions (discarded 128 similar events)
[2024-05-25 13:28:21] [INFO ] Invariant cache hit.
[2024-05-25 13:28:22] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2927 ms. Remains : 229/229 places, 2746/2746 transitions.
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-15 in 9988 ms.
[2024-05-25 13:28:23] [INFO ] Flatten gal took : 238 ms
[2024-05-25 13:28:23] [INFO ] Applying decomposition
[2024-05-25 13:28:23] [INFO ] Flatten gal took : 156 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3631020941920224209.txt' '-o' '/tmp/graph3631020941920224209.bin' '-w' '/tmp/graph3631020941920224209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3631020941920224209.bin' '-l' '-1' '-v' '-w' '/tmp/graph3631020941920224209.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:28:23] [INFO ] Decomposing Gal with order
[2024-05-25 13:28:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:28:23] [INFO ] Removed a total of 299 redundant transitions.
[2024-05-25 13:28:24] [INFO ] Flatten gal took : 276 ms
[2024-05-25 13:28:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 18 ms.
[2024-05-25 13:28:24] [INFO ] Time to serialize gal into /tmp/UpperBounds5841409783631666608.gal : 44 ms
[2024-05-25 13:28:24] [INFO ] Time to serialize properties into /tmp/UpperBounds1780769745990557904.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5841409783631666608.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1780769745990557904.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds1780769745990557904.prop.
Detected timeout of ITS tools.
[2024-05-25 13:50:05] [INFO ] Flatten gal took : 677 ms
[2024-05-25 13:50:05] [INFO ] Time to serialize gal into /tmp/UpperBounds8143886317379296575.gal : 152 ms
[2024-05-25 13:50:05] [INFO ] Time to serialize properties into /tmp/UpperBounds16928330360534133534.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8143886317379296575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16928330360534133534.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds16928330360534133534.prop.
Detected timeout of ITS tools.
[2024-05-25 14:11:42] [INFO ] Flatten gal took : 621 ms
[2024-05-25 14:11:44] [INFO ] Input system was already deterministic with 2765 transitions.
[2024-05-25 14:11:44] [INFO ] Transformed 230 places.
[2024-05-25 14:11:44] [INFO ] Transformed 2765 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 14:11:44] [INFO ] Time to serialize gal into /tmp/UpperBounds4285813997429856612.gal : 13 ms
[2024-05-25 14:11:44] [INFO ] Time to serialize properties into /tmp/UpperBounds10425015985518267091.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4285813997429856612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10425015985518267091.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10425015985518267091.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8199116 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16118012 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-q3m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BugTracking-PT-q3m128, 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 r065-tajo-171620414700231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m128.tgz
mv BugTracking-PT-q3m128 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;