About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.039 | 3600000.00 | 2310398.00 | 850501.10 | 1 ? 1 1 1 1 ? 1 1 1 1 1 1 1 ? 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821200693.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200693
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 13K Apr 29 16:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 16:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.7M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652833377854
Running Version 202205111006
[2022-05-18 00:22:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 00:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:22:59] [INFO ] Load time of PNML (sax parser for PT used): 428 ms
[2022-05-18 00:22:59] [INFO ] Transformed 6222 places.
[2022-05-18 00:22:59] [INFO ] Transformed 8685 transitions.
[2022-05-18 00:22:59] [INFO ] Parsed PT model containing 6222 places and 8685 transitions in 570 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 8413 out of 8685 initially.
// Phase 1: matrix 8413 rows 6222 cols
[2022-05-18 00:23:00] [INFO ] Computed 611 place invariants in 449 ms
Incomplete random walk after 10000 steps, including 138 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :3
[2022-05-18 00:23:01] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2022-05-18 00:23:01] [INFO ] Computed 611 place invariants in 264 ms
[2022-05-18 00:23:02] [INFO ] [Real]Absence check using 52 positive place invariants in 91 ms returned sat
[2022-05-18 00:23:02] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 136 ms returned unsat
[2022-05-18 00:23:02] [INFO ] [Real]Absence check using 52 positive place invariants in 85 ms returned sat
[2022-05-18 00:23:03] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 251 ms returned sat
[2022-05-18 00:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:23:07] [INFO ] [Real]Absence check using state equation in 4073 ms returned unknown
[2022-05-18 00:23:07] [INFO ] [Real]Absence check using 52 positive place invariants in 75 ms returned sat
[2022-05-18 00:23:08] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 137 ms returned unsat
[2022-05-18 00:23:08] [INFO ] [Real]Absence check using 52 positive place invariants in 74 ms returned sat
[2022-05-18 00:23:08] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 175 ms returned unsat
[2022-05-18 00:23:09] [INFO ] [Real]Absence check using 52 positive place invariants in 73 ms returned sat
[2022-05-18 00:23:09] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 249 ms returned sat
[2022-05-18 00:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:23:13] [INFO ] [Real]Absence check using state equation in 4113 ms returned unknown
[2022-05-18 00:23:14] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2022-05-18 00:23:14] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 151 ms returned unsat
[2022-05-18 00:23:15] [INFO ] [Real]Absence check using 52 positive place invariants in 67 ms returned sat
[2022-05-18 00:23:15] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 230 ms returned sat
[2022-05-18 00:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:23:19] [INFO ] [Real]Absence check using state equation in 4192 ms returned unknown
[2022-05-18 00:23:20] [INFO ] [Real]Absence check using 52 positive place invariants in 67 ms returned sat
[2022-05-18 00:23:20] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 129 ms returned unsat
[2022-05-18 00:23:20] [INFO ] [Real]Absence check using 52 positive place invariants in 65 ms returned sat
[2022-05-18 00:23:21] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 130 ms returned unsat
[2022-05-18 00:23:21] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2022-05-18 00:23:21] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 242 ms returned sat
[2022-05-18 00:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:23:26] [INFO ] [Real]Absence check using state equation in 4173 ms returned unknown
[2022-05-18 00:23:26] [INFO ] [Real]Absence check using 52 positive place invariants in 68 ms returned sat
[2022-05-18 00:23:26] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 129 ms returned unsat
[2022-05-18 00:23:27] [INFO ] [Real]Absence check using 52 positive place invariants in 67 ms returned sat
[2022-05-18 00:23:27] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 177 ms returned unsat
[2022-05-18 00:23:28] [INFO ] [Real]Absence check using 52 positive place invariants in 70 ms returned sat
[2022-05-18 00:23:28] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 134 ms returned unsat
[2022-05-18 00:23:28] [INFO ] [Real]Absence check using 52 positive place invariants in 76 ms returned sat
[2022-05-18 00:23:28] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 134 ms returned unsat
[2022-05-18 00:23:29] [INFO ] [Real]Absence check using 52 positive place invariants in 72 ms returned sat
[2022-05-18 00:23:29] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 243 ms returned sat
[2022-05-18 00:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:23:33] [INFO ] [Real]Absence check using state equation in 4142 ms returned unknown
[2022-05-18 00:23:34] [INFO ] [Real]Absence check using 52 positive place invariants in 75 ms returned sat
[2022-05-18 00:23:34] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 130 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 51, 1, 1, 17, 1, 17, 1, 1, 17, 1, 1, 1, 1, 17, 1] Max seen :[1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 6222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.30 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1900 transitions
Trivial Post-agglo rules discarded 1900 transitions
Performed 1900 trivial Post agglomeration. Transition count delta: 1900
Iterating post reduction 0 with 1900 rules applied. Total rules applied 1901 place count 6188 transition count 6785
Reduce places removed 1900 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1901 rules applied. Total rules applied 3802 place count 4288 transition count 6784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3803 place count 4287 transition count 6784
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 3803 place count 4287 transition count 6546
Deduced a syphon composed of 238 places in 4 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 4279 place count 4049 transition count 6546
Discarding 1662 places :
Symmetric choice reduction at 3 with 1662 rule applications. Total rules 5941 place count 2387 transition count 4884
Iterating global reduction 3 with 1662 rules applied. Total rules applied 7603 place count 2387 transition count 4884
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 7603 place count 2387 transition count 4872
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 7627 place count 2375 transition count 4872
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 7861 place count 2141 transition count 3234
Iterating global reduction 3 with 234 rules applied. Total rules applied 8095 place count 2141 transition count 3234
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8129 place count 2124 transition count 3217
Free-agglomeration rule (complex) applied 164 times.
Iterating global reduction 3 with 164 rules applied. Total rules applied 8293 place count 2124 transition count 4457
Reduce places removed 164 places and 0 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 8457 place count 1960 transition count 4457
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 8491 place count 1960 transition count 4457
Applied a total of 8491 rules in 1814 ms. Remains 1960 /6222 variables (removed 4262) and now considering 4457/8685 (removed 4228) transitions.
Finished structural reductions, in 1 iterations. Remains : 1960/6222 places, 4457/8685 transitions.
Normalized transition count is 4059 out of 4457 initially.
// Phase 1: matrix 4059 rows 1960 cols
[2022-05-18 00:23:36] [INFO ] Computed 577 place invariants in 61 ms
Incomplete random walk after 1000000 steps, including 22911 resets, run finished after 17960 ms. (steps per millisecond=55 ) properties (out of 5) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 4036 ms. (steps per millisecond=247 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4298 resets, run finished after 3950 ms. (steps per millisecond=253 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 3993 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 3966 ms. (steps per millisecond=252 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-18 00:24:10] [INFO ] Flow matrix only has 4059 transitions (discarded 398 similar events)
// Phase 1: matrix 4059 rows 1960 cols
[2022-05-18 00:24:10] [INFO ] Computed 577 place invariants in 84 ms
[2022-05-18 00:24:10] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2022-05-18 00:24:10] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 94 ms returned sat
[2022-05-18 00:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:12] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2022-05-18 00:24:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:24:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2022-05-18 00:24:12] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 101 ms returned sat
[2022-05-18 00:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:14] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2022-05-18 00:24:14] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:24:14] [INFO ] [Nat]Added 2450 Read/Feed constraints in 605 ms returned sat
[2022-05-18 00:24:16] [INFO ] Deduced a trap composed of 284 places in 1467 ms of which 5 ms to minimize.
[2022-05-18 00:24:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2197 ms
[2022-05-18 00:24:17] [INFO ] Computed and/alt/rep : 1649/4167/1649 causal constraints (skipped 2393 transitions) in 384 ms.
[2022-05-18 00:24:18] [INFO ] Added : 17 causal constraints over 4 iterations in 1612 ms. Result :sat
[2022-05-18 00:24:19] [INFO ] [Real]Absence check using 33 positive place invariants in 46 ms returned sat
[2022-05-18 00:24:19] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 98 ms returned sat
[2022-05-18 00:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:20] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2022-05-18 00:24:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:24:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2022-05-18 00:24:20] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 101 ms returned sat
[2022-05-18 00:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:21] [INFO ] [Nat]Absence check using state equation in 1009 ms returned sat
[2022-05-18 00:24:22] [INFO ] [Nat]Added 2450 Read/Feed constraints in 274 ms returned sat
[2022-05-18 00:24:23] [INFO ] Deduced a trap composed of 248 places in 1487 ms of which 4 ms to minimize.
[2022-05-18 00:24:25] [INFO ] Deduced a trap composed of 186 places in 1443 ms of which 2 ms to minimize.
[2022-05-18 00:24:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3622 ms
[2022-05-18 00:24:25] [INFO ] Computed and/alt/rep : 1649/4167/1649 causal constraints (skipped 2393 transitions) in 250 ms.
[2022-05-18 00:24:26] [INFO ] Added : 16 causal constraints over 4 iterations in 1219 ms. Result :sat
[2022-05-18 00:24:27] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2022-05-18 00:24:27] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 93 ms returned sat
[2022-05-18 00:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:28] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2022-05-18 00:24:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:24:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2022-05-18 00:24:28] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 89 ms returned sat
[2022-05-18 00:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:24:29] [INFO ] [Nat]Absence check using state equation in 1012 ms returned sat
[2022-05-18 00:24:30] [INFO ] [Nat]Added 2450 Read/Feed constraints in 294 ms returned sat
[2022-05-18 00:24:31] [INFO ] Deduced a trap composed of 225 places in 1404 ms of which 4 ms to minimize.
[2022-05-18 00:24:33] [INFO ] Deduced a trap composed of 182 places in 1420 ms of which 2 ms to minimize.
[2022-05-18 00:24:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3380 ms
[2022-05-18 00:24:33] [INFO ] Computed and/alt/rep : 1649/4167/1649 causal constraints (skipped 2393 transitions) in 265 ms.
[2022-05-18 00:24:34] [INFO ] Added : 16 causal constraints over 4 iterations in 1218 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1960 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1960/1960 places, 4457/4457 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1960 transition count 4456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1959 transition count 4456
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1959 transition count 4456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1958 transition count 4455
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1958 transition count 4455
Applied a total of 5 rules in 338 ms. Remains 1958 /1960 variables (removed 2) and now considering 4455/4457 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1958/1960 places, 4455/4457 transitions.
Normalized transition count is 4057 out of 4455 initially.
// Phase 1: matrix 4057 rows 1958 cols
[2022-05-18 00:24:35] [INFO ] Computed 577 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 22912 resets, run finished after 17738 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4299 resets, run finished after 4016 ms. (steps per millisecond=249 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4298 resets, run finished after 4002 ms. (steps per millisecond=249 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4299 resets, run finished after 4002 ms. (steps per millisecond=249 ) properties (out of 3) seen :0
[2022-05-18 00:25:05] [INFO ] Flow matrix only has 4057 transitions (discarded 398 similar events)
// Phase 1: matrix 4057 rows 1958 cols
[2022-05-18 00:25:05] [INFO ] Computed 577 place invariants in 53 ms
[2022-05-18 00:25:05] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2022-05-18 00:25:05] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 96 ms returned sat
[2022-05-18 00:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:25:07] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2022-05-18 00:25:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:25:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2022-05-18 00:25:07] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 99 ms returned sat
[2022-05-18 00:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:25:08] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2022-05-18 00:25:08] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:25:09] [INFO ] [Nat]Added 2450 Read/Feed constraints in 407 ms returned sat
[2022-05-18 00:25:09] [INFO ] Computed and/alt/rep : 1647/4164/1647 causal constraints (skipped 2393 transitions) in 247 ms.
[2022-05-18 00:25:10] [INFO ] Added : 14 causal constraints over 3 iterations in 1208 ms. Result :sat
[2022-05-18 00:25:10] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-05-18 00:25:10] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 97 ms returned sat
[2022-05-18 00:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:25:12] [INFO ] [Real]Absence check using state equation in 1337 ms returned sat
[2022-05-18 00:25:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:25:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2022-05-18 00:25:12] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 96 ms returned sat
[2022-05-18 00:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:25:13] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2022-05-18 00:25:14] [INFO ] [Nat]Added 2450 Read/Feed constraints in 424 ms returned sat
[2022-05-18 00:25:15] [INFO ] Deduced a trap composed of 213 places in 1432 ms of which 4 ms to minimize.
[2022-05-18 00:25:17] [INFO ] Deduced a trap composed of 188 places in 1386 ms of which 2 ms to minimize.
[2022-05-18 00:25:19] [INFO ] Deduced a trap composed of 156 places in 1445 ms of which 2 ms to minimize.
[2022-05-18 00:25:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5426 ms
[2022-05-18 00:25:19] [INFO ] Computed and/alt/rep : 1647/4164/1647 causal constraints (skipped 2393 transitions) in 237 ms.
[2022-05-18 00:25:20] [INFO ] Added : 16 causal constraints over 4 iterations in 1193 ms. Result :sat
[2022-05-18 00:25:21] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2022-05-18 00:25:21] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 95 ms returned sat
[2022-05-18 00:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:25:22] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2022-05-18 00:25:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:25:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-05-18 00:25:22] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 98 ms returned sat
[2022-05-18 00:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:25:24] [INFO ] [Nat]Absence check using state equation in 1221 ms returned sat
[2022-05-18 00:25:24] [INFO ] [Nat]Added 2450 Read/Feed constraints in 512 ms returned sat
[2022-05-18 00:25:26] [INFO ] Deduced a trap composed of 260 places in 1428 ms of which 1 ms to minimize.
[2022-05-18 00:25:27] [INFO ] Deduced a trap composed of 263 places in 1413 ms of which 1 ms to minimize.
[2022-05-18 00:25:29] [INFO ] Deduced a trap composed of 256 places in 1378 ms of which 2 ms to minimize.
[2022-05-18 00:25:31] [INFO ] Deduced a trap composed of 243 places in 1372 ms of which 3 ms to minimize.
[2022-05-18 00:25:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7411 ms
[2022-05-18 00:25:32] [INFO ] Computed and/alt/rep : 1647/4164/1647 causal constraints (skipped 2393 transitions) in 246 ms.
[2022-05-18 00:25:33] [INFO ] Added : 16 causal constraints over 4 iterations in 1276 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1958 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1958/1958 places, 4455/4455 transitions.
Applied a total of 0 rules in 142 ms. Remains 1958 /1958 variables (removed 0) and now considering 4455/4455 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1958/1958 places, 4455/4455 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1958/1958 places, 4455/4455 transitions.
Applied a total of 0 rules in 133 ms. Remains 1958 /1958 variables (removed 0) and now considering 4455/4455 (removed 0) transitions.
[2022-05-18 00:25:33] [INFO ] Flow matrix only has 4057 transitions (discarded 398 similar events)
// Phase 1: matrix 4057 rows 1958 cols
[2022-05-18 00:25:33] [INFO ] Computed 577 place invariants in 50 ms
[2022-05-18 00:25:37] [INFO ] Implicit Places using invariants in 4067 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 317, 318, 320, 322, 326, 332, 340, 350, 361, 371, 372, 373, 374, 375, 376, 377, 378, 386, 392, 396, 398, 400, 402, 419, 425, 427, 428, 429, 430, 431, 432, 434, 438, 440, 442, 446, 452, 460, 469, 477, 478, 479, 480, 481, 482, 483, 484, 490, 494, 496, 498, 500, 502, 519, 525, 527, 528, 529, 530, 531, 532, 534, 536, 538, 542, 544, 548, 554, 561, 567, 568, 569, 570, 571, 572, 573, 574, 578, 580, 582, 584, 586, 588, 605, 611, 613, 614, 615, 616, 617, 618, 619, 620, 622, 624, 626, 628, 630, 634, 639, 643, 644, 645, 646, 647, 648, 649, 650, 652, 654, 656, 658, 660, 662, 679, 685, 687, 688, 689, 690, 691, 692, 693, 694, 696, 698, 700, 702, 704, 706, 709, 711, 712, 713, 714, 715, 716, 717, 718, 720, 722, 724, 726, 728, 730, 747, 753, 755, 756, 757, 758, 759, 760, 761, 762, 764, 766, 768, 770, 772, 774, 776, 778, 779, 780, 781, 782, 783, 784, 785, 787, 789, 791, 793, 795, 797, 814, 816, 819, 821, 822, 823, 824, 825, 826, 827, 828, 830, 832, 834, 836, 838, 840, 842, 844, 845, 846, 847, 848, 849, 851, 853, 855, 857, 859, 861, 864, 881, 887, 889, 890, 891, 892, 893, 894, 895, 896, 898, 900, 902, 904, 906, 908, 910, 912, 913, 914, 915, 916, 917, 918, 919, 921, 923, 925, 927, 929, 931, 948, 954, 956, 957, 958, 959, 960, 961, 962, 963, 965, 967, 969, 971, 973, 975, 977, 980, 981, 982, 983, 984, 985, 986, 987, 989, 991, 993, 995, 997, 999, 1016, 1022, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1033, 1035, 1037, 1039, 1041, 1043, 1047, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1063, 1065, 1067, 1069, 1071, 1073, 1090, 1096, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1107, 1109, 1111, 1113, 1115, 1119, 1125, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1145, 1149, 1151, 1153, 1155, 1157, 1174, 1180, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1191, 1193, 1195, 1197, 1201, 1207, 1215, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1239, 1245, 1249, 1251, 1253, 1255, 1272, 1278, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1289, 1291, 1293, 1297, 1303, 1311, 1321, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1349, 1357, 1363, 1367, 1369, 1371, 1388, 1394, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1405, 1407, 1411, 1417, 1425, 1435, 1447, 1460, 1461, 1462, 1463, 1464, 1465, 1466, 1467, 1479, 1489, 1497, 1503, 1507, 1509, 1526, 1528, 1531, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1542, 1546, 1552, 1560, 1570, 1582, 1596, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1632, 1644, 1654, 1662, 1668, 1672, 1689]
Discarding 527 places :
Implicit Place search using SMT only with invariants took 4077 ms to find 527 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1431/1958 places, 4455/4455 transitions.
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 221 place count 1210 transition count 4234
Iterating global reduction 0 with 221 rules applied. Total rules applied 442 place count 1210 transition count 4234
Discarding 221 places :
Symmetric choice reduction at 0 with 221 rule applications. Total rules 663 place count 989 transition count 4013
Iterating global reduction 0 with 221 rules applied. Total rules applied 884 place count 989 transition count 4013
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 887 place count 989 transition count 4010
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 890 place count 986 transition count 4010
Applied a total of 890 rules in 279 ms. Remains 986 /1431 variables (removed 445) and now considering 4010/4455 (removed 445) transitions.
[2022-05-18 00:25:38] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:25:38] [INFO ] Computed 50 place invariants in 33 ms
[2022-05-18 00:25:39] [INFO ] Implicit Places using invariants in 1160 ms returned []
[2022-05-18 00:25:39] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:25:39] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-18 00:25:40] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:26:04] [INFO ] Implicit Places using invariants and state equation in 24771 ms returned []
Implicit Place search using SMT with State Equation took 25934 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 986/1958 places, 4010/4455 transitions.
Finished structural reductions, in 2 iterations. Remains : 986/1958 places, 4010/4455 transitions.
Normalized transition count is 3612 out of 4010 initially.
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:26:04] [INFO ] Computed 50 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 24137 resets, run finished after 15591 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3271 resets, run finished after 2760 ms. (steps per millisecond=362 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3252 resets, run finished after 2762 ms. (steps per millisecond=362 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3260 resets, run finished after 2768 ms. (steps per millisecond=361 ) properties (out of 3) seen :0
[2022-05-18 00:26:28] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:26:28] [INFO ] Computed 50 place invariants in 25 ms
[2022-05-18 00:26:28] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:26:28] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:26:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:26:29] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2022-05-18 00:26:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:26:29] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:26:29] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:26:30] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-05-18 00:26:30] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:26:30] [INFO ] [Nat]Added 2450 Read/Feed constraints in 338 ms returned sat
[2022-05-18 00:26:30] [INFO ] Computed and/alt/rep : 1349/1988/1349 causal constraints (skipped 2201 transitions) in 189 ms.
[2022-05-18 00:26:31] [INFO ] Added : 13 causal constraints over 3 iterations in 763 ms. Result :sat
[2022-05-18 00:26:31] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:26:31] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:26:32] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2022-05-18 00:26:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:26:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:26:32] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:26:33] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2022-05-18 00:26:33] [INFO ] [Nat]Added 2450 Read/Feed constraints in 253 ms returned sat
[2022-05-18 00:26:33] [INFO ] Deduced a trap composed of 173 places in 425 ms of which 1 ms to minimize.
[2022-05-18 00:26:34] [INFO ] Deduced a trap composed of 177 places in 444 ms of which 1 ms to minimize.
[2022-05-18 00:26:35] [INFO ] Deduced a trap composed of 200 places in 423 ms of which 1 ms to minimize.
[2022-05-18 00:26:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1855 ms
[2022-05-18 00:26:35] [INFO ] Computed and/alt/rep : 1349/1988/1349 causal constraints (skipped 2201 transitions) in 195 ms.
[2022-05-18 00:26:36] [INFO ] Added : 14 causal constraints over 3 iterations in 754 ms. Result :sat
[2022-05-18 00:26:36] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:26:36] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 9 ms returned sat
[2022-05-18 00:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:26:37] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2022-05-18 00:26:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:26:37] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:26:37] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:26:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:26:37] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2022-05-18 00:26:38] [INFO ] [Nat]Added 2450 Read/Feed constraints in 414 ms returned sat
[2022-05-18 00:26:38] [INFO ] Deduced a trap composed of 188 places in 412 ms of which 1 ms to minimize.
[2022-05-18 00:26:39] [INFO ] Deduced a trap composed of 200 places in 413 ms of which 1 ms to minimize.
[2022-05-18 00:26:40] [INFO ] Deduced a trap composed of 135 places in 448 ms of which 1 ms to minimize.
[2022-05-18 00:26:40] [INFO ] Deduced a trap composed of 167 places in 439 ms of which 1 ms to minimize.
[2022-05-18 00:26:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2469 ms
[2022-05-18 00:26:41] [INFO ] Computed and/alt/rep : 1349/1988/1349 causal constraints (skipped 2201 transitions) in 188 ms.
[2022-05-18 00:26:41] [INFO ] Added : 13 causal constraints over 3 iterations in 770 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 986 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 986/986 places, 4010/4010 transitions.
Applied a total of 0 rules in 105 ms. Remains 986 /986 variables (removed 0) and now considering 4010/4010 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 986/986 places, 4010/4010 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 986/986 places, 4010/4010 transitions.
Applied a total of 0 rules in 109 ms. Remains 986 /986 variables (removed 0) and now considering 4010/4010 (removed 0) transitions.
[2022-05-18 00:26:42] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:26:42] [INFO ] Computed 50 place invariants in 26 ms
[2022-05-18 00:26:43] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2022-05-18 00:26:43] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:26:43] [INFO ] Computed 50 place invariants in 20 ms
[2022-05-18 00:26:44] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:27:03] [INFO ] Implicit Places using invariants and state equation in 20497 ms returned []
Implicit Place search using SMT with State Equation took 21632 ms to find 0 implicit places.
[2022-05-18 00:27:04] [INFO ] Redundant transitions in 284 ms returned []
[2022-05-18 00:27:04] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:27:04] [INFO ] Computed 50 place invariants in 19 ms
[2022-05-18 00:27:05] [INFO ] Dead Transitions using invariants and state equation in 1318 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 986/986 places, 4010/4010 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01
Normalized transition count is 3612 out of 4010 initially.
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:27:05] [INFO ] Computed 50 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
[2022-05-18 00:27:05] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:27:05] [INFO ] Computed 50 place invariants in 25 ms
[2022-05-18 00:27:05] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:27:05] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:06] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2022-05-18 00:27:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:27:06] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:07] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2022-05-18 00:27:07] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:27:07] [INFO ] [Nat]Added 2450 Read/Feed constraints in 333 ms returned sat
[2022-05-18 00:27:08] [INFO ] Computed and/alt/rep : 1349/1988/1349 causal constraints (skipped 2201 transitions) in 184 ms.
[2022-05-18 00:27:08] [INFO ] Added : 13 causal constraints over 3 iterations in 763 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 986 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 986/986 places, 4010/4010 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 986 transition count 4008
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 984 transition count 4008
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 984 transition count 4007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 983 transition count 4007
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 981 transition count 4005
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 981 transition count 4005
Applied a total of 10 rules in 256 ms. Remains 981 /986 variables (removed 5) and now considering 4005/4010 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/986 places, 4005/4010 transitions.
Normalized transition count is 3607 out of 4005 initially.
// Phase 1: matrix 3607 rows 981 cols
[2022-05-18 00:27:09] [INFO ] Computed 50 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 24142 resets, run finished after 15528 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3270 resets, run finished after 2749 ms. (steps per millisecond=363 ) properties (out of 1) seen :0
[2022-05-18 00:27:27] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
// Phase 1: matrix 3607 rows 981 cols
[2022-05-18 00:27:27] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-18 00:27:27] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:27:27] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:28] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2022-05-18 00:27:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:27:28] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:27:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:29] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2022-05-18 00:27:29] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:27:29] [INFO ] [Nat]Added 2450 Read/Feed constraints in 378 ms returned sat
[2022-05-18 00:27:29] [INFO ] Computed and/alt/rep : 1342/1961/1342 causal constraints (skipped 2203 transitions) in 191 ms.
[2022-05-18 00:27:30] [INFO ] Added : 12 causal constraints over 3 iterations in 748 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 981 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4005/4005 transitions.
Applied a total of 0 rules in 115 ms. Remains 981 /981 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 4005/4005 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 981/981 places, 4005/4005 transitions.
Applied a total of 0 rules in 108 ms. Remains 981 /981 variables (removed 0) and now considering 4005/4005 (removed 0) transitions.
[2022-05-18 00:27:30] [INFO ] Flow matrix only has 3607 transitions (discarded 398 similar events)
// Phase 1: matrix 3607 rows 981 cols
[2022-05-18 00:27:30] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 00:27:32] [INFO ] Implicit Places using invariants in 1096 ms returned [303, 358]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1099 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 979/981 places, 4005/4005 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 977 transition count 4003
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 977 transition count 4003
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 975 transition count 4001
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 975 transition count 4001
Applied a total of 8 rules in 158 ms. Remains 975 /979 variables (removed 4) and now considering 4001/4005 (removed 4) transitions.
[2022-05-18 00:27:32] [INFO ] Flow matrix only has 3603 transitions (discarded 398 similar events)
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:27:32] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-18 00:27:33] [INFO ] Implicit Places using invariants in 1091 ms returned []
[2022-05-18 00:27:33] [INFO ] Flow matrix only has 3603 transitions (discarded 398 similar events)
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:27:33] [INFO ] Computed 48 place invariants in 30 ms
[2022-05-18 00:27:34] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:27:54] [INFO ] Implicit Places using invariants and state equation in 21391 ms returned []
Implicit Place search using SMT with State Equation took 22493 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 975/981 places, 4001/4005 transitions.
Finished structural reductions, in 2 iterations. Remains : 975/981 places, 4001/4005 transitions.
Normalized transition count is 3603 out of 4001 initially.
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:27:54] [INFO ] Computed 48 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 24139 resets, run finished after 15527 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3267 resets, run finished after 2788 ms. (steps per millisecond=358 ) properties (out of 1) seen :0
[2022-05-18 00:28:13] [INFO ] Flow matrix only has 3603 transitions (discarded 398 similar events)
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:28:13] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-18 00:28:13] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2022-05-18 00:28:13] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 00:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:14] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-05-18 00:28:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:28:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:28:14] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 00:28:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:14] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2022-05-18 00:28:14] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:28:15] [INFO ] [Nat]Added 2450 Read/Feed constraints in 492 ms returned sat
[2022-05-18 00:28:15] [INFO ] Computed and/alt/rep : 1340/1945/1340 causal constraints (skipped 2201 transitions) in 188 ms.
[2022-05-18 00:28:16] [INFO ] Added : 12 causal constraints over 3 iterations in 758 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 975/975 places, 4001/4001 transitions.
Applied a total of 0 rules in 105 ms. Remains 975 /975 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 975/975 places, 4001/4001 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 975/975 places, 4001/4001 transitions.
Applied a total of 0 rules in 110 ms. Remains 975 /975 variables (removed 0) and now considering 4001/4001 (removed 0) transitions.
[2022-05-18 00:28:16] [INFO ] Flow matrix only has 3603 transitions (discarded 398 similar events)
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:28:16] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-18 00:28:17] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2022-05-18 00:28:17] [INFO ] Flow matrix only has 3603 transitions (discarded 398 similar events)
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:28:17] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 00:28:18] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:28:37] [INFO ] Implicit Places using invariants and state equation in 20015 ms returned []
Implicit Place search using SMT with State Equation took 21105 ms to find 0 implicit places.
[2022-05-18 00:28:38] [INFO ] Redundant transitions in 264 ms returned []
[2022-05-18 00:28:38] [INFO ] Flow matrix only has 3603 transitions (discarded 398 similar events)
// Phase 1: matrix 3603 rows 975 cols
[2022-05-18 00:28:38] [INFO ] Computed 48 place invariants in 32 ms
[2022-05-18 00:28:39] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 975/975 places, 4001/4001 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01 in 93977 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
Normalized transition count is 3612 out of 4010 initially.
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:28:39] [INFO ] Computed 50 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2022-05-18 00:28:39] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:28:39] [INFO ] Computed 50 place invariants in 23 ms
[2022-05-18 00:28:39] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:28:39] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:40] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2022-05-18 00:28:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:28:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:28:40] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:41] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2022-05-18 00:28:41] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:28:41] [INFO ] [Nat]Added 2450 Read/Feed constraints in 258 ms returned sat
[2022-05-18 00:28:42] [INFO ] Deduced a trap composed of 173 places in 471 ms of which 1 ms to minimize.
[2022-05-18 00:28:42] [INFO ] Deduced a trap composed of 177 places in 459 ms of which 1 ms to minimize.
[2022-05-18 00:28:43] [INFO ] Deduced a trap composed of 200 places in 456 ms of which 1 ms to minimize.
[2022-05-18 00:28:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1956 ms
[2022-05-18 00:28:43] [INFO ] Computed and/alt/rep : 1349/1988/1349 causal constraints (skipped 2201 transitions) in 189 ms.
[2022-05-18 00:28:44] [INFO ] Added : 14 causal constraints over 3 iterations in 753 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 986 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 986/986 places, 4010/4010 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 986 transition count 4009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 985 transition count 4009
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 985 transition count 4008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 984 transition count 4008
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 983 transition count 4007
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 983 transition count 4007
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 983 transition count 4007
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 982 transition count 4006
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 982 transition count 4006
Applied a total of 9 rules in 381 ms. Remains 982 /986 variables (removed 4) and now considering 4006/4010 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 982/986 places, 4006/4010 transitions.
Normalized transition count is 3608 out of 4006 initially.
// Phase 1: matrix 3608 rows 982 cols
[2022-05-18 00:28:45] [INFO ] Computed 50 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 24139 resets, run finished after 15494 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3268 resets, run finished after 2773 ms. (steps per millisecond=360 ) properties (out of 1) seen :0
[2022-05-18 00:29:03] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 982 cols
[2022-05-18 00:29:03] [INFO ] Computed 50 place invariants in 27 ms
[2022-05-18 00:29:03] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:29:03] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:29:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:29:04] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2022-05-18 00:29:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:29:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:29:04] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:29:05] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2022-05-18 00:29:05] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:29:05] [INFO ] [Nat]Added 2450 Read/Feed constraints in 302 ms returned sat
[2022-05-18 00:29:06] [INFO ] Deduced a trap composed of 170 places in 468 ms of which 1 ms to minimize.
[2022-05-18 00:29:06] [INFO ] Deduced a trap composed of 161 places in 438 ms of which 1 ms to minimize.
[2022-05-18 00:29:07] [INFO ] Deduced a trap composed of 127 places in 449 ms of which 1 ms to minimize.
[2022-05-18 00:29:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1827 ms
[2022-05-18 00:29:07] [INFO ] Computed and/alt/rep : 1343/1962/1343 causal constraints (skipped 2203 transitions) in 213 ms.
[2022-05-18 00:29:08] [INFO ] Added : 13 causal constraints over 3 iterations in 780 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 982/982 places, 4006/4006 transitions.
Applied a total of 0 rules in 103 ms. Remains 982 /982 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 982/982 places, 4006/4006 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 982/982 places, 4006/4006 transitions.
Applied a total of 0 rules in 102 ms. Remains 982 /982 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
[2022-05-18 00:29:08] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 982 cols
[2022-05-18 00:29:08] [INFO ] Computed 50 place invariants in 30 ms
[2022-05-18 00:29:09] [INFO ] Implicit Places using invariants in 1174 ms returned [303, 481]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1178 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 980/982 places, 4006/4006 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 978 transition count 4004
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 978 transition count 4004
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 976 transition count 4002
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 976 transition count 4002
Applied a total of 8 rules in 158 ms. Remains 976 /980 variables (removed 4) and now considering 4002/4006 (removed 4) transitions.
[2022-05-18 00:29:09] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:29:09] [INFO ] Computed 48 place invariants in 37 ms
[2022-05-18 00:29:10] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2022-05-18 00:29:10] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:29:10] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 00:29:11] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:29:32] [INFO ] Implicit Places using invariants and state equation in 21584 ms returned []
Implicit Place search using SMT with State Equation took 22679 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 976/982 places, 4002/4006 transitions.
Finished structural reductions, in 2 iterations. Remains : 976/982 places, 4002/4006 transitions.
Normalized transition count is 3604 out of 4002 initially.
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:29:32] [INFO ] Computed 48 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 24136 resets, run finished after 15931 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3265 resets, run finished after 2757 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
[2022-05-18 00:29:51] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:29:51] [INFO ] Computed 48 place invariants in 36 ms
[2022-05-18 00:29:51] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:29:51] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 00:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:29:52] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2022-05-18 00:29:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:29:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:29:52] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 3 ms returned sat
[2022-05-18 00:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:29:53] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2022-05-18 00:29:53] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:29:53] [INFO ] [Nat]Added 2450 Read/Feed constraints in 300 ms returned sat
[2022-05-18 00:29:53] [INFO ] Deduced a trap composed of 169 places in 460 ms of which 1 ms to minimize.
[2022-05-18 00:29:54] [INFO ] Deduced a trap composed of 160 places in 447 ms of which 1 ms to minimize.
[2022-05-18 00:29:55] [INFO ] Deduced a trap composed of 120 places in 467 ms of which 0 ms to minimize.
[2022-05-18 00:29:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2044 ms
[2022-05-18 00:29:55] [INFO ] Computed and/alt/rep : 1341/1946/1341 causal constraints (skipped 2201 transitions) in 190 ms.
[2022-05-18 00:29:56] [INFO ] Added : 13 causal constraints over 3 iterations in 762 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 976 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 103 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 103 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2022-05-18 00:29:56] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:29:56] [INFO ] Computed 48 place invariants in 31 ms
[2022-05-18 00:29:57] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2022-05-18 00:29:57] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:29:57] [INFO ] Computed 48 place invariants in 26 ms
[2022-05-18 00:29:58] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:30:19] [INFO ] Implicit Places using invariants and state equation in 22031 ms returned []
Implicit Place search using SMT with State Equation took 23156 ms to find 0 implicit places.
[2022-05-18 00:30:19] [INFO ] Redundant transitions in 197 ms returned []
[2022-05-18 00:30:19] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:30:19] [INFO ] Computed 48 place invariants in 35 ms
[2022-05-18 00:30:21] [INFO ] Dead Transitions using invariants and state equation in 1344 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 4002/4002 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06 in 101879 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14
Normalized transition count is 3612 out of 4010 initially.
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:30:21] [INFO ] Computed 50 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
[2022-05-18 00:30:21] [INFO ] Flow matrix only has 3612 transitions (discarded 398 similar events)
// Phase 1: matrix 3612 rows 986 cols
[2022-05-18 00:30:21] [INFO ] Computed 50 place invariants in 29 ms
[2022-05-18 00:30:21] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-05-18 00:30:21] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:22] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2022-05-18 00:30:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:30:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:30:22] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-18 00:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:23] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2022-05-18 00:30:23] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:30:23] [INFO ] [Nat]Added 2450 Read/Feed constraints in 418 ms returned sat
[2022-05-18 00:30:24] [INFO ] Deduced a trap composed of 188 places in 458 ms of which 1 ms to minimize.
[2022-05-18 00:30:25] [INFO ] Deduced a trap composed of 200 places in 450 ms of which 1 ms to minimize.
[2022-05-18 00:30:25] [INFO ] Deduced a trap composed of 135 places in 474 ms of which 1 ms to minimize.
[2022-05-18 00:30:26] [INFO ] Deduced a trap composed of 167 places in 480 ms of which 1 ms to minimize.
[2022-05-18 00:30:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2644 ms
[2022-05-18 00:30:26] [INFO ] Computed and/alt/rep : 1349/1988/1349 causal constraints (skipped 2201 transitions) in 224 ms.
[2022-05-18 00:30:27] [INFO ] Added : 13 causal constraints over 3 iterations in 825 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 986 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 986/986 places, 4010/4010 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 986 transition count 4009
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 985 transition count 4009
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 985 transition count 4008
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 984 transition count 4008
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 983 transition count 4007
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 983 transition count 4007
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 983 transition count 4007
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 8 place count 982 transition count 4006
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 982 transition count 4006
Applied a total of 9 rules in 415 ms. Remains 982 /986 variables (removed 4) and now considering 4006/4010 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 982/986 places, 4006/4010 transitions.
Normalized transition count is 3608 out of 4006 initially.
// Phase 1: matrix 3608 rows 982 cols
[2022-05-18 00:30:28] [INFO ] Computed 50 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 24134 resets, run finished after 16678 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3276 resets, run finished after 2983 ms. (steps per millisecond=335 ) properties (out of 1) seen :0
[2022-05-18 00:30:47] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 982 cols
[2022-05-18 00:30:47] [INFO ] Computed 50 place invariants in 25 ms
[2022-05-18 00:30:47] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:30:47] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:48] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2022-05-18 00:30:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:30:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:30:48] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2022-05-18 00:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:49] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2022-05-18 00:30:49] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:30:49] [INFO ] [Nat]Added 2450 Read/Feed constraints in 247 ms returned sat
[2022-05-18 00:30:50] [INFO ] Deduced a trap composed of 171 places in 458 ms of which 1 ms to minimize.
[2022-05-18 00:30:51] [INFO ] Deduced a trap composed of 183 places in 456 ms of which 1 ms to minimize.
[2022-05-18 00:30:51] [INFO ] Deduced a trap composed of 197 places in 457 ms of which 4 ms to minimize.
[2022-05-18 00:30:52] [INFO ] Deduced a trap composed of 131 places in 463 ms of which 1 ms to minimize.
[2022-05-18 00:30:52] [INFO ] Deduced a trap composed of 165 places in 483 ms of which 1 ms to minimize.
[2022-05-18 00:30:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3097 ms
[2022-05-18 00:30:53] [INFO ] Computed and/alt/rep : 1343/1962/1343 causal constraints (skipped 2203 transitions) in 219 ms.
[2022-05-18 00:30:53] [INFO ] Added : 13 causal constraints over 3 iterations in 795 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 982/982 places, 4006/4006 transitions.
Applied a total of 0 rules in 114 ms. Remains 982 /982 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 982/982 places, 4006/4006 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 982/982 places, 4006/4006 transitions.
Applied a total of 0 rules in 120 ms. Remains 982 /982 variables (removed 0) and now considering 4006/4006 (removed 0) transitions.
[2022-05-18 00:30:54] [INFO ] Flow matrix only has 3608 transitions (discarded 398 similar events)
// Phase 1: matrix 3608 rows 982 cols
[2022-05-18 00:30:54] [INFO ] Computed 50 place invariants in 28 ms
[2022-05-18 00:30:55] [INFO ] Implicit Places using invariants in 1123 ms returned [360, 481]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1129 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 980/982 places, 4006/4006 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 978 transition count 4004
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 978 transition count 4004
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 976 transition count 4002
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 976 transition count 4002
Applied a total of 8 rules in 168 ms. Remains 976 /980 variables (removed 4) and now considering 4002/4006 (removed 4) transitions.
[2022-05-18 00:30:55] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:30:55] [INFO ] Computed 48 place invariants in 32 ms
[2022-05-18 00:30:56] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2022-05-18 00:30:56] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:30:56] [INFO ] Computed 48 place invariants in 25 ms
[2022-05-18 00:30:57] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:31:18] [INFO ] Implicit Places using invariants and state equation in 22163 ms returned []
Implicit Place search using SMT with State Equation took 23279 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 976/982 places, 4002/4006 transitions.
Finished structural reductions, in 2 iterations. Remains : 976/982 places, 4002/4006 transitions.
Normalized transition count is 3604 out of 4002 initially.
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:31:18] [INFO ] Computed 48 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 24139 resets, run finished after 16107 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3275 resets, run finished after 2848 ms. (steps per millisecond=351 ) properties (out of 1) seen :0
[2022-05-18 00:31:37] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:31:37] [INFO ] Computed 48 place invariants in 32 ms
[2022-05-18 00:31:37] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-05-18 00:31:37] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 00:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:31:38] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2022-05-18 00:31:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:31:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-18 00:31:38] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 4 ms returned sat
[2022-05-18 00:31:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:31:39] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2022-05-18 00:31:39] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:31:39] [INFO ] [Nat]Added 2450 Read/Feed constraints in 288 ms returned sat
[2022-05-18 00:31:40] [INFO ] Deduced a trap composed of 169 places in 448 ms of which 0 ms to minimize.
[2022-05-18 00:31:41] [INFO ] Deduced a trap composed of 182 places in 432 ms of which 1 ms to minimize.
[2022-05-18 00:31:41] [INFO ] Deduced a trap composed of 196 places in 423 ms of which 1 ms to minimize.
[2022-05-18 00:31:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1883 ms
[2022-05-18 00:31:42] [INFO ] Computed and/alt/rep : 1341/1946/1341 causal constraints (skipped 2201 transitions) in 217 ms.
[2022-05-18 00:31:42] [INFO ] Added : 14 causal constraints over 3 iterations in 818 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 976 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 109 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 120 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2022-05-18 00:31:43] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:31:43] [INFO ] Computed 48 place invariants in 34 ms
[2022-05-18 00:31:44] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2022-05-18 00:31:44] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:31:44] [INFO ] Computed 48 place invariants in 27 ms
[2022-05-18 00:31:45] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2022-05-18 00:32:05] [INFO ] Implicit Places using invariants and state equation in 20926 ms returned []
Implicit Place search using SMT with State Equation took 22091 ms to find 0 implicit places.
[2022-05-18 00:32:05] [INFO ] Redundant transitions in 198 ms returned []
[2022-05-18 00:32:05] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2022-05-18 00:32:05] [INFO ] Computed 48 place invariants in 33 ms
[2022-05-18 00:32:06] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 976/976 places, 4002/4002 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14 in 105537 ms.
[2022-05-18 00:32:07] [INFO ] Flatten gal took : 331 ms
[2022-05-18 00:32:07] [INFO ] Applying decomposition
[2022-05-18 00:32:07] [INFO ] Flatten gal took : 177 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13052122642806547816.txt' '-o' '/tmp/graph13052122642806547816.bin' '-w' '/tmp/graph13052122642806547816.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13052122642806547816.bin' '-l' '-1' '-v' '-w' '/tmp/graph13052122642806547816.weights' '-q' '0' '-e' '0.001'
[2022-05-18 00:32:08] [INFO ] Decomposing Gal with order
[2022-05-18 00:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:32:09] [INFO ] Removed a total of 7503 redundant transitions.
[2022-05-18 00:32:09] [INFO ] Flatten gal took : 1127 ms
[2022-05-18 00:32:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 2403 labels/synchronizations in 250 ms.
[2022-05-18 00:32:09] [INFO ] Time to serialize gal into /tmp/UpperBounds3027887757674753146.gal : 38 ms
[2022-05-18 00:32:09] [INFO ] Time to serialize properties into /tmp/UpperBounds14905770669963225755.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3027887757674753146.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14905770669963225755.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds14905770669963225755.prop.
Detected timeout of ITS tools.
[2022-05-18 00:55:49] [INFO ] Flatten gal took : 927 ms
[2022-05-18 00:55:50] [INFO ] Time to serialize gal into /tmp/UpperBounds4701295998564222942.gal : 158 ms
[2022-05-18 00:55:50] [INFO ] Time to serialize properties into /tmp/UpperBounds9519027113717078510.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4701295998564222942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9519027113717078510.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds9519027113717078510.prop.
Detected timeout of ITS tools.
[2022-05-18 01:19:36] [INFO ] Flatten gal took : 941 ms
[2022-05-18 01:19:52] [INFO ] Input system was already deterministic with 4010 transitions.
[2022-05-18 01:19:53] [INFO ] Transformed 986 places.
[2022-05-18 01:19:53] [INFO ] Transformed 4010 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-18 01:19:53] [INFO ] Time to serialize gal into /tmp/UpperBounds8238858841761826857.gal : 44 ms
[2022-05-18 01:19:53] [INFO ] Time to serialize properties into /tmp/UpperBounds2881710444326813114.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8238858841761826857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2881710444326813114.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds2881710444326813114.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, 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 r132-tall-165271821200693"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 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 ;