Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038005900084.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ASLink-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.4M May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620418192015

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 20:09:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-07 20:09:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 20:09:53] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2021-05-07 20:09:53] [INFO ] Transformed 4410 places.
[2021-05-07 20:09:53] [INFO ] Transformed 5405 transitions.
[2021-05-07 20:09:53] [INFO ] Found NUPN structural information;
[2021-05-07 20:09:53] [INFO ] Parsed PT model containing 4410 places and 5405 transitions in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 165 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 13 resets, run finished after 130 ms. (steps per millisecond=76 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1]
FORMULA ASLink-PT-10b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA ASLink-PT-10b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 5405 rows 4410 cols
[2021-05-07 20:09:55] [INFO ] Computed 433 place invariants in 613 ms
[2021-05-07 20:09:56] [INFO ] [Real]Absence check using 102 positive place invariants in 314 ms returned sat
[2021-05-07 20:09:56] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 838 ms returned sat
[2021-05-07 20:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:00] [INFO ] [Real]Absence check using state equation in 3262 ms returned (error "Solver has unexpectedly terminated")
[2021-05-07 20:10:01] [INFO ] [Real]Absence check using 102 positive place invariants in 303 ms returned sat
[2021-05-07 20:10:01] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 278 ms returned unsat
[2021-05-07 20:10:02] [INFO ] [Real]Absence check using 102 positive place invariants in 297 ms returned sat
[2021-05-07 20:10:03] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 842 ms returned sat
[2021-05-07 20:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:06] [INFO ] [Real]Absence check using state equation in 3217 ms returned (error "Solver has unexpectedly terminated")
[2021-05-07 20:10:07] [INFO ] [Real]Absence check using 102 positive place invariants in 327 ms returned sat
[2021-05-07 20:10:08] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 992 ms returned sat
[2021-05-07 20:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 20:10:11] [INFO ] [Real]Absence check using state equation in 3033 ms returned (error "Failed to check-sat")
[2021-05-07 20:10:12] [INFO ] [Real]Absence check using 102 positive place invariants in 304 ms returned sat
[2021-05-07 20:10:13] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 981 ms returned sat
[2021-05-07 20:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:16] [INFO ] [Real]Absence check using state equation in 3077 ms returned (error "Failed to check-sat")
[2021-05-07 20:10:17] [INFO ] [Real]Absence check using 102 positive place invariants in 306 ms returned sat
[2021-05-07 20:10:18] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 847 ms returned sat
[2021-05-07 20:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:21] [INFO ] [Real]Absence check using state equation in 3325 ms returned (error "Failed to check-sat")
[2021-05-07 20:10:22] [INFO ] [Real]Absence check using 102 positive place invariants in 294 ms returned sat
[2021-05-07 20:10:23] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 993 ms returned sat
[2021-05-07 20:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:26] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 20:10:26] [INFO ] [Real]Absence check using state equation in 3207 ms returned (error "Failed to check-sat")
[2021-05-07 20:10:27] [INFO ] [Real]Absence check using 102 positive place invariants in 317 ms returned sat
[2021-05-07 20:10:28] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 997 ms returned sat
[2021-05-07 20:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 20:10:31] [INFO ] [Real]Absence check using state equation in 3169 ms returned (error "Failed to check-sat")
[2021-05-07 20:10:32] [INFO ] [Real]Absence check using 102 positive place invariants in 306 ms returned sat
[2021-05-07 20:10:33] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 988 ms returned sat
[2021-05-07 20:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:36] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 20:10:36] [INFO ] [Real]Absence check using state equation in 3167 ms returned (error "Failed to check-sat")
[2021-05-07 20:10:37] [INFO ] [Real]Absence check using 102 positive place invariants in 299 ms returned sat
[2021-05-07 20:10:38] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 849 ms returned sat
[2021-05-07 20:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:10:41] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 20:10:41] [INFO ] [Real]Absence check using state equation in 3467 ms returned (error "Failed to check-sat")
FORMULA ASLink-PT-10b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 55 out of 4410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Performed 1018 Post agglomeration using F-continuation condition.Transition count delta: 1018
Iterating post reduction 0 with 1018 rules applied. Total rules applied 1018 place count 4410 transition count 4387
Reduce places removed 1018 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 1061 rules applied. Total rules applied 2079 place count 3392 transition count 4344
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2089 place count 3382 transition count 4344
Performed 1016 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1016 Pre rules applied. Total rules applied 2089 place count 3382 transition count 3328
Deduced a syphon composed of 1016 places in 11 ms
Ensure Unique test removed 99 places
Reduce places removed 1115 places and 0 transitions.
Iterating global reduction 3 with 2131 rules applied. Total rules applied 4220 place count 2267 transition count 3328
Discarding 10 places :
Implicit places reduction removed 10 places
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Iterating post reduction 3 with 68 rules applied. Total rules applied 4288 place count 2257 transition count 3270
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 4346 place count 2199 transition count 3270
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 4346 place count 2199 transition count 3233
Deduced a syphon composed of 37 places in 31 ms
Ensure Unique test removed 37 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 111 rules applied. Total rules applied 4457 place count 2125 transition count 3233
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 4457 place count 2125 transition count 3196
Deduced a syphon composed of 37 places in 28 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 4531 place count 2088 transition count 3196
Symmetric choice reduction at 5 with 140 rule applications. Total rules 4671 place count 2088 transition count 3196
Deduced a syphon composed of 140 places in 9 ms
Reduce places removed 140 places and 140 transitions.
Iterating global reduction 5 with 280 rules applied. Total rules applied 4951 place count 1948 transition count 3056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4952 place count 1948 transition count 3055
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 44 Pre rules applied. Total rules applied 4952 place count 1948 transition count 3011
Deduced a syphon composed of 44 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 89 rules applied. Total rules applied 5041 place count 1903 transition count 3011
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 5041 place count 1903 transition count 3010
Deduced a syphon composed of 1 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 5044 place count 1901 transition count 3010
Symmetric choice reduction at 6 with 10 rule applications. Total rules 5054 place count 1901 transition count 3010
Deduced a syphon composed of 10 places in 12 ms
Reduce places removed 10 places and 63 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 5074 place count 1891 transition count 2947
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 5074 place count 1891 transition count 2940
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 5088 place count 1884 transition count 2940
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5089 place count 1884 transition count 2940
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5091 place count 1883 transition count 2932
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5092 place count 1883 transition count 2932
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5094 place count 1882 transition count 2924
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5095 place count 1882 transition count 2924
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5097 place count 1881 transition count 2916
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5098 place count 1881 transition count 2916
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5100 place count 1880 transition count 2908
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5101 place count 1880 transition count 2908
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5103 place count 1879 transition count 2900
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5104 place count 1879 transition count 2900
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5106 place count 1878 transition count 2892
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5107 place count 1878 transition count 2892
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5109 place count 1877 transition count 2884
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5110 place count 1877 transition count 2884
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5112 place count 1876 transition count 2876
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5113 place count 1876 transition count 2876
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5115 place count 1875 transition count 2868
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5116 place count 1875 transition count 2868
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5118 place count 1874 transition count 2860
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5119 place count 1874 transition count 2860
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5121 place count 1873 transition count 2852
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5122 place count 1873 transition count 2852
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5124 place count 1872 transition count 2844
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5125 place count 1872 transition count 2844
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5127 place count 1871 transition count 2836
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5128 place count 1871 transition count 2836
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5130 place count 1870 transition count 2828
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5131 place count 1870 transition count 2828
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5133 place count 1869 transition count 2820
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5134 place count 1869 transition count 2820
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5136 place count 1868 transition count 2812
Performed 255 Post agglomeration using F-continuation condition.Transition count delta: 255
Deduced a syphon composed of 255 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 256 places and 0 transitions.
Iterating global reduction 6 with 511 rules applied. Total rules applied 5647 place count 1612 transition count 2557
Symmetric choice reduction at 6 with 1 rule applications. Total rules 5648 place count 1612 transition count 2557
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5650 place count 1611 transition count 2556
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 5651 place count 1610 transition count 2556
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5652 place count 1610 transition count 2556
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 5654 place count 1609 transition count 2555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 5656 place count 1609 transition count 2553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5657 place count 1608 transition count 2553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5659 place count 1607 transition count 2562
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 5670 place count 1607 transition count 2551
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 5681 place count 1596 transition count 2551
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 10 with 11 rules applied. Total rules applied 5692 place count 1596 transition count 2540
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 10 with 11 rules applied. Total rules applied 5703 place count 1585 transition count 2540
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 5705 place count 1585 transition count 2540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5706 place count 1584 transition count 2539
Reduce places removed 18 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 11 with 25 rules applied. Total rules applied 5731 place count 1566 transition count 2532
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 5738 place count 1559 transition count 2532
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 25 Pre rules applied. Total rules applied 5738 place count 1559 transition count 2507
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 13 with 51 rules applied. Total rules applied 5789 place count 1533 transition count 2507
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 13 with 12 rules applied. Total rules applied 5801 place count 1521 transition count 2507
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 5801 place count 1521 transition count 2506
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 5803 place count 1520 transition count 2506
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 14 with 40 rules applied. Total rules applied 5843 place count 1500 transition count 2486
Symmetric choice reduction at 14 with 10 rule applications. Total rules 5853 place count 1500 transition count 2486
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 5873 place count 1490 transition count 2476
Symmetric choice reduction at 14 with 1 rule applications. Total rules 5874 place count 1490 transition count 2476
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 5876 place count 1489 transition count 2475
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 5877 place count 1489 transition count 2474
Free-agglomeration rule applied 9 times.
Iterating global reduction 15 with 9 rules applied. Total rules applied 5886 place count 1489 transition count 2465
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 5895 place count 1480 transition count 2465
Applied a total of 5895 rules in 3239 ms. Remains 1480 /4410 variables (removed 2930) and now considering 2465/5405 (removed 2940) transitions.
Finished structural reductions, in 1 iterations. Remains : 1480/4410 places, 2465/5405 transitions.
Incomplete random walk after 1000000 steps, including 8169 resets, run finished after 6349 ms. (steps per millisecond=157 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ASLink-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 765 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 772 resets, run finished after 2327 ms. (steps per millisecond=429 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 756 resets, run finished after 2201 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 821 resets, run finished after 2156 ms. (steps per millisecond=463 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 771 resets, run finished after 2352 ms. (steps per millisecond=425 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 766 resets, run finished after 2577 ms. (steps per millisecond=388 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 771 resets, run finished after 2110 ms. (steps per millisecond=473 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2465 rows 1480 cols
[2021-05-07 20:11:07] [INFO ] Computed 252 place invariants in 290 ms
[2021-05-07 20:11:07] [INFO ] [Real]Absence check using 68 positive place invariants in 86 ms returned sat
[2021-05-07 20:11:07] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 158 ms returned sat
[2021-05-07 20:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:11:14] [INFO ] [Real]Absence check using state equation in 6586 ms returned sat
[2021-05-07 20:11:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:11:14] [INFO ] [Nat]Absence check using 68 positive place invariants in 79 ms returned sat
[2021-05-07 20:11:14] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 154 ms returned sat
[2021-05-07 20:11:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:11:21] [INFO ] [Nat]Absence check using state equation in 6597 ms returned sat
[2021-05-07 20:11:21] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2021-05-07 20:11:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2021-05-07 20:11:21] [INFO ] Computed and/alt/rep : 2414/25529/2414 causal constraints in 199 ms.
[2021-05-07 20:11:41] [INFO ] Added : 575 causal constraints over 115 iterations in 20272 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 124 ms.
[2021-05-07 20:11:42] [INFO ] [Real]Absence check using 68 positive place invariants in 87 ms returned sat
[2021-05-07 20:11:42] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 169 ms returned sat
[2021-05-07 20:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:11:49] [INFO ] [Real]Absence check using state equation in 7030 ms returned sat
[2021-05-07 20:11:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:11:50] [INFO ] [Nat]Absence check using 68 positive place invariants in 79 ms returned sat
[2021-05-07 20:11:50] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 166 ms returned sat
[2021-05-07 20:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:11:55] [INFO ] [Nat]Absence check using state equation in 4779 ms returned unsat
[2021-05-07 20:11:55] [INFO ] [Real]Absence check using 68 positive place invariants in 80 ms returned sat
[2021-05-07 20:11:55] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 163 ms returned sat
[2021-05-07 20:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:02] [INFO ] [Real]Absence check using state equation in 6813 ms returned sat
[2021-05-07 20:12:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:12:02] [INFO ] [Nat]Absence check using 68 positive place invariants in 82 ms returned sat
[2021-05-07 20:12:02] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 163 ms returned sat
[2021-05-07 20:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:04] [INFO ] [Nat]Absence check using state equation in 1295 ms returned unsat
[2021-05-07 20:12:04] [INFO ] [Real]Absence check using 68 positive place invariants in 79 ms returned sat
[2021-05-07 20:12:04] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 153 ms returned sat
[2021-05-07 20:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:10] [INFO ] [Real]Absence check using state equation in 6394 ms returned sat
[2021-05-07 20:12:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:12:11] [INFO ] [Nat]Absence check using 68 positive place invariants in 74 ms returned sat
[2021-05-07 20:12:11] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 153 ms returned sat
[2021-05-07 20:12:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:12] [INFO ] [Nat]Absence check using state equation in 1327 ms returned unsat
[2021-05-07 20:12:13] [INFO ] [Real]Absence check using 68 positive place invariants in 77 ms returned sat
[2021-05-07 20:12:13] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 164 ms returned sat
[2021-05-07 20:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:20] [INFO ] [Real]Absence check using state equation in 7024 ms returned sat
[2021-05-07 20:12:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:12:20] [INFO ] [Nat]Absence check using 68 positive place invariants in 105 ms returned sat
[2021-05-07 20:12:20] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 167 ms returned sat
[2021-05-07 20:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:28] [INFO ] [Nat]Absence check using state equation in 7702 ms returned sat
[2021-05-07 20:12:28] [INFO ] Computed and/alt/rep : 2414/25529/2414 causal constraints in 145 ms.
[2021-05-07 20:12:48] [INFO ] Added : 460 causal constraints over 92 iterations in 20223 ms.(timeout) Result :sat
[2021-05-07 20:12:48] [INFO ] Deduced a trap composed of 45 places in 81 ms
[2021-05-07 20:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
[2021-05-07 20:12:49] [INFO ] [Real]Absence check using 68 positive place invariants in 81 ms returned sat
[2021-05-07 20:12:49] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 163 ms returned sat
[2021-05-07 20:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:12:56] [INFO ] [Real]Absence check using state equation in 6917 ms returned sat
[2021-05-07 20:12:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:12:56] [INFO ] [Nat]Absence check using 68 positive place invariants in 78 ms returned sat
[2021-05-07 20:12:57] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 172 ms returned sat
[2021-05-07 20:12:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:13:04] [INFO ] [Nat]Absence check using state equation in 6936 ms returned sat
[2021-05-07 20:13:04] [INFO ] Deduced a trap composed of 38 places in 119 ms
[2021-05-07 20:13:04] [INFO ] Deduced a trap composed of 13 places in 433 ms
[2021-05-07 20:13:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 885 ms
[2021-05-07 20:13:05] [INFO ] Computed and/alt/rep : 2414/25529/2414 causal constraints in 153 ms.
[2021-05-07 20:13:25] [INFO ] Added : 500 causal constraints over 100 iterations in 20434 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 203 ms.
[2021-05-07 20:13:26] [INFO ] [Real]Absence check using 68 positive place invariants in 79 ms returned sat
[2021-05-07 20:13:26] [INFO ] [Real]Absence check using 68 positive and 184 generalized place invariants in 157 ms returned sat
[2021-05-07 20:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:13:32] [INFO ] [Real]Absence check using state equation in 6511 ms returned sat
[2021-05-07 20:13:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:13:33] [INFO ] [Nat]Absence check using 68 positive place invariants in 73 ms returned sat
[2021-05-07 20:13:33] [INFO ] [Nat]Absence check using 68 positive and 184 generalized place invariants in 160 ms returned sat
[2021-05-07 20:13:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:13:33] [INFO ] [Nat]Absence check using state equation in 484 ms returned unsat
FORMULA ASLink-PT-10b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 1072600 steps, including 11462 resets, run finished after 7567 ms. (steps per millisecond=141 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1355000 steps, including 14583 resets, run finished after 8956 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1331900 steps, including 14273 resets, run finished after 8792 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 25 out of 1480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1480/1480 places, 2465/2465 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1480 transition count 2462
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1477 transition count 2462
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 6 place count 1477 transition count 2449
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 32 place count 1464 transition count 2449
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1464 transition count 2449
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 6 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 1463 transition count 2443
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 1462 transition count 2443
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 53 place count 1453 transition count 2435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 1453 transition count 2433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 1452 transition count 2433
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 1452 transition count 2433
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 59 place count 1451 transition count 2432
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 1451 transition count 2430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 63 place count 1449 transition count 2430
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 1449 transition count 2429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 1448 transition count 2429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 66 place count 1447 transition count 2428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 67 place count 1446 transition count 2427
Applied a total of 67 rules in 350 ms. Remains 1446 /1480 variables (removed 34) and now considering 2427/2465 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 1446/1480 places, 2427/2465 transitions.
Incomplete random walk after 1000000 steps, including 8825 resets, run finished after 5821 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 797 resets, run finished after 2041 ms. (steps per millisecond=489 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 791 resets, run finished after 2285 ms. (steps per millisecond=437 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 795 resets, run finished after 2418 ms. (steps per millisecond=413 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 1897862 steps, run timeout after 30001 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0]
Probabilistic random walk after 1897862 steps, saw 331207 distinct states, run finished after 30001 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0]
// Phase 1: matrix 2427 rows 1446 cols
[2021-05-07 20:14:42] [INFO ] Computed 250 place invariants in 81 ms
[2021-05-07 20:14:42] [INFO ] [Real]Absence check using 67 positive place invariants in 76 ms returned sat
[2021-05-07 20:14:42] [INFO ] [Real]Absence check using 67 positive and 183 generalized place invariants in 150 ms returned sat
[2021-05-07 20:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:14:49] [INFO ] [Real]Absence check using state equation in 6645 ms returned sat
[2021-05-07 20:14:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:14:49] [INFO ] [Nat]Absence check using 67 positive place invariants in 76 ms returned sat
[2021-05-07 20:14:49] [INFO ] [Nat]Absence check using 67 positive and 183 generalized place invariants in 150 ms returned sat
[2021-05-07 20:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:14:56] [INFO ] [Nat]Absence check using state equation in 6572 ms returned sat
[2021-05-07 20:14:56] [INFO ] Deduced a trap composed of 47 places in 122 ms
[2021-05-07 20:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2021-05-07 20:14:56] [INFO ] Computed and/alt/rep : 2376/25142/2376 causal constraints in 131 ms.
[2021-05-07 20:15:16] [INFO ] Added : 400 causal constraints over 80 iterations in 20244 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 88 ms.
[2021-05-07 20:15:17] [INFO ] [Real]Absence check using 67 positive place invariants in 75 ms returned sat
[2021-05-07 20:15:17] [INFO ] [Real]Absence check using 67 positive and 183 generalized place invariants in 166 ms returned sat
[2021-05-07 20:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:15:23] [INFO ] [Real]Absence check using state equation in 6400 ms returned sat
[2021-05-07 20:15:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:15:24] [INFO ] [Nat]Absence check using 67 positive place invariants in 74 ms returned sat
[2021-05-07 20:15:24] [INFO ] [Nat]Absence check using 67 positive and 183 generalized place invariants in 163 ms returned sat
[2021-05-07 20:15:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:15:31] [INFO ] [Nat]Absence check using state equation in 7327 ms returned sat
[2021-05-07 20:15:31] [INFO ] Computed and/alt/rep : 2376/25142/2376 causal constraints in 156 ms.
[2021-05-07 20:15:40] [INFO ] Added : 125 causal constraints over 25 iterations in 8933 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 46 ms.
[2021-05-07 20:15:41] [INFO ] [Real]Absence check using 67 positive place invariants in 80 ms returned sat
[2021-05-07 20:15:41] [INFO ] [Real]Absence check using 67 positive and 183 generalized place invariants in 158 ms returned sat
[2021-05-07 20:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:15:48] [INFO ] [Real]Absence check using state equation in 7099 ms returned sat
[2021-05-07 20:15:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:15:48] [INFO ] [Nat]Absence check using 67 positive place invariants in 87 ms returned sat
[2021-05-07 20:15:48] [INFO ] [Nat]Absence check using 67 positive and 183 generalized place invariants in 160 ms returned sat
[2021-05-07 20:15:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:15:55] [INFO ] [Nat]Absence check using state equation in 7006 ms returned sat
[2021-05-07 20:15:56] [INFO ] Computed and/alt/rep : 2376/25142/2376 causal constraints in 160 ms.
[2021-05-07 20:16:16] [INFO ] Added : 495 causal constraints over 99 iterations in 20201 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 108 ms.
Incomplete Parikh walk after 679800 steps, including 7604 resets, run finished after 4647 ms. (steps per millisecond=146 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 493000 steps, including 5711 resets, run finished after 3430 ms. (steps per millisecond=143 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 475300 steps, including 5559 resets, run finished after 3377 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 25 out of 1446 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1446/1446 places, 2427/2427 transitions.
Applied a total of 0 rules in 43 ms. Remains 1446 /1446 variables (removed 0) and now considering 2427/2427 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1446/1446 places, 2427/2427 transitions.
Starting structural reductions, iteration 0 : 1446/1446 places, 2427/2427 transitions.
Applied a total of 0 rules in 42 ms. Remains 1446 /1446 variables (removed 0) and now considering 2427/2427 (removed 0) transitions.
// Phase 1: matrix 2427 rows 1446 cols
[2021-05-07 20:16:27] [INFO ] Computed 250 place invariants in 50 ms
[2021-05-07 20:16:33] [INFO ] Implicit Places using invariants in 5616 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 206, 256, 257, 268, 269, 271, 288, 306, 382, 397, 398, 401, 437, 477, 512, 516, 517, 528, 529, 531, 548, 566, 618, 638, 642, 643, 654, 655, 657, 674, 692, 761, 765, 766, 777, 778, 780, 798, 816, 887, 891, 892, 903, 904, 906, 923, 941, 1022, 1023, 1034, 1035, 1037, 1054, 1072, 1141, 1145, 1146, 1157, 1158, 1160, 1177, 1195, 1272, 1277, 1291, 1292, 1293, 1311, 1313, 1317, 1335, 1336, 1337, 1338, 1350, 1356, 1362, 1368, 1374, 1380, 1386, 1392, 1398, 1404, 1410]
Discarding 98 places :
Implicit Place search using SMT only with invariants took 5622 ms to find 98 implicit places.
[2021-05-07 20:16:33] [INFO ] Redundant transitions in 191 ms returned []
// Phase 1: matrix 2427 rows 1348 cols
[2021-05-07 20:16:33] [INFO ] Computed 152 place invariants in 34 ms
[2021-05-07 20:16:42] [INFO ] Dead Transitions using invariants and state equation in 8368 ms returned []
Starting structural reductions, iteration 1 : 1348/1446 places, 2427/2427 transitions.
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 1348 transition count 2252
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 181 rules applied. Total rules applied 356 place count 1173 transition count 2246
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 356 place count 1173 transition count 2200
Deduced a syphon composed of 46 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 93 rules applied. Total rules applied 449 place count 1126 transition count 2200
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 461 place count 1122 transition count 2192
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 469 place count 1114 transition count 2192
Symmetric choice reduction at 4 with 15 rule applications. Total rules 484 place count 1114 transition count 2192
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 514 place count 1099 transition count 2177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 517 place count 1099 transition count 2174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 517 place count 1099 transition count 2173
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 519 place count 1098 transition count 2173
Symmetric choice reduction at 5 with 3 rule applications. Total rules 522 place count 1098 transition count 2173
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 528 place count 1095 transition count 2167
Symmetric choice reduction at 5 with 1 rule applications. Total rules 529 place count 1095 transition count 2167
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 531 place count 1094 transition count 2166
Symmetric choice reduction at 5 with 1 rule applications. Total rules 532 place count 1094 transition count 2166
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 534 place count 1093 transition count 2164
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 4 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 676 place count 1022 transition count 2093
Symmetric choice reduction at 5 with 6 rule applications. Total rules 682 place count 1022 transition count 2093
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 694 place count 1016 transition count 2087
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 699 place count 1016 transition count 2082
Symmetric choice reduction at 6 with 1 rule applications. Total rules 700 place count 1016 transition count 2082
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 702 place count 1015 transition count 2081
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 703 place count 1015 transition count 2080
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 707 place count 1013 transition count 2081
Free-agglomeration rule (complex) applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 738 place count 1013 transition count 2050
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 770 place count 981 transition count 2050
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 796 place count 981 transition count 2050
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 797 place count 981 transition count 2050
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 800 place count 981 transition count 2047
Applied a total of 800 rules in 406 ms. Remains 981 /1348 variables (removed 367) and now considering 2047/2427 (removed 380) transitions.
// Phase 1: matrix 2047 rows 981 cols
[2021-05-07 20:16:42] [INFO ] Computed 146 place invariants in 26 ms
[2021-05-07 20:16:45] [INFO ] Implicit Places using invariants in 2655 ms returned [72, 89, 95, 98, 100, 103, 104, 171, 177, 180, 182, 187, 188, 258, 264, 267, 269, 272, 279, 280, 338, 361, 369, 376, 381, 382, 434, 459, 461, 464, 469, 470, 522, 539, 545, 548, 550, 555, 556, 609, 628, 634, 637, 639, 644, 645, 729, 732, 734, 740, 741, 793, 810, 816, 819, 821, 826, 827, 896, 902, 905, 907, 912]
Discarding 63 places :
Implicit Place search using SMT only with invariants took 2657 ms to find 63 implicit places.
Starting structural reductions, iteration 2 : 918/1446 places, 2047/2427 transitions.
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 918 transition count 2047
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 81 place count 891 transition count 2020
Symmetric choice reduction at 0 with 9 rule applications. Total rules 90 place count 891 transition count 2020
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 882 transition count 2011
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 882 transition count 2011
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 114 place count 880 transition count 2009
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 880 transition count 2009
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 879 transition count 2008
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 149 place count 863 transition count 1992
Free-agglomeration rule applied 28 times.
Iterating global reduction 0 with 28 rules applied. Total rules applied 177 place count 863 transition count 1964
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 205 place count 835 transition count 1964
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 210 place count 835 transition count 1959
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 215 place count 830 transition count 1959
Partial Post-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 224 place count 830 transition count 1959
Applied a total of 224 rules in 191 ms. Remains 830 /918 variables (removed 88) and now considering 1959/2047 (removed 88) transitions.
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:16:45] [INFO ] Computed 83 place invariants in 22 ms
[2021-05-07 20:16:47] [INFO ] Implicit Places using invariants in 1974 ms returned []
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:16:47] [INFO ] Computed 83 place invariants in 21 ms
[2021-05-07 20:16:56] [INFO ] Implicit Places using invariants and state equation in 9685 ms returned []
Implicit Place search using SMT with State Equation took 11660 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 830/1446 places, 1959/2427 transitions.
Incomplete random walk after 1000000 steps, including 13483 resets, run finished after 4542 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1629 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1644 resets, run finished after 1416 ms. (steps per millisecond=706 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1649 resets, run finished after 1548 ms. (steps per millisecond=645 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 3070221 steps, run timeout after 30001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0]
Probabilistic random walk after 3070221 steps, saw 600424 distinct states, run finished after 30001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:17:35] [INFO ] Computed 83 place invariants in 21 ms
[2021-05-07 20:17:35] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2021-05-07 20:17:35] [INFO ] [Real]Absence check using 19 positive and 64 generalized place invariants in 38 ms returned sat
[2021-05-07 20:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:17:38] [INFO ] [Real]Absence check using state equation in 2664 ms returned sat
[2021-05-07 20:17:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:17:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 20:17:38] [INFO ] [Nat]Absence check using 19 positive and 64 generalized place invariants in 37 ms returned sat
[2021-05-07 20:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:17:43] [INFO ] [Nat]Absence check using state equation in 4668 ms returned sat
[2021-05-07 20:17:43] [INFO ] Deduced a trap composed of 61 places in 113 ms
[2021-05-07 20:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2021-05-07 20:17:43] [INFO ] Computed and/alt/rep : 1908/24112/1908 causal constraints in 119 ms.
[2021-05-07 20:18:07] [INFO ] Added : 550 causal constraints over 110 iterations in 23699 ms.(timeout) Result :unknown
[2021-05-07 20:18:07] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 20:18:07] [INFO ] [Real]Absence check using 19 positive and 64 generalized place invariants in 45 ms returned sat
[2021-05-07 20:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:18:10] [INFO ] [Real]Absence check using state equation in 2701 ms returned sat
[2021-05-07 20:18:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:18:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 20:18:10] [INFO ] [Nat]Absence check using 19 positive and 64 generalized place invariants in 45 ms returned sat
[2021-05-07 20:18:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:18:13] [INFO ] [Nat]Absence check using state equation in 3461 ms returned sat
[2021-05-07 20:18:14] [INFO ] Computed and/alt/rep : 1908/24112/1908 causal constraints in 108 ms.
[2021-05-07 20:18:40] [INFO ] Added : 580 causal constraints over 116 iterations in 26123 ms.(timeout) Result :unknown
[2021-05-07 20:18:40] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2021-05-07 20:18:40] [INFO ] [Real]Absence check using 19 positive and 64 generalized place invariants in 46 ms returned sat
[2021-05-07 20:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:18:43] [INFO ] [Real]Absence check using state equation in 2861 ms returned sat
[2021-05-07 20:18:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:18:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 31 ms returned sat
[2021-05-07 20:18:43] [INFO ] [Nat]Absence check using 19 positive and 64 generalized place invariants in 49 ms returned sat
[2021-05-07 20:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:18:46] [INFO ] [Nat]Absence check using state equation in 3264 ms returned sat
[2021-05-07 20:18:46] [INFO ] Computed and/alt/rep : 1908/24112/1908 causal constraints in 124 ms.
[2021-05-07 20:19:06] [INFO ] Added : 505 causal constraints over 101 iterations in 20158 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 111 ms.
Incomplete Parikh walk after 245200 steps, including 5778 resets, run finished after 1372 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 239300 steps, including 5703 resets, run finished after 1345 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 353300 steps, including 8070 resets, run finished after 1960 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 25 out of 830 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 830/830 places, 1959/1959 transitions.
Applied a total of 0 rules in 25 ms. Remains 830 /830 variables (removed 0) and now considering 1959/1959 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 1959/1959 transitions.
Starting structural reductions, iteration 0 : 830/830 places, 1959/1959 transitions.
Applied a total of 0 rules in 24 ms. Remains 830 /830 variables (removed 0) and now considering 1959/1959 (removed 0) transitions.
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:19:11] [INFO ] Computed 83 place invariants in 21 ms
[2021-05-07 20:19:13] [INFO ] Implicit Places using invariants in 1959 ms returned []
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:19:13] [INFO ] Computed 83 place invariants in 22 ms
[2021-05-07 20:19:23] [INFO ] Implicit Places using invariants and state equation in 9589 ms returned []
Implicit Place search using SMT with State Equation took 11550 ms to find 0 implicit places.
[2021-05-07 20:19:23] [INFO ] Redundant transitions in 185 ms returned []
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:19:23] [INFO ] Computed 83 place invariants in 22 ms
[2021-05-07 20:19:27] [INFO ] Dead Transitions using invariants and state equation in 4360 ms returned []
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 1959/1959 transitions.
Incomplete random walk after 100000 steps, including 1357 resets, run finished after 466 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1959 rows 830 cols
[2021-05-07 20:19:28] [INFO ] Computed 83 place invariants in 21 ms
[2021-05-07 20:19:28] [INFO ] [Real]Absence check using 19 positive place invariants in 29 ms returned sat
[2021-05-07 20:19:28] [INFO ] [Real]Absence check using 19 positive and 64 generalized place invariants in 37 ms returned sat
[2021-05-07 20:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:19:31] [INFO ] [Real]Absence check using state equation in 2610 ms returned sat
[2021-05-07 20:19:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:19:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 30 ms returned sat
[2021-05-07 20:19:31] [INFO ] [Nat]Absence check using 19 positive and 64 generalized place invariants in 38 ms returned sat
[2021-05-07 20:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:19:35] [INFO ] [Nat]Absence check using state equation in 4653 ms returned sat
[2021-05-07 20:19:36] [INFO ] Deduced a trap composed of 61 places in 74 ms
[2021-05-07 20:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2021-05-07 20:19:36] [INFO ] Computed and/alt/rep : 1908/24112/1908 causal constraints in 110 ms.
[2021-05-07 20:19:51] [INFO ] Added : 505 causal constraints over 101 iterations in 14994 ms. Result :(error "Failed to check-sat")
[2021-05-07 20:19:51] [INFO ] [Real]Absence check using 19 positive place invariants in 30 ms returned sat
[2021-05-07 20:19:51] [INFO ] [Real]Absence check using 19 positive and 64 generalized place invariants in 47 ms returned sat
[2021-05-07 20:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:19:53] [INFO ] [Real]Absence check using state equation in 2606 ms returned sat
[2021-05-07 20:19:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:19:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2021-05-07 20:19:54] [INFO ] [Nat]Absence check using 19 positive and 64 generalized place invariants in 45 ms returned sat
[2021-05-07 20:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:19:57] [INFO ] [Nat]Absence check using state equation in 3383 ms returned sat
[2021-05-07 20:19:57] [INFO ] Computed and/alt/rep : 1908/24112/1908 causal constraints in 122 ms.
[2021-05-07 20:20:14] [INFO ] Added : 505 causal constraints over 101 iterations in 16396 ms. Result :(error "Failed to check-sat")
[2021-05-07 20:20:14] [INFO ] [Real]Absence check using 19 positive place invariants in 31 ms returned sat
[2021-05-07 20:20:14] [INFO ] [Real]Absence check using 19 positive and 64 generalized place invariants in 46 ms returned sat
[2021-05-07 20:20:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:20:17] [INFO ] [Real]Absence check using state equation in 2950 ms returned sat
[2021-05-07 20:20:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:20:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 31 ms returned sat
[2021-05-07 20:20:17] [INFO ] [Nat]Absence check using 19 positive and 64 generalized place invariants in 43 ms returned sat
[2021-05-07 20:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:20:20] [INFO ] [Nat]Absence check using state equation in 3207 ms returned sat
[2021-05-07 20:20:20] [INFO ] Computed and/alt/rep : 1908/24112/1908 causal constraints in 102 ms.
[2021-05-07 20:20:37] [INFO ] Added : 485 causal constraints over 97 iterations in 16591 ms. Result :unknown
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 830 transition count 1958
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 829 transition count 1958
Applied a total of 2 rules in 33 ms. Remains 829 /830 variables (removed 1) and now considering 1958/1959 (removed 1) transitions.
// Phase 1: matrix 1958 rows 829 cols
[2021-05-07 20:20:37] [INFO ] Computed 83 place invariants in 22 ms
[2021-05-07 20:20:37] [INFO ] [Real]Absence check using 18 positive place invariants in 30 ms returned sat
[2021-05-07 20:20:37] [INFO ] [Real]Absence check using 18 positive and 65 generalized place invariants in 39 ms returned sat
[2021-05-07 20:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:20:40] [INFO ] [Real]Absence check using state equation in 2762 ms returned sat
[2021-05-07 20:20:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:20:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 29 ms returned sat
[2021-05-07 20:20:40] [INFO ] [Nat]Absence check using 18 positive and 65 generalized place invariants in 39 ms returned sat
[2021-05-07 20:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:20:43] [INFO ] [Nat]Absence check using state equation in 2844 ms returned sat
[2021-05-07 20:20:43] [INFO ] Computed and/alt/rep : 1907/24303/1907 causal constraints in 110 ms.
[2021-05-07 20:21:03] [INFO ] Added : 515 causal constraints over 103 iterations in 20240 ms.(timeout) Result :sat
[2021-05-07 20:21:03] [INFO ] Deduced a trap composed of 13 places in 65 ms
[2021-05-07 20:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
Attempting to minimize the solution found.
Minimization took 125 ms.
[2021-05-07 20:21:04] [INFO ] [Real]Absence check using 18 positive place invariants in 29 ms returned sat
[2021-05-07 20:21:04] [INFO ] [Real]Absence check using 18 positive and 65 generalized place invariants in 47 ms returned sat
[2021-05-07 20:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:06] [INFO ] [Real]Absence check using state equation in 2607 ms returned sat
[2021-05-07 20:21:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:21:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 27 ms returned sat
[2021-05-07 20:21:07] [INFO ] [Nat]Absence check using 18 positive and 65 generalized place invariants in 49 ms returned sat
[2021-05-07 20:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:10] [INFO ] [Nat]Absence check using state equation in 3148 ms returned sat
[2021-05-07 20:21:10] [INFO ] Computed and/alt/rep : 1907/24303/1907 causal constraints in 125 ms.
[2021-05-07 20:21:30] [INFO ] Added : 535 causal constraints over 107 iterations in 20262 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 116 ms.
[2021-05-07 20:21:30] [INFO ] [Real]Absence check using 18 positive place invariants in 30 ms returned sat
[2021-05-07 20:21:30] [INFO ] [Real]Absence check using 18 positive and 65 generalized place invariants in 47 ms returned sat
[2021-05-07 20:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:33] [INFO ] [Real]Absence check using state equation in 3041 ms returned sat
[2021-05-07 20:21:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 20:21:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 30 ms returned sat
[2021-05-07 20:21:34] [INFO ] [Nat]Absence check using 18 positive and 65 generalized place invariants in 47 ms returned sat
[2021-05-07 20:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 20:21:37] [INFO ] [Nat]Absence check using state equation in 2920 ms returned sat
[2021-05-07 20:21:37] [INFO ] Computed and/alt/rep : 1907/24303/1907 causal constraints in 109 ms.
[2021-05-07 20:21:55] [INFO ] Added : 455 causal constraints over 91 iterations in 18479 ms. Result :unknown
[2021-05-07 20:21:55] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-07 20:21:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
[2021-05-07 20:21:56] [INFO ] Flatten gal took : 200 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-10b @ 3570 seconds

FORMULA ASLink-PT-10b-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-10b-ReachabilityFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3449
rslt: Output for ReachabilityFireability @ ASLink-PT-10b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 7 20:21:57 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1150
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p299))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 496,
"markings": 497,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1725
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G ((((p330 <= 1) AND (1 <= p330) AND (1 <= p434)) OR ((1 <= p254) AND (p303 <= 1) AND (1 <= p303)) OR (((2 <= p396) OR (p396 <= 0) OR (2 <= p512) OR (p512 <= 0) OR (p312 <= 0)) AND ((2 <= p588) OR (p588 <= 0) OR (p127 <= 0))))))",
"processed_size": 239,
"rewrites": 2
},
"result":
{
"edges": 546,
"markings": 547,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 108,
"problems": 18
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3450
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p760) AND (1 <= p775) AND (1 <= p288) AND ((2 <= p587) OR (p587 <= 0)) AND ((p227 <= 0) OR (p235 <= 0) OR (2 <= p514) OR (p514 <= 0) OR ((p608 <= 1) AND (1 <= p608) AND (p610 <= 1) AND (1 <= p610) AND (p612 <= 1) AND (1 <= p612) AND (p384 <= 1) AND (1 <= p384))) AND ((2 <= p473) OR (p473 <= 0) OR (2 <= p586) OR (p586 <= 0) OR (2 <= p476) OR (p476 <= 0) OR (2 <= p574) OR (p574 <= 0)))))",
"processed_size": 413,
"rewrites": 1
},
"result":
{
"edges": 144,
"markings": 145,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 592,
"problems": 80
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 70968,
"runtime": 120.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 7978,
"conflict_clusters": 91,
"places": 830,
"places_significant": 747,
"singleton_clusters": 0,
"transitions": 1959
},
"result":
{
"preliminary_value": "yes no yes ",
"value": "yes no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2789/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 830
lola: finding significant places
lola: 830 places, 1959 transitions, 747 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p299 <= 1)
lola: LP says that atomic proposition is always true: (p434 <= 1)
lola: LP says that atomic proposition is always true: (p254 <= 1)
lola: LP says that atomic proposition is always true: (p312 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p760 <= 1)
lola: LP says that atomic proposition is always true: (p775 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: E (F (((1 <= p299)))) : A (G ((((p330 <= 1) AND (1 <= p330) AND (1 <= p434)) OR ((1 <= p254) AND (p303 <= 1) AND (1 <= p303)) OR (((2 <= p396) OR (p396 <= 0) OR (2 <= p512) OR (p512 <= 0) OR (p312 <= 0)) AND ((2 <= p588) OR (p588 <= 0) OR (p127 <= 0)))))) : E (F (((1 <= p760) AND (1 <= p775) AND (1 <= p288) AND ((2 <= p587) OR (p587 <= 0)) AND ((p227 <= 0) OR (p235 <= 0) OR (2 <= p514) OR (p514 <= 0) OR ((p608 <= 1) AND (1 <= p608) AND (p610 <= 1) AND (1 <= p610) AND (p612 <= 1) AND (1 <= p612) AND (p384 <= 1) AND (1 <= p384))) AND ((2 <= p473) OR (p473 <= 0) OR (2 <= p586) OR (p586 <= 0) OR (2 <= p476) OR (p476 <= 0) OR (2 <= p574) OR (p574 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p299))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p299))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p299))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 497 markings, 496 edges
lola: ========================================
lola: subprocess 1 will run for 1725 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p330 <= 1) AND (1 <= p330) AND (1 <= p434)) OR ((1 <= p254) AND (p303 <= 1) AND (1 <= p303)) OR (((2 <= p396) OR (p396 <= 0) OR (2 <= p512) OR (p512 <= 0) OR (p312 <= 0)) AND ((2 <= p588) OR (p588 <= 0) OR (p127 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p330 <= 1) AND (1 <= p330) AND (1 <= p434)) OR ((1 <= p254) AND (p303 <= 1) AND (1 <= p303)) OR (((2 <= p396) OR (p396 <= 0) OR (2 <= p512) OR (p512 <= 0) OR (p312 <= 0)) AND ((2 <= p588) OR (p588 <= 0) OR (p127 <= 0))))))
lola: processed formula length: 239
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((2 <= p330) OR (p330 <= 0) OR (p434 <= 0)) AND ((p254 <= 0) OR (2 <= p303) OR (p303 <= 0)) AND (((p396 <= 1) AND (1 <= p396) AND (p512 <= 1) AND (1 <= p512) AND (1 <= p312)) OR ((p588 <= 1) AND (1 <= p588) AND (1 <= p127))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 108 literals and 18 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 547 markings, 546 edges
lola: ========================================
lola: subprocess 2 will run for 3450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p760) AND (1 <= p775) AND (1 <= p288) AND ((2 <= p587) OR (p587 <= 0)) AND ((p227 <= 0) OR (p235 <= 0) OR (2 <= p514) OR (p514 <= 0) OR ((p608 <= 1) AND (1 <= p608) AND (p610 <= 1) AND (1 <= p610) AND (p612 <= 1) AND (1 <= p612) AND (p384 <= 1) AND (1 <= p384))) AND ((2 <= p473) OR (p473 <= 0) OR (2 <= p586) OR (p586 <= 0) OR (2 <= p476) OR (p476 <= 0) OR (2 <= p574) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p760) AND (1 <= p775) AND (1 <= p288) AND ((2 <= p587) OR (p587 <= 0)) AND ((p227 <= 0) OR (p235 <= 0) OR (2 <= p514) OR (p514 <= 0) OR ((p608 <= 1) AND (1 <= p608) AND (p610 <= 1) AND (1 <= p610) AND (p612 <= 1) AND (1 <= p612) AND (p384 <= 1) AND (1 <= p384))) AND ((2 <= p473) OR (p473 <= 0) OR (2 <= p586) OR (p586 <= 0) OR (2 <= p476) OR (p476 <= 0) OR (2 <= p574) OR (p... (shortened)
lola: processed formula length: 413
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p760) AND (1 <= p775) AND (1 <= p288) AND ((2 <= p587) OR (p587 <= 0)) AND ((p227 <= 0) OR (p235 <= 0) OR (2 <= p514) OR (p514 <= 0) OR ((p608 <= 1) AND (1 <= p608) AND (p610 <= 1) AND (1 <= p610) AND (p612 <= 1) AND (1 <= p612) AND (p384 <= 1) AND (1 <= p384))) AND ((2 <= p473) OR (p473 <= 0) OR (2 <= p586) OR (p586 <= 0) OR (2 <= p476) OR (p476 <= 0) OR (2 <= p574) OR (p574 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 592 literals and 80 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 145 markings, 144 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes
lola:
preliminary result: yes no yes
lola: memory consumption: 70968 KB
lola: time consumption: 120 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
content from stderr:

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="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ASLink-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-tall-162038005900084"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;