Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787200087.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is ASLink-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787200087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 3.5K Mar 25 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 09:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 09:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 25 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 09:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 25 09:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 795K Mar 24 05:37 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-05b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591220160103

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:36:03] [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]
[2020-06-03 21:36:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:36:03] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2020-06-03 21:36:03] [INFO ] Transformed 2430 places.
[2020-06-03 21:36:03] [INFO ] Transformed 3040 transitions.
[2020-06-03 21:36:03] [INFO ] Found NUPN structural information;
[2020-06-03 21:36:03] [INFO ] Parsed PT model containing 2430 places and 3040 transitions in 410 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 225 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 18 resets, run finished after 214 ms. (steps per millisecond=46 ) properties seen :[0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA ASLink-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3040 rows 2430 cols
[2020-06-03 21:36:05] [INFO ] Computed 238 place invariants in 585 ms
[2020-06-03 21:36:06] [INFO ] [Real]Absence check using 56 positive place invariants in 223 ms returned sat
[2020-06-03 21:36:06] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 341 ms returned unsat
[2020-06-03 21:36:07] [INFO ] [Real]Absence check using 56 positive place invariants in 302 ms returned sat
[2020-06-03 21:36:08] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 588 ms returned sat
[2020-06-03 21:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:11] [INFO ] [Real]Absence check using state equation in 3243 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 21:36:12] [INFO ] [Real]Absence check using 56 positive place invariants in 310 ms returned sat
[2020-06-03 21:36:13] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 568 ms returned sat
[2020-06-03 21:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:16] [INFO ] [Real]Absence check using state equation in 3296 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 21:36:17] [INFO ] [Real]Absence check using 56 positive place invariants in 299 ms returned sat
[2020-06-03 21:36:18] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 559 ms returned unsat
[2020-06-03 21:36:19] [INFO ] [Real]Absence check using 56 positive place invariants in 292 ms returned sat
[2020-06-03 21:36:19] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 557 ms returned sat
[2020-06-03 21:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 21:36:23] [INFO ] [Real]Absence check using state equation in 3421 ms returned (error "Failed to check-sat")
[2020-06-03 21:36:24] [INFO ] [Real]Absence check using 56 positive place invariants in 293 ms returned sat
[2020-06-03 21:36:24] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 532 ms returned sat
[2020-06-03 21:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:28] [INFO ] [Real]Absence check using state equation in 3454 ms returned (error "Failed to check-sat")
[2020-06-03 21:36:29] [INFO ] [Real]Absence check using 56 positive place invariants in 300 ms returned sat
[2020-06-03 21:36:29] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 699 ms returned sat
[2020-06-03 21:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 21:36:33] [INFO ] [Real]Absence check using state equation in 3363 ms returned (error "Failed to check-sat")
[2020-06-03 21:36:34] [INFO ] [Real]Absence check using 56 positive place invariants in 297 ms returned sat
[2020-06-03 21:36:34] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 296 ms returned unsat
[2020-06-03 21:36:35] [INFO ] [Real]Absence check using 56 positive place invariants in 273 ms returned sat
[2020-06-03 21:36:35] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 462 ms returned sat
[2020-06-03 21:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 21:36:39] [INFO ] [Real]Absence check using state equation in 3755 ms returned (error "Failed to check-sat")
[2020-06-03 21:36:40] [INFO ] [Real]Absence check using 56 positive place invariants in 292 ms returned sat
[2020-06-03 21:36:40] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 650 ms returned sat
[2020-06-03 21:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:36:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 21:36:44] [INFO ] [Real]Absence check using state equation in 3462 ms returned (error "Failed to check-sat")
FORMULA ASLink-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-05b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 31 out of 2430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 2430 transition count 2493
Reduce places removed 547 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 573 rules applied. Total rules applied 1120 place count 1883 transition count 2467
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1127 place count 1876 transition count 2467
Performed 562 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 562 Pre rules applied. Total rules applied 1127 place count 1876 transition count 1905
Deduced a syphon composed of 562 places in 5 ms
Ensure Unique test removed 51 places
Reduce places removed 613 places and 0 transitions.
Iterating global reduction 3 with 1175 rules applied. Total rules applied 2302 place count 1263 transition count 1905
Discarding 7 places :
Implicit places reduction removed 7 places
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 3 with 40 rules applied. Total rules applied 2342 place count 1256 transition count 1872
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 2375 place count 1223 transition count 1872
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2375 place count 1223 transition count 1852
Deduced a syphon composed of 20 places in 14 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2435 place count 1183 transition count 1852
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2435 place count 1183 transition count 1832
Deduced a syphon composed of 20 places in 13 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2475 place count 1163 transition count 1832
Symmetric choice reduction at 5 with 78 rule applications. Total rules 2553 place count 1163 transition count 1832
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 78 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 2709 place count 1085 transition count 1754
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2710 place count 1085 transition count 1753
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 2710 place count 1085 transition count 1727
Deduced a syphon composed of 26 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 53 rules applied. Total rules applied 2763 place count 1058 transition count 1727
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2763 place count 1058 transition count 1726
Deduced a syphon composed of 1 places in 6 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 2766 place count 1056 transition count 1726
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2772 place count 1056 transition count 1726
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 39 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 2784 place count 1050 transition count 1687
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 2784 place count 1050 transition count 1684
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2790 place count 1047 transition count 1684
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2791 place count 1047 transition count 1684
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2793 place count 1046 transition count 1676
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2794 place count 1046 transition count 1676
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2796 place count 1045 transition count 1668
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2797 place count 1045 transition count 1668
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2799 place count 1044 transition count 1660
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2800 place count 1044 transition count 1660
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2802 place count 1043 transition count 1652
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2803 place count 1043 transition count 1652
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2805 place count 1042 transition count 1644
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2806 place count 1042 transition count 1644
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2808 place count 1041 transition count 1636
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2809 place count 1041 transition count 1636
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2811 place count 1040 transition count 1628
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2812 place count 1040 transition count 1628
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2814 place count 1039 transition count 1620
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2815 place count 1039 transition count 1620
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2817 place count 1038 transition count 1612
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2818 place count 1038 transition count 1612
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2820 place count 1037 transition count 1604
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2821 place count 1037 transition count 1604
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2823 place count 1036 transition count 1596
Performed 132 Post agglomeration using F-continuation condition.Transition count delta: 132
Deduced a syphon composed of 132 places in 3 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 6 with 264 rules applied. Total rules applied 3087 place count 904 transition count 1464
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3088 place count 904 transition count 1464
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3090 place count 903 transition count 1463
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 3091 place count 902 transition count 1463
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3092 place count 902 transition count 1463
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3094 place count 901 transition count 1462
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 3096 place count 901 transition count 1460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3097 place count 900 transition count 1460
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3099 place count 899 transition count 1469
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3106 place count 899 transition count 1462
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3113 place count 892 transition count 1462
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3117 place count 892 transition count 1458
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 3121 place count 888 transition count 1458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3122 place count 887 transition count 1457
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 11 with 11 rules applied. Total rules applied 3133 place count 879 transition count 1454
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3136 place count 876 transition count 1454
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 11 Pre rules applied. Total rules applied 3136 place count 876 transition count 1443
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 13 with 22 rules applied. Total rules applied 3158 place count 865 transition count 1443
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 3163 place count 860 transition count 1443
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3164 place count 860 transition count 1443
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3166 place count 859 transition count 1442
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3167 place count 859 transition count 1442
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3169 place count 858 transition count 1441
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 3185 place count 850 transition count 1433
Symmetric choice reduction at 14 with 3 rule applications. Total rules 3188 place count 850 transition count 1433
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3194 place count 847 transition count 1430
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 3197 place count 847 transition count 1427
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 3200 place count 844 transition count 1427
Applied a total of 3200 rules in 2214 ms. Remains 844 /2430 variables (removed 1586) and now considering 1427/3040 (removed 1613) transitions.
Finished structural reductions, in 1 iterations. Remains : 844/2430 places, 1427/3040 transitions.
Incomplete random walk after 1000000 steps, including 10099 resets, run finished after 4671 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0, 1, 0]
FORMULA ASLink-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2053 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2054 resets, run finished after 1651 ms. (steps per millisecond=605 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2054 resets, run finished after 1615 ms. (steps per millisecond=619 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2054 resets, run finished after 1680 ms. (steps per millisecond=595 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2417 resets, run finished after 2348 ms. (steps per millisecond=425 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2029 resets, run finished after 1810 ms. (steps per millisecond=552 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1427 rows 844 cols
[2020-06-03 21:37:02] [INFO ] Computed 144 place invariants in 162 ms
[2020-06-03 21:37:02] [INFO ] [Real]Absence check using 38 positive place invariants in 135 ms returned sat
[2020-06-03 21:37:02] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 126 ms returned sat
[2020-06-03 21:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:06] [INFO ] [Real]Absence check using state equation in 3161 ms returned sat
[2020-06-03 21:37:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:37:06] [INFO ] [Nat]Absence check using 38 positive place invariants in 65 ms returned sat
[2020-06-03 21:37:06] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 81 ms returned sat
[2020-06-03 21:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:09] [INFO ] [Nat]Absence check using state equation in 2602 ms returned unsat
[2020-06-03 21:37:09] [INFO ] [Real]Absence check using 38 positive place invariants in 90 ms returned sat
[2020-06-03 21:37:09] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 142 ms returned sat
[2020-06-03 21:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:14] [INFO ] [Real]Absence check using state equation in 4669 ms returned sat
[2020-06-03 21:37:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:37:14] [INFO ] [Nat]Absence check using 38 positive place invariants in 93 ms returned sat
[2020-06-03 21:37:14] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 137 ms returned sat
[2020-06-03 21:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:15] [INFO ] [Nat]Absence check using state equation in 646 ms returned unsat
[2020-06-03 21:37:15] [INFO ] [Real]Absence check using 38 positive place invariants in 89 ms returned sat
[2020-06-03 21:37:15] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 141 ms returned sat
[2020-06-03 21:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:20] [INFO ] [Real]Absence check using state equation in 4923 ms returned sat
[2020-06-03 21:37:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:37:21] [INFO ] [Nat]Absence check using 38 positive place invariants in 91 ms returned sat
[2020-06-03 21:37:21] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 140 ms returned sat
[2020-06-03 21:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:26] [INFO ] [Nat]Absence check using state equation in 4889 ms returned sat
[2020-06-03 21:37:26] [INFO ] Computed and/alt/rep : 1398/15506/1398 causal constraints in 197 ms.
[2020-06-03 21:37:46] [INFO ] Added : 365 causal constraints over 73 iterations in 20157 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 77 ms.
[2020-06-03 21:37:47] [INFO ] [Real]Absence check using 38 positive place invariants in 103 ms returned sat
[2020-06-03 21:37:47] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 147 ms returned sat
[2020-06-03 21:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:51] [INFO ] [Real]Absence check using state equation in 4385 ms returned sat
[2020-06-03 21:37:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:37:52] [INFO ] [Nat]Absence check using 38 positive place invariants in 99 ms returned sat
[2020-06-03 21:37:52] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 151 ms returned sat
[2020-06-03 21:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:37:54] [INFO ] [Nat]Absence check using state equation in 2457 ms returned unsat
[2020-06-03 21:37:55] [INFO ] [Real]Absence check using 38 positive place invariants in 79 ms returned sat
[2020-06-03 21:37:55] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 145 ms returned sat
[2020-06-03 21:37:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:00] [INFO ] [Real]Absence check using state equation in 5114 ms returned sat
[2020-06-03 21:38:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:38:00] [INFO ] [Nat]Absence check using 38 positive place invariants in 64 ms returned sat
[2020-06-03 21:38:00] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 103 ms returned sat
[2020-06-03 21:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:07] [INFO ] [Nat]Absence check using state equation in 6407 ms returned sat
[2020-06-03 21:38:07] [INFO ] Computed and/alt/rep : 1398/15506/1398 causal constraints in 132 ms.
[2020-06-03 21:38:27] [INFO ] Added : 440 causal constraints over 88 iterations in 20167 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 143 ms.
[2020-06-03 21:38:27] [INFO ] [Real]Absence check using 38 positive place invariants in 57 ms returned sat
[2020-06-03 21:38:27] [INFO ] [Real]Absence check using 38 positive and 106 generalized place invariants in 89 ms returned sat
[2020-06-03 21:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:31] [INFO ] [Real]Absence check using state equation in 3366 ms returned sat
[2020-06-03 21:38:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:38:31] [INFO ] [Nat]Absence check using 38 positive place invariants in 61 ms returned sat
[2020-06-03 21:38:31] [INFO ] [Nat]Absence check using 38 positive and 106 generalized place invariants in 103 ms returned sat
[2020-06-03 21:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:38:35] [INFO ] [Nat]Absence check using state equation in 3529 ms returned sat
[2020-06-03 21:38:35] [INFO ] Computed and/alt/rep : 1398/15506/1398 causal constraints in 169 ms.
[2020-06-03 21:38:58] [INFO ] Added : 385 causal constraints over 77 iterations in 23076 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
FORMULA ASLink-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-05b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-05b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 581700 steps, including 1000 resets, run finished after 2642 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 552800 steps, including 1000 resets, run finished after 2142 ms. (steps per millisecond=258 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 536300 steps, including 1000 resets, run finished after 2416 ms. (steps per millisecond=221 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 19 out of 844 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 844/844 places, 1427/1427 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 1426
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 842 transition count 1426
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 3 place count 842 transition count 1421
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 13 place count 837 transition count 1421
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 836 transition count 1421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 834 transition count 1419
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 834 transition count 1419
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 833 transition count 1418
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 833 transition count 1415
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 830 transition count 1415
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 830 transition count 1415
Applied a total of 29 rules in 226 ms. Remains 830 /844 variables (removed 14) and now considering 1415/1427 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 830/844 places, 1415/1427 transitions.
Incomplete random walk after 1000000 steps, including 11224 resets, run finished after 5209 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2160 resets, run finished after 1960 ms. (steps per millisecond=510 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2511 resets, run finished after 2112 ms. (steps per millisecond=473 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2169 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 3596310 steps, run timeout after 30001 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0]
Probabilistic random walk after 3596310 steps, saw 577172 distinct states, run finished after 30001 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1415 rows 830 cols
[2020-06-03 21:39:47] [INFO ] Computed 142 place invariants in 91 ms
[2020-06-03 21:39:47] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-06-03 21:39:47] [INFO ] [Real]Absence check using 39 positive and 103 generalized place invariants in 91 ms returned sat
[2020-06-03 21:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:39:51] [INFO ] [Real]Absence check using state equation in 4231 ms returned sat
[2020-06-03 21:39:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:39:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 79 ms returned sat
[2020-06-03 21:39:52] [INFO ] [Nat]Absence check using 39 positive and 103 generalized place invariants in 107 ms returned sat
[2020-06-03 21:39:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:39:56] [INFO ] [Nat]Absence check using state equation in 4170 ms returned sat
[2020-06-03 21:39:56] [INFO ] Computed and/alt/rep : 1387/15634/1387 causal constraints in 117 ms.
[2020-06-03 21:40:17] [INFO ] Added : 425 causal constraints over 85 iterations in 21103 ms.(timeout) Result :sat
[2020-06-03 21:40:18] [INFO ] Deduced a trap composed of 72 places in 470 ms
[2020-06-03 21:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
Attempting to minimize the solution found.
Minimization took 123 ms.
[2020-06-03 21:40:18] [INFO ] [Real]Absence check using 39 positive place invariants in 71 ms returned sat
[2020-06-03 21:40:18] [INFO ] [Real]Absence check using 39 positive and 103 generalized place invariants in 110 ms returned sat
[2020-06-03 21:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:40:23] [INFO ] [Real]Absence check using state equation in 4103 ms returned sat
[2020-06-03 21:40:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:40:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-06-03 21:40:23] [INFO ] [Nat]Absence check using 39 positive and 103 generalized place invariants in 99 ms returned sat
[2020-06-03 21:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:40:26] [INFO ] [Nat]Absence check using state equation in 3118 ms returned sat
[2020-06-03 21:40:26] [INFO ] Computed and/alt/rep : 1387/15634/1387 causal constraints in 158 ms.
[2020-06-03 21:40:46] [INFO ] Added : 400 causal constraints over 80 iterations in 20225 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 111 ms.
[2020-06-03 21:40:47] [INFO ] [Real]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-06-03 21:40:47] [INFO ] [Real]Absence check using 39 positive and 103 generalized place invariants in 130 ms returned sat
[2020-06-03 21:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:40:52] [INFO ] [Real]Absence check using state equation in 4597 ms returned sat
[2020-06-03 21:40:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:40:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 21:40:52] [INFO ] [Nat]Absence check using 39 positive and 103 generalized place invariants in 137 ms returned sat
[2020-06-03 21:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:40:57] [INFO ] [Nat]Absence check using state equation in 4763 ms returned sat
[2020-06-03 21:40:57] [INFO ] Computed and/alt/rep : 1387/15634/1387 causal constraints in 155 ms.
[2020-06-03 21:41:17] [INFO ] Added : 450 causal constraints over 90 iterations in 20215 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
Incomplete Parikh walk after 602200 steps, including 9934 resets, run finished after 3797 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 578500 steps, including 9366 resets, run finished after 2907 ms. (steps per millisecond=199 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA ASLink-PT-05b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 681000 steps, including 10884 resets, run finished after 3611 ms. (steps per millisecond=188 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 830 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 830/830 places, 1415/1415 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 830 transition count 1413
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 828 transition count 1413
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 828 transition count 1407
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 822 transition count 1407
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 822 transition count 1407
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 821 transition count 1399
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 821 transition count 1399
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 820 transition count 1391
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 820 transition count 1391
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 819 transition count 1383
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 819 transition count 1383
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 818 transition count 1375
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 818 transition count 1375
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 817 transition count 1367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 815 transition count 1365
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 815 transition count 1365
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 815 transition count 1365
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 814 transition count 1364
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 813 transition count 1363
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 812 transition count 1362
Applied a total of 41 rules in 239 ms. Remains 812 /830 variables (removed 18) and now considering 1362/1415 (removed 53) transitions.
Finished structural reductions, in 1 iterations. Remains : 812/830 places, 1362/1415 transitions.
Incomplete random walk after 1000000 steps, including 11704 resets, run finished after 4184 ms. (steps per millisecond=239 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2320 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2325 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 3434926 steps, run timeout after 30001 ms. (steps per millisecond=114 ) properties seen :[0, 0]
Probabilistic random walk after 3434926 steps, saw 599408 distinct states, run finished after 30001 ms. (steps per millisecond=114 ) properties seen :[0, 0]
// Phase 1: matrix 1362 rows 812 cols
[2020-06-03 21:42:06] [INFO ] Computed 142 place invariants in 27 ms
[2020-06-03 21:42:06] [INFO ] [Real]Absence check using 37 positive place invariants in 50 ms returned sat
[2020-06-03 21:42:06] [INFO ] [Real]Absence check using 37 positive and 105 generalized place invariants in 82 ms returned sat
[2020-06-03 21:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:42:10] [INFO ] [Real]Absence check using state equation in 3859 ms returned sat
[2020-06-03 21:42:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:42:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 88 ms returned sat
[2020-06-03 21:42:10] [INFO ] [Nat]Absence check using 37 positive and 105 generalized place invariants in 132 ms returned sat
[2020-06-03 21:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:42:14] [INFO ] [Nat]Absence check using state equation in 4048 ms returned sat
[2020-06-03 21:42:15] [INFO ] Computed and/alt/rep : 1336/14436/1336 causal constraints in 165 ms.
[2020-06-03 21:42:35] [INFO ] Added : 455 causal constraints over 91 iterations in 20213 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
[2020-06-03 21:42:35] [INFO ] [Real]Absence check using 37 positive place invariants in 86 ms returned sat
[2020-06-03 21:42:35] [INFO ] [Real]Absence check using 37 positive and 105 generalized place invariants in 142 ms returned sat
[2020-06-03 21:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:42:39] [INFO ] [Real]Absence check using state equation in 3973 ms returned sat
[2020-06-03 21:42:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:42:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 67 ms returned sat
[2020-06-03 21:42:40] [INFO ] [Nat]Absence check using 37 positive and 105 generalized place invariants in 114 ms returned sat
[2020-06-03 21:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:42:44] [INFO ] [Nat]Absence check using state equation in 3887 ms returned sat
[2020-06-03 21:42:44] [INFO ] Computed and/alt/rep : 1336/14436/1336 causal constraints in 112 ms.
[2020-06-03 21:43:04] [INFO ] Added : 465 causal constraints over 93 iterations in 20493 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 156 ms.
Incomplete Parikh walk after 784700 steps, including 10860 resets, run finished after 3938 ms. (steps per millisecond=199 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 500300 steps, including 7102 resets, run finished after 2477 ms. (steps per millisecond=201 ) properties seen :[0, 0] could not realise parikh vector
Support contains 5 out of 812 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 812/812 places, 1362/1362 transitions.
Applied a total of 0 rules in 25 ms. Remains 812 /812 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 812/812 places, 1362/1362 transitions.
Starting structural reductions, iteration 0 : 812/812 places, 1362/1362 transitions.
Applied a total of 0 rules in 24 ms. Remains 812 /812 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
// Phase 1: matrix 1362 rows 812 cols
[2020-06-03 21:43:11] [INFO ] Computed 142 place invariants in 27 ms
[2020-06-03 21:43:14] [INFO ] Implicit Places using invariants in 3130 ms returned [1, 18, 19, 22, 32, 49, 67, 142, 157, 158, 160, 177, 195, 265, 270, 271, 282, 283, 286, 303, 321, 390, 395, 408, 409, 411, 428, 446, 519, 520, 531, 532, 534, 551, 569, 638, 642, 643, 646, 657, 658, 659, 677, 679, 683, 701, 702, 703, 704, 716, 722, 728, 734, 740, 746, 752, 758, 764, 770, 776]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 3134 ms to find 60 implicit places.
[2020-06-03 21:43:14] [INFO ] Redundant transitions in 119 ms returned []
// Phase 1: matrix 1362 rows 752 cols
[2020-06-03 21:43:14] [INFO ] Computed 82 place invariants in 19 ms
[2020-06-03 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 5952 ms returned []
Starting structural reductions, iteration 1 : 752/812 places, 1362/1362 transitions.
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 752 transition count 1252
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 224 place count 642 transition count 1248
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 224 place count 642 transition count 1222
Deduced a syphon composed of 26 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 277 place count 615 transition count 1222
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 289 place count 611 transition count 1214
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 297 place count 603 transition count 1214
Symmetric choice reduction at 4 with 15 rule applications. Total rules 312 place count 603 transition count 1214
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 342 place count 588 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 345 place count 588 transition count 1196
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 345 place count 588 transition count 1195
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 347 place count 587 transition count 1195
Symmetric choice reduction at 5 with 3 rule applications. Total rules 350 place count 587 transition count 1195
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 356 place count 584 transition count 1189
Symmetric choice reduction at 5 with 1 rule applications. Total rules 357 place count 584 transition count 1189
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 359 place count 583 transition count 1188
Symmetric choice reduction at 5 with 1 rule applications. Total rules 360 place count 583 transition count 1188
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 362 place count 582 transition count 1186
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 442 place count 542 transition count 1146
Symmetric choice reduction at 5 with 3 rule applications. Total rules 445 place count 542 transition count 1146
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 451 place count 539 transition count 1143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 453 place count 539 transition count 1141
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 6 with 4 rules applied. Total rules applied 457 place count 537 transition count 1142
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 469 place count 537 transition count 1130
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 482 place count 524 transition count 1130
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 497 place count 524 transition count 1130
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 499 place count 524 transition count 1128
Applied a total of 499 rules in 306 ms. Remains 524 /752 variables (removed 228) and now considering 1128/1362 (removed 234) transitions.
// Phase 1: matrix 1128 rows 524 cols
[2020-06-03 21:43:20] [INFO ] Computed 76 place invariants in 24 ms
[2020-06-03 21:43:22] [INFO ] Implicit Places using invariants in 1883 ms returned [88, 94, 97, 99, 102, 109, 110, 164, 181, 187, 190, 192, 256, 273, 279, 282, 284, 291, 292, 362, 368, 371, 373, 379, 380, 432, 449, 455, 458, 460]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 1886 ms to find 30 implicit places.
Starting structural reductions, iteration 2 : 494/812 places, 1128/1362 transitions.
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 494 transition count 1128
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 48 place count 478 transition count 1112
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 478 transition count 1112
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 63 place count 473 transition count 1107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 79 place count 465 transition count 1099
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 94 place count 465 transition count 1084
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 109 place count 450 transition count 1084
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 450 transition count 1082
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 448 transition count 1082
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 448 transition count 1082
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 448 transition count 1081
Applied a total of 119 rules in 222 ms. Remains 448 /494 variables (removed 46) and now considering 1081/1128 (removed 47) transitions.
// Phase 1: matrix 1081 rows 448 cols
[2020-06-03 21:43:23] [INFO ] Computed 46 place invariants in 21 ms
[2020-06-03 21:43:24] [INFO ] Implicit Places using invariants in 1771 ms returned []
// Phase 1: matrix 1081 rows 448 cols
[2020-06-03 21:43:24] [INFO ] Computed 46 place invariants in 20 ms
[2020-06-03 21:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 21:43:31] [INFO ] Implicit Places using invariants and state equation in 7091 ms returned []
Implicit Place search using SMT with State Equation took 8865 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 448/812 places, 1081/1362 transitions.
Incomplete random walk after 1000000 steps, including 17114 resets, run finished after 3817 ms. (steps per millisecond=261 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4423 resets, run finished after 1530 ms. (steps per millisecond=653 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4403 resets, run finished after 1462 ms. (steps per millisecond=683 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 4279342 steps, run timeout after 30001 ms. (steps per millisecond=142 ) properties seen :[0, 1]
Probabilistic random walk after 4279342 steps, saw 956102 distinct states, run finished after 30001 ms. (steps per millisecond=142 ) properties seen :[0, 1]
FORMULA ASLink-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1081 rows 448 cols
[2020-06-03 21:44:08] [INFO ] Computed 46 place invariants in 12 ms
[2020-06-03 21:44:08] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 21:44:08] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 25 ms returned sat
[2020-06-03 21:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:44:10] [INFO ] [Real]Absence check using state equation in 1626 ms returned sat
[2020-06-03 21:44:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:44:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 34 ms returned sat
[2020-06-03 21:44:10] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 34 ms returned sat
[2020-06-03 21:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:44:12] [INFO ] [Nat]Absence check using state equation in 1994 ms returned sat
[2020-06-03 21:44:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 21:44:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 94 ms returned sat
[2020-06-03 21:44:12] [INFO ] Computed and/alt/rep : 1055/13903/1055 causal constraints in 118 ms.
[2020-06-03 21:44:34] [INFO ] Added : 445 causal constraints over 89 iterations in 21233 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 118 ms.
Incomplete Parikh walk after 265300 steps, including 6749 resets, run finished after 1439 ms. (steps per millisecond=184 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 1081/1081 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 448 transition count 1079
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 1079
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 446 transition count 1079
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 445 transition count 1078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 445 transition count 1077
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 444 transition count 1076
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 444 transition count 1075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 443 transition count 1075
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 442 transition count 1074
Applied a total of 13 rules in 61 ms. Remains 442 /448 variables (removed 6) and now considering 1074/1081 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/448 places, 1074/1081 transitions.
Incomplete random walk after 1000000 steps, including 18026 resets, run finished after 3781 ms. (steps per millisecond=264 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4319 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties seen :[0]
Interrupted probabilistic random walk after 4114205 steps, run timeout after 30001 ms. (steps per millisecond=137 ) properties seen :[0]
Probabilistic random walk after 4114205 steps, saw 1014949 distinct states, run finished after 30001 ms. (steps per millisecond=137 ) properties seen :[0]
// Phase 1: matrix 1074 rows 442 cols
[2020-06-03 21:45:10] [INFO ] Computed 46 place invariants in 11 ms
[2020-06-03 21:45:10] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 21:45:10] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned sat
[2020-06-03 21:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:45:12] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2020-06-03 21:45:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:45:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 21:45:12] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 23 ms returned sat
[2020-06-03 21:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:45:13] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2020-06-03 21:45:13] [INFO ] Computed and/alt/rep : 1045/13562/1045 causal constraints in 80 ms.
[2020-06-03 21:45:33] [INFO ] Added : 500 causal constraints over 100 iterations in 20302 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 141 ms.
Incomplete Parikh walk after 141100 steps, including 3915 resets, run finished after 597 ms. (steps per millisecond=236 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 442/442 places, 1074/1074 transitions.
Applied a total of 0 rules in 33 ms. Remains 442 /442 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/442 places, 1074/1074 transitions.
Starting structural reductions, iteration 0 : 442/442 places, 1074/1074 transitions.
Applied a total of 0 rules in 20 ms. Remains 442 /442 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
// Phase 1: matrix 1074 rows 442 cols
[2020-06-03 21:45:34] [INFO ] Computed 46 place invariants in 19 ms
[2020-06-03 21:45:35] [INFO ] Implicit Places using invariants in 1168 ms returned [237, 293]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1171 ms to find 2 implicit places.
[2020-06-03 21:45:36] [INFO ] Redundant transitions in 165 ms returned []
// Phase 1: matrix 1074 rows 440 cols
[2020-06-03 21:45:36] [INFO ] Computed 44 place invariants in 18 ms
[2020-06-03 21:45:38] [INFO ] Dead Transitions using invariants and state equation in 2057 ms returned []
Starting structural reductions, iteration 1 : 440/442 places, 1074/1074 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 437 transition count 1071
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 437 transition count 1068
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 434 transition count 1068
Applied a total of 12 rules in 31 ms. Remains 434 /440 variables (removed 6) and now considering 1068/1074 (removed 6) transitions.
// Phase 1: matrix 1068 rows 434 cols
[2020-06-03 21:45:38] [INFO ] Computed 44 place invariants in 11 ms
[2020-06-03 21:45:39] [INFO ] Implicit Places using invariants in 958 ms returned [166, 167]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 960 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 432/442 places, 1068/1074 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
[2020-06-03 21:45:39] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1068 rows 432 cols
[2020-06-03 21:45:39] [INFO ] Computed 42 place invariants in 11 ms
[2020-06-03 21:45:41] [INFO ] Dead Transitions using invariants and state equation in 1949 ms returned []
Finished structural reductions, in 3 iterations. Remains : 432/442 places, 1068/1074 transitions.
Incomplete random walk after 1000000 steps, including 18662 resets, run finished after 3483 ms. (steps per millisecond=287 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4468 resets, run finished after 1341 ms. (steps per millisecond=745 ) properties seen :[0]
Interrupted probabilistic random walk after 4666758 steps, run timeout after 30001 ms. (steps per millisecond=155 ) properties seen :[0]
Probabilistic random walk after 4666758 steps, saw 1005515 distinct states, run finished after 30001 ms. (steps per millisecond=155 ) properties seen :[0]
// Phase 1: matrix 1068 rows 432 cols
[2020-06-03 21:46:16] [INFO ] Computed 42 place invariants in 11 ms
[2020-06-03 21:46:16] [INFO ] [Real]Absence check using 14 positive place invariants in 35 ms returned sat
[2020-06-03 21:46:16] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 25 ms returned sat
[2020-06-03 21:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:46:17] [INFO ] [Real]Absence check using state equation in 1667 ms returned sat
[2020-06-03 21:46:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:46:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 35 ms returned sat
[2020-06-03 21:46:18] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 25 ms returned sat
[2020-06-03 21:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:46:19] [INFO ] [Nat]Absence check using state equation in 1727 ms returned sat
[2020-06-03 21:46:19] [INFO ] Computed and/alt/rep : 1039/13595/1039 causal constraints in 118 ms.
[2020-06-03 21:46:39] [INFO ] Added : 460 causal constraints over 92 iterations in 20011 ms. Result :unknown
Incomplete Parikh walk after 129600 steps, including 3170 resets, run finished after 508 ms. (steps per millisecond=255 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 432 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 432/432 places, 1068/1068 transitions.
Applied a total of 0 rules in 13 ms. Remains 432 /432 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1068/1068 transitions.
Starting structural reductions, iteration 0 : 432/432 places, 1068/1068 transitions.
Applied a total of 0 rules in 12 ms. Remains 432 /432 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
// Phase 1: matrix 1068 rows 432 cols
[2020-06-03 21:46:40] [INFO ] Computed 42 place invariants in 12 ms
[2020-06-03 21:46:41] [INFO ] Implicit Places using invariants in 1325 ms returned []
// Phase 1: matrix 1068 rows 432 cols
[2020-06-03 21:46:41] [INFO ] Computed 42 place invariants in 18 ms
[2020-06-03 21:46:46] [INFO ] Implicit Places using invariants and state equation in 5144 ms returned []
Implicit Place search using SMT with State Equation took 6470 ms to find 0 implicit places.
[2020-06-03 21:46:46] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1068 rows 432 cols
[2020-06-03 21:46:46] [INFO ] Computed 42 place invariants in 11 ms
[2020-06-03 21:46:48] [INFO ] Dead Transitions using invariants and state equation in 1920 ms returned []
Finished structural reductions, in 1 iterations. Remains : 432/432 places, 1068/1068 transitions.
Incomplete random walk after 100000 steps, including 1844 resets, run finished after 342 ms. (steps per millisecond=292 ) properties seen :[0]
// Phase 1: matrix 1068 rows 432 cols
[2020-06-03 21:46:49] [INFO ] Computed 42 place invariants in 11 ms
[2020-06-03 21:46:49] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2020-06-03 21:46:49] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 27 ms returned sat
[2020-06-03 21:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:46:50] [INFO ] [Real]Absence check using state equation in 1635 ms returned sat
[2020-06-03 21:46:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:46:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 36 ms returned sat
[2020-06-03 21:46:51] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 23 ms returned sat
[2020-06-03 21:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:46:52] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2020-06-03 21:46:52] [INFO ] Computed and/alt/rep : 1039/13595/1039 causal constraints in 100 ms.
[2020-06-03 21:47:11] [INFO ] Added : 460 causal constraints over 92 iterations in 18121 ms. Result :(error "Solver has unexpectedly terminated")
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 432 transition count 1067
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 431 transition count 1067
Applied a total of 2 rules in 28 ms. Remains 431 /432 variables (removed 1) and now considering 1067/1068 (removed 1) transitions.
// Phase 1: matrix 1067 rows 431 cols
[2020-06-03 21:47:11] [INFO ] Computed 42 place invariants in 18 ms
[2020-06-03 21:47:11] [INFO ] [Real]Absence check using 13 positive place invariants in 36 ms returned sat
[2020-06-03 21:47:11] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 27 ms returned sat
[2020-06-03 21:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:47:12] [INFO ] [Real]Absence check using state equation in 1726 ms returned sat
[2020-06-03 21:47:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:47:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 39 ms returned sat
[2020-06-03 21:47:13] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 25 ms returned sat
[2020-06-03 21:47:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:47:15] [INFO ] [Nat]Absence check using state equation in 2047 ms returned sat
[2020-06-03 21:47:15] [INFO ] Computed and/alt/rep : 1038/13594/1038 causal constraints in 112 ms.
[2020-06-03 21:47:35] [INFO ] Added : 465 causal constraints over 93 iterations in 20546 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 160 ms.
[2020-06-03 21:47:36] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-03 21:47:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-03 21:47:36] [INFO ] Flatten gal took : 318 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-05b @ 3570 seconds

FORMULA ASLink-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for ReachabilityFireability @ ASLink-PT-05b

{
"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",
"localtimelimit": 0,
"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": "Wed Jun 3 21:47:37 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 25300,
"runtime": 13.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((2 <= p96) OR (p96 <= 0))))",
"processed_size": 35,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 4358,
"conflict_clusters": 38,
"places": 432,
"places_significant": 390,
"singleton_clusters": 0,
"transitions": 1068
},
"result":
{
"edges": 250,
"markings": 251,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
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: 1500/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 432
lola: finding significant places
lola: 432 places, 1068 transitions, 390 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: A (G (((2 <= p96) OR (p96 <= 0))))
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 (((2 <= p96) OR (p96 <= 0))))
lola: processed formula length: 35
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: subprocess will run for 0 seconds at most (--localtimelimit)
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p96 <= 1) AND (1 <= p96))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 251 markings, 250 edges
lola: memory consumption: 25300 KB
lola: time consumption: 13 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-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is ASLink-PT-05b, 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 r166-smll-158987787200087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05b.tgz
mv ASLink-PT-05b 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 ;