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.r399-tall-171690531300878.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 Szymanski-PT-b06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531300878
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K 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 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 Szymanski-PT-b06-ReachabilityCardinality-2024-00
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-01
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2023-02
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-03
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-04
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-05
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-06
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-07
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-08
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-09
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-10
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-11
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-12
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-13
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-14
FORMULA_NAME Szymanski-PT-b06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717100889161

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 20:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 20:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 20:28:10] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-05-30 20:28:10] [INFO ] Transformed 568 places.
[2024-05-30 20:28:10] [INFO ] Transformed 8320 transitions.
[2024-05-30 20:28:10] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 456 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40005 steps (8 resets) in 1618 ms. (24 steps per ms) remains 9/10 properties
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (13 resets) in 477 ms. (83 steps per ms) remains 8/9 properties
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (10 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (12 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 115 ms. (344 steps per ms) remains 7/8 properties
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
[2024-05-30 20:28:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-05-30 20:28:11] [INFO ] Computed 3 invariants in 45 ms
[2024-05-30 20:28:11] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-01 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem Szymanski-PT-b06-ReachabilityCardinality-2024-08 is UNSAT
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 294/307 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/308 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2733/3041 variables, 308/311 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3041 variables, 147/458 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/458 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 458 constraints, problems are : Problem set: 5 solved, 2 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 308/308 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 302/307 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 2 unsolved
[2024-05-30 20:28:13] [INFO ] Deduced a trap composed of 139 places in 606 ms of which 10 ms to minimize.
[2024-05-30 20:28:14] [INFO ] Deduced a trap composed of 121 places in 566 ms of which 14 ms to minimize.
[2024-05-30 20:28:14] [INFO ] Deduced a trap composed of 131 places in 547 ms of which 3 ms to minimize.
[2024-05-30 20:28:15] [INFO ] Deduced a trap composed of 43 places in 530 ms of which 2 ms to minimize.
[2024-05-30 20:28:15] [INFO ] Deduced a trap composed of 52 places in 525 ms of which 2 ms to minimize.
[2024-05-30 20:28:16] [INFO ] Deduced a trap composed of 137 places in 526 ms of which 2 ms to minimize.
[2024-05-30 20:28:17] [INFO ] Deduced a trap composed of 134 places in 517 ms of which 2 ms to minimize.
[2024-05-30 20:28:17] [INFO ] Deduced a trap composed of 76 places in 527 ms of which 2 ms to minimize.
[2024-05-30 20:28:18] [INFO ] Deduced a trap composed of 130 places in 512 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/3041 variables, and 11 constraints, problems are : Problem set: 5 solved, 2 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/308 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 9/9 constraints]
After SMT, in 6329ms problems are : Problem set: 5 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 128 place count 306 transition count 7937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 305 transition count 7809
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 305 transition count 7809
Applied a total of 130 rules in 412 ms. Remains 305 /308 variables (removed 3) and now considering 7809/8064 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 305/308 places, 7809/8064 transitions.
RANDOM walk for 40011 steps (8 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149390 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149390 steps, saw 74913 distinct states, run finished after 3004 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-30 20:28:21] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-05-30 20:28:21] [INFO ] Computed 2 invariants in 33 ms
[2024-05-30 20:28:21] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 271/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 271/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 20:28:23] [INFO ] Deduced a trap composed of 72 places in 426 ms of which 1 ms to minimize.
[2024-05-30 20:28:23] [INFO ] Deduced a trap composed of 44 places in 395 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2605/2910 variables, 305/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 147/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 20:28:30] [INFO ] Deduced a trap composed of 72 places in 514 ms of which 2 ms to minimize.
[2024-05-30 20:28:30] [INFO ] Deduced a trap composed of 75 places in 491 ms of which 2 ms to minimize.
[2024-05-30 20:28:31] [INFO ] Deduced a trap composed of 72 places in 484 ms of which 2 ms to minimize.
[2024-05-30 20:28:32] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 2 ms to minimize.
[2024-05-30 20:28:32] [INFO ] Deduced a trap composed of 85 places in 472 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 5/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 11793ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA Szymanski-PT-b06-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 529 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7808
Applied a total of 1 rules in 268 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7809 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 305/305 places, 7808/7809 transitions.
RANDOM walk for 40009 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 197228 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 197228 steps, saw 85704 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-30 20:28:37] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 20:28:37] [INFO ] Computed 3 invariants in 32 ms
[2024-05-30 20:28:37] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 20:28:38] [INFO ] Deduced a trap composed of 134 places in 403 ms of which 2 ms to minimize.
[2024-05-30 20:28:38] [INFO ] Deduced a trap composed of 85 places in 392 ms of which 2 ms to minimize.
[2024-05-30 20:28:39] [INFO ] Deduced a trap composed of 108 places in 394 ms of which 2 ms to minimize.
[2024-05-30 20:28:39] [INFO ] Deduced a trap composed of 122 places in 402 ms of which 2 ms to minimize.
[2024-05-30 20:28:40] [INFO ] Deduced a trap composed of 129 places in 409 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 20:28:40] [INFO ] Deduced a trap composed of 50 places in 515 ms of which 2 ms to minimize.
[2024-05-30 20:28:41] [INFO ] Deduced a trap composed of 75 places in 522 ms of which 2 ms to minimize.
[2024-05-30 20:28:41] [INFO ] Deduced a trap composed of 60 places in 504 ms of which 2 ms to minimize.
[2024-05-30 20:28:42] [INFO ] Deduced a trap composed of 130 places in 500 ms of which 2 ms to minimize.
[2024-05-30 20:28:42] [INFO ] Deduced a trap composed of 106 places in 401 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6704 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 7343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 212 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 290 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 20:28:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 20:28:45] [INFO ] Invariant cache hit.
[2024-05-30 20:28:46] [INFO ] Implicit Places using invariants in 622 ms returned []
[2024-05-30 20:28:46] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 20:28:46] [INFO ] Invariant cache hit.
[2024-05-30 20:28:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 20:29:01] [INFO ] Implicit Places using invariants and state equation in 15166 ms returned []
Implicit Place search using SMT with State Equation took 15798 ms to find 0 implicit places.
[2024-05-30 20:29:02] [INFO ] Redundant transitions in 884 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 20:29:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 20:29:02] [INFO ] Invariant cache hit.
[2024-05-30 20:29:02] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 20:30:02] [INFO ] Deduced a trap composed of 138 places in 364 ms of which 2 ms to minimize.
[2024-05-30 20:30:04] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 2 ms to minimize.
[2024-05-30 20:30:04] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 2 ms to minimize.
[2024-05-30 20:30:05] [INFO ] Deduced a trap composed of 42 places in 289 ms of which 1 ms to minimize.
[2024-05-30 20:30:05] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 2 ms to minimize.
[2024-05-30 20:30:05] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 2 ms to minimize.
[2024-05-30 20:30:05] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 2 ms to minimize.
[2024-05-30 20:30:06] [INFO ] Deduced a trap composed of 57 places in 372 ms of which 3 ms to minimize.
[2024-05-30 20:30:06] [INFO ] Deduced a trap composed of 57 places in 413 ms of which 2 ms to minimize.
[2024-05-30 20:30:07] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 2 ms to minimize.
[2024-05-30 20:30:07] [INFO ] Deduced a trap composed of 70 places in 382 ms of which 3 ms to minimize.
[2024-05-30 20:30:08] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 2 ms to minimize.
[2024-05-30 20:30:08] [INFO ] Deduced a trap composed of 102 places in 393 ms of which 2 ms to minimize.
[2024-05-30 20:30:08] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 2 ms to minimize.
[2024-05-30 20:30:09] [INFO ] Deduced a trap composed of 101 places in 381 ms of which 2 ms to minimize.
[2024-05-30 20:30:09] [INFO ] Deduced a trap composed of 114 places in 350 ms of which 2 ms to minimize.
[2024-05-30 20:30:10] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 1 ms to minimize.
[2024-05-30 20:30:10] [INFO ] Deduced a trap composed of 134 places in 240 ms of which 1 ms to minimize.
[2024-05-30 20:30:10] [INFO ] Deduced a trap composed of 137 places in 267 ms of which 2 ms to minimize.
[2024-05-30 20:30:10] [INFO ] Deduced a trap composed of 195 places in 225 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 20:30:15] [INFO ] Deduced a trap composed of 111 places in 316 ms of which 2 ms to minimize.
[2024-05-30 20:30:18] [INFO ] Deduced a trap composed of 195 places in 415 ms of which 2 ms to minimize.
[2024-05-30 20:30:19] [INFO ] Deduced a trap composed of 204 places in 420 ms of which 2 ms to minimize.
[2024-05-30 20:30:19] [INFO ] Deduced a trap composed of 209 places in 409 ms of which 2 ms to minimize.
[2024-05-30 20:30:20] [INFO ] Deduced a trap composed of 116 places in 419 ms of which 2 ms to minimize.
[2024-05-30 20:30:20] [INFO ] Deduced a trap composed of 136 places in 422 ms of which 2 ms to minimize.
[2024-05-30 20:30:20] [INFO ] Deduced a trap composed of 139 places in 415 ms of which 2 ms to minimize.
[2024-05-30 20:30:21] [INFO ] Deduced a trap composed of 208 places in 356 ms of which 2 ms to minimize.
[2024-05-30 20:30:22] [INFO ] Deduced a trap composed of 116 places in 299 ms of which 1 ms to minimize.
[2024-05-30 20:30:23] [INFO ] Deduced a trap composed of 146 places in 304 ms of which 2 ms to minimize.
[2024-05-30 20:30:23] [INFO ] Deduced a trap composed of 209 places in 307 ms of which 6 ms to minimize.
[2024-05-30 20:30:24] [INFO ] Deduced a trap composed of 208 places in 300 ms of which 1 ms to minimize.
[2024-05-30 20:30:24] [INFO ] Deduced a trap composed of 144 places in 201 ms of which 1 ms to minimize.
[2024-05-30 20:30:26] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 2 ms to minimize.
[2024-05-30 20:30:26] [INFO ] Deduced a trap composed of 77 places in 363 ms of which 2 ms to minimize.
[2024-05-30 20:30:27] [INFO ] Deduced a trap composed of 72 places in 359 ms of which 2 ms to minimize.
[2024-05-30 20:30:27] [INFO ] Deduced a trap composed of 85 places in 350 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 40 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 37/37 constraints]
After SMT, in 87010ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87088ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103999 ms. Remains : 305/305 places, 7808/7808 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5136 edges and 305 vertex of which 37 / 305 are part of one of the 3 SCC in 2 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 4072 transitions
Ensure Unique test removed 1307 transitions
Reduce isomorphic transitions removed 5379 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 270 transition count 2428
Drop transitions (Redundant composition of simpler transitions.) removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 419 place count 270 transition count 2012
Applied a total of 419 rules in 341 ms. Remains 270 /305 variables (removed 35) and now considering 2012/7808 (removed 5796) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2012 rows 270 cols
[2024-05-30 20:30:29] [INFO ] Computed 3 invariants in 12 ms
[2024-05-30 20:30:29] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 20:30:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-30 20:30:29] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 20:30:30] [INFO ] State equation strengthened by 504 read => feed constraints.
[2024-05-30 20:30:30] [INFO ] After 134ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 20:30:30] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 20:30:30] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1093 ms.
[2024-05-30 20:30:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-30 20:30:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7808 transitions and 31360 arcs took 33 ms.
[2024-05-30 20:30:31] [INFO ] Flatten gal took : 453 ms
Total runtime 140763 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-b06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 305
TRANSITIONS: 7808
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.147s, Sys 0.016s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.023s, 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: 783
MODEL NAME: /home/mcc/execution/411/model
305 places, 7808 transitions.

Creating all event NSFs..
Creating all event NSFs..
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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717101420759

--------------------
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

Error in allocating array of size 16777216 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r399-tall-171690531300878"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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