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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 105K 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 2.7K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 279K 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-02a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620392107107

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 12:55:08] [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:55:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 12:55:08] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2021-05-07 12:55:08] [INFO ] Transformed 626 places.
[2021-05-07 12:55:08] [INFO ] Transformed 1008 transitions.
[2021-05-07 12:55:08] [INFO ] Found NUPN structural information;
[2021-05-07 12:55:08] [INFO ] Parsed PT model containing 626 places and 1008 transitions in 143 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 112 resets, run finished after 111 ms. (steps per millisecond=90 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0]
FORMULA ASLink-PT-02a-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA ASLink-PT-02a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 998 rows 626 cols
[2021-05-07 12:55:09] [INFO ] Computed 118 place invariants in 55 ms
[2021-05-07 12:55:09] [INFO ] [Real]Absence check using 28 positive place invariants in 38 ms returned sat
[2021-05-07 12:55:09] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 59 ms returned sat
[2021-05-07 12:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:11] [INFO ] [Real]Absence check using state equation in 1643 ms returned sat
[2021-05-07 12:55:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:11] [INFO ] [Nat]Absence check using 28 positive place invariants in 44 ms returned sat
[2021-05-07 12:55:11] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 57 ms returned sat
[2021-05-07 12:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:13] [INFO ] [Nat]Absence check using state equation in 1457 ms returned sat
[2021-05-07 12:55:13] [INFO ] Computed and/alt/rep : 997/13104/997 causal constraints in 97 ms.
[2021-05-07 12:55:16] [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 (=> (> t182 0) (and (or (and (> t174 0) (< o174 o182)) (and (> t190 0) (< o190 o182)) (and (> t206 0) (< o206 o182)) (and (> t222 0) (< o222 o182)) (and (> t238 0) (< o238 o182)) (and (> t254 0) (< o254 o182)) (and (> t270 0) (< o270 o182)) (and (> t286 0) (< o286 o182))) (or (and (> t169 0) (< o169 o182)) (and (> t170 0) (< o170 o182)) (and (> t171 0) (< o171 o182)) (and (> t172 0) (< o172 o182)) (and (> t173 0) (< o173 o182)) (and (> t174 0) (< o174 o182)) (and (> t175 0) (< o175 o182)) (and (> t176 0) (< o176 o182)))))") while checking expression at index 0
[2021-05-07 12:55:16] [INFO ] [Real]Absence check using 28 positive place invariants in 26 ms returned sat
[2021-05-07 12:55:16] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 46 ms returned sat
[2021-05-07 12:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:17] [INFO ] [Real]Absence check using state equation in 1284 ms returned sat
[2021-05-07 12:55:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:18] [INFO ] [Nat]Absence check using 28 positive place invariants in 40 ms returned sat
[2021-05-07 12:55:18] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 46 ms returned sat
[2021-05-07 12:55:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:18] [INFO ] [Nat]Absence check using state equation in 365 ms returned unsat
[2021-05-07 12:55:18] [INFO ] [Real]Absence check using 28 positive place invariants in 27 ms returned sat
[2021-05-07 12:55:18] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 42 ms returned unsat
[2021-05-07 12:55:18] [INFO ] [Real]Absence check using 28 positive place invariants in 27 ms returned sat
[2021-05-07 12:55:18] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 57 ms returned sat
[2021-05-07 12:55:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:20] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2021-05-07 12:55:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:20] [INFO ] [Nat]Absence check using 28 positive place invariants in 39 ms returned sat
[2021-05-07 12:55:20] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 45 ms returned sat
[2021-05-07 12:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:20] [INFO ] [Nat]Absence check using state equation in 217 ms returned unsat
[2021-05-07 12:55:20] [INFO ] [Real]Absence check using 28 positive place invariants in 26 ms returned sat
[2021-05-07 12:55:20] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 58 ms returned sat
[2021-05-07 12:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:22] [INFO ] [Real]Absence check using state equation in 1434 ms returned sat
[2021-05-07 12:55:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:22] [INFO ] [Nat]Absence check using 28 positive place invariants in 40 ms returned sat
[2021-05-07 12:55:22] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 57 ms returned sat
[2021-05-07 12:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:24] [INFO ] [Nat]Absence check using state equation in 2472 ms returned unsat
[2021-05-07 12:55:24] [INFO ] [Real]Absence check using 28 positive place invariants in 26 ms returned sat
[2021-05-07 12:55:24] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 56 ms returned sat
[2021-05-07 12:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:26] [INFO ] [Real]Absence check using state equation in 1403 ms returned sat
[2021-05-07 12:55:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:26] [INFO ] [Nat]Absence check using 28 positive place invariants in 39 ms returned sat
[2021-05-07 12:55:26] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 57 ms returned sat
[2021-05-07 12:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:28] [INFO ] [Nat]Absence check using state equation in 1585 ms returned unsat
[2021-05-07 12:55:28] [INFO ] [Real]Absence check using 28 positive place invariants in 26 ms returned sat
[2021-05-07 12:55:28] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 47 ms returned sat
[2021-05-07 12:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:29] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2021-05-07 12:55:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:29] [INFO ] [Nat]Absence check using 28 positive place invariants in 40 ms returned sat
[2021-05-07 12:55:29] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 46 ms returned sat
[2021-05-07 12:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:31] [INFO ] [Nat]Absence check using state equation in 1402 ms returned sat
[2021-05-07 12:55:31] [INFO ] Deduced a trap composed of 42 places in 325 ms
[2021-05-07 12:55:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 347 ms
[2021-05-07 12:55:31] [INFO ] [Real]Absence check using 28 positive place invariants in 26 ms returned sat
[2021-05-07 12:55:31] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 30 ms returned unsat
[2021-05-07 12:55:31] [INFO ] [Real]Absence check using 28 positive place invariants in 27 ms returned sat
[2021-05-07 12:55:31] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 52 ms returned sat
[2021-05-07 12:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:32] [INFO ] [Real]Absence check using state equation in 1317 ms returned sat
[2021-05-07 12:55:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:33] [INFO ] [Nat]Absence check using 28 positive place invariants in 38 ms returned sat
[2021-05-07 12:55:33] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 56 ms returned sat
[2021-05-07 12:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:33] [INFO ] [Nat]Absence check using state equation in 266 ms returned unsat
[2021-05-07 12:55:33] [INFO ] [Real]Absence check using 28 positive place invariants in 25 ms returned sat
[2021-05-07 12:55:33] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 54 ms returned sat
[2021-05-07 12:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:34] [INFO ] [Real]Absence check using state equation in 1353 ms returned sat
[2021-05-07 12:55:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:55:35] [INFO ] [Nat]Absence check using 28 positive place invariants in 38 ms returned sat
[2021-05-07 12:55:35] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 54 ms returned sat
[2021-05-07 12:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:55:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 12:55:39] [INFO ] [Nat]Absence check using state equation in 4806 ms returned (error "Solver has unexpectedly terminated")
[2021-05-07 12:55:40] [INFO ] [Real]Absence check using 28 positive place invariants in 26 ms returned sat
[2021-05-07 12:55:40] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 19 ms returned unsat
FORMULA ASLink-PT-02a-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 21 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 614 transition count 948
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 112 place count 564 transition count 948
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 112 place count 564 transition count 900
Deduced a syphon composed of 48 places in 3 ms
Ensure Unique test removed 18 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 226 place count 498 transition count 900
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 228 place count 497 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 496 transition count 899
Symmetric choice reduction at 4 with 4 rule applications. Total rules 233 place count 496 transition count 899
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 17 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 241 place count 492 transition count 882
Ensure Unique test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 248 place count 490 transition count 877
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 251 place count 487 transition count 877
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 487 transition count 877
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 486 transition count 869
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 486 transition count 869
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 257 place count 485 transition count 861
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 485 transition count 861
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 260 place count 484 transition count 853
Symmetric choice reduction at 6 with 1 rule applications. Total rules 261 place count 484 transition count 853
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 263 place count 483 transition count 845
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 483 transition count 845
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 482 transition count 837
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 294 place count 468 transition count 823
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 296 place count 468 transition count 821
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 298 place count 466 transition count 821
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 300 place count 466 transition count 821
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 302 place count 466 transition count 821
Applied a total of 302 rules in 312 ms. Remains 466 /626 variables (removed 160) and now considering 821/998 (removed 177) transitions.
Finished structural reductions, in 1 iterations. Remains : 466/626 places, 821/998 transitions.
Incomplete random walk after 1000000 steps, including 15114 resets, run finished after 3011 ms. (steps per millisecond=332 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5123 resets, run finished after 1722 ms. (steps per millisecond=580 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5250 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 5976205 steps, run timeout after 30001 ms. (steps per millisecond=199 ) properties seen :[1, 0]
Probabilistic random walk after 5976205 steps, saw 1701164 distinct states, run finished after 30001 ms. (steps per millisecond=199 ) properties seen :[1, 0]
FORMULA ASLink-PT-02a-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 821 rows 466 cols
[2021-05-07 12:56:16] [INFO ] Computed 85 place invariants in 17 ms
[2021-05-07 12:56:16] [INFO ] [Real]Absence check using 25 positive place invariants in 21 ms returned sat
[2021-05-07 12:56:16] [INFO ] [Real]Absence check using 25 positive and 60 generalized place invariants in 65 ms returned sat
[2021-05-07 12:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:17] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2021-05-07 12:56:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:56:18] [INFO ] [Nat]Absence check using 25 positive place invariants in 281 ms returned sat
[2021-05-07 12:56:18] [INFO ] [Nat]Absence check using 25 positive and 60 generalized place invariants in 29 ms returned sat
[2021-05-07 12:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:56:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 12:56:27] [INFO ] [Nat]Absence check using state equation in 9183 ms returned unknown
Support contains 6 out of 466 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 466/466 places, 821/821 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 466 transition count 820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 465 transition count 820
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 465 transition count 820
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 6 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 464 transition count 814
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 464 transition count 814
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 463 transition count 813
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 459 transition count 813
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 11 place count 459 transition count 807
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 24 place count 452 transition count 807
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 449 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 27 place count 449 transition count 806
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 448 transition count 806
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 39 place count 443 transition count 801
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 443 transition count 801
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 45 place count 441 transition count 799
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 441 transition count 797
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 49 place count 439 transition count 797
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 51 place count 439 transition count 797
Applied a total of 51 rules in 194 ms. Remains 439 /466 variables (removed 27) and now considering 797/821 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 439/466 places, 797/821 transitions.
Incomplete random walk after 1000000 steps, including 16235 resets, run finished after 3053 ms. (steps per millisecond=327 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5672 resets, run finished after 1531 ms. (steps per millisecond=653 ) properties seen :[0]
Interrupted probabilistic random walk after 6411225 steps, run timeout after 30001 ms. (steps per millisecond=213 ) properties seen :[0]
Probabilistic random walk after 6411225 steps, saw 1842549 distinct states, run finished after 30001 ms. (steps per millisecond=213 ) properties seen :[0]
// Phase 1: matrix 797 rows 439 cols
[2021-05-07 12:57:02] [INFO ] Computed 77 place invariants in 18 ms
[2021-05-07 12:57:02] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2021-05-07 12:57:02] [INFO ] [Real]Absence check using 18 positive and 59 generalized place invariants in 74 ms returned sat
[2021-05-07 12:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:57:03] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2021-05-07 12:57:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:57:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2021-05-07 12:57:03] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 29 ms returned sat
[2021-05-07 12:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:57:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 12:57:12] [INFO ] [Nat]Absence check using state equation in 9160 ms returned unknown
Support contains 6 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 797/797 transitions.
Applied a total of 0 rules in 13 ms. Remains 439 /439 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 439/439 places, 797/797 transitions.
Starting structural reductions, iteration 0 : 439/439 places, 797/797 transitions.
Applied a total of 0 rules in 12 ms. Remains 439 /439 variables (removed 0) and now considering 797/797 (removed 0) transitions.
// Phase 1: matrix 797 rows 439 cols
[2021-05-07 12:57:12] [INFO ] Computed 77 place invariants in 8 ms
[2021-05-07 12:57:13] [INFO ] Implicit Places using invariants in 899 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 263, 274, 275, 276, 305, 307, 310, 328, 329, 330, 331, 343, 349, 355, 361, 367, 373, 379, 385, 391, 397, 403]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 906 ms to find 38 implicit places.
[2021-05-07 12:57:13] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 797 rows 401 cols
[2021-05-07 12:57:13] [INFO ] Computed 39 place invariants in 7 ms
[2021-05-07 12:57:14] [INFO ] Dead Transitions using invariants and state equation in 1279 ms returned []
Starting structural reductions, iteration 1 : 401/439 places, 797/797 transitions.
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 401 transition count 735
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 339 transition count 735
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 124 place count 339 transition count 720
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 155 place count 323 transition count 720
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 167 place count 319 transition count 712
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 175 place count 311 transition count 712
Symmetric choice reduction at 4 with 15 rule applications. Total rules 190 place count 311 transition count 712
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 220 place count 296 transition count 697
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 223 place count 296 transition count 694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 223 place count 296 transition count 693
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 225 place count 295 transition count 693
Symmetric choice reduction at 5 with 3 rule applications. Total rules 228 place count 295 transition count 693
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 234 place count 292 transition count 690
Symmetric choice reduction at 5 with 1 rule applications. Total rules 235 place count 292 transition count 690
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 237 place count 291 transition count 689
Symmetric choice reduction at 5 with 1 rule applications. Total rules 238 place count 291 transition count 689
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 240 place count 290 transition count 688
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 290 place count 265 transition count 663
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 292 place count 265 transition count 661
Symmetric choice reduction at 6 with 2 rule applications. Total rules 294 place count 265 transition count 661
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 298 place count 263 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 300 place count 263 transition count 657
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 304 place count 263 transition count 653
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 309 place count 258 transition count 653
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 316 place count 258 transition count 653
Applied a total of 316 rules in 129 ms. Remains 258 /401 variables (removed 143) and now considering 653/797 (removed 144) transitions.
// Phase 1: matrix 653 rows 258 cols
[2021-05-07 12:57:14] [INFO ] Computed 33 place invariants in 5 ms
[2021-05-07 12:57:15] [INFO ] Implicit Places using invariants in 320 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 322 ms to find 12 implicit places.
Starting structural reductions, iteration 2 : 246/439 places, 653/797 transitions.
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 246 transition count 653
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 240 transition count 647
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 240 transition count 647
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 238 transition count 645
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 234 transition count 641
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 234 transition count 635
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 228 transition count 635
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 228 transition count 633
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 226 transition count 633
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 226 transition count 633
Applied a total of 50 rules in 52 ms. Remains 226 /246 variables (removed 20) and now considering 633/653 (removed 20) transitions.
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:57:15] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 12:57:15] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:57:15] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 12:57:16] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 226/439 places, 633/797 transitions.
Incomplete random walk after 1000000 steps, including 24171 resets, run finished after 2433 ms. (steps per millisecond=411 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 10092 resets, run finished after 1272 ms. (steps per millisecond=786 ) properties seen :[0]
Interrupted probabilistic random walk after 7108659 steps, run timeout after 30001 ms. (steps per millisecond=236 ) properties seen :[0]
Probabilistic random walk after 7108659 steps, saw 2819690 distinct states, run finished after 30001 ms. (steps per millisecond=236 ) properties seen :[0]
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:57:50] [INFO ] Computed 21 place invariants in 7 ms
[2021-05-07 12:57:50] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2021-05-07 12:57:50] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-07 12:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:57:50] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2021-05-07 12:57:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:57:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2021-05-07 12:57:50] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-07 12:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:57:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 12:57:59] [INFO ] [Nat]Absence check using state equation in 8348 ms returned sat
[2021-05-07 12:57:59] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2021-05-07 12:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2021-05-07 12:57:59] [INFO ] Computed and/alt/rep : 619/9790/619 causal constraints in 46 ms.
[2021-05-07 12:58:06] [INFO ] Added : 90 causal constraints over 18 iterations in 6739 ms. Result :unknown
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 226/226 places, 633/633 transitions.
Applied a total of 0 rules in 16 ms. Remains 226 /226 variables (removed 0) and now considering 633/633 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 226/226 places, 633/633 transitions.
Starting structural reductions, iteration 0 : 226/226 places, 633/633 transitions.
Applied a total of 0 rules in 24 ms. Remains 226 /226 variables (removed 0) and now considering 633/633 (removed 0) transitions.
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:58:06] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 12:58:06] [INFO ] Implicit Places using invariants in 384 ms returned []
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:58:06] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 12:58:07] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2021-05-07 12:58:08] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:58:08] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 603 ms returned []
Finished structural reductions, in 1 iterations. Remains : 226/226 places, 633/633 transitions.
Incomplete random walk after 100000 steps, including 2388 resets, run finished after 244 ms. (steps per millisecond=409 ) properties seen :[0]
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:58:08] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 12:58:08] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2021-05-07 12:58:08] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-07 12:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:58:09] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2021-05-07 12:58:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:58:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2021-05-07 12:58:09] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-07 12:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:58:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 12:58:15] [INFO ] [Nat]Absence check using state equation in 6284 ms returned sat
[2021-05-07 12:58:15] [INFO ] Deduced a trap composed of 27 places in 68 ms
[2021-05-07 12:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2021-05-07 12:58:15] [INFO ] Computed and/alt/rep : 619/9790/619 causal constraints in 48 ms.
[2021-05-07 12:58:19] [INFO ] Added : 95 causal constraints over 19 iterations in 3983 ms. Result :sat
Applied a total of 0 rules in 39 ms. Remains 226 /226 variables (removed 0) and now considering 633/633 (removed 0) transitions.
// Phase 1: matrix 633 rows 226 cols
[2021-05-07 12:58:19] [INFO ] Computed 21 place invariants in 9 ms
[2021-05-07 12:58:19] [INFO ] [Real]Absence check using 9 positive place invariants in 27 ms returned sat
[2021-05-07 12:58:19] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-07 12:58:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 12:58:20] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2021-05-07 12:58:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 12:58:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2021-05-07 12:58:20] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-07 12:58:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 12:58:24] [INFO ] [Nat]Absence check using state equation in 4177 ms returned sat
[2021-05-07 12:58:24] [INFO ] Computed and/alt/rep : 619/9790/619 causal constraints in 161 ms.
[2021-05-07 12:58:39] [INFO ] Added : 400 causal constraints over 80 iterations in 14829 ms. Result :sat
[2021-05-07 12:58:39] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2021-05-07 12:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
Attempting to minimize the solution found.
Minimization took 93 ms.
[2021-05-07 12:58:39] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-07 12:58:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2021-05-07 12:58:40] [INFO ] Flatten gal took : 90 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-02a @ 3570 seconds
vrfy: finished
info: timeLeft: 3518
rslt: Output for ReachabilityFireability @ ASLink-PT-02a

{
"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:58:41 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 25348,
"runtime": 52.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": 3,
"adisj": 2,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= p90) OR (p90 <= 0) OR (2 <= p169) OR (p169 <= 0)) AND (((1 <= p102) AND (p173 <= 1) AND (1 <= p173)) OR ((p4 <= 1) AND (1 <= p4) AND (p66 <= 1) AND (1 <= p66))))))",
"processed_size": 181,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2581,
"conflict_clusters": 18,
"places": 226,
"places_significant": 205,
"singleton_clusters": 0,
"transitions": 633
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 36,
"problems": 8
},
"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: 859/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 226
lola: finding significant places
lola: 226 places, 633 transitions, 205 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: (p102 <= 1)
lola: E (F ((((2 <= p90) OR (p90 <= 0) OR (2 <= p169) OR (p169 <= 0)) AND (((1 <= p102) AND (p173 <= 1) AND (1 <= p173)) OR ((p4 <= 1) AND (1 <= p4) AND (p66 <= 1) AND (1 <= p66))))))
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 ((((2 <= p90) OR (p90 <= 0) OR (2 <= p169) OR (p169 <= 0)) AND (((1 <= p102) AND (p173 <= 1) AND (1 <= p173)) OR ((p4 <= 1) AND (1 <= p4) AND (p66 <= 1) AND (1 <= p66))))))
lola: processed formula length: 181
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((2 <= p90) OR (p90 <= 0) OR (2 <= p169) OR (p169 <= 0)) AND (((1 <= p102) AND (p173 <= 1) AND (1 <= p173)) OR ((p4 <= 1) AND (1 <= p4) AND (p66 <= 1) AND (1 <= p66))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 8 conjunctive subformulas
lola: memory consumption: 25348 KB
lola: time consumption: 52 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-02a"
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-02a, 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-162038005800016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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