Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r003-smll-171620117600366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Anderson-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117600366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 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 Anderson-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716455039162

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 09:04:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 09:04:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 09:04:01] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2024-05-23 09:04:01] [INFO ] Transformed 621 places.
[2024-05-23 09:04:01] [INFO ] Transformed 2480 transitions.
[2024-05-23 09:04:01] [INFO ] Found NUPN structural information;
[2024-05-23 09:04:01] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 525 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3188 ms. (12 steps per ms) remains 4/14 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 680 ms. (58 steps per ms) remains 3/4 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 340 ms. (117 steps per ms) remains 3/3 properties
// Phase 1: matrix 2480 rows 621 cols
[2024-05-23 09:04:03] [INFO ] Computed 23 invariants in 117 ms
[2024-05-23 09:04:03] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 553/602 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 553/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/621 variables, 12/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 19/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2480/3101 variables, 621/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 90/1355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/3101 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3101/3101 variables, and 1355 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2963 ms.
Refiners :[Domain max(s): 621/621 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 621/621 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem Anderson-PT-10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 553/602 variables, 11/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 553/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/621 variables, 12/625 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 19/644 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/644 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2480/3101 variables, 621/1265 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 90/1355 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 2/1357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3101 variables, 0/1357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3101 variables, 0/1357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3101/3101 variables, and 1357 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3722 ms.
Refiners :[Domain max(s): 621/621 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 621/621 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 7037ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 41 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 621 transition count 2409
Deduced a syphon composed of 71 places in 4 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 550 transition count 2409
Discarding 164 places :
Symmetric choice reduction at 0 with 164 rule applications. Total rules 306 place count 386 transition count 715
Iterating global reduction 0 with 164 rules applied. Total rules applied 470 place count 386 transition count 715
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 490 place count 376 transition count 705
Applied a total of 490 rules in 244 ms. Remains 376 /621 variables (removed 245) and now considering 705/2480 (removed 1775) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 260 ms. Remains : 376/621 places, 705/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 516 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 359361 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 2
Probabilistic random walk after 359361 steps, saw 268964 distinct states, run finished after 3007 ms. (steps per millisecond=119 ) properties seen :0
// Phase 1: matrix 705 rows 376 cols
[2024-05-23 09:04:13] [INFO ] Computed 23 invariants in 28 ms
[2024-05-23 09:04:13] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/376 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 705/1081 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 90/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1081 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 376/376 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 324/365 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/376 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 705/1081 variables, 376/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1081 variables, 90/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1081 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1081 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1081 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 491 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 376/376 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2273ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 41 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 705/705 transitions.
Applied a total of 0 rules in 41 ms. Remains 376 /376 variables (removed 0) and now considering 705/705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 376/376 places, 705/705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 705/705 transitions.
Applied a total of 0 rules in 28 ms. Remains 376 /376 variables (removed 0) and now considering 705/705 (removed 0) transitions.
[2024-05-23 09:04:16] [INFO ] Invariant cache hit.
[2024-05-23 09:04:17] [INFO ] Implicit Places using invariants in 742 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 757 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 375/376 places, 705/705 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 375 transition count 639
Reduce places removed 66 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 81 rules applied. Total rules applied 147 place count 309 transition count 624
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 162 place count 294 transition count 624
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 175 place count 294 transition count 611
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 188 place count 281 transition count 611
Applied a total of 188 rules in 59 ms. Remains 281 /375 variables (removed 94) and now considering 611/705 (removed 94) transitions.
// Phase 1: matrix 611 rows 281 cols
[2024-05-23 09:04:17] [INFO ] Computed 22 invariants in 11 ms
[2024-05-23 09:04:17] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-23 09:04:17] [INFO ] Invariant cache hit.
[2024-05-23 09:04:17] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 09:04:19] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 281/376 places, 611/705 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3102 ms. Remains : 281/376 places, 611/705 transitions.
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 337408 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 337408 steps, saw 247409 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-23 09:04:22] [INFO ] Invariant cache hit.
[2024-05-23 09:04:22] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/281 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 611/892 variables, 281/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 90/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/892 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 892/892 variables, and 393 constraints, problems are : Problem set: 0 solved, 2 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 281/281 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/281 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 611/892 variables, 281/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 90/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/892 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 09:04:24] [INFO ] Deduced a trap composed of 125 places in 274 ms of which 31 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/892 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/892 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/892 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 892/892 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1759 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 281/281 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 2282ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 41 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 611/611 transitions.
Applied a total of 0 rules in 15 ms. Remains 281 /281 variables (removed 0) and now considering 611/611 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 281/281 places, 611/611 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 611/611 transitions.
Applied a total of 0 rules in 14 ms. Remains 281 /281 variables (removed 0) and now considering 611/611 (removed 0) transitions.
[2024-05-23 09:04:25] [INFO ] Invariant cache hit.
[2024-05-23 09:04:25] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-23 09:04:25] [INFO ] Invariant cache hit.
[2024-05-23 09:04:26] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-23 09:04:27] [INFO ] Implicit Places using invariants and state equation in 1779 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
[2024-05-23 09:04:27] [INFO ] Redundant transitions in 38 ms returned []
Running 601 sub problems to find dead transitions.
[2024-05-23 09:04:27] [INFO ] Invariant cache hit.
[2024-05-23 09:04:27] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 09:04:33] [INFO ] Deduced a trap composed of 125 places in 354 ms of which 4 ms to minimize.
[2024-05-23 09:04:33] [INFO ] Deduced a trap composed of 121 places in 222 ms of which 4 ms to minimize.
[2024-05-23 09:04:34] [INFO ] Deduced a trap composed of 87 places in 274 ms of which 4 ms to minimize.
[2024-05-23 09:04:34] [INFO ] Deduced a trap composed of 106 places in 231 ms of which 4 ms to minimize.
[2024-05-23 09:04:34] [INFO ] Deduced a trap composed of 77 places in 297 ms of which 5 ms to minimize.
[2024-05-23 09:04:34] [INFO ] Deduced a trap composed of 95 places in 247 ms of which 4 ms to minimize.
[2024-05-23 09:04:35] [INFO ] Deduced a trap composed of 81 places in 225 ms of which 3 ms to minimize.
[2024-05-23 09:04:35] [INFO ] Deduced a trap composed of 69 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:04:35] [INFO ] Deduced a trap composed of 80 places in 282 ms of which 4 ms to minimize.
[2024-05-23 09:04:36] [INFO ] Deduced a trap composed of 86 places in 261 ms of which 4 ms to minimize.
[2024-05-23 09:04:36] [INFO ] Deduced a trap composed of 61 places in 202 ms of which 3 ms to minimize.
[2024-05-23 09:04:36] [INFO ] Deduced a trap composed of 95 places in 290 ms of which 4 ms to minimize.
[2024-05-23 09:04:36] [INFO ] Deduced a trap composed of 65 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:04:37] [INFO ] Deduced a trap composed of 72 places in 265 ms of which 3 ms to minimize.
[2024-05-23 09:04:37] [INFO ] Deduced a trap composed of 130 places in 269 ms of which 4 ms to minimize.
[2024-05-23 09:04:37] [INFO ] Deduced a trap composed of 128 places in 281 ms of which 4 ms to minimize.
[2024-05-23 09:04:38] [INFO ] Deduced a trap composed of 108 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:04:38] [INFO ] Deduced a trap composed of 92 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:04:38] [INFO ] Deduced a trap composed of 81 places in 273 ms of which 3 ms to minimize.
[2024-05-23 09:04:40] [INFO ] Deduced a trap composed of 116 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 09:04:41] [INFO ] Deduced a trap composed of 85 places in 256 ms of which 4 ms to minimize.
[2024-05-23 09:04:41] [INFO ] Deduced a trap composed of 97 places in 261 ms of which 3 ms to minimize.
[2024-05-23 09:04:41] [INFO ] Deduced a trap composed of 87 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:04:42] [INFO ] Deduced a trap composed of 71 places in 251 ms of which 4 ms to minimize.
[2024-05-23 09:04:42] [INFO ] Deduced a trap composed of 87 places in 307 ms of which 3 ms to minimize.
[2024-05-23 09:04:42] [INFO ] Deduced a trap composed of 110 places in 252 ms of which 3 ms to minimize.
[2024-05-23 09:04:43] [INFO ] Deduced a trap composed of 54 places in 300 ms of which 3 ms to minimize.
[2024-05-23 09:04:43] [INFO ] Deduced a trap composed of 67 places in 305 ms of which 3 ms to minimize.
[2024-05-23 09:04:43] [INFO ] Deduced a trap composed of 92 places in 320 ms of which 3 ms to minimize.
[2024-05-23 09:04:45] [INFO ] Deduced a trap composed of 78 places in 321 ms of which 5 ms to minimize.
[2024-05-23 09:04:46] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 4 ms to minimize.
[2024-05-23 09:04:46] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 4 ms to minimize.
[2024-05-23 09:04:46] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 5 ms to minimize.
[2024-05-23 09:04:47] [INFO ] Deduced a trap composed of 85 places in 253 ms of which 3 ms to minimize.
[2024-05-23 09:04:47] [INFO ] Deduced a trap composed of 85 places in 252 ms of which 4 ms to minimize.
[2024-05-23 09:04:47] [INFO ] Deduced a trap composed of 60 places in 256 ms of which 4 ms to minimize.
[2024-05-23 09:04:47] [INFO ] Deduced a trap composed of 106 places in 265 ms of which 4 ms to minimize.
[2024-05-23 09:04:48] [INFO ] Deduced a trap composed of 76 places in 260 ms of which 3 ms to minimize.
[2024-05-23 09:04:48] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 4 ms to minimize.
[2024-05-23 09:04:48] [INFO ] Deduced a trap composed of 103 places in 312 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 09:04:54] [INFO ] Deduced a trap composed of 109 places in 237 ms of which 4 ms to minimize.
[2024-05-23 09:04:54] [INFO ] Deduced a trap composed of 90 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:04:55] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 4 ms to minimize.
[2024-05-23 09:04:55] [INFO ] Deduced a trap composed of 120 places in 245 ms of which 3 ms to minimize.
[2024-05-23 09:04:57] [INFO ] Deduced a trap composed of 77 places in 244 ms of which 4 ms to minimize.
[2024-05-23 09:04:57] [INFO ] Deduced a trap composed of 100 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:04:57] [INFO ] Deduced a trap composed of 94 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 281/892 variables, and 69 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/281 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/281 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 47/69 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-23 09:05:03] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 3 ms to minimize.
[2024-05-23 09:05:03] [INFO ] Deduced a trap composed of 130 places in 247 ms of which 3 ms to minimize.
[2024-05-23 09:05:03] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 3 ms to minimize.
[2024-05-23 09:05:03] [INFO ] Deduced a trap composed of 92 places in 254 ms of which 3 ms to minimize.
[2024-05-23 09:05:04] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 3 ms to minimize.
[2024-05-23 09:05:04] [INFO ] Deduced a trap composed of 129 places in 255 ms of which 3 ms to minimize.
[2024-05-23 09:05:04] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 4 ms to minimize.
[2024-05-23 09:05:04] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 3 ms to minimize.
[2024-05-23 09:05:05] [INFO ] Deduced a trap composed of 145 places in 225 ms of which 3 ms to minimize.
[2024-05-23 09:05:05] [INFO ] Deduced a trap composed of 112 places in 262 ms of which 3 ms to minimize.
[2024-05-23 09:05:05] [INFO ] Deduced a trap composed of 81 places in 266 ms of which 4 ms to minimize.
[2024-05-23 09:05:06] [INFO ] Deduced a trap composed of 134 places in 284 ms of which 3 ms to minimize.
[2024-05-23 09:05:06] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 3 ms to minimize.
[2024-05-23 09:05:06] [INFO ] Deduced a trap composed of 95 places in 205 ms of which 3 ms to minimize.
[2024-05-23 09:05:06] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 3 ms to minimize.
[2024-05-23 09:05:07] [INFO ] Deduced a trap composed of 138 places in 251 ms of which 4 ms to minimize.
[2024-05-23 09:05:07] [INFO ] Deduced a trap composed of 97 places in 249 ms of which 3 ms to minimize.
[2024-05-23 09:05:07] [INFO ] Deduced a trap composed of 118 places in 238 ms of which 3 ms to minimize.
[2024-05-23 09:05:07] [INFO ] Deduced a trap composed of 115 places in 251 ms of which 3 ms to minimize.
[2024-05-23 09:05:08] [INFO ] Deduced a trap composed of 86 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 281/892 variables, and 89 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/281 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 67/67 constraints]
After SMT, in 60770ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63063 ms. Remains : 281/281 places, 611/611 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 84 Pre rules applied. Total rules applied 0 place count 281 transition count 527
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 0 with 168 rules applied. Total rules applied 168 place count 197 transition count 527
Applied a total of 168 rules in 20 ms. Remains 197 /281 variables (removed 84) and now considering 527/611 (removed 84) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 527 rows 197 cols
[2024-05-23 09:05:28] [INFO ] Computed 22 invariants in 6 ms
[2024-05-23 09:05:28] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 09:05:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-23 09:05:28] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 15 ms returned sat
[2024-05-23 09:05:28] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 09:05:29] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 09:05:29] [INFO ] After 825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 948 ms.
[2024-05-23 09:05:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-23 09:05:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 281 places, 611 transitions and 2392 arcs took 9 ms.
[2024-05-23 09:05:29] [INFO ] Flatten gal took : 132 ms
Total runtime 88602 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 281
TRANSITIONS: 611
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.004s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 811
MODEL NAME: /home/mcc/execution/414/model
281 places, 611 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-03 CANNOT_COMPUTE
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716456960100

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Anderson-PT-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Anderson-PT-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117600366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-10.tgz
mv Anderson-PT-10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;