About the Execution of 2023-gold for ASLink-PT-09b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16224.563 | 3600000.00 | 3487002.00 | 95458.60 | 1 1 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/mcc2024-input.r021-smll-171620127900091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ASLink-PT-09b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127900091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-09b-UpperBounds-00
FORMULA_NAME ASLink-PT-09b-UpperBounds-01
FORMULA_NAME ASLink-PT-09b-UpperBounds-02
FORMULA_NAME ASLink-PT-09b-UpperBounds-03
FORMULA_NAME ASLink-PT-09b-UpperBounds-04
FORMULA_NAME ASLink-PT-09b-UpperBounds-05
FORMULA_NAME ASLink-PT-09b-UpperBounds-06
FORMULA_NAME ASLink-PT-09b-UpperBounds-07
FORMULA_NAME ASLink-PT-09b-UpperBounds-08
FORMULA_NAME ASLink-PT-09b-UpperBounds-09
FORMULA_NAME ASLink-PT-09b-UpperBounds-10
FORMULA_NAME ASLink-PT-09b-UpperBounds-11
FORMULA_NAME ASLink-PT-09b-UpperBounds-12
FORMULA_NAME ASLink-PT-09b-UpperBounds-13
FORMULA_NAME ASLink-PT-09b-UpperBounds-14
FORMULA_NAME ASLink-PT-09b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716471006644
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 13:30:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 13:30:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 13:30:09] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2024-05-23 13:30:09] [INFO ] Transformed 4014 places.
[2024-05-23 13:30:09] [INFO ] Transformed 4932 transitions.
[2024-05-23 13:30:09] [INFO ] Found NUPN structural information;
[2024-05-23 13:30:09] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 4932 rows 4014 cols
[2024-05-23 13:30:10] [INFO ] Computed 394 invariants in 252 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 16) seen :9
FORMULA ASLink-PT-09b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
[2024-05-23 13:30:10] [INFO ] Invariant cache hit.
[2024-05-23 13:30:12] [INFO ] [Real]Absence check using 93 positive place invariants in 175 ms returned sat
[2024-05-23 13:30:12] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 198 ms returned sat
[2024-05-23 13:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:15] [INFO ] [Real]Absence check using state equation in 3348 ms returned unknown
[2024-05-23 13:30:16] [INFO ] [Real]Absence check using 93 positive place invariants in 146 ms returned sat
[2024-05-23 13:30:17] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 188 ms returned sat
[2024-05-23 13:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:20] [INFO ] [Real]Absence check using state equation in 3700 ms returned unknown
[2024-05-23 13:30:21] [INFO ] [Real]Absence check using 93 positive place invariants in 200 ms returned sat
[2024-05-23 13:30:22] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 206 ms returned sat
[2024-05-23 13:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:25] [INFO ] [Real]Absence check using state equation in 3715 ms returned unknown
[2024-05-23 13:30:26] [INFO ] [Real]Absence check using 93 positive place invariants in 164 ms returned sat
[2024-05-23 13:30:27] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 213 ms returned sat
[2024-05-23 13:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:30] [INFO ] [Real]Absence check using state equation in 3775 ms returned unknown
[2024-05-23 13:30:31] [INFO ] [Real]Absence check using 93 positive place invariants in 144 ms returned sat
[2024-05-23 13:30:32] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 180 ms returned sat
[2024-05-23 13:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:35] [INFO ] [Real]Absence check using state equation in 3808 ms returned unknown
[2024-05-23 13:30:36] [INFO ] [Real]Absence check using 93 positive place invariants in 145 ms returned sat
[2024-05-23 13:30:37] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 177 ms returned sat
[2024-05-23 13:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:40] [INFO ] [Real]Absence check using state equation in 3844 ms returned unknown
[2024-05-23 13:30:41] [INFO ] [Real]Absence check using 93 positive place invariants in 144 ms returned sat
[2024-05-23 13:30:42] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 186 ms returned sat
[2024-05-23 13:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:30:45] [INFO ] [Real]Absence check using state equation in 3761 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 937 transitions
Trivial Post-agglo rules discarded 937 transitions
Performed 937 trivial Post agglomeration. Transition count delta: 937
Iterating post reduction 0 with 937 rules applied. Total rules applied 937 place count 4014 transition count 3995
Reduce places removed 937 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 979 rules applied. Total rules applied 1916 place count 3077 transition count 3953
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1929 place count 3066 transition count 3951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1931 place count 3064 transition count 3951
Performed 929 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 929 Pre rules applied. Total rules applied 1931 place count 3064 transition count 3022
Deduced a syphon composed of 929 places in 12 ms
Ensure Unique test removed 92 places
Reduce places removed 1021 places and 0 transitions.
Iterating global reduction 4 with 1950 rules applied. Total rules applied 3881 place count 2043 transition count 3022
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 67 rules applied. Total rules applied 3948 place count 2033 transition count 2965
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 58 rules applied. Total rules applied 4006 place count 1976 transition count 2964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4007 place count 1975 transition count 2964
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 4007 place count 1975 transition count 2928
Deduced a syphon composed of 36 places in 41 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 4115 place count 1903 transition count 2928
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 4115 place count 1903 transition count 2892
Deduced a syphon composed of 36 places in 39 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 4187 place count 1867 transition count 2892
Discarding 129 places :
Symmetric choice reduction at 7 with 129 rule applications. Total rules 4316 place count 1738 transition count 2763
Iterating global reduction 7 with 129 rules applied. Total rules applied 4445 place count 1738 transition count 2763
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4446 place count 1738 transition count 2762
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 42 Pre rules applied. Total rules applied 4446 place count 1738 transition count 2720
Deduced a syphon composed of 42 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 85 rules applied. Total rules applied 4531 place count 1695 transition count 2720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4531 place count 1695 transition count 2719
Deduced a syphon composed of 1 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4534 place count 1693 transition count 2719
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 4544 place count 1683 transition count 2656
Iterating global reduction 8 with 10 rules applied. Total rules applied 4554 place count 1683 transition count 2656
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 4554 place count 1683 transition count 2647
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 4572 place count 1674 transition count 2647
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4573 place count 1673 transition count 2639
Iterating global reduction 8 with 1 rules applied. Total rules applied 4574 place count 1673 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4575 place count 1672 transition count 2631
Iterating global reduction 8 with 1 rules applied. Total rules applied 4576 place count 1672 transition count 2631
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4577 place count 1671 transition count 2623
Iterating global reduction 8 with 1 rules applied. Total rules applied 4578 place count 1671 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4579 place count 1670 transition count 2615
Iterating global reduction 8 with 1 rules applied. Total rules applied 4580 place count 1670 transition count 2615
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4581 place count 1669 transition count 2607
Iterating global reduction 8 with 1 rules applied. Total rules applied 4582 place count 1669 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4583 place count 1668 transition count 2599
Iterating global reduction 8 with 1 rules applied. Total rules applied 4584 place count 1668 transition count 2599
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4585 place count 1667 transition count 2591
Iterating global reduction 8 with 1 rules applied. Total rules applied 4586 place count 1667 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4587 place count 1666 transition count 2583
Iterating global reduction 8 with 1 rules applied. Total rules applied 4588 place count 1666 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4589 place count 1665 transition count 2575
Iterating global reduction 8 with 1 rules applied. Total rules applied 4590 place count 1665 transition count 2575
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4591 place count 1664 transition count 2567
Iterating global reduction 8 with 1 rules applied. Total rules applied 4592 place count 1664 transition count 2567
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4593 place count 1663 transition count 2559
Iterating global reduction 8 with 1 rules applied. Total rules applied 4594 place count 1663 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4595 place count 1662 transition count 2551
Iterating global reduction 8 with 1 rules applied. Total rules applied 4596 place count 1662 transition count 2551
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4597 place count 1661 transition count 2543
Iterating global reduction 8 with 1 rules applied. Total rules applied 4598 place count 1661 transition count 2543
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4599 place count 1660 transition count 2535
Iterating global reduction 8 with 1 rules applied. Total rules applied 4600 place count 1660 transition count 2535
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4601 place count 1659 transition count 2527
Iterating global reduction 8 with 1 rules applied. Total rules applied 4602 place count 1659 transition count 2527
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4603 place count 1658 transition count 2519
Iterating global reduction 8 with 1 rules applied. Total rules applied 4604 place count 1658 transition count 2519
Performed 234 Post agglomeration using F-continuation condition.Transition count delta: 234
Deduced a syphon composed of 234 places in 17 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 8 with 468 rules applied. Total rules applied 5072 place count 1424 transition count 2285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5074 place count 1423 transition count 2294
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 5084 place count 1423 transition count 2284
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 5094 place count 1413 transition count 2284
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 5102 place count 1413 transition count 2276
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 5110 place count 1405 transition count 2276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 5111 place count 1404 transition count 2275
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 25 rules applied. Total rules applied 5136 place count 1387 transition count 2267
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 5144 place count 1379 transition count 2267
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 26 Pre rules applied. Total rules applied 5144 place count 1379 transition count 2241
Deduced a syphon composed of 26 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 12 with 53 rules applied. Total rules applied 5197 place count 1352 transition count 2241
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 12 with 9 rules applied. Total rules applied 5206 place count 1343 transition count 2241
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5206 place count 1343 transition count 2240
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5208 place count 1342 transition count 2240
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 13 with 36 rules applied. Total rules applied 5244 place count 1324 transition count 2222
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 5252 place count 1316 transition count 2214
Iterating global reduction 13 with 8 rules applied. Total rules applied 5260 place count 1316 transition count 2214
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 5268 place count 1316 transition count 2206
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 5276 place count 1308 transition count 2206
Applied a total of 5276 rules in 4177 ms. Remains 1308 /4014 variables (removed 2706) and now considering 2206/4932 (removed 2726) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4183 ms. Remains : 1308/4014 places, 2206/4932 transitions.
// Phase 1: matrix 2206 rows 1308 cols
[2024-05-23 13:30:50] [INFO ] Computed 227 invariants in 88 ms
Incomplete random walk after 1000000 steps, including 9909 resets, run finished after 4644 ms. (steps per millisecond=215 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1066 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1088 resets, run finished after 1843 ms. (steps per millisecond=542 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1080 resets, run finished after 1841 ms. (steps per millisecond=543 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1076 resets, run finished after 1832 ms. (steps per millisecond=545 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1079 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1087 resets, run finished after 1843 ms. (steps per millisecond=542 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1077 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties (out of 7) seen :0
[2024-05-23 13:31:07] [INFO ] Invariant cache hit.
[2024-05-23 13:31:08] [INFO ] [Real]Absence check using 59 positive place invariants in 35 ms returned sat
[2024-05-23 13:31:08] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 65 ms returned sat
[2024-05-23 13:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:31:09] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2024-05-23 13:31:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:31:09] [INFO ] [Nat]Absence check using 59 positive place invariants in 63 ms returned sat
[2024-05-23 13:31:09] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 70 ms returned sat
[2024-05-23 13:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:31:11] [INFO ] [Nat]Absence check using state equation in 1351 ms returned sat
[2024-05-23 13:31:12] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 472 ms.
[2024-05-23 13:31:31] [INFO ] Added : 530 causal constraints over 106 iterations in 20200 ms.(timeout) Result :sat
Minimization took 1355 ms.
[2024-05-23 13:31:33] [INFO ] [Real]Absence check using 59 positive place invariants in 30 ms returned sat
[2024-05-23 13:31:33] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 57 ms returned sat
[2024-05-23 13:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:31:34] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2024-05-23 13:31:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:31:35] [INFO ] [Nat]Absence check using 59 positive place invariants in 30 ms returned sat
[2024-05-23 13:31:35] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 57 ms returned sat
[2024-05-23 13:31:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:31:37] [INFO ] [Nat]Absence check using state equation in 2181 ms returned sat
[2024-05-23 13:31:37] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 150 ms.
[2024-05-23 13:31:57] [INFO ] Added : 445 causal constraints over 89 iterations in 20136 ms.(timeout) Result :sat
Minimization took 1384 ms.
[2024-05-23 13:31:59] [INFO ] [Real]Absence check using 59 positive place invariants in 30 ms returned sat
[2024-05-23 13:31:59] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 60 ms returned sat
[2024-05-23 13:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:32:00] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2024-05-23 13:32:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:32:01] [INFO ] [Nat]Absence check using 59 positive place invariants in 31 ms returned sat
[2024-05-23 13:32:01] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 67 ms returned sat
[2024-05-23 13:32:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:32:02] [INFO ] [Nat]Absence check using state equation in 1713 ms returned sat
[2024-05-23 13:32:03] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 217 ms.
[2024-05-23 13:32:23] [INFO ] Added : 420 causal constraints over 84 iterations in 20154 ms.(timeout) Result :sat
Minimization took 1826 ms.
[2024-05-23 13:32:25] [INFO ] [Real]Absence check using 59 positive place invariants in 112 ms returned sat
[2024-05-23 13:32:25] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 132 ms returned sat
[2024-05-23 13:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:32:26] [INFO ] [Real]Absence check using state equation in 1288 ms returned sat
[2024-05-23 13:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:32:27] [INFO ] [Nat]Absence check using 59 positive place invariants in 49 ms returned sat
[2024-05-23 13:32:27] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 91 ms returned sat
[2024-05-23 13:32:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:32:29] [INFO ] [Nat]Absence check using state equation in 2357 ms returned sat
[2024-05-23 13:32:30] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 386 ms.
[2024-05-23 13:32:40] [INFO ] Added : 200 causal constraints over 40 iterations in 10643 ms. Result :sat
Minimization took 1228 ms.
[2024-05-23 13:32:42] [INFO ] [Real]Absence check using 59 positive place invariants in 28 ms returned sat
[2024-05-23 13:32:42] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 67 ms returned sat
[2024-05-23 13:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:32:43] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2024-05-23 13:32:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:32:43] [INFO ] [Nat]Absence check using 59 positive place invariants in 46 ms returned sat
[2024-05-23 13:32:43] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 85 ms returned sat
[2024-05-23 13:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:32:45] [INFO ] [Nat]Absence check using state equation in 1543 ms returned sat
[2024-05-23 13:32:45] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 187 ms.
[2024-05-23 13:33:05] [INFO ] Added : 535 causal constraints over 107 iterations in 20048 ms.(timeout) Result :sat
Minimization took 1870 ms.
[2024-05-23 13:33:07] [INFO ] [Real]Absence check using 59 positive place invariants in 49 ms returned sat
[2024-05-23 13:33:07] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 95 ms returned sat
[2024-05-23 13:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:33:09] [INFO ] [Real]Absence check using state equation in 1327 ms returned sat
[2024-05-23 13:33:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:33:09] [INFO ] [Nat]Absence check using 59 positive place invariants in 27 ms returned sat
[2024-05-23 13:33:09] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 48 ms returned sat
[2024-05-23 13:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:33:11] [INFO ] [Nat]Absence check using state equation in 1420 ms returned sat
[2024-05-23 13:33:11] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 159 ms.
[2024-05-23 13:33:31] [INFO ] Added : 515 causal constraints over 103 iterations in 20069 ms.(timeout) Result :sat
Minimization took 1722 ms.
[2024-05-23 13:33:33] [INFO ] [Real]Absence check using 59 positive place invariants in 31 ms returned sat
[2024-05-23 13:33:33] [INFO ] [Real]Absence check using 59 positive and 168 generalized place invariants in 62 ms returned sat
[2024-05-23 13:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:33:34] [INFO ] [Real]Absence check using state equation in 1120 ms returned sat
[2024-05-23 13:33:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:33:34] [INFO ] [Nat]Absence check using 59 positive place invariants in 38 ms returned sat
[2024-05-23 13:33:34] [INFO ] [Nat]Absence check using 59 positive and 168 generalized place invariants in 73 ms returned sat
[2024-05-23 13:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:33:36] [INFO ] [Nat]Absence check using state equation in 1562 ms returned sat
[2024-05-23 13:33:36] [INFO ] Computed and/alt/rep : 885/3408/885 causal constraints (skipped 1275 transitions) in 154 ms.
[2024-05-23 13:33:56] [INFO ] Added : 605 causal constraints over 121 iterations in 20044 ms.(timeout) Result :sat
Minimization took 1048 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1308/1308 places, 2206/2206 transitions.
Applied a total of 0 rules in 80 ms. Remains 1308 /1308 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1308/1308 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1308/1308 places, 2206/2206 transitions.
Applied a total of 0 rules in 64 ms. Remains 1308 /1308 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-05-23 13:34:23] [INFO ] Invariant cache hit.
[2024-05-23 13:34:25] [INFO ] Implicit Places using invariants in 1992 ms returned [1, 18, 19, 20, 36, 53, 71, 140, 145, 154, 155, 157, 174, 192, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 508, 512, 513, 524, 525, 527, 545, 563, 638, 643, 644, 655, 657, 658, 678, 696, 765, 769, 770, 781, 782, 784, 801, 819, 888, 892, 893, 904, 905, 907, 924, 942, 1011, 1015, 1016, 1027, 1028, 1030, 1047, 1065, 1134, 1138, 1139, 1142, 1153, 1154, 1155, 1173, 1175, 1179, 1197, 1198, 1199, 1200, 1212, 1218, 1224, 1230, 1236, 1242, 1248, 1254, 1260, 1266, 1272]
Discarding 95 places :
Implicit Place search using SMT only with invariants took 2025 ms to find 95 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1213/1308 places, 2206/2206 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 1213 transition count 2038
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 175 rules applied. Total rules applied 343 place count 1045 transition count 2031
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 343 place count 1045 transition count 1987
Deduced a syphon composed of 44 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 89 rules applied. Total rules applied 432 place count 1000 transition count 1987
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 445 place count 995 transition count 1979
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 453 place count 987 transition count 1979
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 469 place count 971 transition count 1963
Iterating global reduction 4 with 16 rules applied. Total rules applied 485 place count 971 transition count 1963
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 488 place count 971 transition count 1960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 488 place count 971 transition count 1959
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 490 place count 970 transition count 1959
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 494 place count 966 transition count 1952
Iterating global reduction 5 with 4 rules applied. Total rules applied 498 place count 966 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 500 place count 964 transition count 1950
Iterating global reduction 5 with 2 rules applied. Total rules applied 502 place count 964 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 503 place count 964 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 504 place count 963 transition count 1947
Iterating global reduction 6 with 1 rules applied. Total rules applied 505 place count 963 transition count 1947
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 637 place count 897 transition count 1881
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 645 place count 889 transition count 1873
Iterating global reduction 6 with 8 rules applied. Total rules applied 653 place count 889 transition count 1873
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 659 place count 889 transition count 1867
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 663 place count 887 transition count 1868
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 664 place count 887 transition count 1867
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 665 place count 887 transition count 1866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 666 place count 886 transition count 1866
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 688 place count 886 transition count 1844
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 711 place count 863 transition count 1844
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 715 place count 863 transition count 1840
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 743 place count 863 transition count 1840
Applied a total of 743 rules in 690 ms. Remains 863 /1213 variables (removed 350) and now considering 1840/2206 (removed 366) transitions.
// Phase 1: matrix 1840 rows 863 cols
[2024-05-23 13:34:26] [INFO ] Computed 125 invariants in 27 ms
[2024-05-23 13:34:27] [INFO ] Implicit Places using invariants in 1115 ms returned [90, 96, 99, 101, 105, 106, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272, 277, 278, 331, 348, 354, 357, 359, 364, 365, 418, 435, 441, 444, 446, 452, 453, 509, 530, 536, 539, 541, 546, 547, 599, 616, 622, 625, 627, 632, 633, 685, 702, 708, 711, 713, 718, 719, 771, 788, 794, 797, 799]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 1129 ms to find 60 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 803/1308 places, 1840/2206 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 775 transition count 1812
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 775 transition count 1812
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 766 transition count 1803
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 766 transition count 1803
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 106 place count 750 transition count 1787
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 133 place count 750 transition count 1760
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 160 place count 723 transition count 1760
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 723 transition count 1754
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 172 place count 717 transition count 1754
Applied a total of 172 rules in 210 ms. Remains 717 /803 variables (removed 86) and now considering 1754/1840 (removed 86) transitions.
// Phase 1: matrix 1754 rows 717 cols
[2024-05-23 13:34:28] [INFO ] Computed 65 invariants in 24 ms
[2024-05-23 13:34:29] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2024-05-23 13:34:29] [INFO ] Invariant cache hit.
[2024-05-23 13:34:31] [INFO ] Implicit Places using invariants and state equation in 2601 ms returned []
Implicit Place search using SMT with State Equation took 3649 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 717/1308 places, 1754/2206 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7768 ms. Remains : 717/1308 places, 1754/2206 transitions.
Successfully produced net in file /tmp/petri1000_3516746157106926146.dot
Successfully produced net in file /tmp/petri1001_17939099076133708676.dot
Successfully produced net in file /tmp/petri1002_7302795206044000451.dot
Successfully produced net in file /tmp/petri1003_14616870160803495348.dot
Successfully produced net in file /tmp/petri1004_1702596529766001100.dot
Successfully produced net in file /tmp/petri1005_11826650307315317303.dot
Successfully produced net in file /tmp/petri1006_14638894689564642984.dot
Successfully produced net in file /tmp/petri1007_10331276530930997808.dot
Successfully produced net in file /tmp/petri1008_7576150028405745486.dot
Drop transitions removed 9 transitions
Dominated transitions for bounds rules discarded 9 transitions
// Phase 1: matrix 1745 rows 717 cols
[2024-05-23 13:34:31] [INFO ] Computed 65 invariants in 34 ms
Incomplete random walk after 1000000 steps, including 16420 resets, run finished after 3571 ms. (steps per millisecond=280 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2425 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2443 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2455 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2427 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2456 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2442 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2440 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 7) seen :0
[2024-05-23 13:34:42] [INFO ] Invariant cache hit.
[2024-05-23 13:34:42] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:34:42] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 22 ms returned sat
[2024-05-23 13:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:34:43] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-23 13:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:34:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-23 13:34:43] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 26 ms returned sat
[2024-05-23 13:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:34:44] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2024-05-23 13:34:44] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 126 ms.
[2024-05-23 13:34:47] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 10 ms to minimize.
[2024-05-23 13:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 568 ms
[2024-05-23 13:34:47] [INFO ] Added : 68 causal constraints over 14 iterations in 3252 ms. Result :sat
Minimization took 759 ms.
[2024-05-23 13:34:48] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:34:48] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 22 ms returned sat
[2024-05-23 13:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:34:49] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2024-05-23 13:34:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:34:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2024-05-23 13:34:49] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 24 ms returned sat
[2024-05-23 13:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:34:51] [INFO ] [Nat]Absence check using state equation in 1292 ms returned sat
[2024-05-23 13:34:51] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 124 ms.
[2024-05-23 13:34:56] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-23 13:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2024-05-23 13:34:56] [INFO ] Added : 117 causal constraints over 24 iterations in 5471 ms. Result :sat
Minimization took 465 ms.
[2024-05-23 13:34:57] [INFO ] [Real]Absence check using 15 positive place invariants in 16 ms returned sat
[2024-05-23 13:34:57] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 30 ms returned sat
[2024-05-23 13:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:34:58] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2024-05-23 13:34:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:34:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-23 13:34:58] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 35 ms returned sat
[2024-05-23 13:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:00] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2024-05-23 13:35:00] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 155 ms.
[2024-05-23 13:35:02] [INFO ] Added : 98 causal constraints over 20 iterations in 2879 ms. Result :sat
Minimization took 660 ms.
[2024-05-23 13:35:03] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:35:03] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 22 ms returned sat
[2024-05-23 13:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:04] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2024-05-23 13:35:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-23 13:35:04] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 33 ms returned sat
[2024-05-23 13:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:06] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2024-05-23 13:35:06] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 118 ms.
[2024-05-23 13:35:08] [INFO ] Added : 88 causal constraints over 18 iterations in 2334 ms. Result :sat
Minimization took 469 ms.
[2024-05-23 13:35:09] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-23 13:35:09] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 32 ms returned sat
[2024-05-23 13:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:10] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2024-05-23 13:35:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:35:10] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 23 ms returned sat
[2024-05-23 13:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:12] [INFO ] [Nat]Absence check using state equation in 1597 ms returned sat
[2024-05-23 13:35:12] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 161 ms.
[2024-05-23 13:35:14] [INFO ] Added : 100 causal constraints over 20 iterations in 2706 ms. Result :sat
Minimization took 713 ms.
[2024-05-23 13:35:15] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-23 13:35:15] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 25 ms returned sat
[2024-05-23 13:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:16] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2024-05-23 13:35:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2024-05-23 13:35:16] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 33 ms returned sat
[2024-05-23 13:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:18] [INFO ] [Nat]Absence check using state equation in 1310 ms returned sat
[2024-05-23 13:35:18] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 124 ms.
[2024-05-23 13:35:21] [INFO ] Added : 99 causal constraints over 20 iterations in 3114 ms. Result :sat
Minimization took 646 ms.
[2024-05-23 13:35:22] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2024-05-23 13:35:22] [INFO ] [Real]Absence check using 15 positive and 50 generalized place invariants in 36 ms returned sat
[2024-05-23 13:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:23] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2024-05-23 13:35:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:35:23] [INFO ] [Nat]Absence check using 15 positive and 50 generalized place invariants in 21 ms returned sat
[2024-05-23 13:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:25] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2024-05-23 13:35:25] [INFO ] Computed and/alt/rep : 440/2012/440 causal constraints (skipped 1260 transitions) in 160 ms.
[2024-05-23 13:35:27] [INFO ] Added : 93 causal constraints over 19 iterations in 2694 ms. Result :sat
Minimization took 775 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-09b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 1745/1745 transitions.
Graph (complete) has 4290 edges and 717 vertex of which 708 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 0 output 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 2 place count 708 transition count 1744
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 707 transition count 1744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 707 transition count 1743
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 706 transition count 1743
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 705 transition count 1742
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 705 transition count 1741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 704 transition count 1741
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 18 place count 704 transition count 1741
Applied a total of 18 rules in 142 ms. Remains 704 /717 variables (removed 13) and now considering 1741/1745 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 704/717 places, 1741/1745 transitions.
// Phase 1: matrix 1741 rows 704 cols
[2024-05-23 13:35:33] [INFO ] Computed 65 invariants in 31 ms
Incomplete random walk after 1000000 steps, including 16249 resets, run finished after 3379 ms. (steps per millisecond=295 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2430 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2430 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2443 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2426 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 4) seen :0
[2024-05-23 13:35:41] [INFO ] Invariant cache hit.
[2024-05-23 13:35:41] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-23 13:35:41] [INFO ] [Real]Absence check using 14 positive and 51 generalized place invariants in 24 ms returned sat
[2024-05-23 13:35:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:42] [INFO ] [Real]Absence check using state equation in 1051 ms returned sat
[2024-05-23 13:35:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-23 13:35:42] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 24 ms returned sat
[2024-05-23 13:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:43] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2024-05-23 13:35:43] [INFO ] Computed and/alt/rep : 421/1876/421 causal constraints (skipped 1275 transitions) in 117 ms.
[2024-05-23 13:35:45] [INFO ] Added : 31 causal constraints over 8 iterations in 1799 ms. Result :sat
Minimization took 670 ms.
[2024-05-23 13:35:46] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-23 13:35:46] [INFO ] [Real]Absence check using 14 positive and 51 generalized place invariants in 24 ms returned sat
[2024-05-23 13:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:47] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2024-05-23 13:35:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2024-05-23 13:35:47] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 26 ms returned sat
[2024-05-23 13:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:48] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2024-05-23 13:35:48] [INFO ] Computed and/alt/rep : 421/1876/421 causal constraints (skipped 1275 transitions) in 162 ms.
[2024-05-23 13:35:49] [INFO ] Added : 21 causal constraints over 5 iterations in 1096 ms. Result :sat
Minimization took 1157 ms.
[2024-05-23 13:35:51] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-23 13:35:51] [INFO ] [Real]Absence check using 14 positive and 51 generalized place invariants in 34 ms returned sat
[2024-05-23 13:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:52] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2024-05-23 13:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2024-05-23 13:35:52] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 23 ms returned sat
[2024-05-23 13:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:53] [INFO ] [Nat]Absence check using state equation in 1058 ms returned sat
[2024-05-23 13:35:53] [INFO ] Computed and/alt/rep : 421/1876/421 causal constraints (skipped 1275 transitions) in 171 ms.
[2024-05-23 13:35:54] [INFO ] Added : 30 causal constraints over 6 iterations in 998 ms. Result :sat
Minimization took 794 ms.
[2024-05-23 13:35:55] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-23 13:35:55] [INFO ] [Real]Absence check using 14 positive and 51 generalized place invariants in 26 ms returned sat
[2024-05-23 13:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:56] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2024-05-23 13:35:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:35:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 19 ms returned sat
[2024-05-23 13:35:56] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 36 ms returned sat
[2024-05-23 13:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:35:58] [INFO ] [Nat]Absence check using state equation in 1173 ms returned sat
[2024-05-23 13:35:58] [INFO ] Computed and/alt/rep : 421/1876/421 causal constraints (skipped 1275 transitions) in 160 ms.
[2024-05-23 13:36:00] [INFO ] Added : 46 causal constraints over 11 iterations in 2046 ms. Result :sat
Minimization took 409 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 1741/1741 transitions.
Applied a total of 0 rules in 33 ms. Remains 704 /704 variables (removed 0) and now considering 1741/1741 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 704/704 places, 1741/1741 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 1741/1741 transitions.
Applied a total of 0 rules in 32 ms. Remains 704 /704 variables (removed 0) and now considering 1741/1741 (removed 0) transitions.
[2024-05-23 13:36:02] [INFO ] Invariant cache hit.
[2024-05-23 13:36:03] [INFO ] Implicit Places using invariants in 891 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 896 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 703/704 places, 1741/1741 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 703 transition count 1737
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 699 transition count 1737
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 698 transition count 1736
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 698 transition count 1735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 697 transition count 1735
Applied a total of 12 rules in 94 ms. Remains 697 /703 variables (removed 6) and now considering 1735/1741 (removed 6) transitions.
// Phase 1: matrix 1735 rows 697 cols
[2024-05-23 13:36:03] [INFO ] Computed 64 invariants in 18 ms
[2024-05-23 13:36:04] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-23 13:36:04] [INFO ] Invariant cache hit.
[2024-05-23 13:36:06] [INFO ] Implicit Places using invariants and state equation in 2364 ms returned []
Implicit Place search using SMT with State Equation took 3187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 697/704 places, 1735/1741 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4211 ms. Remains : 697/704 places, 1735/1741 transitions.
[2024-05-23 13:36:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16457 resets, run finished after 3546 ms. (steps per millisecond=282 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2438 resets, run finished after 991 ms. (steps per millisecond=1009 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2445 resets, run finished after 984 ms. (steps per millisecond=1016 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2432 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2439 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 4) seen :0
[2024-05-23 13:36:14] [INFO ] Invariant cache hit.
[2024-05-23 13:36:14] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-23 13:36:14] [INFO ] [Real]Absence check using 16 positive and 48 generalized place invariants in 21 ms returned sat
[2024-05-23 13:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:15] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2024-05-23 13:36:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 19 ms returned sat
[2024-05-23 13:36:15] [INFO ] [Nat]Absence check using 16 positive and 48 generalized place invariants in 25 ms returned sat
[2024-05-23 13:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:16] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2024-05-23 13:36:17] [INFO ] Computed and/alt/rep : 409/1784/409 causal constraints (skipped 1281 transitions) in 162 ms.
[2024-05-23 13:36:17] [INFO ] Added : 20 causal constraints over 4 iterations in 749 ms. Result :sat
Minimization took 317 ms.
[2024-05-23 13:36:18] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2024-05-23 13:36:18] [INFO ] [Real]Absence check using 16 positive and 48 generalized place invariants in 34 ms returned sat
[2024-05-23 13:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:19] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2024-05-23 13:36:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-23 13:36:19] [INFO ] [Nat]Absence check using 16 positive and 48 generalized place invariants in 23 ms returned sat
[2024-05-23 13:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:20] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2024-05-23 13:36:20] [INFO ] Computed and/alt/rep : 409/1784/409 causal constraints (skipped 1281 transitions) in 116 ms.
[2024-05-23 13:36:21] [INFO ] Added : 20 causal constraints over 4 iterations in 1047 ms. Result :sat
Minimization took 395 ms.
[2024-05-23 13:36:22] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-23 13:36:22] [INFO ] [Real]Absence check using 16 positive and 48 generalized place invariants in 27 ms returned sat
[2024-05-23 13:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:23] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2024-05-23 13:36:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 21 ms returned sat
[2024-05-23 13:36:23] [INFO ] [Nat]Absence check using 16 positive and 48 generalized place invariants in 36 ms returned sat
[2024-05-23 13:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:25] [INFO ] [Nat]Absence check using state equation in 1991 ms returned sat
[2024-05-23 13:36:25] [INFO ] Computed and/alt/rep : 409/1784/409 causal constraints (skipped 1281 transitions) in 195 ms.
[2024-05-23 13:36:28] [INFO ] Added : 38 causal constraints over 8 iterations in 3113 ms. Result :sat
Minimization took 552 ms.
[2024-05-23 13:36:29] [INFO ] [Real]Absence check using 16 positive place invariants in 19 ms returned sat
[2024-05-23 13:36:29] [INFO ] [Real]Absence check using 16 positive and 48 generalized place invariants in 30 ms returned sat
[2024-05-23 13:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:30] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2024-05-23 13:36:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-23 13:36:30] [INFO ] [Nat]Absence check using 16 positive and 48 generalized place invariants in 28 ms returned sat
[2024-05-23 13:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:31] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2024-05-23 13:36:32] [INFO ] Computed and/alt/rep : 409/1784/409 causal constraints (skipped 1281 transitions) in 118 ms.
[2024-05-23 13:36:33] [INFO ] Added : 37 causal constraints over 8 iterations in 1698 ms. Result :sat
Minimization took 598 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-09b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1735/1735 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 697 transition count 1734
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 696 transition count 1734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 696 transition count 1733
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 695 transition count 1733
Applied a total of 4 rules in 44 ms. Remains 695 /697 variables (removed 2) and now considering 1733/1735 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 695/697 places, 1733/1735 transitions.
// Phase 1: matrix 1733 rows 695 cols
[2024-05-23 13:36:36] [INFO ] Computed 64 invariants in 18 ms
Incomplete random walk after 1000000 steps, including 16384 resets, run finished after 3281 ms. (steps per millisecond=304 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2430 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2437 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 2) seen :0
[2024-05-23 13:36:41] [INFO ] Invariant cache hit.
[2024-05-23 13:36:41] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2024-05-23 13:36:41] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 34 ms returned sat
[2024-05-23 13:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:42] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2024-05-23 13:36:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-23 13:36:42] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 23 ms returned sat
[2024-05-23 13:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:43] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2024-05-23 13:36:43] [INFO ] Computed and/alt/rep : 407/1782/407 causal constraints (skipped 1281 transitions) in 117 ms.
[2024-05-23 13:36:45] [INFO ] Added : 40 causal constraints over 8 iterations in 1235 ms. Result :sat
Minimization took 473 ms.
[2024-05-23 13:36:45] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2024-05-23 13:36:45] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 34 ms returned sat
[2024-05-23 13:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:46] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2024-05-23 13:36:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-23 13:36:46] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 23 ms returned sat
[2024-05-23 13:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:47] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2024-05-23 13:36:47] [INFO ] Computed and/alt/rep : 407/1782/407 causal constraints (skipped 1281 transitions) in 115 ms.
[2024-05-23 13:36:48] [INFO ] Added : 22 causal constraints over 5 iterations in 1382 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ASLink-PT-09b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 1733/1733 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 695 transition count 1732
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 694 transition count 1732
Applied a total of 2 rules in 37 ms. Remains 694 /695 variables (removed 1) and now considering 1732/1733 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 694/695 places, 1732/1733 transitions.
// Phase 1: matrix 1732 rows 694 cols
[2024-05-23 13:36:50] [INFO ] Computed 64 invariants in 30 ms
Incomplete random walk after 1000000 steps, including 16288 resets, run finished after 3543 ms. (steps per millisecond=282 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2461 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 1) seen :0
[2024-05-23 13:36:54] [INFO ] Invariant cache hit.
[2024-05-23 13:36:54] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2024-05-23 13:36:54] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 28 ms returned sat
[2024-05-23 13:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:55] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2024-05-23 13:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:36:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2024-05-23 13:36:55] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 37 ms returned sat
[2024-05-23 13:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:36:57] [INFO ] [Nat]Absence check using state equation in 1530 ms returned sat
[2024-05-23 13:36:57] [INFO ] Computed and/alt/rep : 406/1781/406 causal constraints (skipped 1281 transitions) in 161 ms.
[2024-05-23 13:37:03] [INFO ] Added : 25 causal constraints over 5 iterations in 5599 ms. Result :sat
Minimization took 642 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1732/1732 transitions.
Applied a total of 0 rules in 31 ms. Remains 694 /694 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 694/694 places, 1732/1732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1732/1732 transitions.
Applied a total of 0 rules in 30 ms. Remains 694 /694 variables (removed 0) and now considering 1732/1732 (removed 0) transitions.
[2024-05-23 13:37:04] [INFO ] Invariant cache hit.
[2024-05-23 13:37:05] [INFO ] Implicit Places using invariants in 925 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 932 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 693/694 places, 1732/1732 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 692 transition count 1731
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 692 transition count 1730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 691 transition count 1730
Applied a total of 4 rules in 90 ms. Remains 691 /693 variables (removed 2) and now considering 1730/1732 (removed 2) transitions.
// Phase 1: matrix 1730 rows 691 cols
[2024-05-23 13:37:06] [INFO ] Computed 63 invariants in 18 ms
[2024-05-23 13:37:06] [INFO ] Implicit Places using invariants in 957 ms returned []
[2024-05-23 13:37:06] [INFO ] Invariant cache hit.
[2024-05-23 13:37:09] [INFO ] Implicit Places using invariants and state equation in 2747 ms returned []
Implicit Place search using SMT with State Equation took 3706 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 691/694 places, 1730/1732 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4759 ms. Remains : 691/694 places, 1730/1732 transitions.
[2024-05-23 13:37:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16371 resets, run finished after 3122 ms. (steps per millisecond=320 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2428 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 1) seen :0
[2024-05-23 13:37:13] [INFO ] Invariant cache hit.
[2024-05-23 13:37:13] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-23 13:37:14] [INFO ] [Real]Absence check using 15 positive and 48 generalized place invariants in 33 ms returned sat
[2024-05-23 13:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:37:14] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2024-05-23 13:37:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:37:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:37:14] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 22 ms returned sat
[2024-05-23 13:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:37:15] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2024-05-23 13:37:16] [INFO ] Computed and/alt/rep : 397/1708/397 causal constraints (skipped 1288 transitions) in 116 ms.
[2024-05-23 13:37:17] [INFO ] Added : 40 causal constraints over 8 iterations in 1814 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 31 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 691/691 places, 1730/1730 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 30 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
[2024-05-23 13:37:18] [INFO ] Invariant cache hit.
[2024-05-23 13:37:19] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-23 13:37:19] [INFO ] Invariant cache hit.
[2024-05-23 13:37:22] [INFO ] Implicit Places using invariants and state equation in 2464 ms returned []
Implicit Place search using SMT with State Equation took 3431 ms to find 0 implicit places.
[2024-05-23 13:37:22] [INFO ] Redundant transitions in 175 ms returned []
[2024-05-23 13:37:22] [INFO ] Invariant cache hit.
[2024-05-23 13:37:23] [INFO ] Dead Transitions using invariants and state equation in 1386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5031 ms. Remains : 691/691 places, 1730/1730 transitions.
Starting property specific reduction for ASLink-PT-09b-UpperBounds-07
[2024-05-23 13:37:23] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2024-05-23 13:37:23] [INFO ] Invariant cache hit.
[2024-05-23 13:37:24] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2024-05-23 13:37:24] [INFO ] [Real]Absence check using 15 positive and 48 generalized place invariants in 35 ms returned sat
[2024-05-23 13:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:37:24] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2024-05-23 13:37:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:37:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:37:25] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 24 ms returned sat
[2024-05-23 13:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:37:26] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2024-05-23 13:37:26] [INFO ] Computed and/alt/rep : 397/1708/397 causal constraints (skipped 1288 transitions) in 120 ms.
[2024-05-23 13:37:28] [INFO ] Added : 40 causal constraints over 8 iterations in 2084 ms. Result :sat
Minimization took 366 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 35 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 691/691 places, 1730/1730 transitions.
[2024-05-23 13:37:29] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16588 resets, run finished after 3725 ms. (steps per millisecond=268 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2453 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 1) seen :0
[2024-05-23 13:37:34] [INFO ] Invariant cache hit.
[2024-05-23 13:37:34] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2024-05-23 13:37:34] [INFO ] [Real]Absence check using 15 positive and 48 generalized place invariants in 23 ms returned sat
[2024-05-23 13:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 13:37:35] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-23 13:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 13:37:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2024-05-23 13:37:35] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 33 ms returned sat
[2024-05-23 13:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 13:37:36] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2024-05-23 13:37:36] [INFO ] Computed and/alt/rep : 397/1708/397 causal constraints (skipped 1288 transitions) in 123 ms.
[2024-05-23 13:37:38] [INFO ] Added : 40 causal constraints over 8 iterations in 2146 ms. Result :sat
Minimization took 377 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 32 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 691/691 places, 1730/1730 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 30 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
[2024-05-23 13:37:39] [INFO ] Invariant cache hit.
[2024-05-23 13:37:40] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-23 13:37:40] [INFO ] Invariant cache hit.
[2024-05-23 13:37:43] [INFO ] Implicit Places using invariants and state equation in 2518 ms returned []
Implicit Place search using SMT with State Equation took 3516 ms to find 0 implicit places.
[2024-05-23 13:37:43] [INFO ] Redundant transitions in 125 ms returned []
[2024-05-23 13:37:43] [INFO ] Invariant cache hit.
[2024-05-23 13:37:44] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5106 ms. Remains : 691/691 places, 1730/1730 transitions.
Ending property specific reduction for ASLink-PT-09b-UpperBounds-07 in 21050 ms.
[2024-05-23 13:37:45] [INFO ] Flatten gal took : 403 ms
[2024-05-23 13:37:45] [INFO ] Applying decomposition
[2024-05-23 13:37:45] [INFO ] Flatten gal took : 163 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph326741163983328434.txt' '-o' '/tmp/graph326741163983328434.bin' '-w' '/tmp/graph326741163983328434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph326741163983328434.bin' '-l' '-1' '-v' '-w' '/tmp/graph326741163983328434.weights' '-q' '0' '-e' '0.001'
[2024-05-23 13:37:46] [INFO ] Decomposing Gal with order
[2024-05-23 13:37:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 13:37:46] [INFO ] Removed a total of 3414 redundant transitions.
[2024-05-23 13:37:46] [INFO ] Flatten gal took : 300 ms
[2024-05-23 13:37:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 73 ms.
[2024-05-23 13:37:46] [INFO ] Time to serialize gal into /tmp/UpperBounds5266289768009347519.gal : 37 ms
[2024-05-23 13:37:46] [INFO ] Time to serialize properties into /tmp/UpperBounds16930835128015842946.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5266289768009347519.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16930835128015842946.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16930835128015842946.prop.
Detected timeout of ITS tools.
[2024-05-23 14:00:41] [INFO ] Applying decomposition
[2024-05-23 14:00:42] [INFO ] Flatten gal took : 1163 ms
[2024-05-23 14:00:43] [INFO ] Decomposing Gal with order
[2024-05-23 14:00:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 14:00:44] [INFO ] Removed a total of 3293 redundant transitions.
[2024-05-23 14:00:45] [INFO ] Flatten gal took : 1266 ms
[2024-05-23 14:00:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1374 labels/synchronizations in 379 ms.
[2024-05-23 14:00:46] [INFO ] Time to serialize gal into /tmp/UpperBounds17976100286143889362.gal : 88 ms
[2024-05-23 14:00:46] [INFO ] Time to serialize properties into /tmp/UpperBounds4196620484689616049.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17976100286143889362.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4196620484689616049.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds4196620484689616049.prop.
Detected timeout of ITS tools.
[2024-05-23 14:23:19] [INFO ] Flatten gal took : 792 ms
[2024-05-23 14:23:24] [INFO ] Input system was already deterministic with 1730 transitions.
[2024-05-23 14:23:24] [INFO ] Transformed 691 places.
[2024-05-23 14:23:24] [INFO ] Transformed 1730 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 14:23:25] [INFO ] Time to serialize gal into /tmp/UpperBounds1451525560334849167.gal : 74 ms
[2024-05-23 14:23:25] [INFO ] Time to serialize properties into /tmp/UpperBounds5984600424603093380.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1451525560334849167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5984600424603093380.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5984600424603093380.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 9446140 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15666132 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-09b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ASLink-PT-09b, 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 r021-smll-171620127900091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b 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 ;