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-162038005800012.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-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038005800012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.5K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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 3.3K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 293K 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-01b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-01b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620391759061

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 12:49:20] [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 12:49:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:49:20] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2021-05-07 12:49:20] [INFO ] Transformed 846 places.
[2021-05-07 12:49:20] [INFO ] Transformed 1148 transitions.
[2021-05-07 12:49:20] [INFO ] Found NUPN structural information;
[2021-05-07 12:49:20] [INFO ] Parsed PT model containing 846 places and 1148 transitions in 164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-01b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 58 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0]
FORMULA ASLink-PT-01b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1148 rows 846 cols
[2021-05-07 12:49:21] [INFO ] Computed 82 place invariants in 73 ms
[2021-05-07 12:49:21] [INFO ] [Real]Absence check using 19 positive place invariants in 43 ms returned sat
[2021-05-07 12:49:21] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 62 ms returned sat
[2021-05-07 12:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:23] [INFO ] [Real]Absence check using state equation in 2407 ms returned sat
[2021-05-07 12:49:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 222 ms returned sat
[2021-05-07 12:49:24] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 65 ms returned sat
[2021-05-07 12:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:27] [INFO ] [Nat]Absence check using state equation in 2946 ms returned sat
[2021-05-07 12:49:27] [INFO ] Computed and/alt/rep : 1147/6193/1147 causal constraints in 77 ms.
[2021-05-07 12:49:28] [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: Broken pipe (=> (> t129 0) (and (> t1034 0) (< o1034 o129)))") while checking expression at index 0
[2021-05-07 12:49:29] [INFO ] [Real]Absence check using 19 positive place invariants in 45 ms returned sat
[2021-05-07 12:49:29] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 44 ms returned sat
[2021-05-07 12:49:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:31] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2021-05-07 12:49:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 94 ms returned sat
[2021-05-07 12:49:31] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 43 ms returned sat
[2021-05-07 12:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:33] [INFO ] [Nat]Absence check using state equation in 2369 ms returned sat
[2021-05-07 12:49:34] [INFO ] Deduced a trap composed of 160 places in 416 ms
[2021-05-07 12:49:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2021-05-07 12:49:34] [INFO ] Computed and/alt/rep : 1147/6193/1147 causal constraints in 73 ms.
[2021-05-07 12:49:36] [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: Broken pipe (=> (> t167 0) (and (> t1049 0) (< o1049 o167)))") while checking expression at index 1
[2021-05-07 12:49:36] [INFO ] [Real]Absence check using 19 positive place invariants in 36 ms returned sat
[2021-05-07 12:49:36] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 43 ms returned unsat
[2021-05-07 12:49:36] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2021-05-07 12:49:36] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 48 ms returned sat
[2021-05-07 12:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:38] [INFO ] [Real]Absence check using state equation in 1968 ms returned sat
[2021-05-07 12:49:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 19 positive place invariants in 95 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 47 ms returned sat
[2021-05-07 12:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:40] [INFO ] [Nat]Absence check using state equation in 1370 ms returned unsat
[2021-05-07 12:49:40] [INFO ] [Real]Absence check using 19 positive place invariants in 34 ms returned sat
[2021-05-07 12:49:40] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 57 ms returned sat
[2021-05-07 12:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:42] [INFO ] [Real]Absence check using state equation in 1988 ms returned sat
[2021-05-07 12:49:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 216 ms returned sat
[2021-05-07 12:49:42] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 61 ms returned sat
[2021-05-07 12:49:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:43] [INFO ] [Nat]Absence check using state equation in 626 ms returned unsat
[2021-05-07 12:49:43] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2021-05-07 12:49:43] [INFO ] [Real]Absence check using 19 positive and 63 generalized place invariants in 59 ms returned sat
[2021-05-07 12:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:46] [INFO ] [Real]Absence check using state equation in 2555 ms returned sat
[2021-05-07 12:49:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:49:46] [INFO ] [Nat]Absence check using 19 positive place invariants in 211 ms returned sat
[2021-05-07 12:49:46] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 58 ms returned sat
[2021-05-07 12:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:49:49] [INFO ] [Nat]Absence check using state equation in 3059 ms returned sat
[2021-05-07 12:49:49] [INFO ] Deduced a trap composed of 51 places in 189 ms
[2021-05-07 12:49:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2021-05-07 12:49:50] [INFO ] Computed and/alt/rep : 1147/6193/1147 causal constraints in 82 ms.
[2021-05-07 12:49:51] [INFO ] Added : 90 causal constraints over 18 iterations in 1298 ms. Result :unknown
FORMULA ASLink-PT-01b-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-01b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 369200 steps, including 1000 resets, run finished after 1001 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 25 out of 846 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 846/846 places, 1148/1148 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Iterating post reduction 0 with 180 rules applied. Total rules applied 180 place count 846 transition count 968
Reduce places removed 180 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 190 rules applied. Total rules applied 370 place count 666 transition count 958
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 373 place count 663 transition count 958
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 373 place count 663 transition count 770
Deduced a syphon composed of 188 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 388 rules applied. Total rules applied 761 place count 463 transition count 770
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 772 place count 462 transition count 760
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 782 place count 452 transition count 760
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 782 place count 452 transition count 757
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 446 transition count 757
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 791 place count 446 transition count 754
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 797 place count 443 transition count 754
Symmetric choice reduction at 5 with 22 rule applications. Total rules 819 place count 443 transition count 754
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 22 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 863 place count 421 transition count 732
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 864 place count 421 transition count 731
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 864 place count 421 transition count 724
Deduced a syphon composed of 7 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 879 place count 413 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 879 place count 413 transition count 723
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 6 with 3 rules applied. Total rules applied 882 place count 411 transition count 723
Symmetric choice reduction at 6 with 2 rule applications. Total rules 884 place count 411 transition count 723
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 15 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 888 place count 409 transition count 708
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 888 place count 409 transition count 707
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 890 place count 408 transition count 707
Symmetric choice reduction at 6 with 1 rule applications. Total rules 891 place count 408 transition count 707
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 893 place count 407 transition count 699
Symmetric choice reduction at 6 with 1 rule applications. Total rules 894 place count 407 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 896 place count 406 transition count 691
Symmetric choice reduction at 6 with 1 rule applications. Total rules 897 place count 406 transition count 691
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 899 place count 405 transition count 683
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 81 rules applied. Total rules applied 980 place count 364 transition count 643
Symmetric choice reduction at 6 with 1 rule applications. Total rules 981 place count 364 transition count 643
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 983 place count 363 transition count 642
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 984 place count 362 transition count 642
Symmetric choice reduction at 7 with 1 rule applications. Total rules 985 place count 362 transition count 642
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 987 place count 361 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 989 place count 361 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 990 place count 360 transition count 639
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 994 place count 360 transition count 635
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 998 place count 356 transition count 635
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 999 place count 356 transition count 635
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1000 place count 355 transition count 634
Applied a total of 1000 rules in 311 ms. Remains 355 /846 variables (removed 491) and now considering 634/1148 (removed 514) transitions.
Finished structural reductions, in 1 iterations. Remains : 355/846 places, 634/1148 transitions.
Incomplete random walk after 1000000 steps, including 16553 resets, run finished after 2805 ms. (steps per millisecond=356 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6450 resets, run finished after 1371 ms. (steps per millisecond=729 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6965 resets, run finished after 1345 ms. (steps per millisecond=743 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7370 resets, run finished after 1681 ms. (steps per millisecond=594 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 9560406 steps, run timeout after 30001 ms. (steps per millisecond=318 ) properties seen :[1, 1, 0]
Probabilistic random walk after 9560406 steps, saw 2249059 distinct states, run finished after 30001 ms. (steps per millisecond=318 ) properties seen :[1, 1, 0]
FORMULA ASLink-PT-01b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-01b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 634 rows 355 cols
[2021-05-07 12:50:29] [INFO ] Computed 62 place invariants in 21 ms
[2021-05-07 12:50:29] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2021-05-07 12:50:29] [INFO ] [Real]Absence check using 17 positive and 45 generalized place invariants in 22 ms returned sat
[2021-05-07 12:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:50:30] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-07 12:50:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:50:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2021-05-07 12:50:30] [INFO ] [Nat]Absence check using 17 positive and 45 generalized place invariants in 24 ms returned sat
[2021-05-07 12:50:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:50:31] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2021-05-07 12:50:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-07 12:50:31] [INFO ] [Nat]Added 7 Read/Feed constraints in 51 ms returned sat
[2021-05-07 12:50:31] [INFO ] Computed and/alt/rep : 622/8459/622 causal constraints in 44 ms.
[2021-05-07 12:50:46] [INFO ] Added : 355 causal constraints over 71 iterations in 14964 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
Incomplete Parikh walk after 171400 steps, including 1000 resets, run finished after 431 ms. (steps per millisecond=397 ) properties seen :[0] could not realise parikh vector
Support contains 17 out of 355 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 355/355 places, 634/634 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 355 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 354 transition count 633
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 354 transition count 632
Deduced a syphon composed of 1 places in 0 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 352 transition count 632
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 352 transition count 632
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 351 transition count 624
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 351 transition count 624
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 350 transition count 616
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 350 transition count 616
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 349 transition count 608
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 349 transition count 608
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 348 transition count 600
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 348 transition count 600
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 347 transition count 592
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 2 with 6 rules applied. Total rules applied 26 place count 344 transition count 589
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 344 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 343 transition count 588
Applied a total of 28 rules in 101 ms. Remains 343 /355 variables (removed 12) and now considering 588/634 (removed 46) transitions.
Finished structural reductions, in 1 iterations. Remains : 343/355 places, 588/634 transitions.
Incomplete random walk after 1000000 steps, including 17061 resets, run finished after 2456 ms. (steps per millisecond=407 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7438 resets, run finished after 1536 ms. (steps per millisecond=651 ) properties seen :[0]
Interrupted probabilistic random walk after 10187735 steps, run timeout after 30001 ms. (steps per millisecond=339 ) properties seen :[0]
Probabilistic random walk after 10187735 steps, saw 2392896 distinct states, run finished after 30001 ms. (steps per millisecond=339 ) properties seen :[0]
// Phase 1: matrix 588 rows 343 cols
[2021-05-07 12:51:21] [INFO ] Computed 61 place invariants in 7 ms
[2021-05-07 12:51:21] [INFO ] [Real]Absence check using 18 positive place invariants in 24 ms returned sat
[2021-05-07 12:51:21] [INFO ] [Real]Absence check using 18 positive and 43 generalized place invariants in 35 ms returned sat
[2021-05-07 12:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:51:21] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2021-05-07 12:51:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:51:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2021-05-07 12:51:21] [INFO ] [Nat]Absence check using 18 positive and 43 generalized place invariants in 19 ms returned sat
[2021-05-07 12:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:51:22] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2021-05-07 12:51:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-07 12:51:22] [INFO ] [Nat]Added 7 Read/Feed constraints in 34 ms returned sat
[2021-05-07 12:51:22] [INFO ] Computed and/alt/rep : 576/7248/576 causal constraints in 35 ms.
[2021-05-07 12:51:37] [INFO ] Added : 370 causal constraints over 74 iterations in 15039 ms. Result :unknown
Incomplete Parikh walk after 194500 steps, including 1000 resets, run finished after 540 ms. (steps per millisecond=360 ) properties seen :[0] could not realise parikh vector
Support contains 17 out of 343 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 343/343 places, 588/588 transitions.
Applied a total of 0 rules in 13 ms. Remains 343 /343 variables (removed 0) and now considering 588/588 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 343/343 places, 588/588 transitions.
Starting structural reductions, iteration 0 : 343/343 places, 588/588 transitions.
Applied a total of 0 rules in 11 ms. Remains 343 /343 variables (removed 0) and now considering 588/588 (removed 0) transitions.
// Phase 1: matrix 588 rows 343 cols
[2021-05-07 12:51:38] [INFO ] Computed 61 place invariants in 6 ms
[2021-05-07 12:51:38] [INFO ] Implicit Places using invariants in 569 ms returned [1, 20, 21, 24, 35, 55, 73, 162, 173, 176, 177, 210, 213, 231, 232, 233, 234, 246, 252, 258, 264, 270, 276, 282, 288, 295, 301, 307]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 571 ms to find 28 implicit places.
[2021-05-07 12:51:38] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 588 rows 315 cols
[2021-05-07 12:51:38] [INFO ] Computed 33 place invariants in 5 ms
[2021-05-07 12:51:39] [INFO ] Dead Transitions using invariants and state equation in 720 ms returned []
Starting structural reductions, iteration 1 : 315/343 places, 588/588 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 315 transition count 555
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 282 transition count 555
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 282 transition count 543
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 91 place count 269 transition count 543
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 96 place count 264 transition count 543
Symmetric choice reduction at 3 with 14 rule applications. Total rules 110 place count 264 transition count 543
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 138 place count 250 transition count 529
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 138 place count 250 transition count 528
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 140 place count 249 transition count 528
Symmetric choice reduction at 3 with 6 rule applications. Total rules 146 place count 249 transition count 528
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 158 place count 243 transition count 522
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 243 transition count 522
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 173 place count 238 transition count 517
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 175 place count 238 transition count 515
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 238 transition count 515
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 237 transition count 514
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 237 transition count 514
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 181 place count 236 transition count 513
Symmetric choice reduction at 4 with 1 rule applications. Total rules 182 place count 236 transition count 513
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 184 place count 235 transition count 512
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 222 place count 216 transition count 493
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 225 place count 216 transition count 490
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 228 place count 213 transition count 490
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 232 place count 213 transition count 486
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 236 place count 209 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 209 transition count 486
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 209 transition count 485
Applied a total of 240 rules in 66 ms. Remains 209 /315 variables (removed 106) and now considering 485/588 (removed 103) transitions.
// Phase 1: matrix 485 rows 209 cols
[2021-05-07 12:51:39] [INFO ] Computed 27 place invariants in 3 ms
[2021-05-07 12:51:39] [INFO ] Implicit Places using invariants in 223 ms returned [96, 103, 106, 108, 111, 205]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 225 ms to find 6 implicit places.
Starting structural reductions, iteration 2 : 203/343 places, 485/588 transitions.
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 203 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 200 transition count 482
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 198 transition count 480
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 198 transition count 477
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 195 transition count 477
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 195 transition count 477
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 195 transition count 477
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 195 transition count 476
Applied a total of 22 rules in 34 ms. Remains 195 /203 variables (removed 8) and now considering 476/485 (removed 9) transitions.
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:51:39] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-07 12:51:40] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:51:40] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 12:51:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-07 12:51:41] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 195/343 places, 476/588 transitions.
Incomplete random walk after 1000000 steps, including 25091 resets, run finished after 2126 ms. (steps per millisecond=470 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 12285 resets, run finished after 1420 ms. (steps per millisecond=704 ) properties seen :[0]
Interrupted probabilistic random walk after 11185448 steps, run timeout after 30001 ms. (steps per millisecond=372 ) properties seen :[0]
Probabilistic random walk after 11185448 steps, saw 3447533 distinct states, run finished after 30001 ms. (steps per millisecond=372 ) properties seen :[0]
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:52:14] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 12:52:14] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-07 12:52:14] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 5 ms returned sat
[2021-05-07 12:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:14] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2021-05-07 12:52:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2021-05-07 12:52:14] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 5 ms returned sat
[2021-05-07 12:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:15] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-07 12:52:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-07 12:52:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 87 ms returned sat
[2021-05-07 12:52:15] [INFO ] Computed and/alt/rep : 469/7019/469 causal constraints in 23 ms.
[2021-05-07 12:52:30] [INFO ] Added : 310 causal constraints over 62 iterations in 15533 ms. Result :sat
[2021-05-07 12:52:30] [INFO ] Deduced a trap composed of 62 places in 116 ms
[2021-05-07 12:52:31] [INFO ] Deduced a trap composed of 22 places in 121 ms
[2021-05-07 12:52:31] [INFO ] Deduced a trap composed of 62 places in 93 ms
[2021-05-07 12:52:31] [INFO ] Deduced a trap composed of 17 places in 108 ms
[2021-05-07 12:52:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 849 ms
Attempting to minimize the solution found.
Minimization took 73 ms.
Incomplete Parikh walk after 267500 steps, including 8348 resets, run finished after 647 ms. (steps per millisecond=413 ) properties seen :[0] could not realise parikh vector
Support contains 17 out of 195 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 195/195 places, 476/476 transitions.
Applied a total of 0 rules in 7 ms. Remains 195 /195 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 476/476 transitions.
Starting structural reductions, iteration 0 : 195/195 places, 476/476 transitions.
Applied a total of 0 rules in 7 ms. Remains 195 /195 variables (removed 0) and now considering 476/476 (removed 0) transitions.
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:52:32] [INFO ] Computed 21 place invariants in 3 ms
[2021-05-07 12:52:32] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:52:32] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 12:52:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-07 12:52:33] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2021-05-07 12:52:33] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:52:33] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 12:52:34] [INFO ] Dead Transitions using invariants and state equation in 527 ms returned []
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 476/476 transitions.
Incomplete random walk after 100000 steps, including 2518 resets, run finished after 221 ms. (steps per millisecond=452 ) properties seen :[0]
// Phase 1: matrix 476 rows 195 cols
[2021-05-07 12:52:34] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 12:52:34] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2021-05-07 12:52:34] [INFO ] [Real]Absence check using 10 positive and 11 generalized place invariants in 4 ms returned sat
[2021-05-07 12:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:34] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-07 12:52:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2021-05-07 12:52:34] [INFO ] [Nat]Absence check using 10 positive and 11 generalized place invariants in 5 ms returned sat
[2021-05-07 12:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:35] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2021-05-07 12:52:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-07 12:52:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 87 ms returned sat
[2021-05-07 12:52:35] [INFO ] Computed and/alt/rep : 469/7019/469 causal constraints in 27 ms.
[2021-05-07 12:52:49] [INFO ] Added : 310 causal constraints over 62 iterations in 13874 ms. Result :sat
[2021-05-07 12:52:49] [INFO ] Deduced a trap composed of 18 places in 229 ms
[2021-05-07 12:52:49] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2021-05-07 12:52:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1129 edges and 195 vertex of which 194 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 194 transition count 474
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 192 transition count 474
Applied a total of 5 rules in 21 ms. Remains 192 /195 variables (removed 3) and now considering 474/476 (removed 2) transitions.
// Phase 1: matrix 474 rows 192 cols
[2021-05-07 12:52:49] [INFO ] Computed 20 place invariants in 3 ms
[2021-05-07 12:52:49] [INFO ] [Real]Absence check using 8 positive place invariants in 33 ms returned sat
[2021-05-07 12:52:49] [INFO ] [Real]Absence check using 8 positive and 12 generalized place invariants in 8 ms returned sat
[2021-05-07 12:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:50] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2021-05-07 12:52:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:52:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 50 ms returned sat
[2021-05-07 12:52:50] [INFO ] [Nat]Absence check using 8 positive and 12 generalized place invariants in 9 ms returned sat
[2021-05-07 12:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:52:50] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-07 12:52:50] [INFO ] Computed and/alt/rep : 467/7005/467 causal constraints in 28 ms.
[2021-05-07 12:53:10] [INFO ] Added : 365 causal constraints over 73 iterations in 20062 ms. Result :unknown
[2021-05-07 12:53:10] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2021-05-07 12:53:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
[2021-05-07 12:53:10] [INFO ] Flatten gal took : 79 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-01b @ 3570 seconds
vrfy: finished
info: timeLeft: 3487
rslt: Output for ReachabilityFireability @ ASLink-PT-01b

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 7 12:53:12 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 33608,
"runtime": 83.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 6,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p94) AND ((p186 <= 0)) AND ((p113 <= 0)) AND ((2 <= p26) OR (p26 <= 0) OR (p134 <= 0)) AND ((p18 <= 0) OR (2 <= p63) OR (p63 <= 0)) AND ((p116 <= 0) OR (p192 <= 0)) AND (((1 <= p1) AND (1 <= p21)) OR ((p12 <= 1) AND (1 <= p12) AND (p70 <= 1) AND (1 <= p70)) OR ((p33 <= 1) AND (1 <= p33) AND (p127 <= 1) AND (1 <= p127) AND (p32 <= 1) AND (1 <= p32) AND (p133 <= 1) AND (1 <= p133))))))",
"processed_size": 406,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 1902,
"conflict_clusters": 32,
"places": 195,
"places_significant": 174,
"singleton_clusters": 0,
"transitions": 476
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 576,
"problems": 54
},
"type": "reachability",
"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: 671/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 195
lola: finding significant places
lola: 195 places, 476 transitions, 174 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: E (F (((1 <= p94) AND ((p186 <= 0)) AND ((p113 <= 0)) AND ((2 <= p26) OR (p26 <= 0) OR (p134 <= 0)) AND ((p18 <= 0) OR (2 <= p63) OR (p63 <= 0)) AND ((p116 <= 0) OR (p192 <= 0)) AND (((1 <= p1) AND (1 <= p21)) OR ((p12 <= 1) AND (1 <= p12) AND (p70 <= 1) AND (1 <= p70)) OR ((p33 <= 1) AND (1 <= p33) AND (p127 <= 1) AND (1 <= p127) AND (p32 <= 1) AND (1 <= p32) AND (p133 <= 1) AND (1 <= p133))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p94) AND ((p186 <= 0)) AND ((p113 <= 0)) AND ((2 <= p26) OR (p26 <= 0) OR (p134 <= 0)) AND ((p18 <= 0) OR (2 <= p63) OR (p63 <= 0)) AND ((p116 <= 0) OR (p192 <= 0)) AND (((1 <= p1) AND (1 <= p21)) OR ((p12 <= 1) AND (1 <= p12) AND (p70 <= 1) AND (1 <= p70)) OR ((p33 <= 1) AND (1 <= p33) AND (p127 <= 1) AND (1 <= p127) AND (p32 <= 1) AND (1 <= p32) AND (p133 <= 1) AND (1 <= p133... (shortened)
lola: processed formula length: 406
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: 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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p94) AND ((p186 <= 0)) AND ((p113 <= 0)) AND ((2 <= p26) OR (p26 <= 0) OR (p134 <= 0)) AND ((p18 <= 0) OR (2 <= p63) OR (p63 <= 0)) AND ((p116 <= 0) OR (p192 <= 0)) AND (((1 <= p1) AND (1 <= p21)) OR ((p12 <= 1) AND (1 <= p12) AND (p70 <= 1) AND (1 <= p70)) OR ((p33 <= 1) AND (1 <= p33) AND (p127 <= 1) AND (1 <= p127) AND (p32 <= 1) AND (1 <= p32) AND (p133 <= 1) AND (1 <= p133))))
lola: local time limit reached - aborting
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 576 literals and 54 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: memory consumption: 33608 KB
lola: time consumption: 83 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-01b"
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-01b, 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-162038005800012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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