Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 544K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620396002064

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 14:00: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]
[2021-05-07 14:00:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 14:00:03] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2021-05-07 14:00:03] [INFO ] Transformed 1638 places.
[2021-05-07 14:00:03] [INFO ] Transformed 2094 transitions.
[2021-05-07 14:00:03] [INFO ] Found NUPN structural information;
[2021-05-07 14:00:03] [INFO ] Parsed PT model containing 1638 places and 2094 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 28 resets, run finished after 95 ms. (steps per millisecond=105 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA ASLink-PT-03b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2094 rows 1638 cols
[2021-05-07 14:00:04] [INFO ] Computed 160 place invariants in 124 ms
[2021-05-07 14:00:04] [INFO ] [Real]Absence check using 37 positive place invariants in 86 ms returned sat
[2021-05-07 14:00:05] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 178 ms returned sat
[2021-05-07 14:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:09] [INFO ] [Real]Absence check using state equation in 4411 ms returned (error "Failed to check-sat")
[2021-05-07 14:00:09] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2021-05-07 14:00:10] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 125 ms returned sat
[2021-05-07 14:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:14] [INFO ] [Real]Absence check using state equation in 4552 ms returned (error "Failed to check-sat")
[2021-05-07 14:00:14] [INFO ] [Real]Absence check using 37 positive place invariants in 74 ms returned sat
[2021-05-07 14:00:15] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 156 ms returned sat
[2021-05-07 14:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:19] [INFO ] [Real]Absence check using state equation in 4540 ms returned unknown
[2021-05-07 14:00:19] [INFO ] [Real]Absence check using 37 positive place invariants in 71 ms returned sat
[2021-05-07 14:00:20] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 124 ms returned sat
[2021-05-07 14:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:24] [INFO ] [Real]Absence check using state equation in 4570 ms returned (error "Failed to check-sat")
[2021-05-07 14:00:24] [INFO ] [Real]Absence check using 37 positive place invariants in 71 ms returned sat
[2021-05-07 14:00:25] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 127 ms returned sat
[2021-05-07 14:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:29] [INFO ] [Real]Absence check using state equation in 4556 ms returned (error "Failed to check-sat")
[2021-05-07 14:00:29] [INFO ] [Real]Absence check using 37 positive place invariants in 74 ms returned sat
[2021-05-07 14:00:29] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 91 ms returned unsat
[2021-05-07 14:00:30] [INFO ] [Real]Absence check using 37 positive place invariants in 74 ms returned sat
[2021-05-07 14:00:30] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 163 ms returned sat
[2021-05-07 14:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:34] [INFO ] [Real]Absence check using state equation in 4524 ms returned (error "Failed to check-sat")
[2021-05-07 14:00:35] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2021-05-07 14:00:35] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 50 ms returned unsat
[2021-05-07 14:00:35] [INFO ] [Real]Absence check using 37 positive place invariants in 73 ms returned sat
[2021-05-07 14:00:35] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 125 ms returned sat
[2021-05-07 14:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:40] [INFO ] [Real]Absence check using state equation in 4565 ms returned (error "Failed to check-sat")
[2021-05-07 14:00:40] [INFO ] [Real]Absence check using 37 positive place invariants in 72 ms returned sat
[2021-05-07 14:00:40] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 124 ms returned sat
[2021-05-07 14:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:00:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:00:45] [INFO ] [Real]Absence check using state equation in 4610 ms returned (error "Failed to check-sat")
FORMULA ASLink-PT-03b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 39 out of 1638 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: 363
Iterating post reduction 0 with 363 rules applied. Total rules applied 363 place count 1638 transition count 1731
Reduce places removed 363 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 381 rules applied. Total rules applied 744 place count 1275 transition count 1713
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 749 place count 1270 transition count 1713
Performed 370 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 370 Pre rules applied. Total rules applied 749 place count 1270 transition count 1343
Deduced a syphon composed of 370 places in 4 ms
Ensure Unique test removed 32 places
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 772 rules applied. Total rules applied 1521 place count 868 transition count 1343
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 3 with 21 rules applied. Total rules applied 1542 place count 865 transition count 1325
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1560 place count 847 transition count 1325
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1560 place count 847 transition count 1312
Deduced a syphon composed of 13 places in 7 ms
Ensure Unique test removed 12 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1598 place count 822 transition count 1312
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1600 place count 821 transition count 1311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1601 place count 820 transition count 1311
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1601 place count 820 transition count 1299
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1625 place count 808 transition count 1299
Symmetric choice reduction at 7 with 49 rule applications. Total rules 1674 place count 808 transition count 1299
Deduced a syphon composed of 49 places in 5 ms
Reduce places removed 49 places and 49 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1772 place count 759 transition count 1250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1773 place count 759 transition count 1249
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 1773 place count 759 transition count 1233
Deduced a syphon composed of 16 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 33 rules applied. Total rules applied 1806 place count 742 transition count 1233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1806 place count 742 transition count 1232
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1809 place count 740 transition count 1232
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1812 place count 740 transition count 1232
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 21 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1818 place count 737 transition count 1211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1818 place count 737 transition count 1209
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1822 place count 735 transition count 1209
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1823 place count 735 transition count 1209
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1825 place count 734 transition count 1201
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 8 with 180 rules applied. Total rules applied 2005 place count 644 transition count 1111
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2006 place count 644 transition count 1111
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2008 place count 643 transition count 1110
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 2009 place count 642 transition count 1110
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2010 place count 642 transition count 1110
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2012 place count 641 transition count 1109
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 9 with 2 rules applied. Total rules applied 2014 place count 641 transition count 1107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2015 place count 640 transition count 1107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2017 place count 639 transition count 1116
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2021 place count 639 transition count 1112
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2025 place count 635 transition count 1112
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2029 place count 635 transition count 1108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2033 place count 631 transition count 1108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2034 place count 630 transition count 1107
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 6 rules applied. Total rules applied 2040 place count 626 transition count 1105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 2042 place count 624 transition count 1105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 5 Pre rules applied. Total rules applied 2042 place count 624 transition count 1100
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 2052 place count 619 transition count 1100
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 15 with 1 rules applied. Total rules applied 2053 place count 618 transition count 1100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2059 place count 615 transition count 1097
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2060 place count 615 transition count 1097
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2062 place count 614 transition count 1096
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2063 place count 614 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2064 place count 613 transition count 1095
Applied a total of 2064 rules in 768 ms. Remains 613 /1638 variables (removed 1025) and now considering 1095/2094 (removed 999) transitions.
Finished structural reductions, in 1 iterations. Remains : 613/1638 places, 1095/2094 transitions.
Incomplete random walk after 1000000 steps, including 11902 resets, run finished after 3931 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3256 resets, run finished after 1868 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3285 resets, run finished after 1530 ms. (steps per millisecond=653 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3305 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3315 resets, run finished after 1528 ms. (steps per millisecond=654 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3328 resets, run finished after 1466 ms. (steps per millisecond=682 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3168 resets, run finished after 1603 ms. (steps per millisecond=623 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3390 resets, run finished after 1479 ms. (steps per millisecond=676 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2890 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 5278281 steps, run timeout after 30001 ms. (steps per millisecond=175 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 5278281 steps, saw 1227250 distinct states, run finished after 30001 ms. (steps per millisecond=175 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-03b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1095 rows 613 cols
[2021-05-07 14:01:32] [INFO ] Computed 104 place invariants in 27 ms
[2021-05-07 14:01:32] [INFO ] [Real]Absence check using 26 positive place invariants in 26 ms returned sat
[2021-05-07 14:01:32] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 38 ms returned sat
[2021-05-07 14:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:33] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2021-05-07 14:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:34] [INFO ] [Nat]Absence check using 26 positive place invariants in 32 ms returned sat
[2021-05-07 14:01:34] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 38 ms returned sat
[2021-05-07 14:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:35] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2021-05-07 14:01:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-07 14:01:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2021-05-07 14:01:35] [INFO ] Computed and/alt/rep : 1073/13206/1073 causal constraints in 90 ms.
[2021-05-07 14:01:55] [INFO ] Added : 565 causal constraints over 113 iterations in 20261 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 119 ms.
[2021-05-07 14:01:56] [INFO ] [Real]Absence check using 26 positive place invariants in 70 ms returned sat
[2021-05-07 14:01:56] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 76 ms returned sat
[2021-05-07 14:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:57] [INFO ] [Real]Absence check using state equation in 1425 ms returned sat
[2021-05-07 14:01:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:57] [INFO ] [Nat]Absence check using 26 positive place invariants in 29 ms returned sat
[2021-05-07 14:01:57] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 43 ms returned sat
[2021-05-07 14:01:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:58] [INFO ] [Nat]Absence check using state equation in 256 ms returned unsat
[2021-05-07 14:01:58] [INFO ] [Real]Absence check using 26 positive place invariants in 26 ms returned sat
[2021-05-07 14:01:58] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 39 ms returned sat
[2021-05-07 14:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:01:59] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2021-05-07 14:01:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:01:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 28 ms returned sat
[2021-05-07 14:01:59] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 43 ms returned sat
[2021-05-07 14:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:00] [INFO ] [Nat]Absence check using state equation in 447 ms returned unsat
[2021-05-07 14:02:00] [INFO ] [Real]Absence check using 26 positive place invariants in 26 ms returned sat
[2021-05-07 14:02:00] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 39 ms returned sat
[2021-05-07 14:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:01] [INFO ] [Real]Absence check using state equation in 1208 ms returned sat
[2021-05-07 14:02:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 28 ms returned sat
[2021-05-07 14:02:01] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 39 ms returned sat
[2021-05-07 14:02:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:02] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2021-05-07 14:02:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2021-05-07 14:02:03] [INFO ] Deduced a trap composed of 29 places in 101 ms
[2021-05-07 14:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2021-05-07 14:02:03] [INFO ] Computed and/alt/rep : 1073/13206/1073 causal constraints in 81 ms.
[2021-05-07 14:02:23] [INFO ] Added : 590 causal constraints over 118 iterations in 20153 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 131 ms.
[2021-05-07 14:02:23] [INFO ] [Real]Absence check using 26 positive place invariants in 26 ms returned sat
[2021-05-07 14:02:23] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 42 ms returned sat
[2021-05-07 14:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:24] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2021-05-07 14:02:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:25] [INFO ] [Nat]Absence check using 26 positive place invariants in 30 ms returned sat
[2021-05-07 14:02:25] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 42 ms returned sat
[2021-05-07 14:02:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:26] [INFO ] [Nat]Absence check using state equation in 1230 ms returned unsat
[2021-05-07 14:02:26] [INFO ] [Real]Absence check using 26 positive place invariants in 25 ms returned sat
[2021-05-07 14:02:26] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 39 ms returned sat
[2021-05-07 14:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:27] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2021-05-07 14:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:27] [INFO ] [Nat]Absence check using 26 positive place invariants in 28 ms returned sat
[2021-05-07 14:02:27] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 38 ms returned sat
[2021-05-07 14:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:02:37] [INFO ] [Nat]Absence check using state equation in 9993 ms returned unknown
[2021-05-07 14:02:37] [INFO ] [Real]Absence check using 26 positive place invariants in 26 ms returned sat
[2021-05-07 14:02:38] [INFO ] [Real]Absence check using 26 positive and 78 generalized place invariants in 40 ms returned sat
[2021-05-07 14:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:39] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2021-05-07 14:02:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:02:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 28 ms returned sat
[2021-05-07 14:02:39] [INFO ] [Nat]Absence check using 26 positive and 78 generalized place invariants in 40 ms returned sat
[2021-05-07 14:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:02:40] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2021-05-07 14:02:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 53 ms returned sat
[2021-05-07 14:02:40] [INFO ] Deduced a trap composed of 37 places in 184 ms
[2021-05-07 14:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2021-05-07 14:02:40] [INFO ] Computed and/alt/rep : 1073/13206/1073 causal constraints in 62 ms.
[2021-05-07 14:02:53] [INFO ] Added : 440 causal constraints over 88 iterations in 12891 ms. Result :sat
[2021-05-07 14:02:54] [INFO ] Deduced a trap composed of 21 places in 290 ms
[2021-05-07 14:02:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 472 ms
Attempting to minimize the solution found.
Minimization took 95 ms.
FORMULA ASLink-PT-03b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 355000 steps, including 1000 resets, run finished after 1149 ms. (steps per millisecond=308 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 317600 steps, including 1000 resets, run finished after 941 ms. (steps per millisecond=337 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 383000 steps, including 1000 resets, run finished after 1303 ms. (steps per millisecond=293 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 8 out of 613 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 613/613 places, 1095/1095 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 613 transition count 1090
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 608 transition count 1090
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 608 transition count 1079
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 33 place count 596 transition count 1079
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 595 transition count 1079
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 34 place count 595 transition count 1077
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 592 transition count 1077
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 590 transition count 1077
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 41 place count 590 transition count 1076
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 589 transition count 1076
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 589 transition count 1076
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 588 transition count 1068
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 588 transition count 1068
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 587 transition count 1060
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 587 transition count 1060
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 586 transition count 1052
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 586 transition count 1052
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 585 transition count 1044
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 585 transition count 1044
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 584 transition count 1036
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 66 place count 580 transition count 1032
Symmetric choice reduction at 4 with 2 rule applications. Total rules 68 place count 580 transition count 1032
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 578 transition count 1030
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 578 transition count 1030
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 577 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 577 transition count 1028
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 577 transition count 1027
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 78 place count 576 transition count 1027
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 79 place count 575 transition count 1026
Applied a total of 79 rules in 166 ms. Remains 575 /613 variables (removed 38) and now considering 1026/1095 (removed 69) transitions.
Finished structural reductions, in 1 iterations. Remains : 575/613 places, 1026/1095 transitions.
Incomplete random walk after 1000000 steps, including 13481 resets, run finished after 3164 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4033 resets, run finished after 1334 ms. (steps per millisecond=749 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3997 resets, run finished after 1340 ms. (steps per millisecond=746 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4106 resets, run finished after 1340 ms. (steps per millisecond=746 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3505 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 7222310 steps, run timeout after 30001 ms. (steps per millisecond=240 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 7222310 steps, saw 1159315 distinct states, run finished after 30001 ms. (steps per millisecond=240 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1026 rows 575 cols
[2021-05-07 14:03:36] [INFO ] Computed 99 place invariants in 13 ms
[2021-05-07 14:03:36] [INFO ] [Real]Absence check using 25 positive place invariants in 25 ms returned sat
[2021-05-07 14:03:36] [INFO ] [Real]Absence check using 25 positive and 74 generalized place invariants in 35 ms returned sat
[2021-05-07 14:03:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:03:37] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2021-05-07 14:03:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:03:37] [INFO ] [Nat]Absence check using 25 positive place invariants in 25 ms returned sat
[2021-05-07 14:03:37] [INFO ] [Nat]Absence check using 25 positive and 74 generalized place invariants in 35 ms returned sat
[2021-05-07 14:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:03:39] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2021-05-07 14:03:39] [INFO ] Computed and/alt/rep : 1007/12190/1007 causal constraints in 57 ms.
[2021-05-07 14:04:01] [INFO ] Added : 615 causal constraints over 123 iterations in 22663 ms.(timeout) Result :sat
[2021-05-07 14:04:02] [INFO ] Deduced a trap composed of 24 places in 252 ms
[2021-05-07 14:04:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
Attempting to minimize the solution found.
Minimization took 137 ms.
[2021-05-07 14:04:02] [INFO ] [Real]Absence check using 25 positive place invariants in 24 ms returned sat
[2021-05-07 14:04:02] [INFO ] [Real]Absence check using 25 positive and 74 generalized place invariants in 35 ms returned sat
[2021-05-07 14:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:04:03] [INFO ] [Real]Absence check using state equation in 1169 ms returned sat
[2021-05-07 14:04:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:04:03] [INFO ] [Nat]Absence check using 25 positive place invariants in 24 ms returned sat
[2021-05-07 14:04:03] [INFO ] [Nat]Absence check using 25 positive and 74 generalized place invariants in 34 ms returned sat
[2021-05-07 14:04:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:04:04] [INFO ] [Nat]Absence check using state equation in 1093 ms returned sat
[2021-05-07 14:04:05] [INFO ] Computed and/alt/rep : 1007/12190/1007 causal constraints in 52 ms.
[2021-05-07 14:04:25] [INFO ] Added : 580 causal constraints over 116 iterations in 20363 ms.(timeout) Result :sat
[2021-05-07 14:04:25] [INFO ] Deduced a trap composed of 25 places in 90 ms
[2021-05-07 14:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
Attempting to minimize the solution found.
Minimization took 131 ms.
[2021-05-07 14:04:25] [INFO ] [Real]Absence check using 25 positive place invariants in 24 ms returned sat
[2021-05-07 14:04:25] [INFO ] [Real]Absence check using 25 positive and 74 generalized place invariants in 34 ms returned sat
[2021-05-07 14:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:04:27] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2021-05-07 14:04:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:04:27] [INFO ] [Nat]Absence check using 25 positive place invariants in 24 ms returned sat
[2021-05-07 14:04:27] [INFO ] [Nat]Absence check using 25 positive and 74 generalized place invariants in 35 ms returned sat
[2021-05-07 14:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:04:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:04:37] [INFO ] [Nat]Absence check using state equation in 9812 ms returned unknown
[2021-05-07 14:04:37] [INFO ] [Real]Absence check using 25 positive place invariants in 26 ms returned sat
[2021-05-07 14:04:37] [INFO ] [Real]Absence check using 25 positive and 74 generalized place invariants in 34 ms returned sat
[2021-05-07 14:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:04:38] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2021-05-07 14:04:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:04:38] [INFO ] [Nat]Absence check using 25 positive place invariants in 25 ms returned sat
[2021-05-07 14:04:38] [INFO ] [Nat]Absence check using 25 positive and 74 generalized place invariants in 35 ms returned sat
[2021-05-07 14:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:04:39] [INFO ] [Nat]Absence check using state equation in 1104 ms returned sat
[2021-05-07 14:04:39] [INFO ] Deduced a trap composed of 61 places in 279 ms
[2021-05-07 14:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2021-05-07 14:04:40] [INFO ] Computed and/alt/rep : 1007/12190/1007 causal constraints in 65 ms.
[2021-05-07 14:04:56] [INFO ] Added : 535 causal constraints over 107 iterations in 16419 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 126 ms.
Incomplete Parikh walk after 295000 steps, including 5773 resets, run finished after 1164 ms. (steps per millisecond=253 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 367900 steps, including 7023 resets, run finished after 1441 ms. (steps per millisecond=255 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 313000 steps, including 5999 resets, run finished after 1217 ms. (steps per millisecond=257 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 8 out of 575 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 575/575 places, 1026/1026 transitions.
Applied a total of 0 rules in 16 ms. Remains 575 /575 variables (removed 0) and now considering 1026/1026 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 575/575 places, 1026/1026 transitions.
Starting structural reductions, iteration 0 : 575/575 places, 1026/1026 transitions.
Applied a total of 0 rules in 15 ms. Remains 575 /575 variables (removed 0) and now considering 1026/1026 (removed 0) transitions.
// Phase 1: matrix 1026 rows 575 cols
[2021-05-07 14:05:00] [INFO ] Computed 99 place invariants in 13 ms
[2021-05-07 14:05:01] [INFO ] Implicit Places using invariants in 1246 ms returned [1, 18, 19, 50, 68, 89, 145, 154, 156, 157, 161, 178, 196, 265, 270, 281, 282, 284, 302, 320, 390, 394, 395, 398, 409, 410, 411, 440, 442, 446, 464, 465, 466, 467, 479, 485, 491, 497, 503, 509, 515, 521, 527, 533, 539]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 1249 ms to find 45 implicit places.
[2021-05-07 14:05:01] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 1026 rows 530 cols
[2021-05-07 14:05:01] [INFO ] Computed 54 place invariants in 9 ms
[2021-05-07 14:05:03] [INFO ] Dead Transitions using invariants and state equation in 1774 ms returned []
Starting structural reductions, iteration 1 : 530/575 places, 1026/1026 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 530 transition count 954
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 146 place count 458 transition count 952
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 146 place count 458 transition count 930
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 191 place count 435 transition count 930
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 203 place count 431 transition count 922
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 211 place count 423 transition count 922
Symmetric choice reduction at 4 with 15 rule applications. Total rules 226 place count 423 transition count 922
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 256 place count 408 transition count 907
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 259 place count 408 transition count 904
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 259 place count 408 transition count 903
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 261 place count 407 transition count 903
Symmetric choice reduction at 5 with 3 rule applications. Total rules 264 place count 407 transition count 903
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 270 place count 404 transition count 897
Symmetric choice reduction at 5 with 1 rule applications. Total rules 271 place count 404 transition count 897
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 403 transition count 896
Symmetric choice reduction at 5 with 1 rule applications. Total rules 274 place count 403 transition count 896
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 276 place count 402 transition count 894
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 326 place count 377 transition count 869
Symmetric choice reduction at 5 with 2 rule applications. Total rules 328 place count 377 transition count 869
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 332 place count 375 transition count 867
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 334 place count 375 transition count 865
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 338 place count 373 transition count 866
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 342 place count 373 transition count 862
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 347 place count 368 transition count 862
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 356 place count 368 transition count 862
Applied a total of 356 rules in 85 ms. Remains 368 /530 variables (removed 162) and now considering 862/1026 (removed 164) transitions.
// Phase 1: matrix 862 rows 368 cols
[2021-05-07 14:05:03] [INFO ] Computed 48 place invariants in 8 ms
[2021-05-07 14:05:04] [INFO ] Implicit Places using invariants in 535 ms returned [98, 104, 107, 109, 110, 176, 193, 199, 202, 204, 210, 211, 265, 282, 288, 291, 293]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 537 ms to find 17 implicit places.
Starting structural reductions, iteration 2 : 351/575 places, 862/1026 transitions.
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 351 transition count 862
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 30 place count 341 transition count 852
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 341 transition count 852
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 39 place count 338 transition count 849
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 49 place count 333 transition count 844
Free-agglomeration rule applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 59 place count 333 transition count 834
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 69 place count 323 transition count 834
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 323 transition count 832
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 321 transition count 832
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 321 transition count 832
Applied a total of 76 rules in 55 ms. Remains 321 /351 variables (removed 30) and now considering 832/862 (removed 30) transitions.
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:05:04] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-07 14:05:04] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:05:04] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-07 14:05:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-07 14:05:07] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2857 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 321/575 places, 832/1026 transitions.
Incomplete random walk after 1000000 steps, including 19232 resets, run finished after 2866 ms. (steps per millisecond=348 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6273 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6305 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6357 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5200 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 6966248 steps, run timeout after 30001 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 6966248 steps, saw 1952114 distinct states, run finished after 30001 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:05:44] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-07 14:05:44] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:05:44] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:05:44] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2021-05-07 14:05:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:05:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-07 14:05:44] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:05:45] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2021-05-07 14:05:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-07 14:05:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2021-05-07 14:05:45] [INFO ] Computed and/alt/rep : 814/12049/814 causal constraints in 47 ms.
[2021-05-07 14:05:59] [INFO ] Added : 420 causal constraints over 84 iterations in 13885 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 114 ms.
[2021-05-07 14:05:59] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:05:59] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:00] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2021-05-07 14:06:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:06:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-07 14:06:00] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:06:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:00] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2021-05-07 14:06:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 20 ms returned sat
[2021-05-07 14:06:00] [INFO ] Computed and/alt/rep : 814/12049/814 causal constraints in 55 ms.
[2021-05-07 14:06:13] [INFO ] Added : 435 causal constraints over 87 iterations in 12343 ms. Result :sat
[2021-05-07 14:06:13] [INFO ] Deduced a trap composed of 28 places in 75 ms
[2021-05-07 14:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
Attempting to minimize the solution found.
Minimization took 106 ms.
[2021-05-07 14:06:13] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:06:13] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:06:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:13] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2021-05-07 14:06:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:06:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-07 14:06:14] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:06:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:06:23] [INFO ] [Nat]Absence check using state equation in 9428 ms returned unknown
[2021-05-07 14:06:23] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-07 14:06:23] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:24] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2021-05-07 14:06:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:06:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-07 14:06:24] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:24] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2021-05-07 14:06:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 47 ms returned sat
[2021-05-07 14:06:24] [INFO ] Deduced a trap composed of 57 places in 131 ms
[2021-05-07 14:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2021-05-07 14:06:24] [INFO ] Computed and/alt/rep : 814/12049/814 causal constraints in 53 ms.
[2021-05-07 14:06:50] [INFO ] Added : 525 causal constraints over 105 iterations in 25328 ms.(timeout) Result :unknown
Incomplete Parikh walk after 286900 steps, including 8610 resets, run finished after 941 ms. (steps per millisecond=304 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 247000 steps, including 7348 resets, run finished after 788 ms. (steps per millisecond=313 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 194000 steps, including 5955 resets, run finished after 638 ms. (steps per millisecond=304 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 8 out of 321 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 321/321 places, 832/832 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 832/832 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 832/832 transitions.
Starting structural reductions, iteration 0 : 321/321 places, 832/832 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 832/832 (removed 0) transitions.
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:06:52] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-07 14:06:53] [INFO ] Implicit Places using invariants in 546 ms returned []
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:06:53] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-07 14:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-07 14:06:55] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
[2021-05-07 14:06:55] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:06:55] [INFO ] Computed 31 place invariants in 13 ms
[2021-05-07 14:06:56] [INFO ] Dead Transitions using invariants and state equation in 1020 ms returned []
Finished structural reductions, in 1 iterations. Remains : 321/321 places, 832/832 transitions.
Incomplete random walk after 100000 steps, including 1926 resets, run finished after 293 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:06:56] [INFO ] Computed 31 place invariants in 6 ms
[2021-05-07 14:06:56] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:06:56] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:57] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2021-05-07 14:06:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:06:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-07 14:06:57] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:06:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:06:58] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2021-05-07 14:06:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-07 14:06:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2021-05-07 14:06:58] [INFO ] Computed and/alt/rep : 814/12049/814 causal constraints in 54 ms.
[2021-05-07 14:07:11] [INFO ] Added : 420 causal constraints over 84 iterations in 13533 ms. Result :sat
[2021-05-07 14:07:11] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-07 14:07:11] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:07:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:12] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2021-05-07 14:07:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:07:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-07 14:07:12] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:12] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2021-05-07 14:07:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2021-05-07 14:07:12] [INFO ] Computed and/alt/rep : 814/12049/814 causal constraints in 52 ms.
[2021-05-07 14:07:25] [INFO ] Added : 435 causal constraints over 87 iterations in 12469 ms. Result :sat
[2021-05-07 14:07:25] [INFO ] Deduced a trap composed of 28 places in 67 ms
[2021-05-07 14:07:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2021-05-07 14:07:25] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:07:25] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:07:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:26] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2021-05-07 14:07:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:07:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-07 14:07:26] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:07:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:32] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:07:35] [INFO ] [Nat]Absence check using state equation in 9414 ms returned unknown
[2021-05-07 14:07:35] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-07 14:07:35] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:36] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-07 14:07:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:07:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-07 14:07:36] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:36] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2021-05-07 14:07:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 47 ms returned sat
[2021-05-07 14:07:36] [INFO ] Deduced a trap composed of 57 places in 126 ms
[2021-05-07 14:07:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2021-05-07 14:07:37] [INFO ] Computed and/alt/rep : 814/12049/814 causal constraints in 44 ms.
[2021-05-07 14:07:47] [INFO ] Added : 420 causal constraints over 84 iterations in 10549 ms. Result :sat
Applied a total of 0 rules in 22 ms. Remains 321 /321 variables (removed 0) and now considering 832/832 (removed 0) transitions.
// Phase 1: matrix 832 rows 321 cols
[2021-05-07 14:07:47] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-07 14:07:47] [INFO ] [Real]Absence check using 10 positive place invariants in 31 ms returned sat
[2021-05-07 14:07:47] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 33 ms returned sat
[2021-05-07 14:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:48] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2021-05-07 14:07:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:07:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2021-05-07 14:07:48] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:07:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:07:48] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2021-05-07 14:07:48] [INFO ] Computed and/alt/rep : 814/12034/814 causal constraints in 44 ms.
[2021-05-07 14:08:09] [INFO ] Added : 495 causal constraints over 99 iterations in 20592 ms.(timeout) Result :sat
[2021-05-07 14:08:09] [INFO ] Deduced a trap composed of 29 places in 103 ms
[2021-05-07 14:08:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1710 ms
Attempting to minimize the solution found.
Minimization took 132 ms.
[2021-05-07 14:08:11] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-07 14:08:11] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:08:11] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2021-05-07 14:08:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:08:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2021-05-07 14:08:11] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:08:12] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2021-05-07 14:08:12] [INFO ] Computed and/alt/rep : 814/12034/814 causal constraints in 50 ms.
[2021-05-07 14:08:33] [INFO ] Added : 515 causal constraints over 103 iterations in 21223 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 133 ms.
[2021-05-07 14:08:33] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-07 14:08:33] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-07 14:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:08:34] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2021-05-07 14:08:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:08:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2021-05-07 14:08:34] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:08:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:08:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 14:08:43] [INFO ] [Nat]Absence check using state equation in 9408 ms returned unknown
[2021-05-07 14:08:44] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-07 14:08:44] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 14:08:44] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-07 14:08:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 14:08:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2021-05-07 14:08:44] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-07 14:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 14:08:45] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2021-05-07 14:08:45] [INFO ] Computed and/alt/rep : 814/12034/814 causal constraints in 51 ms.
[2021-05-07 14:08:58] [INFO ] Added : 405 causal constraints over 81 iterations in 13261 ms. Result :sat
[2021-05-07 14:08:58] [INFO ] Deduced a trap composed of 27 places in 102 ms
[2021-05-07 14:09:00] [INFO ] Deduced a trap composed of 34 places in 167 ms
[2021-05-07 14:09:01] [INFO ] Deduced a trap composed of 33 places in 154 ms
[2021-05-07 14:09:01] [INFO ] Deduced a trap composed of 25 places in 157 ms
[2021-05-07 14:09:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3256 ms
Attempting to minimize the solution found.
Minimization took 104 ms.
[2021-05-07 14:09:01] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-07 14:09:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2021-05-07 14:09:02] [INFO ] Flatten gal took : 226 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-03b @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 12802196 kB
After kill :
MemTotal: 16427332 kB
MemFree: 13027556 kB

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ASLink-PT-03b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r011-tall-162038005800028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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