About the Execution of Marcie+red for ASLink-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9690.231 | 3600000.00 | 3702689.00 | 120.90 | ? 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/mcc2023-input.r010-oct2-167813598700165.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ASLink-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598700165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:22 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-10b-UpperBounds-00
FORMULA_NAME ASLink-PT-10b-UpperBounds-01
FORMULA_NAME ASLink-PT-10b-UpperBounds-02
FORMULA_NAME ASLink-PT-10b-UpperBounds-03
FORMULA_NAME ASLink-PT-10b-UpperBounds-04
FORMULA_NAME ASLink-PT-10b-UpperBounds-05
FORMULA_NAME ASLink-PT-10b-UpperBounds-06
FORMULA_NAME ASLink-PT-10b-UpperBounds-07
FORMULA_NAME ASLink-PT-10b-UpperBounds-08
FORMULA_NAME ASLink-PT-10b-UpperBounds-09
FORMULA_NAME ASLink-PT-10b-UpperBounds-10
FORMULA_NAME ASLink-PT-10b-UpperBounds-11
FORMULA_NAME ASLink-PT-10b-UpperBounds-12
FORMULA_NAME ASLink-PT-10b-UpperBounds-13
FORMULA_NAME ASLink-PT-10b-UpperBounds-14
FORMULA_NAME ASLink-PT-10b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678674430468
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 02:27:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 02:27:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 02:27:13] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2023-03-13 02:27:13] [INFO ] Transformed 4410 places.
[2023-03-13 02:27:13] [INFO ] Transformed 5405 transitions.
[2023-03-13 02:27:13] [INFO ] Found NUPN structural information;
[2023-03-13 02:27:13] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 539 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
// Phase 1: matrix 5405 rows 4410 cols
[2023-03-13 02:27:14] [INFO ] Computed 433 place invariants in 314 ms
Incomplete random walk after 10000 steps, including 12 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 16) seen :7
FORMULA ASLink-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :1
FORMULA ASLink-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
[2023-03-13 02:27:14] [INFO ] Invariant cache hit.
[2023-03-13 02:27:15] [INFO ] [Real]Absence check using 102 positive place invariants in 117 ms returned sat
[2023-03-13 02:27:16] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 186 ms returned sat
[2023-03-13 02:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:19] [INFO ] [Real]Absence check using state equation in 3638 ms returned unknown
[2023-03-13 02:27:20] [INFO ] [Real]Absence check using 102 positive place invariants in 111 ms returned sat
[2023-03-13 02:27:20] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 220 ms returned sat
[2023-03-13 02:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:24] [INFO ] [Real]Absence check using state equation in 4021 ms returned unknown
[2023-03-13 02:27:25] [INFO ] [Real]Absence check using 102 positive place invariants in 215 ms returned sat
[2023-03-13 02:27:25] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 187 ms returned sat
[2023-03-13 02:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:29] [INFO ] [Real]Absence check using state equation in 3888 ms returned unknown
[2023-03-13 02:27:30] [INFO ] [Real]Absence check using 102 positive place invariants in 92 ms returned sat
[2023-03-13 02:27:30] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 181 ms returned sat
[2023-03-13 02:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:34] [INFO ] [Real]Absence check using state equation in 3995 ms returned unknown
[2023-03-13 02:27:35] [INFO ] [Real]Absence check using 102 positive place invariants in 152 ms returned sat
[2023-03-13 02:27:36] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 340 ms returned sat
[2023-03-13 02:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:39] [INFO ] [Real]Absence check using state equation in 3804 ms returned unknown
[2023-03-13 02:27:40] [INFO ] [Real]Absence check using 102 positive place invariants in 93 ms returned sat
[2023-03-13 02:27:41] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 825 ms returned sat
[2023-03-13 02:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:44] [INFO ] [Real]Absence check using state equation in 3370 ms returned unknown
[2023-03-13 02:27:45] [INFO ] [Real]Absence check using 102 positive place invariants in 91 ms returned sat
[2023-03-13 02:27:45] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 199 ms returned sat
[2023-03-13 02:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:49] [INFO ] [Real]Absence check using state equation in 3849 ms returned sat
[2023-03-13 02:27:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:27:50] [INFO ] [Nat]Absence check using 102 positive place invariants in 101 ms returned sat
[2023-03-13 02:27:50] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 185 ms returned sat
[2023-03-13 02:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:27:55] [INFO ] [Nat]Absence check using state equation in 4047 ms returned unknown
[2023-03-13 02:27:55] [INFO ] [Real]Absence check using 102 positive place invariants in 117 ms returned sat
[2023-03-13 02:27:56] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 172 ms returned sat
[2023-03-13 02:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:00] [INFO ] [Real]Absence check using state equation in 3908 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions removed 1030 transitions
Trivial Post-agglo rules discarded 1030 transitions
Performed 1030 trivial Post agglomeration. Transition count delta: 1030
Iterating post reduction 0 with 1030 rules applied. Total rules applied 1030 place count 4410 transition count 4375
Reduce places removed 1030 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1076 rules applied. Total rules applied 2106 place count 3380 transition count 4329
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 2121 place count 3368 transition count 4326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2124 place count 3365 transition count 4326
Performed 1025 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1025 Pre rules applied. Total rules applied 2124 place count 3365 transition count 3301
Deduced a syphon composed of 1025 places in 10 ms
Ensure Unique test removed 103 places
Reduce places removed 1128 places and 0 transitions.
Iterating global reduction 4 with 2153 rules applied. Total rules applied 4277 place count 2237 transition count 3301
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 4 with 72 rules applied. Total rules applied 4349 place count 2227 transition count 3239
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 4411 place count 2165 transition count 3239
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4411 place count 2165 transition count 3199
Deduced a syphon composed of 40 places in 20 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 4531 place count 2085 transition count 3199
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4531 place count 2085 transition count 3159
Deduced a syphon composed of 40 places in 20 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4611 place count 2045 transition count 3159
Discarding 141 places :
Symmetric choice reduction at 6 with 141 rule applications. Total rules 4752 place count 1904 transition count 3018
Iterating global reduction 6 with 141 rules applied. Total rules applied 4893 place count 1904 transition count 3018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4894 place count 1904 transition count 3017
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 46 Pre rules applied. Total rules applied 4894 place count 1904 transition count 2971
Deduced a syphon composed of 46 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 93 rules applied. Total rules applied 4987 place count 1857 transition count 2971
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4987 place count 1857 transition count 2970
Deduced a syphon composed of 1 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 4990 place count 1855 transition count 2970
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 5001 place count 1844 transition count 2901
Iterating global reduction 7 with 11 rules applied. Total rules applied 5012 place count 1844 transition count 2901
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 5012 place count 1844 transition count 2893
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 5028 place count 1836 transition count 2893
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5029 place count 1835 transition count 2885
Iterating global reduction 7 with 1 rules applied. Total rules applied 5030 place count 1835 transition count 2885
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5031 place count 1834 transition count 2877
Iterating global reduction 7 with 1 rules applied. Total rules applied 5032 place count 1834 transition count 2877
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5033 place count 1833 transition count 2869
Iterating global reduction 7 with 1 rules applied. Total rules applied 5034 place count 1833 transition count 2869
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5035 place count 1832 transition count 2861
Iterating global reduction 7 with 1 rules applied. Total rules applied 5036 place count 1832 transition count 2861
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5037 place count 1831 transition count 2853
Iterating global reduction 7 with 1 rules applied. Total rules applied 5038 place count 1831 transition count 2853
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5039 place count 1830 transition count 2845
Iterating global reduction 7 with 1 rules applied. Total rules applied 5040 place count 1830 transition count 2845
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5041 place count 1829 transition count 2837
Iterating global reduction 7 with 1 rules applied. Total rules applied 5042 place count 1829 transition count 2837
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5043 place count 1828 transition count 2829
Iterating global reduction 7 with 1 rules applied. Total rules applied 5044 place count 1828 transition count 2829
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5045 place count 1827 transition count 2821
Iterating global reduction 7 with 1 rules applied. Total rules applied 5046 place count 1827 transition count 2821
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5047 place count 1826 transition count 2813
Iterating global reduction 7 with 1 rules applied. Total rules applied 5048 place count 1826 transition count 2813
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5049 place count 1825 transition count 2805
Iterating global reduction 7 with 1 rules applied. Total rules applied 5050 place count 1825 transition count 2805
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5051 place count 1824 transition count 2797
Iterating global reduction 7 with 1 rules applied. Total rules applied 5052 place count 1824 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5053 place count 1823 transition count 2789
Iterating global reduction 7 with 1 rules applied. Total rules applied 5054 place count 1823 transition count 2789
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5055 place count 1822 transition count 2781
Iterating global reduction 7 with 1 rules applied. Total rules applied 5056 place count 1822 transition count 2781
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5057 place count 1821 transition count 2773
Iterating global reduction 7 with 1 rules applied. Total rules applied 5058 place count 1821 transition count 2773
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5059 place count 1820 transition count 2765
Iterating global reduction 7 with 1 rules applied. Total rules applied 5060 place count 1820 transition count 2765
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 260
Deduced a syphon composed of 260 places in 7 ms
Reduce places removed 260 places and 0 transitions.
Iterating global reduction 7 with 520 rules applied. Total rules applied 5580 place count 1560 transition count 2505
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5581 place count 1559 transition count 2504
Iterating global reduction 7 with 1 rules applied. Total rules applied 5582 place count 1559 transition count 2504
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5583 place count 1558 transition count 2503
Iterating global reduction 7 with 1 rules applied. Total rules applied 5584 place count 1558 transition count 2503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 5586 place count 1557 transition count 2502
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5588 place count 1556 transition count 2511
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 5599 place count 1556 transition count 2500
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 5610 place count 1545 transition count 2500
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 9 with 12 rules applied. Total rules applied 5622 place count 1545 transition count 2488
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 5634 place count 1533 transition count 2488
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5635 place count 1533 transition count 2488
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 5636 place count 1532 transition count 2487
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 5666 place count 1512 transition count 2477
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 5676 place count 1502 transition count 2477
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 29 Pre rules applied. Total rules applied 5676 place count 1502 transition count 2448
Deduced a syphon composed of 29 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 59 rules applied. Total rules applied 5735 place count 1472 transition count 2448
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 5746 place count 1461 transition count 2448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5746 place count 1461 transition count 2447
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5748 place count 1460 transition count 2447
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 13 with 42 rules applied. Total rules applied 5790 place count 1439 transition count 2426
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 5800 place count 1429 transition count 2416
Iterating global reduction 13 with 10 rules applied. Total rules applied 5810 place count 1429 transition count 2416
Free-agglomeration rule applied 10 times.
Iterating global reduction 13 with 10 rules applied. Total rules applied 5820 place count 1429 transition count 2406
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 5830 place count 1419 transition count 2406
Applied a total of 5830 rules in 3985 ms. Remains 1419 /4410 variables (removed 2991) and now considering 2406/5405 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3985 ms. Remains : 1419/4410 places, 2406/5405 transitions.
// Phase 1: matrix 2406 rows 1419 cols
[2023-03-13 02:28:04] [INFO ] Computed 245 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 9451 resets, run finished after 4219 ms. (steps per millisecond=237 ) properties (out of 8) seen :2
FORMULA ASLink-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1756 ms. (steps per millisecond=569 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 922 resets, run finished after 1991 ms. (steps per millisecond=502 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 921 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 908 resets, run finished after 1981 ms. (steps per millisecond=504 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 917 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 913 resets, run finished after 1905 ms. (steps per millisecond=524 ) properties (out of 6) seen :0
[2023-03-13 02:28:19] [INFO ] Invariant cache hit.
[2023-03-13 02:28:19] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:28:20] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 41 ms returned sat
[2023-03-13 02:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:20] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2023-03-13 02:28:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:28:21] [INFO ] [Nat]Absence check using 67 positive place invariants in 22 ms returned sat
[2023-03-13 02:28:21] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 42 ms returned sat
[2023-03-13 02:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:22] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2023-03-13 02:28:22] [INFO ] Computed and/alt/rep : 959/3692/959 causal constraints (skipped 1398 transitions) in 181 ms.
[2023-03-13 02:28:27] [INFO ] Added : 140 causal constraints over 28 iterations in 4989 ms. Result :sat
Minimization took 749 ms.
[2023-03-13 02:28:28] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:28:29] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 155 ms returned sat
[2023-03-13 02:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:30] [INFO ] [Real]Absence check using state equation in 1495 ms returned sat
[2023-03-13 02:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:28:30] [INFO ] [Nat]Absence check using 67 positive place invariants in 59 ms returned sat
[2023-03-13 02:28:30] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 55 ms returned sat
[2023-03-13 02:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:32] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2023-03-13 02:28:32] [INFO ] Computed and/alt/rep : 959/3692/959 causal constraints (skipped 1398 transitions) in 281 ms.
[2023-03-13 02:28:52] [INFO ] Added : 620 causal constraints over 124 iterations in 20118 ms.(timeout) Result :sat
Minimization took 1060 ms.
[2023-03-13 02:28:53] [INFO ] [Real]Absence check using 67 positive place invariants in 19 ms returned sat
[2023-03-13 02:28:53] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 85 ms returned sat
[2023-03-13 02:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:54] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2023-03-13 02:28:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:28:55] [INFO ] [Nat]Absence check using 67 positive place invariants in 37 ms returned sat
[2023-03-13 02:28:55] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 127 ms returned sat
[2023-03-13 02:28:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:28:57] [INFO ] [Nat]Absence check using state equation in 1877 ms returned sat
[2023-03-13 02:28:57] [INFO ] Computed and/alt/rep : 959/3692/959 causal constraints (skipped 1398 transitions) in 223 ms.
[2023-03-13 02:29:17] [INFO ] Added : 595 causal constraints over 119 iterations in 20162 ms.(timeout) Result :sat
Minimization took 1797 ms.
[2023-03-13 02:29:19] [INFO ] [Real]Absence check using 67 positive place invariants in 20 ms returned sat
[2023-03-13 02:29:19] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 45 ms returned sat
[2023-03-13 02:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:29:20] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2023-03-13 02:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:29:20] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:29:20] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 43 ms returned sat
[2023-03-13 02:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:29:22] [INFO ] [Nat]Absence check using state equation in 1491 ms returned sat
[2023-03-13 02:29:22] [INFO ] Computed and/alt/rep : 959/3692/959 causal constraints (skipped 1398 transitions) in 153 ms.
[2023-03-13 02:29:42] [INFO ] Added : 570 causal constraints over 114 iterations in 20052 ms.(timeout) Result :sat
Minimization took 1356 ms.
[2023-03-13 02:29:44] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:29:44] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 89 ms returned sat
[2023-03-13 02:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:29:45] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2023-03-13 02:29:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:29:45] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:29:45] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 72 ms returned sat
[2023-03-13 02:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:29:46] [INFO ] [Nat]Absence check using state equation in 1227 ms returned sat
[2023-03-13 02:29:47] [INFO ] Computed and/alt/rep : 959/3692/959 causal constraints (skipped 1398 transitions) in 151 ms.
[2023-03-13 02:29:55] [INFO ] Added : 135 causal constraints over 27 iterations in 8312 ms. Result :sat
Minimization took 730 ms.
[2023-03-13 02:29:56] [INFO ] [Real]Absence check using 67 positive place invariants in 25 ms returned sat
[2023-03-13 02:29:56] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 57 ms returned sat
[2023-03-13 02:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:29:57] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2023-03-13 02:29:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:29:57] [INFO ] [Nat]Absence check using 67 positive place invariants in 20 ms returned sat
[2023-03-13 02:29:57] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 77 ms returned sat
[2023-03-13 02:29:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:30:00] [INFO ] [Nat]Absence check using state equation in 2201 ms returned sat
[2023-03-13 02:30:00] [INFO ] Computed and/alt/rep : 959/3692/959 causal constraints (skipped 1398 transitions) in 169 ms.
[2023-03-13 02:30:20] [INFO ] Added : 600 causal constraints over 120 iterations in 20076 ms.(timeout) Result :sat
Minimization took 1200 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1419/1419 places, 2406/2406 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 1418 transition count 2405
Applied a total of 2 rules in 107 ms. Remains 1418 /1419 variables (removed 1) and now considering 2405/2406 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1418/1419 places, 2405/2406 transitions.
// Phase 1: matrix 2405 rows 1418 cols
[2023-03-13 02:30:43] [INFO ] Computed 245 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 9457 resets, run finished after 4250 ms. (steps per millisecond=235 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 921 resets, run finished after 1804 ms. (steps per millisecond=554 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 920 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 920 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 915 resets, run finished after 1885 ms. (steps per millisecond=530 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1837 ms. (steps per millisecond=544 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 916 resets, run finished after 1882 ms. (steps per millisecond=531 ) properties (out of 6) seen :0
[2023-03-13 02:30:59] [INFO ] Invariant cache hit.
[2023-03-13 02:30:59] [INFO ] [Real]Absence check using 67 positive place invariants in 105 ms returned sat
[2023-03-13 02:30:59] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 58 ms returned sat
[2023-03-13 02:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:00] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2023-03-13 02:31:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:31:00] [INFO ] [Nat]Absence check using 67 positive place invariants in 24 ms returned sat
[2023-03-13 02:31:00] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 43 ms returned sat
[2023-03-13 02:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:01] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2023-03-13 02:31:01] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 153 ms.
[2023-03-13 02:31:21] [INFO ] Added : 560 causal constraints over 112 iterations in 20111 ms.(timeout) Result :sat
Minimization took 1324 ms.
[2023-03-13 02:31:23] [INFO ] [Real]Absence check using 67 positive place invariants in 27 ms returned sat
[2023-03-13 02:31:23] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 83 ms returned sat
[2023-03-13 02:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:24] [INFO ] [Real]Absence check using state equation in 1022 ms returned sat
[2023-03-13 02:31:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:31:25] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:31:25] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 42 ms returned sat
[2023-03-13 02:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:26] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2023-03-13 02:31:26] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 149 ms.
[2023-03-13 02:31:35] [INFO ] Added : 254 causal constraints over 51 iterations in 8604 ms. Result :sat
Minimization took 776 ms.
[2023-03-13 02:31:36] [INFO ] [Real]Absence check using 67 positive place invariants in 26 ms returned sat
[2023-03-13 02:31:36] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 79 ms returned sat
[2023-03-13 02:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:37] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2023-03-13 02:31:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:31:37] [INFO ] [Nat]Absence check using 67 positive place invariants in 186 ms returned sat
[2023-03-13 02:31:37] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 69 ms returned sat
[2023-03-13 02:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:39] [INFO ] [Nat]Absence check using state equation in 1340 ms returned sat
[2023-03-13 02:31:39] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 115 ms.
[2023-03-13 02:31:43] [INFO ] Added : 143 causal constraints over 29 iterations in 4495 ms. Result :sat
Minimization took 1252 ms.
[2023-03-13 02:31:45] [INFO ] [Real]Absence check using 67 positive place invariants in 57 ms returned sat
[2023-03-13 02:31:45] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 59 ms returned sat
[2023-03-13 02:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:46] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2023-03-13 02:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:31:46] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:31:46] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 37 ms returned sat
[2023-03-13 02:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:31:48] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2023-03-13 02:31:48] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 124 ms.
[2023-03-13 02:32:08] [INFO ] Added : 585 causal constraints over 117 iterations in 20153 ms.(timeout) Result :sat
Minimization took 1250 ms.
[2023-03-13 02:32:09] [INFO ] [Real]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-13 02:32:10] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 976 ms returned sat
[2023-03-13 02:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:32:12] [INFO ] [Real]Absence check using state equation in 1294 ms returned sat
[2023-03-13 02:32:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:32:12] [INFO ] [Nat]Absence check using 67 positive place invariants in 20 ms returned sat
[2023-03-13 02:32:12] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 43 ms returned sat
[2023-03-13 02:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:32:13] [INFO ] [Nat]Absence check using state equation in 1101 ms returned sat
[2023-03-13 02:32:13] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 199 ms.
[2023-03-13 02:32:33] [INFO ] Added : 620 causal constraints over 124 iterations in 20133 ms.(timeout) Result :sat
Minimization took 804 ms.
[2023-03-13 02:32:35] [INFO ] [Real]Absence check using 67 positive place invariants in 24 ms returned sat
[2023-03-13 02:32:35] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 47 ms returned sat
[2023-03-13 02:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:32:35] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2023-03-13 02:32:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:32:36] [INFO ] [Nat]Absence check using 67 positive place invariants in 19 ms returned sat
[2023-03-13 02:32:36] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 82 ms returned sat
[2023-03-13 02:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:32:37] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2023-03-13 02:32:37] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 150 ms.
[2023-03-13 02:32:50] [INFO ] Added : 100 causal constraints over 20 iterations in 12664 ms. Result :sat
Minimization took 533 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 2405/2405 transitions.
Applied a total of 0 rules in 55 ms. Remains 1418 /1418 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 1418/1418 places, 2405/2405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 2405/2405 transitions.
Applied a total of 0 rules in 63 ms. Remains 1418 /1418 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
[2023-03-13 02:33:09] [INFO ] Invariant cache hit.
[2023-03-13 02:33:10] [INFO ] Implicit Places using invariants in 1230 ms returned [1, 18, 20, 32, 49, 67, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 750, 754, 755, 766, 767, 769, 786, 804, 878, 879, 890, 891, 893, 910, 928, 998, 1002, 1003, 1014, 1015, 1017, 1034, 1052, 1121, 1125, 1126, 1137, 1138, 1140, 1157, 1175, 1244, 1248, 1249, 1252, 1263, 1264, 1265, 1283, 1285, 1289, 1307, 1308, 1309, 1310, 1322, 1328, 1334, 1340, 1346, 1352, 1358, 1364, 1370, 1376, 1382]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1247 ms to find 101 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1317/1418 places, 2405/2405 transitions.
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 1317 transition count 2220
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 197 rules applied. Total rules applied 382 place count 1132 transition count 2208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 1130 transition count 2208
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 384 place count 1130 transition count 2161
Deduced a syphon composed of 47 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 479 place count 1082 transition count 2161
Discarding 4 places :
Implicit places reduction removed 4 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 3 with 12 rules applied. Total rules applied 491 place count 1078 transition count 2153
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 499 place count 1070 transition count 2153
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 514 place count 1055 transition count 2138
Iterating global reduction 5 with 15 rules applied. Total rules applied 529 place count 1055 transition count 2138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 532 place count 1055 transition count 2135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 532 place count 1055 transition count 2134
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 534 place count 1054 transition count 2134
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 537 place count 1051 transition count 2128
Iterating global reduction 6 with 3 rules applied. Total rules applied 540 place count 1051 transition count 2128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 541 place count 1050 transition count 2127
Iterating global reduction 6 with 1 rules applied. Total rules applied 542 place count 1050 transition count 2127
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 543 place count 1049 transition count 2125
Iterating global reduction 6 with 1 rules applied. Total rules applied 544 place count 1049 transition count 2125
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 684 place count 979 transition count 2055
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 692 place count 971 transition count 2047
Iterating global reduction 6 with 8 rules applied. Total rules applied 700 place count 971 transition count 2047
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 707 place count 971 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 708 place count 970 transition count 2039
Iterating global reduction 7 with 1 rules applied. Total rules applied 709 place count 970 transition count 2039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 710 place count 970 transition count 2038
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 714 place count 968 transition count 2039
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 737 place count 968 transition count 2016
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 761 place count 944 transition count 2016
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 791 place count 944 transition count 2016
Applied a total of 791 rules in 487 ms. Remains 944 /1317 variables (removed 373) and now considering 2016/2405 (removed 389) transitions.
// Phase 1: matrix 2016 rows 944 cols
[2023-03-13 02:33:11] [INFO ] Computed 138 place invariants in 28 ms
[2023-03-13 02:33:12] [INFO ] Implicit Places using invariants in 776 ms returned [74, 91, 97, 100, 102, 105, 106, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272, 277, 278, 330, 347, 353, 356, 358, 363, 364, 416, 433, 439, 442, 444, 449, 450, 520, 526, 529, 531, 537, 538, 607, 613, 616, 618, 621, 626, 627, 679, 697, 703, 706, 708, 713, 714, 766, 783, 789, 792, 794, 799, 800, 852, 869, 875, 878, 880]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 779 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 877/1418 places, 2016/2405 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 847 transition count 1986
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 847 transition count 1986
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 837 transition count 1976
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 837 transition count 1976
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 116 place count 819 transition count 1958
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 146 place count 819 transition count 1928
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 176 place count 789 transition count 1928
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 183 place count 789 transition count 1921
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 190 place count 782 transition count 1921
Applied a total of 190 rules in 167 ms. Remains 782 /877 variables (removed 95) and now considering 1921/2016 (removed 95) transitions.
// Phase 1: matrix 1921 rows 782 cols
[2023-03-13 02:33:12] [INFO ] Computed 71 place invariants in 14 ms
[2023-03-13 02:33:12] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-13 02:33:12] [INFO ] Invariant cache hit.
[2023-03-13 02:33:14] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 782/1418 places, 1921/2405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5147 ms. Remains : 782/1418 places, 1921/2405 transitions.
Successfully produced net in file /tmp/petri1000_5981774246688186783.dot
Successfully produced net in file /tmp/petri1001_18285831756291648632.dot
Successfully produced net in file /tmp/petri1002_14229311568523072438.dot
Successfully produced net in file /tmp/petri1003_10868490256980952193.dot
Successfully produced net in file /tmp/petri1004_5215035669376150486.dot
Successfully produced net in file /tmp/petri1005_9605618512637522587.dot
Successfully produced net in file /tmp/petri1006_3560310239084409701.dot
Successfully produced net in file /tmp/petri1007_6845460341622166159.dot
Successfully produced net in file /tmp/petri1008_17708317226252316097.dot
Successfully produced net in file /tmp/petri1009_15702761798336876703.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1911 rows 782 cols
[2023-03-13 02:33:14] [INFO ] Computed 71 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 16096 resets, run finished after 2665 ms. (steps per millisecond=375 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2125 resets, run finished after 817 ms. (steps per millisecond=1223 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2133 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2133 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2135 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2135 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2132 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 6) seen :0
[2023-03-13 02:33:22] [INFO ] Invariant cache hit.
[2023-03-13 02:33:22] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2023-03-13 02:33:22] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 15 ms returned sat
[2023-03-13 02:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:23] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-13 02:33:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:23] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 12 ms returned sat
[2023-03-13 02:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:24] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2023-03-13 02:33:24] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 151 ms.
[2023-03-13 02:33:26] [INFO ] Added : 40 causal constraints over 9 iterations in 1476 ms. Result :sat
Minimization took 294 ms.
[2023-03-13 02:33:26] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:26] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 29 ms returned sat
[2023-03-13 02:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:27] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2023-03-13 02:33:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:27] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-13 02:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:27] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-13 02:33:28] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 136 ms.
[2023-03-13 02:33:29] [INFO ] Added : 38 causal constraints over 8 iterations in 1372 ms. Result :sat
Minimization took 181 ms.
[2023-03-13 02:33:29] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:29] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 21 ms returned sat
[2023-03-13 02:33:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:30] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2023-03-13 02:33:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-13 02:33:30] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-13 02:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:31] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2023-03-13 02:33:31] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 126 ms.
[2023-03-13 02:33:34] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 5 ms to minimize.
[2023-03-13 02:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2023-03-13 02:33:35] [INFO ] Added : 80 causal constraints over 18 iterations in 3721 ms. Result :sat
Minimization took 381 ms.
[2023-03-13 02:33:36] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-13 02:33:36] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-13 02:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:36] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2023-03-13 02:33:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:36] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 118 ms returned sat
[2023-03-13 02:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:37] [INFO ] [Nat]Absence check using state equation in 1009 ms returned sat
[2023-03-13 02:33:38] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 219 ms.
[2023-03-13 02:33:40] [INFO ] Added : 66 causal constraints over 14 iterations in 2737 ms. Result :sat
Minimization took 696 ms.
[2023-03-13 02:33:41] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:41] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 15 ms returned sat
[2023-03-13 02:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:42] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2023-03-13 02:33:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 102 ms returned sat
[2023-03-13 02:33:42] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 22 ms returned sat
[2023-03-13 02:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:43] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-13 02:33:43] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 125 ms.
[2023-03-13 02:33:44] [INFO ] Added : 35 causal constraints over 7 iterations in 1049 ms. Result :sat
Minimization took 185 ms.
[2023-03-13 02:33:45] [INFO ] [Real]Absence check using 16 positive place invariants in 111 ms returned sat
[2023-03-13 02:33:45] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 30 ms returned sat
[2023-03-13 02:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:45] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2023-03-13 02:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2023-03-13 02:33:46] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-13 02:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:48] [INFO ] [Nat]Absence check using state equation in 2248 ms returned sat
[2023-03-13 02:33:48] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 126 ms.
[2023-03-13 02:33:51] [INFO ] Added : 75 causal constraints over 15 iterations in 3121 ms. Result :sat
Minimization took 682 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 1911/1911 transitions.
Graph (complete) has 4700 edges and 782 vertex of which 772 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 772 transition count 1909
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 770 transition count 1909
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 770 transition count 1907
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 768 transition count 1907
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 766 transition count 1905
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 766 transition count 1905
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 766 transition count 1903
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 766 transition count 1902
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 765 transition count 1902
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 27 place count 765 transition count 1902
Applied a total of 27 rules in 124 ms. Remains 765 /782 variables (removed 17) and now considering 1902/1911 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 765/782 places, 1902/1911 transitions.
// Phase 1: matrix 1902 rows 765 cols
[2023-03-13 02:33:54] [INFO ] Computed 71 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 15952 resets, run finished after 2860 ms. (steps per millisecond=349 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2134 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0
[2023-03-13 02:33:58] [INFO ] Invariant cache hit.
[2023-03-13 02:33:58] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-13 02:33:58] [INFO ] [Real]Absence check using 15 positive and 56 generalized place invariants in 27 ms returned sat
[2023-03-13 02:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:33:59] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2023-03-13 02:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:33:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-13 02:33:59] [INFO ] [Nat]Absence check using 15 positive and 56 generalized place invariants in 27 ms returned sat
[2023-03-13 02:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:00] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2023-03-13 02:34:00] [INFO ] Computed and/alt/rep : 458/2018/458 causal constraints (skipped 1395 transitions) in 121 ms.
[2023-03-13 02:34:01] [INFO ] Added : 32 causal constraints over 7 iterations in 1256 ms. Result :sat
Minimization took 250 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1902/1902 transitions.
Applied a total of 0 rules in 31 ms. Remains 765 /765 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 765/765 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1902/1902 transitions.
Applied a total of 0 rules in 31 ms. Remains 765 /765 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2023-03-13 02:34:02] [INFO ] Invariant cache hit.
[2023-03-13 02:34:02] [INFO ] Implicit Places using invariants in 676 ms returned [410, 481]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 678 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 763/765 places, 1902/1902 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 761 transition count 1900
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 761 transition count 1898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 759 transition count 1898
Applied a total of 8 rules in 93 ms. Remains 759 /763 variables (removed 4) and now considering 1898/1902 (removed 4) transitions.
// Phase 1: matrix 1898 rows 759 cols
[2023-03-13 02:34:03] [INFO ] Computed 69 place invariants in 28 ms
[2023-03-13 02:34:03] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-13 02:34:03] [INFO ] Invariant cache hit.
[2023-03-13 02:34:05] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/765 places, 1898/1902 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3334 ms. Remains : 759/765 places, 1898/1902 transitions.
[2023-03-13 02:34:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16005 resets, run finished after 2861 ms. (steps per millisecond=349 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2132 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 1) seen :0
[2023-03-13 02:34:09] [INFO ] Invariant cache hit.
[2023-03-13 02:34:09] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2023-03-13 02:34:09] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 48 ms returned sat
[2023-03-13 02:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:09] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2023-03-13 02:34:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:34:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-13 02:34:10] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 18 ms returned sat
[2023-03-13 02:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:10] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2023-03-13 02:34:11] [INFO ] Computed and/alt/rep : 440/1872/440 causal constraints (skipped 1409 transitions) in 105 ms.
[2023-03-13 02:34:12] [INFO ] Added : 45 causal constraints over 9 iterations in 1466 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 30 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 759/759 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-13 02:34:13] [INFO ] Invariant cache hit.
[2023-03-13 02:34:13] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-13 02:34:13] [INFO ] Invariant cache hit.
[2023-03-13 02:34:15] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2023-03-13 02:34:15] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-13 02:34:15] [INFO ] Invariant cache hit.
[2023-03-13 02:34:16] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3244 ms. Remains : 759/759 places, 1898/1898 transitions.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-00
[2023-03-13 02:34:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-13 02:34:16] [INFO ] Invariant cache hit.
[2023-03-13 02:34:16] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-03-13 02:34:16] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 13 ms returned sat
[2023-03-13 02:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:16] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-13 02:34:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:34:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-13 02:34:17] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 20 ms returned sat
[2023-03-13 02:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:18] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2023-03-13 02:34:18] [INFO ] Computed and/alt/rep : 440/1872/440 causal constraints (skipped 1409 transitions) in 102 ms.
[2023-03-13 02:34:19] [INFO ] Added : 45 causal constraints over 9 iterations in 1572 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 32 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 759/759 places, 1898/1898 transitions.
[2023-03-13 02:34:20] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 15979 resets, run finished after 2970 ms. (steps per millisecond=336 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2139 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 1) seen :0
[2023-03-13 02:34:24] [INFO ] Invariant cache hit.
[2023-03-13 02:34:24] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-13 02:34:24] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 31 ms returned sat
[2023-03-13 02:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:24] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2023-03-13 02:34:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 02:34:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 91 ms returned sat
[2023-03-13 02:34:25] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 124 ms returned sat
[2023-03-13 02:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 02:34:26] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2023-03-13 02:34:26] [INFO ] Computed and/alt/rep : 440/1872/440 causal constraints (skipped 1409 transitions) in 217 ms.
[2023-03-13 02:34:27] [INFO ] Added : 45 causal constraints over 9 iterations in 1585 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 33 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 759/759 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 33 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-13 02:34:28] [INFO ] Invariant cache hit.
[2023-03-13 02:34:29] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-13 02:34:29] [INFO ] Invariant cache hit.
[2023-03-13 02:34:30] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
[2023-03-13 02:34:30] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-13 02:34:30] [INFO ] Invariant cache hit.
[2023-03-13 02:34:31] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3261 ms. Remains : 759/759 places, 1898/1898 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-00 in 15419 ms.
[2023-03-13 02:34:32] [INFO ] Flatten gal took : 352 ms
[2023-03-13 02:34:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 02:34:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 759 places, 1898 transitions and 7766 arcs took 11 ms.
Total runtime 439305 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ASLink_PT_10b
(NrP: 759 NrTr: 1898 NrArc: 7766)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.102sec
net check time: 0m 0.001sec
init dd package: 0m 2.891sec
before gc: list nodes free: 1171886
after gc: idd nodes used:4990, unused:63995010; list nodes free:264208773
before gc: list nodes free: 420762
after gc: idd nodes used:5509, unused:63994491; list nodes free:272578830
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6453768 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097368 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.013sec
4428 3417 3358 3757 3756 3689 3218 3606 3853 3888 3628 3337 3822 3878 3829 3358 3720 3939 3974 3785 3560 3982 4027 4071 3404 3888 4082 4138 4298 3698 4163 4212 4205 3724 4000 4274 4327 4527 3841 4403 4365 4405 4219 4219 4530 4480 4316 3858 4520 4617 4652 4503 4119 4697 4751 4577 3964 4640 4795 4828 4768 4207 4865 4911 4775 4051 4757 4983 5008 4750 4355 5028 5066 5106 4197 4912 5145
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-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is ASLink-PT-10b, 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 r010-oct2-167813598700165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10b.tgz
mv ASLink-PT-10b 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 ;