fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r011-tall-162038005800039
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ASLink-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4288.100 3600000.00 361612.00 658.40 FFTFFFFF?FTFFTFF normal

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-162038005800039.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-05a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005800039
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 516K 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-05a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620399685791

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 15:01:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-07 15:01:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 15:01:27] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2021-05-07 15:01:27] [INFO ] Transformed 1211 places.
[2021-05-07 15:01:27] [INFO ] Transformed 1827 transitions.
[2021-05-07 15:01:27] [INFO ] Found NUPN structural information;
[2021-05-07 15:01:27] [INFO ] Parsed PT model containing 1211 places and 1827 transitions in 312 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 62 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-05a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 103 ms. (steps per millisecond=97 ) properties seen :[1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1]
FORMULA ASLink-PT-05a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1808 rows 1211 cols
[2021-05-07 15:01:28] [INFO ] Computed 232 place invariants in 135 ms
[2021-05-07 15:01:28] [INFO ] [Real]Absence check using 56 positive place invariants in 68 ms returned sat
[2021-05-07 15:01:28] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 146 ms returned sat
[2021-05-07 15:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:01:33] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 15:01:33] [INFO ] [Real]Absence check using state equation in 4571 ms returned (error "Failed to check-sat")
[2021-05-07 15:01:33] [INFO ] [Real]Absence check using 56 positive place invariants in 60 ms returned sat
[2021-05-07 15:01:33] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 156 ms returned sat
[2021-05-07 15:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:01:37] [INFO ] [Real]Absence check using state equation in 4387 ms returned sat
[2021-05-07 15:01:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:01:38] [INFO ] [Nat]Absence check using 56 positive place invariants in 74 ms returned sat
[2021-05-07 15:01:38] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 161 ms returned sat
[2021-05-07 15:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:01:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 15:01:43] [INFO ] [Nat]Absence check using state equation in 4627 ms returned (error "Failed to check-sat")
[2021-05-07 15:01:43] [INFO ] [Real]Absence check using 56 positive place invariants in 61 ms returned sat
[2021-05-07 15:01:43] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 156 ms returned sat
[2021-05-07 15:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:01:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 15:01:48] [INFO ] [Real]Absence check using state equation in 4645 ms returned (error "Failed to check-sat")
[2021-05-07 15:01:48] [INFO ] [Real]Absence check using 56 positive place invariants in 57 ms returned sat
[2021-05-07 15:01:48] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 139 ms returned sat
[2021-05-07 15:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:01:52] [INFO ] [Real]Absence check using state equation in 4605 ms returned sat
[2021-05-07 15:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:01:53] [INFO ] [Nat]Absence check using 56 positive place invariants in 55 ms returned sat
[2021-05-07 15:01:53] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 133 ms returned sat
[2021-05-07 15:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:01:57] [INFO ] [Nat]Absence check using state equation in 4296 ms returned sat
[2021-05-07 15:01:57] [INFO ] Computed and/alt/rep : 1807/21267/1807 causal constraints in 126 ms.
[2021-05-07 15:01:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t29 0) (and (and (> t1386 0) (< o1386 o29)) (and (> t1447 0) (< o1447 o29))))") while checking expression at index 3
[2021-05-07 15:01:58] [INFO ] [Real]Absence check using 56 positive place invariants in 62 ms returned sat
[2021-05-07 15:01:58] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 147 ms returned sat
[2021-05-07 15:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:02] [INFO ] [Real]Absence check using state equation in 4214 ms returned sat
[2021-05-07 15:02:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:02:02] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2021-05-07 15:02:03] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 150 ms returned sat
[2021-05-07 15:02:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:07] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 15:02:07] [INFO ] [Nat]Absence check using state equation in 4618 ms returned unknown
[2021-05-07 15:02:07] [INFO ] [Real]Absence check using 56 positive place invariants in 60 ms returned sat
[2021-05-07 15:02:08] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 157 ms returned sat
[2021-05-07 15:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:12] [INFO ] [Real]Absence check using state equation in 4545 ms returned sat
[2021-05-07 15:02:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:02:12] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2021-05-07 15:02:13] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 156 ms returned sat
[2021-05-07 15:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:17] [INFO ] [Nat]Absence check using state equation in 4277 ms returned sat
[2021-05-07 15:02:17] [INFO ] Deduced a trap composed of 31 places in 173 ms
[2021-05-07 15:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2021-05-07 15:02:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 5
Support contains 33 out of 1211 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1181 transition count 1704
Reduce places removed 104 places and 0 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 238 place count 1077 transition count 1704
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 238 place count 1077 transition count 1600
Deduced a syphon composed of 104 places in 6 ms
Ensure Unique test removed 38 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 484 place count 935 transition count 1600
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 485 place count 935 transition count 1599
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 486 place count 934 transition count 1599
Symmetric choice reduction at 4 with 8 rule applications. Total rules 494 place count 934 transition count 1599
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 41 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 510 place count 926 transition count 1558
Ensure Unique test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 514 place count 925 transition count 1555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 515 place count 924 transition count 1555
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 515 place count 924 transition count 1554
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 518 place count 922 transition count 1554
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 519 place count 921 transition count 1554
Symmetric choice reduction at 7 with 1 rule applications. Total rules 520 place count 921 transition count 1554
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 522 place count 920 transition count 1546
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 586 place count 888 transition count 1514
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 587 place count 888 transition count 1513
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 588 place count 887 transition count 1513
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 592 place count 887 transition count 1509
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 596 place count 883 transition count 1509
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 601 place count 883 transition count 1509
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 609 place count 883 transition count 1509
Applied a total of 609 rules in 571 ms. Remains 883 /1211 variables (removed 328) and now considering 1509/1808 (removed 299) transitions.
Finished structural reductions, in 1 iterations. Remains : 883/1211 places, 1509/1808 transitions.
Incomplete random walk after 1000000 steps, including 9125 resets, run finished after 3714 ms. (steps per millisecond=269 ) properties seen :[1, 0, 0, 1, 1, 0]
FORMULA ASLink-PT-05a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1844 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1795 resets, run finished after 1642 ms. (steps per millisecond=609 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1680 resets, run finished after 1511 ms. (steps per millisecond=661 ) properties seen :[0, 0, 1]
FORMULA ASLink-PT-05a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1509 rows 883 cols
[2021-05-07 15:02:26] [INFO ] Computed 161 place invariants in 112 ms
[2021-05-07 15:02:26] [INFO ] [Real]Absence check using 40 positive place invariants in 38 ms returned sat
[2021-05-07 15:02:27] [INFO ] [Real]Absence check using 40 positive and 121 generalized place invariants in 87 ms returned sat
[2021-05-07 15:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:29] [INFO ] [Real]Absence check using state equation in 2631 ms returned sat
[2021-05-07 15:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:02:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 40 ms returned sat
[2021-05-07 15:02:29] [INFO ] [Nat]Absence check using 40 positive and 121 generalized place invariants in 83 ms returned sat
[2021-05-07 15:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:32] [INFO ] [Nat]Absence check using state equation in 2513 ms returned sat
[2021-05-07 15:02:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-07 15:02:32] [INFO ] [Nat]Added 38 Read/Feed constraints in 264 ms returned sat
[2021-05-07 15:02:32] [INFO ] Computed and/alt/rep : 1508/20340/1508 causal constraints in 141 ms.
[2021-05-07 15:02:49] [INFO ] Added : 340 causal constraints over 68 iterations in 16635 ms. Result :unknown
[2021-05-07 15:02:49] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2021-05-07 15:02:49] [INFO ] [Real]Absence check using 40 positive and 121 generalized place invariants in 84 ms returned sat
[2021-05-07 15:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:52] [INFO ] [Real]Absence check using state equation in 2399 ms returned sat
[2021-05-07 15:02:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:02:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 42 ms returned sat
[2021-05-07 15:02:52] [INFO ] [Nat]Absence check using 40 positive and 121 generalized place invariants in 85 ms returned sat
[2021-05-07 15:02:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:02:55] [INFO ] [Nat]Absence check using state equation in 2974 ms returned sat
[2021-05-07 15:02:55] [INFO ] [Nat]Added 38 Read/Feed constraints in 186 ms returned sat
[2021-05-07 15:02:55] [INFO ] Deduced a trap composed of 67 places in 149 ms
[2021-05-07 15:02:55] [INFO ] Deduced a trap composed of 69 places in 191 ms
[2021-05-07 15:02:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2021-05-07 15:02:56] [INFO ] Computed and/alt/rep : 1508/20340/1508 causal constraints in 105 ms.
[2021-05-07 15:03:06] [INFO ] Added : 190 causal constraints over 38 iterations in 10650 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
Incomplete Parikh walk after 361800 steps, including 3222 resets, run finished after 1594 ms. (steps per millisecond=226 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 531400 steps, including 4383 resets, run finished after 2251 ms. (steps per millisecond=236 ) properties seen :[0, 0] could not realise parikh vector
Support contains 13 out of 883 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 883/883 places, 1509/1509 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 883 transition count 1507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 881 transition count 1507
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 881 transition count 1505
Deduced a syphon composed of 2 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 877 transition count 1505
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 877 transition count 1505
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 876 transition count 1497
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 876 transition count 1497
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 875 transition count 1489
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 875 transition count 1489
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 874 transition count 1481
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 874 transition count 1481
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 873 transition count 1473
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 873 transition count 1473
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 872 transition count 1465
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 872 transition count 1465
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 871 transition count 1457
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 871 transition count 1457
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 870 transition count 1449
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 870 transition count 1449
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 869 transition count 1441
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 869 transition count 1441
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 868 transition count 1433
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 868 transition count 1433
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 867 transition count 1425
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 865 transition count 1423
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 865 transition count 1422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 864 transition count 1422
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 864 transition count 1421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 863 transition count 1421
Applied a total of 48 rules in 286 ms. Remains 863 /883 variables (removed 20) and now considering 1421/1509 (removed 88) transitions.
Finished structural reductions, in 1 iterations. Remains : 863/883 places, 1421/1509 transitions.
Incomplete random walk after 1000000 steps, including 10154 resets, run finished after 3650 ms. (steps per millisecond=273 ) properties seen :[1, 0]
FORMULA ASLink-PT-05a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1892 resets, run finished after 1687 ms. (steps per millisecond=592 ) properties seen :[0]
// Phase 1: matrix 1421 rows 863 cols
[2021-05-07 15:03:16] [INFO ] Computed 159 place invariants in 76 ms
[2021-05-07 15:03:16] [INFO ] [Real]Absence check using 41 positive place invariants in 41 ms returned sat
[2021-05-07 15:03:16] [INFO ] [Real]Absence check using 41 positive and 118 generalized place invariants in 79 ms returned sat
[2021-05-07 15:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:03:19] [INFO ] [Real]Absence check using state equation in 2518 ms returned sat
[2021-05-07 15:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:03:19] [INFO ] [Nat]Absence check using 41 positive place invariants in 77 ms returned sat
[2021-05-07 15:03:19] [INFO ] [Nat]Absence check using 41 positive and 118 generalized place invariants in 75 ms returned sat
[2021-05-07 15:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:03:21] [INFO ] [Nat]Absence check using state equation in 2336 ms returned sat
[2021-05-07 15:03:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2021-05-07 15:03:21] [INFO ] [Nat]Added 38 Read/Feed constraints in 249 ms returned sat
[2021-05-07 15:03:22] [INFO ] Deduced a trap composed of 66 places in 250 ms
[2021-05-07 15:03:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2021-05-07 15:03:22] [INFO ] Computed and/alt/rep : 1420/17716/1420 causal constraints in 77 ms.
[2021-05-07 15:03:31] [INFO ] Added : 180 causal constraints over 36 iterations in 9439 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 181300 steps, including 2023 resets, run finished after 760 ms. (steps per millisecond=238 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 863 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 863/863 places, 1421/1421 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 863 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 862 transition count 1420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 862 transition count 1419
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 860 transition count 1419
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 859 transition count 1418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 858 transition count 1417
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 18 place count 848 transition count 1417
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 18 place count 848 transition count 1402
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 49 place count 832 transition count 1402
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 3 with 7 rules applied. Total rules applied 56 place count 825 transition count 1402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 825 transition count 1401
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 824 transition count 1401
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 80 place count 813 transition count 1390
Symmetric choice reduction at 4 with 4 rule applications. Total rules 84 place count 813 transition count 1390
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 92 place count 809 transition count 1386
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 97 place count 809 transition count 1381
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 102 place count 804 transition count 1381
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 106 place count 804 transition count 1381
Applied a total of 106 rules in 155 ms. Remains 804 /863 variables (removed 59) and now considering 1381/1421 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 804/863 places, 1381/1421 transitions.
Incomplete random walk after 1000000 steps, including 11930 resets, run finished after 3742 ms. (steps per millisecond=267 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 2197 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties seen :[0]
Interrupted probabilistic random walk after 2919519 steps, run timeout after 30001 ms. (steps per millisecond=97 ) properties seen :[0]
Probabilistic random walk after 2919519 steps, saw 836542 distinct states, run finished after 30001 ms. (steps per millisecond=97 ) properties seen :[0]
// Phase 1: matrix 1381 rows 804 cols
[2021-05-07 15:04:08] [INFO ] Computed 140 place invariants in 20 ms
[2021-05-07 15:04:08] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2021-05-07 15:04:08] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 68 ms returned sat
[2021-05-07 15:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:04:10] [INFO ] [Real]Absence check using state equation in 2106 ms returned sat
[2021-05-07 15:04:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:04:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2021-05-07 15:04:10] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 64 ms returned sat
[2021-05-07 15:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:04:12] [INFO ] [Nat]Absence check using state equation in 2118 ms returned sat
[2021-05-07 15:04:12] [INFO ] Deduced a trap composed of 71 places in 87 ms
[2021-05-07 15:04:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2021-05-07 15:04:13] [INFO ] Computed and/alt/rep : 1352/15193/1352 causal constraints in 88 ms.
[2021-05-07 15:04:21] [INFO ] Added : 135 causal constraints over 27 iterations in 8795 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1430 ms.
Incomplete Parikh walk after 102100 steps, including 1831 resets, run finished after 497 ms. (steps per millisecond=205 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 804 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 804/804 places, 1381/1381 transitions.
Applied a total of 0 rules in 22 ms. Remains 804 /804 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 804/804 places, 1381/1381 transitions.
Starting structural reductions, iteration 0 : 804/804 places, 1381/1381 transitions.
Applied a total of 0 rules in 21 ms. Remains 804 /804 variables (removed 0) and now considering 1381/1381 (removed 0) transitions.
// Phase 1: matrix 1381 rows 804 cols
[2021-05-07 15:04:23] [INFO ] Computed 140 place invariants in 19 ms
[2021-05-07 15:04:25] [INFO ] Implicit Places using invariants in 2077 ms returned [0, 18, 19, 30, 48, 66, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 481, 503, 507, 508, 519, 520, 521, 539, 557, 626, 630, 631, 634, 645, 646, 647, 670, 672, 675, 693, 694, 695, 696, 708, 714, 720, 726, 732, 738, 744, 750, 756, 762, 768]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 2081 ms to find 62 implicit places.
[2021-05-07 15:04:26] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 1381 rows 742 cols
[2021-05-07 15:04:26] [INFO ] Computed 78 place invariants in 14 ms
[2021-05-07 15:04:29] [INFO ] Dead Transitions using invariants and state equation in 3014 ms returned []
Starting structural reductions, iteration 1 : 742/804 places, 1381/1381 transitions.
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 742 transition count 1275
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 636 transition count 1275
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 212 place count 636 transition count 1250
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 262 place count 611 transition count 1250
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 271 place count 608 transition count 1244
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 277 place count 602 transition count 1244
Symmetric choice reduction at 4 with 14 rule applications. Total rules 291 place count 602 transition count 1244
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 319 place count 588 transition count 1230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 321 place count 588 transition count 1228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 321 place count 588 transition count 1227
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 323 place count 587 transition count 1227
Symmetric choice reduction at 5 with 3 rule applications. Total rules 326 place count 587 transition count 1227
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 332 place count 584 transition count 1224
Symmetric choice reduction at 5 with 1 rule applications. Total rules 333 place count 584 transition count 1224
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 335 place count 583 transition count 1223
Symmetric choice reduction at 5 with 1 rule applications. Total rules 336 place count 583 transition count 1223
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 338 place count 582 transition count 1222
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 426 place count 538 transition count 1178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 430 place count 538 transition count 1174
Symmetric choice reduction at 6 with 4 rule applications. Total rules 434 place count 538 transition count 1174
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 442 place count 534 transition count 1170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 446 place count 534 transition count 1166
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 459 place count 534 transition count 1153
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 474 place count 519 transition count 1153
Symmetric choice reduction at 8 with 1 rule applications. Total rules 475 place count 519 transition count 1153
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 477 place count 518 transition count 1152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 478 place count 518 transition count 1151
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 494 place count 518 transition count 1151
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 495 place count 518 transition count 1150
Applied a total of 495 rules in 135 ms. Remains 518 /742 variables (removed 224) and now considering 1150/1381 (removed 231) transitions.
// Phase 1: matrix 1150 rows 518 cols
[2021-05-07 15:04:29] [INFO ] Computed 73 place invariants in 12 ms
[2021-05-07 15:04:30] [INFO ] Implicit Places using invariants in 931 ms returned [73, 90, 97, 100, 102, 105, 106, 158, 175, 181, 184, 186, 191, 192, 245, 262, 268, 271, 273, 278, 279, 331, 356, 359, 361, 366, 367, 419, 436, 442, 445, 447, 515]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 934 ms to find 33 implicit places.
Starting structural reductions, iteration 2 : 485/804 places, 1150/1381 transitions.
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 485 transition count 1150
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 42 place count 471 transition count 1136
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 471 transition count 1136
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 51 place count 468 transition count 1133
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 69 place count 459 transition count 1124
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 83 place count 459 transition count 1110
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 97 place count 445 transition count 1110
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 445 transition count 1105
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 107 place count 440 transition count 1105
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 440 transition count 1105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 440 transition count 1104
Applied a total of 113 rules in 90 ms. Remains 440 /485 variables (removed 45) and now considering 1104/1150 (removed 46) transitions.
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:04:30] [INFO ] Computed 40 place invariants in 10 ms
[2021-05-07 15:04:30] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:04:30] [INFO ] Computed 40 place invariants in 11 ms
[2021-05-07 15:04:35] [INFO ] Implicit Places using invariants and state equation in 4392 ms returned []
Implicit Place search using SMT with State Equation took 5105 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 440/804 places, 1104/1381 transitions.
Incomplete random walk after 1000000 steps, including 18060 resets, run finished after 3073 ms. (steps per millisecond=325 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4040 resets, run finished after 1220 ms. (steps per millisecond=819 ) properties seen :[0]
Interrupted probabilistic random walk after 5151932 steps, run timeout after 30001 ms. (steps per millisecond=171 ) properties seen :[0]
Probabilistic random walk after 5151932 steps, saw 1235406 distinct states, run finished after 30001 ms. (steps per millisecond=171 ) properties seen :[0]
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:05:09] [INFO ] Computed 40 place invariants in 10 ms
[2021-05-07 15:05:09] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2021-05-07 15:05:09] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-07 15:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:05:10] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2021-05-07 15:05:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:05:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-07 15:05:10] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-07 15:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:05:11] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2021-05-07 15:05:11] [INFO ] Deduced a trap composed of 25 places in 197 ms
[2021-05-07 15:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2021-05-07 15:05:11] [INFO ] Computed and/alt/rep : 1078/14605/1078 causal constraints in 61 ms.
[2021-05-07 15:05:32] [INFO ] Added : 495 causal constraints over 99 iterations in 20690 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
Incomplete Parikh walk after 90100 steps, including 1683 resets, run finished after 327 ms. (steps per millisecond=275 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 440 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 440/440 places, 1104/1104 transitions.
Applied a total of 0 rules in 12 ms. Remains 440 /440 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 1104/1104 transitions.
Starting structural reductions, iteration 0 : 440/440 places, 1104/1104 transitions.
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:05:33] [INFO ] Computed 40 place invariants in 10 ms
[2021-05-07 15:05:33] [INFO ] Implicit Places using invariants in 709 ms returned []
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:05:33] [INFO ] Computed 40 place invariants in 10 ms
[2021-05-07 15:05:38] [INFO ] Implicit Places using invariants and state equation in 4346 ms returned []
Implicit Place search using SMT with State Equation took 5056 ms to find 0 implicit places.
[2021-05-07 15:05:38] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:05:38] [INFO ] Computed 40 place invariants in 9 ms
[2021-05-07 15:05:39] [INFO ] Dead Transitions using invariants and state equation in 1535 ms returned []
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 1104/1104 transitions.
Incomplete random walk after 100000 steps, including 1784 resets, run finished after 315 ms. (steps per millisecond=317 ) properties seen :[0]
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:05:39] [INFO ] Computed 40 place invariants in 10 ms
[2021-05-07 15:05:40] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-07 15:05:40] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-07 15:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:05:40] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2021-05-07 15:05:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:05:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-07 15:05:40] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-07 15:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:05:41] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2021-05-07 15:05:42] [INFO ] Deduced a trap composed of 25 places in 196 ms
[2021-05-07 15:05:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2021-05-07 15:05:42] [INFO ] Computed and/alt/rep : 1078/14605/1078 causal constraints in 59 ms.
[2021-05-07 15:06:00] [INFO ] Added : 470 causal constraints over 94 iterations in 18833 ms. Result :unknown
Applied a total of 0 rules in 11 ms. Remains 440 /440 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
// Phase 1: matrix 1104 rows 440 cols
[2021-05-07 15:06:00] [INFO ] Computed 40 place invariants in 10 ms
[2021-05-07 15:06:00] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2021-05-07 15:06:01] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-07 15:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 15:06:01] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2021-05-07 15:06:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 15:06:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2021-05-07 15:06:01] [INFO ] [Nat]Absence check using 11 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-07 15:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 15:06:02] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2021-05-07 15:06:02] [INFO ] Deduced a trap composed of 29 places in 162 ms
[2021-05-07 15:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2021-05-07 15:06:03] [INFO ] Computed and/alt/rep : 1078/14605/1078 causal constraints in 64 ms.
[2021-05-07 15:06:23] [INFO ] Added : 465 causal constraints over 93 iterations in 20233 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 104 ms.
[2021-05-07 15:06:23] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-07 15:06:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 19 ms.
[2021-05-07 15:06:23] [INFO ] Flatten gal took : 248 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ASLink-PT-05a @ 3570 seconds
vrfy: finished
info: timeLeft: 3542
rslt: Output for ReachabilityCardinality @ ASLink-PT-05a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 7 15:06:24 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 32472,
"runtime": 28.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p86 <= 0) OR (2 <= p298) OR (p298 <= 0) OR (((1 <= p15)) AND ((p437 <= 0))) OR ((((p71 <= 0)) OR ((1 <= p161))) AND (((p399 <= 0)) OR ((p31 <= 1) AND (1 <= p31)))))))",
"processed_size": 180,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 4486,
"conflict_clusters": 40,
"places": 440,
"places_significant": 400,
"singleton_clusters": 0,
"transitions": 1104
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 36,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1544/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 440
lola: finding significant places
lola: 440 places, 1104 transitions, 400 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p437 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: A (G (((p86 <= 0) OR (2 <= p298) OR (p298 <= 0) OR (((1 <= p15)) AND ((p437 <= 0))) OR ((((p71 <= 0)) OR ((1 <= p161))) AND (((p399 <= 0)) OR ((p31 <= 1) AND (1 <= p31)))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p86 <= 0) OR (2 <= p298) OR (p298 <= 0) OR (((1 <= p15)) AND ((p437 <= 0))) OR ((((p71 <= 0)) OR ((1 <= p161))) AND (((p399 <= 0)) OR ((p31 <= 1) AND (1 <= p31)))))))
lola: processed formula length: 180
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p86) AND (p298 <= 1) AND (1 <= p298) AND (((p15 <= 0)) OR ((1 <= p437))) AND ((((1 <= p71)) AND ((p161 <= 0))) OR (((1 <= p399)) AND ((2 <= p31) OR (p31 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 6 conjunctive subformulas
lola: memory consumption: 32472 KB
lola: time consumption: 28 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05a"
export BK_EXAMINATION="ReachabilityCardinality"
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-05a, examination is ReachabilityCardinality"
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-162038005800039"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;