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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.3K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.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.5K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 417K 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-02b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620393999128

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-07 13:26:40] [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 13:26:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 13:26:40] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2021-05-07 13:26:40] [INFO ] Transformed 1242 places.
[2021-05-07 13:26:40] [INFO ] Transformed 1621 transitions.
[2021-05-07 13:26:40] [INFO ] Found NUPN structural information;
[2021-05-07 13:26:40] [INFO ] Parsed PT model containing 1242 places and 1621 transitions in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 42 resets, run finished after 87 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1]
FORMULA ASLink-PT-02b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA ASLink-PT-02b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-02b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 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 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1621 rows 1242 cols
[2021-05-07 13:26:41] [INFO ] Computed 121 place invariants in 125 ms
[2021-05-07 13:26:41] [INFO ] [Real]Absence check using 27 positive place invariants in 66 ms returned sat
[2021-05-07 13:26:41] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 96 ms returned unsat
[2021-05-07 13:26:42] [INFO ] [Real]Absence check using 27 positive place invariants in 52 ms returned sat
[2021-05-07 13:26:42] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 108 ms returned sat
[2021-05-07 13:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:26:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-07 13:26:46] [INFO ] [Real]Absence check using state equation in 4693 ms returned (error "Failed to check-sat")
[2021-05-07 13:26:47] [INFO ] [Real]Absence check using 27 positive place invariants in 49 ms returned sat
[2021-05-07 13:26:47] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 79 ms returned sat
[2021-05-07 13:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:26:51] [INFO ] [Real]Absence check using state equation in 3854 ms returned sat
[2021-05-07 13:26:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:26:51] [INFO ] [Nat]Absence check using 27 positive place invariants in 107 ms returned sat
[2021-05-07 13:26:51] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 76 ms returned sat
[2021-05-07 13:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:26:54] [INFO ] [Nat]Absence check using state equation in 2691 ms returned unsat
[2021-05-07 13:26:54] [INFO ] [Real]Absence check using 27 positive place invariants in 54 ms returned sat
[2021-05-07 13:26:54] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 80 ms returned sat
[2021-05-07 13:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:26:58] [INFO ] [Real]Absence check using state equation in 4064 ms returned sat
[2021-05-07 13:26:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:26:58] [INFO ] [Nat]Absence check using 27 positive place invariants in 100 ms returned sat
[2021-05-07 13:26:59] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 78 ms returned sat
[2021-05-07 13:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:03] [INFO ] [Nat]Absence check using state equation in 4040 ms returned sat
[2021-05-07 13:27:03] [INFO ] Deduced a trap composed of 20 places in 491 ms
[2021-05-07 13:27:04] [INFO ] Deduced a trap composed of 16 places in 817 ms
[2021-05-07 13:27:04] [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 (> (+ s0 s1 s2 s78 s79 s80 s81 s82 s83 s84 s155 s156 s213 s214 s408 s409) 0)") while checking expression at index 3
[2021-05-07 13:27:04] [INFO ] [Real]Absence check using 27 positive place invariants in 52 ms returned sat
[2021-05-07 13:27:04] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 14 ms returned unsat
[2021-05-07 13:27:04] [INFO ] [Real]Absence check using 27 positive place invariants in 49 ms returned sat
[2021-05-07 13:27:05] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 100 ms returned sat
[2021-05-07 13:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:09] [INFO ] [Real]Absence check using state equation in 4363 ms returned sat
[2021-05-07 13:27:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:27:09] [INFO ] [Nat]Absence check using 27 positive place invariants in 274 ms returned sat
[2021-05-07 13:27:09] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 97 ms returned sat
[2021-05-07 13:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:13] [INFO ] [Nat]Absence check using state equation in 4039 ms returned sat
[2021-05-07 13:27:14] [INFO ] Deduced a trap composed of 61 places in 356 ms
[2021-05-07 13:27:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2021-05-07 13:27:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 5
[2021-05-07 13:27:14] [INFO ] [Real]Absence check using 27 positive place invariants in 49 ms returned sat
[2021-05-07 13:27:14] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 49 ms returned unsat
[2021-05-07 13:27:14] [INFO ] [Real]Absence check using 27 positive place invariants in 51 ms returned sat
[2021-05-07 13:27:15] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 98 ms returned sat
[2021-05-07 13:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:18] [INFO ] [Real]Absence check using state equation in 3878 ms returned sat
[2021-05-07 13:27:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:27:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 240 ms returned sat
[2021-05-07 13:27:19] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 97 ms returned sat
[2021-05-07 13:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:22] [INFO ] [Nat]Absence check using state equation in 2924 ms returned unsat
[2021-05-07 13:27:22] [INFO ] [Real]Absence check using 27 positive place invariants in 49 ms returned sat
[2021-05-07 13:27:22] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 81 ms returned sat
[2021-05-07 13:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:26] [INFO ] [Real]Absence check using state equation in 3877 ms returned sat
[2021-05-07 13:27:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:27:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 100 ms returned sat
[2021-05-07 13:27:27] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 77 ms returned sat
[2021-05-07 13:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:27:29] [INFO ] [Nat]Absence check using state equation in 2746 ms returned unsat
[2021-05-07 13:27:29] [INFO ] [Real]Absence check using 27 positive place invariants in 48 ms returned sat
[2021-05-07 13:27:30] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 68 ms returned unsat
[2021-05-07 13:27:30] [INFO ] [Real]Absence check using 27 positive place invariants in 49 ms returned sat
[2021-05-07 13:27:30] [INFO ] [Real]Absence check using 27 positive and 94 generalized place invariants in 1 ms returned unsat
FORMULA ASLink-PT-02b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 16 out of 1242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1242 transition count 1345
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 290 rules applied. Total rules applied 566 place count 966 transition count 1331
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 570 place count 962 transition count 1331
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 281 Pre rules applied. Total rules applied 570 place count 962 transition count 1050
Deduced a syphon composed of 281 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 3 with 585 rules applied. Total rules applied 1155 place count 658 transition count 1050
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 3 with 18 rules applied. Total rules applied 1173 place count 656 transition count 1034
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1189 place count 640 transition count 1034
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1189 place count 640 transition count 1026
Deduced a syphon composed of 8 places in 4 ms
Ensure Unique test removed 8 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1213 place count 624 transition count 1026
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1213 place count 624 transition count 1018
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1229 place count 616 transition count 1018
Symmetric choice reduction at 5 with 37 rule applications. Total rules 1266 place count 616 transition count 1018
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 37 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1340 place count 579 transition count 981
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1341 place count 579 transition count 980
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1341 place count 579 transition count 966
Deduced a syphon composed of 14 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 29 rules applied. Total rules applied 1370 place count 564 transition count 966
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1370 place count 564 transition count 965
Deduced a syphon composed of 1 places in 3 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 1373 place count 562 transition count 965
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1375 place count 562 transition count 965
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 15 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1379 place count 560 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1379 place count 560 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1381 place count 559 transition count 949
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1382 place count 559 transition count 949
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 1384 place count 558 transition count 941
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 558 transition count 941
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 1387 place count 557 transition count 933
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1388 place count 557 transition count 933
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 1390 place count 556 transition count 925
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1391 place count 556 transition count 925
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 1393 place count 555 transition count 917
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1394 place count 555 transition count 917
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 1396 place count 554 transition count 909
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1397 place count 554 transition count 909
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 1399 place count 553 transition count 901
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1400 place count 553 transition count 901
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 1402 place count 552 transition count 893
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1403 place count 552 transition count 893
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 1405 place count 551 transition count 885
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1406 place count 551 transition count 885
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 1408 place count 550 transition count 877
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1409 place count 550 transition count 877
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 1411 place count 549 transition count 869
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1412 place count 549 transition count 869
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 1414 place count 548 transition count 861
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1415 place count 548 transition count 861
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 1417 place count 547 transition count 853
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1418 place count 547 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 1420 place count 546 transition count 845
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 1554 place count 479 transition count 778
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1555 place count 479 transition count 778
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1557 place count 478 transition count 777
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1558 place count 477 transition count 777
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1559 place count 477 transition count 777
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1561 place count 476 transition count 776
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 1563 place count 476 transition count 774
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1564 place count 475 transition count 774
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1566 place count 474 transition count 783
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1569 place count 474 transition count 780
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1572 place count 471 transition count 780
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1574 place count 471 transition count 778
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1576 place count 469 transition count 778
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1577 place count 468 transition count 777
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 1583 place count 464 transition count 775
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1585 place count 462 transition count 775
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 6 Pre rules applied. Total rules applied 1585 place count 462 transition count 769
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 13 with 13 rules applied. Total rules applied 1598 place count 455 transition count 769
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 13 with 3 rules applied. Total rules applied 1601 place count 452 transition count 769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1601 place count 452 transition count 768
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1603 place count 451 transition count 768
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 14 with 10 rules applied. Total rules applied 1613 place count 446 transition count 763
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1615 place count 446 transition count 763
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 1619 place count 444 transition count 761
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1620 place count 444 transition count 761
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1622 place count 443 transition count 760
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1623 place count 443 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1624 place count 443 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1625 place count 442 transition count 758
Applied a total of 1625 rules in 818 ms. Remains 442 /1242 variables (removed 800) and now considering 758/1621 (removed 863) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/1242 places, 758/1621 transitions.
Incomplete random walk after 1000000 steps, including 16174 resets, run finished after 2850 ms. (steps per millisecond=350 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6121 resets, run finished after 1572 ms. (steps per millisecond=636 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6190 resets, run finished after 1423 ms. (steps per millisecond=702 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6247 resets, run finished after 1538 ms. (steps per millisecond=650 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 7667490 steps, run timeout after 30001 ms. (steps per millisecond=255 ) properties seen :[0, 0, 1]
Probabilistic random walk after 7667490 steps, saw 1803113 distinct states, run finished after 30001 ms. (steps per millisecond=255 ) properties seen :[0, 0, 1]
FORMULA ASLink-PT-02b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 758 rows 442 cols
[2021-05-07 13:28:08] [INFO ] Computed 77 place invariants in 37 ms
[2021-05-07 13:28:08] [INFO ] [Real]Absence check using 18 positive place invariants in 71 ms returned sat
[2021-05-07 13:28:08] [INFO ] [Real]Absence check using 18 positive and 59 generalized place invariants in 36 ms returned sat
[2021-05-07 13:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:28:09] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2021-05-07 13:28:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:28:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2021-05-07 13:28:09] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 28 ms returned sat
[2021-05-07 13:28:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:28:10] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2021-05-07 13:28:10] [INFO ] Deduced a trap composed of 63 places in 202 ms
[2021-05-07 13:28:10] [INFO ] Deduced a trap composed of 23 places in 179 ms
[2021-05-07 13:28:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 417 ms
[2021-05-07 13:28:10] [INFO ] [Real]Absence check using 18 positive place invariants in 18 ms returned sat
[2021-05-07 13:28:10] [INFO ] [Real]Absence check using 18 positive and 59 generalized place invariants in 25 ms returned sat
[2021-05-07 13:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:28:11] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2021-05-07 13:28:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:28:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2021-05-07 13:28:11] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 24 ms returned sat
[2021-05-07 13:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:28:12] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2021-05-07 13:28:12] [INFO ] Computed and/alt/rep : 748/8067/748 causal constraints in 57 ms.
[2021-05-07 13:28:29] [INFO ] Added : 480 causal constraints over 96 iterations in 16734 ms. Result :sat
[2021-05-07 13:28:29] [INFO ] Deduced a trap composed of 104 places in 230 ms
[2021-05-07 13:28:29] [INFO ] Deduced a trap composed of 92 places in 240 ms
[2021-05-07 13:28:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 850 ms
Attempting to minimize the solution found.
Minimization took 117 ms.
FORMULA ASLink-PT-02b-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 201000 steps, including 3182 resets, run finished after 691 ms. (steps per millisecond=290 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 442/442 places, 758/758 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 442 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 440 transition count 756
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 440 transition count 751
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 435 transition count 751
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 435 transition count 751
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 14 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 433 transition count 737
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 432 transition count 737
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 432 transition count 737
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 431 transition count 729
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 431 transition count 729
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 8 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 430 transition count 721
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 429 transition count 720
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 429 transition count 720
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 428 transition count 719
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 428 transition count 718
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 427 transition count 718
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 427 transition count 781
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 36 place count 426 transition count 781
Applied a total of 36 rules in 74 ms. Remains 426 /442 variables (removed 16) and now considering 781/758 (removed -23) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/442 places, 781/758 transitions.
Incomplete random walk after 1000000 steps, including 16193 resets, run finished after 2722 ms. (steps per millisecond=367 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 5424 resets, run finished after 1278 ms. (steps per millisecond=782 ) properties seen :[0]
Interrupted probabilistic random walk after 7105001 steps, run timeout after 30001 ms. (steps per millisecond=236 ) properties seen :[0]
Probabilistic random walk after 7105001 steps, saw 1631524 distinct states, run finished after 30001 ms. (steps per millisecond=236 ) properties seen :[0]
// Phase 1: matrix 781 rows 426 cols
[2021-05-07 13:29:04] [INFO ] Computed 76 place invariants in 9 ms
[2021-05-07 13:29:05] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2021-05-07 13:29:05] [INFO ] [Real]Absence check using 20 positive and 56 generalized place invariants in 65 ms returned sat
[2021-05-07 13:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:29:05] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2021-05-07 13:29:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:29:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2021-05-07 13:29:06] [INFO ] [Nat]Absence check using 20 positive and 56 generalized place invariants in 22 ms returned sat
[2021-05-07 13:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:29:06] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2021-05-07 13:29:06] [INFO ] Computed and/alt/rep : 764/7846/764 causal constraints in 59 ms.
[2021-05-07 13:29:27] [INFO ] Added : 660 causal constraints over 132 iterations in 20482 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 137 ms.
Incomplete Parikh walk after 666500 steps, including 14064 resets, run finished after 2100 ms. (steps per millisecond=317 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 426/426 places, 781/781 transitions.
Applied a total of 0 rules in 11 ms. Remains 426 /426 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 426/426 places, 781/781 transitions.
Starting structural reductions, iteration 0 : 426/426 places, 781/781 transitions.
Applied a total of 0 rules in 11 ms. Remains 426 /426 variables (removed 0) and now considering 781/781 (removed 0) transitions.
// Phase 1: matrix 781 rows 426 cols
[2021-05-07 13:29:29] [INFO ] Computed 76 place invariants in 8 ms
[2021-05-07 13:29:30] [INFO ] Implicit Places using invariants in 775 ms returned [1, 18, 19, 31, 48, 66, 85, 135, 145, 146, 148, 165, 183, 252, 256, 257, 260, 271, 272, 273, 291, 293, 297, 315, 316, 317, 318, 330, 336, 342, 348, 354, 360, 366, 372, 378, 384, 390]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 783 ms to find 38 implicit places.
[2021-05-07 13:29:30] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 781 rows 388 cols
[2021-05-07 13:29:30] [INFO ] Computed 38 place invariants in 6 ms
[2021-05-07 13:29:31] [INFO ] Dead Transitions using invariants and state equation in 1060 ms returned []
Starting structural reductions, iteration 1 : 388/426 places, 781/781 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 388 transition count 724
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 331 transition count 722
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 116 place count 331 transition count 707
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 147 place count 315 transition count 707
Symmetric choice reduction at 2 with 13 rule applications. Total rules 160 place count 315 transition count 707
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 45 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 186 place count 302 transition count 662
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 186 place count 302 transition count 661
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 301 transition count 661
Symmetric choice reduction at 2 with 3 rule applications. Total rules 191 place count 301 transition count 661
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 197 place count 298 transition count 658
Symmetric choice reduction at 2 with 3 rule applications. Total rules 200 place count 298 transition count 658
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 295 transition count 652
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 295 transition count 652
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 294 transition count 651
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 294 transition count 651
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 212 place count 293 transition count 649
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 260 place count 269 transition count 625
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 269 transition count 625
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 263 place count 268 transition count 624
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 264 place count 268 transition count 623
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 274 place count 263 transition count 633
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 283 place count 263 transition count 624
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 297 place count 249 transition count 624
Symmetric choice reduction at 4 with 3 rule applications. Total rules 300 place count 249 transition count 624
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 306 place count 246 transition count 621
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 321 place count 246 transition count 606
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 327 place count 246 transition count 606
Applied a total of 327 rules in 75 ms. Remains 246 /388 variables (removed 142) and now considering 606/781 (removed 175) transitions.
[2021-05-07 13:29:31] [INFO ] Flow matrix only has 602 transitions (discarded 4 similar events)
// Phase 1: matrix 602 rows 246 cols
[2021-05-07 13:29:31] [INFO ] Computed 32 place invariants in 5 ms
[2021-05-07 13:29:31] [INFO ] Implicit Places using invariants in 328 ms returned [86, 92, 95, 97, 101, 102, 154, 171, 177, 180, 182]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 330 ms to find 11 implicit places.
Starting structural reductions, iteration 2 : 235/426 places, 606/781 transitions.
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 235 transition count 606
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 229 transition count 600
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 229 transition count 600
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 227 transition count 598
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 224 transition count 595
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 224 transition count 589
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 218 transition count 589
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 218 transition count 588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 217 transition count 588
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 217 transition count 588
Applied a total of 46 rules in 42 ms. Remains 217 /235 variables (removed 18) and now considering 588/606 (removed 18) transitions.
[2021-05-07 13:29:31] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:29:31] [INFO ] Computed 21 place invariants in 4 ms
[2021-05-07 13:29:32] [INFO ] Implicit Places using invariants in 410 ms returned []
[2021-05-07 13:29:32] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:29:32] [INFO ] Computed 21 place invariants in 6 ms
[2021-05-07 13:29:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 13:29:33] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 217/426 places, 588/781 transitions.
Incomplete random walk after 1000000 steps, including 24477 resets, run finished after 2294 ms. (steps per millisecond=435 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 9108 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties seen :[0]
Interrupted probabilistic random walk after 7517352 steps, run timeout after 30001 ms. (steps per millisecond=250 ) properties seen :[0]
Probabilistic random walk after 7517352 steps, saw 2395912 distinct states, run finished after 30001 ms. (steps per millisecond=250 ) properties seen :[0]
[2021-05-07 13:30:06] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:30:06] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 13:30:06] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2021-05-07 13:30:07] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-07 13:30:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:30:07] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-07 13:30:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:30:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2021-05-07 13:30:07] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-07 13:30:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:30:07] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2021-05-07 13:30:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 13:30:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 44 ms returned sat
[2021-05-07 13:30:07] [INFO ] Deduced a trap composed of 62 places in 184 ms
[2021-05-07 13:30:08] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2021-05-07 13:30:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2021-05-07 13:30:08] [INFO ] Computed and/alt/rep : 571/8002/567 causal constraints in 28 ms.
[2021-05-07 13:30:28] [INFO ] Added : 440 causal constraints over 88 iterations in 20166 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 93 ms.
Incomplete Parikh walk after 146400 steps, including 1000 resets, run finished after 377 ms. (steps per millisecond=388 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 217 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 217/217 places, 588/588 transitions.
Applied a total of 0 rules in 7 ms. Remains 217 /217 variables (removed 0) and now considering 588/588 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 217/217 places, 588/588 transitions.
Starting structural reductions, iteration 0 : 217/217 places, 588/588 transitions.
Applied a total of 0 rules in 6 ms. Remains 217 /217 variables (removed 0) and now considering 588/588 (removed 0) transitions.
[2021-05-07 13:30:28] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:30:28] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 13:30:29] [INFO ] Implicit Places using invariants in 280 ms returned []
[2021-05-07 13:30:29] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:30:29] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 13:30:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 13:30:30] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2021-05-07 13:30:30] [INFO ] Redundant transitions in 24 ms returned []
[2021-05-07 13:30:30] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:30:30] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 13:30:30] [INFO ] Dead Transitions using invariants and state equation in 580 ms returned []
Finished structural reductions, in 1 iterations. Remains : 217/217 places, 588/588 transitions.
Incomplete random walk after 100000 steps, including 2474 resets, run finished after 241 ms. (steps per millisecond=414 ) properties seen :[0]
[2021-05-07 13:30:31] [INFO ] Flow matrix only has 584 transitions (discarded 4 similar events)
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:30:31] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 13:30:31] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2021-05-07 13:30:31] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-07 13:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:30:31] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-07 13:30:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:30:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2021-05-07 13:30:31] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-07 13:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:30:31] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2021-05-07 13:30:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-07 13:30:31] [INFO ] [Nat]Added 3 Read/Feed constraints in 44 ms returned sat
[2021-05-07 13:30:32] [INFO ] Deduced a trap composed of 62 places in 105 ms
[2021-05-07 13:30:32] [INFO ] Deduced a trap composed of 13 places in 95 ms
[2021-05-07 13:30:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2021-05-07 13:30:32] [INFO ] Computed and/alt/rep : 571/8002/567 causal constraints in 36 ms.
[2021-05-07 13:30:50] [INFO ] Added : 430 causal constraints over 86 iterations in 18090 ms. Result :sat
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 217 transition count 584
Applied a total of 4 rules in 8 ms. Remains 217 /217 variables (removed 0) and now considering 584/588 (removed 4) transitions.
// Phase 1: matrix 584 rows 217 cols
[2021-05-07 13:30:50] [INFO ] Computed 21 place invariants in 5 ms
[2021-05-07 13:30:50] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2021-05-07 13:30:50] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 8 ms returned sat
[2021-05-07 13:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 13:30:50] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-07 13:30:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 13:30:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2021-05-07 13:30:50] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-07 13:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 13:30:51] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2021-05-07 13:30:51] [INFO ] Computed and/alt/rep : 567/7933/567 causal constraints in 37 ms.
[2021-05-07 13:31:08] [INFO ] Added : 435 causal constraints over 87 iterations in 17079 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 133 ms.
[2021-05-07 13:31:08] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2021-05-07 13:31:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
[2021-05-07 13:31:08] [INFO ] Flatten gal took : 96 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ASLink-PT-02b @ 3570 seconds

FORMULA ASLink-PT-02b-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ASLink-PT-02b

{
"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 13:31:09 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 21964,
"runtime": 3.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": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p88))))",
"processed_size": 20,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2434,
"conflict_clusters": 20,
"places": 217,
"places_significant": 196,
"singleton_clusters": 0,
"transitions": 588
},
"result":
{
"edges": 101,
"markings": 102,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"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: 805/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 217
lola: finding significant places
lola: 217 places, 588 transitions, 196 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: (p88 <= 1)
lola: E (F (((1 <= p88))))
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 <= p88))))
lola: processed formula length: 20
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 <= p88))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 101 edges
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: memory consumption: 21964 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: state equation: calling and running sara
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-02b"
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-02b, 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-162038005800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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