About the Execution of GreatSPN+red for Anderson-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10024.292 | 1800000.00 | 5751558.00 | 3522.30 | [undef] | Time out reached |
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.r012-smll-171620124200219.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-08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620124200219
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 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 667K 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
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1716264055058
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 04:00:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-21 04:00:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 04:00:57] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-05-21 04:00:57] [INFO ] Transformed 401 places.
[2024-05-21 04:00:57] [INFO ] Transformed 1328 transitions.
[2024-05-21 04:00:57] [INFO ] Found NUPN structural information;
[2024-05-21 04:00:57] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 555 ms.
Built sparse matrix representations for Structural reductions in 16 ms.27729KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 208 ms. Remains 401 /401 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 245 ms. Remains : 401/401 places, 1328/1328 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 75 ms. Remains 401 /401 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
// Phase 1: matrix 1328 rows 401 cols
[2024-05-21 04:00:58] [INFO ] Computed 19 invariants in 91 ms
[2024-05-21 04:00:58] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-21 04:00:58] [INFO ] Invariant cache hit.
[2024-05-21 04:00:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-21 04:00:59] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
[2024-05-21 04:01:00] [INFO ] Redundant transitions in 109 ms returned []
Running 1320 sub problems to find dead transitions.
[2024-05-21 04:01:00] [INFO ] Invariant cache hit.
[2024-05-21 04:01:00] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
[2024-05-21 04:01:22] [INFO ] Deduced a trap composed of 302 places in 631 ms of which 69 ms to minimize.
[2024-05-21 04:01:22] [INFO ] Deduced a trap composed of 234 places in 531 ms of which 6 ms to minimize.
[2024-05-21 04:01:23] [INFO ] Deduced a trap composed of 250 places in 518 ms of which 5 ms to minimize.
[2024-05-21 04:01:23] [INFO ] Deduced a trap composed of 251 places in 379 ms of which 5 ms to minimize.
[2024-05-21 04:01:24] [INFO ] Deduced a trap composed of 141 places in 431 ms of which 7 ms to minimize.
[2024-05-21 04:01:24] [INFO ] Deduced a trap composed of 241 places in 514 ms of which 7 ms to minimize.
[2024-05-21 04:01:25] [INFO ] Deduced a trap composed of 150 places in 569 ms of which 6 ms to minimize.
[2024-05-21 04:01:25] [INFO ] Deduced a trap composed of 215 places in 433 ms of which 4 ms to minimize.
[2024-05-21 04:01:26] [INFO ] Deduced a trap composed of 141 places in 426 ms of which 4 ms to minimize.
[2024-05-21 04:01:26] [INFO ] Deduced a trap composed of 181 places in 523 ms of which 4 ms to minimize.
[2024-05-21 04:01:27] [INFO ] Deduced a trap composed of 194 places in 466 ms of which 4 ms to minimize.
[2024-05-21 04:01:27] [INFO ] Deduced a trap composed of 174 places in 550 ms of which 6 ms to minimize.
[2024-05-21 04:01:28] [INFO ] Deduced a trap composed of 234 places in 519 ms of which 5 ms to minimize.
[2024-05-21 04:01:28] [INFO ] Deduced a trap composed of 200 places in 508 ms of which 6 ms to minimize.
[2024-05-21 04:01:29] [INFO ] Deduced a trap composed of 232 places in 433 ms of which 4 ms to minimize.
[2024-05-21 04:01:29] [INFO ] Deduced a trap composed of 225 places in 548 ms of which 6 ms to minimize.
[2024-05-21 04:01:30] [INFO ] Deduced a trap composed of 94 places in 605 ms of which 7 ms to minimize.
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 197 places in 547 ms of which 4 ms to minimize.
[2024-05-21 04:01:31] [INFO ] Deduced a trap composed of 147 places in 570 ms of which 5 ms to minimize.
[2024-05-21 04:01:32] [INFO ] Deduced a trap composed of 95 places in 605 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/1729 variables, and 440 constraints, problems are : Problem set: 0 solved, 1320 unsolved in 30090 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/401 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1320/1320 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 401/401 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
[2024-05-21 04:01:41] [INFO ] Deduced a trap composed of 111 places in 686 ms of which 6 ms to minimize.
[2024-05-21 04:01:42] [INFO ] Deduced a trap composed of 147 places in 666 ms of which 7 ms to minimize.
[2024-05-21 04:01:43] [INFO ] Deduced a trap composed of 201 places in 661 ms of which 6 ms to minimize.
[2024-05-21 04:01:43] [INFO ] Deduced a trap composed of 199 places in 650 ms of which 7 ms to minimize.
[2024-05-21 04:01:44] [INFO ] Deduced a trap composed of 127 places in 542 ms of which 6 ms to minimize.
[2024-05-21 04:01:45] [INFO ] Deduced a trap composed of 105 places in 657 ms of which 6 ms to minimize.
[2024-05-21 04:01:45] [INFO ] Deduced a trap composed of 138 places in 642 ms of which 5 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 221 places in 390 ms of which 4 ms to minimize.
[2024-05-21 04:01:46] [INFO ] Deduced a trap composed of 172 places in 540 ms of which 7 ms to minimize.
[2024-05-21 04:01:47] [INFO ] Deduced a trap composed of 112 places in 431 ms of which 4 ms to minimize.
[2024-05-21 04:01:47] [INFO ] Deduced a trap composed of 200 places in 640 ms of which 6 ms to minimize.
[2024-05-21 04:01:48] [INFO ] Deduced a trap composed of 250 places in 539 ms of which 5 ms to minimize.
[2024-05-21 04:01:49] [INFO ] Deduced a trap composed of 153 places in 596 ms of which 6 ms to minimize.
[2024-05-21 04:01:49] [INFO ] Deduced a trap composed of 217 places in 675 ms of which 7 ms to minimize.
[2024-05-21 04:01:50] [INFO ] Deduced a trap composed of 199 places in 696 ms of which 7 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 187 places in 624 ms of which 7 ms to minimize.
[2024-05-21 04:01:51] [INFO ] Deduced a trap composed of 173 places in 689 ms of which 7 ms to minimize.
[2024-05-21 04:01:52] [INFO ] Deduced a trap composed of 221 places in 695 ms of which 7 ms to minimize.
[2024-05-21 04:01:53] [INFO ] Deduced a trap composed of 136 places in 709 ms of which 6 ms to minimize.
[2024-05-21 04:01:54] [INFO ] Deduced a trap composed of 197 places in 707 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1320 unsolved
[2024-05-21 04:02:00] [INFO ] Deduced a trap composed of 96 places in 601 ms of which 6 ms to minimize.
[2024-05-21 04:02:01] [INFO ] Deduced a trap composed of 113 places in 699 ms of which 7 ms to minimize.
[2024-05-21 04:02:02] [INFO ] Deduced a trap composed of 132 places in 564 ms of which 7 ms to minimize.
[2024-05-21 04:02:02] [INFO ] Deduced a trap composed of 214 places in 530 ms of which 6 ms to minimize.
[2024-05-21 04:02:03] [INFO ] Deduced a trap composed of 112 places in 508 ms of which 6 ms to minimize.
[2024-05-21 04:02:04] [INFO ] Deduced a trap composed of 146 places in 613 ms of which 6 ms to minimize.
[2024-05-21 04:02:04] [INFO ] Deduced a trap composed of 55 places in 528 ms of which 6 ms to minimize.
SMT process timed out in 64571ms, After SMT, problems are : Problem set: 0 solved, 1320 unsolved
Search for dead transitions found 0 dead transitions in 64646ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 66529 ms. Remains : 401/401 places, 1328/1328 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3829 ms (no deadlock found). (steps per millisecond=326 )
Random directed walk for 1250001 steps, including 0 resets, run took 4118 ms (no deadlock found). (steps per millisecond=303 )
[2024-05-21 04:02:12] [INFO ] Invariant cache hit.
[2024-05-21 04:02:13] [INFO ] [Real]Absence check using 9 positive place invariants in 28 ms returned sat
[2024-05-21 04:02:14] [INFO ] [Real]Absence check using 9 positive and 10 generalized place invariants in 1356 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 73 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2024-05-21 04:02:14] [INFO ] Computed 19 invariants in 23 ms
[2024-05-21 04:02:15] [INFO ] Implicit Places using invariants in 1125 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1133 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 16 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2024-05-21 04:02:15] [INFO ] Computed 18 invariants in 10 ms
[2024-05-21 04:02:16] [INFO ] Implicit Places using invariants in 964 ms returned []
[2024-05-21 04:02:16] [INFO ] Invariant cache hit.
[2024-05-21 04:02:17] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-21 04:02:19] [INFO ] Implicit Places using invariants and state equation in 2892 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5085 ms. Remains : 280/401 places, 1208/1328 transitions.
Initial state reduction rules removed 8 formulas.
RANDOM walk for 40000 steps (8 resets) in 6207 ms. (6 steps per ms) remains 447/1200 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 447/447 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 447/447 properties
[2024-05-21 04:02:21] [INFO ] Invariant cache hit.
[2024-05-21 04:02:21] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 164/280 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 447 unsolved
SMT process timed out in 6762ms, After SMT, problems are : Problem set: 0 solved, 447 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 116 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 1208/1208 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 248 transition count 1176
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 248 transition count 1176
Applied a total of 64 rules in 93 ms. Remains 248 /280 variables (removed 32) and now considering 1176/1208 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 248/280 places, 1176/1208 transitions.
RANDOM walk for 4000000 steps (8 resets) in 80186 ms. (49 steps per ms) remains 117/447 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 111/117 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 101/111 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 98/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 98/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 90/98 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 89/90 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 88/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 88/88 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 86/88 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 86/86 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 85/86 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 85/85 properties
BEST_FIRST walk for 40001 steps (8 resets) in 261 ms. (152 steps per ms) remains 83/85 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 81/83 properties
BEST_FIRST walk for 40002 steps (8 resets) in 295 ms. (135 steps per ms) remains 73/81 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 70/73 properties
BEST_FIRST walk for 40002 steps (8 resets) in 183 ms. (217 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 70/70 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 52/70 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 51/52 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 51/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 48/51 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 48/48 properties
BEST_FIRST walk for 40001 steps (8 resets) in 111 ms. (357 steps per ms) remains 45/48 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 42/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 42/42 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 42/42 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 42/42 properties
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 42/42 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 41/42 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 41/41 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 41/41 properties
BEST_FIRST walk for 40002 steps (8 resets) in 109 ms. (363 steps per ms) remains 39/41 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 38/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 38/38 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 35/38 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 35/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 35/35 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 35/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 35/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 34/35 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 34/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 31/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 28/31 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 27/28 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 23/27 properties
// Phase 1: matrix 1176 rows 248 cols
[2024-05-21 04:02:52] [INFO ] Computed 18 invariants in 8 ms
[2024-05-21 04:02:52] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 180/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 47/245 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:02:53] [INFO ] Deduced a trap composed of 91 places in 374 ms of which 5 ms to minimize.
[2024-05-21 04:02:54] [INFO ] Deduced a trap composed of 92 places in 441 ms of which 4 ms to minimize.
[2024-05-21 04:02:54] [INFO ] Deduced a trap composed of 46 places in 502 ms of which 4 ms to minimize.
[2024-05-21 04:02:55] [INFO ] Deduced a trap composed of 57 places in 409 ms of which 4 ms to minimize.
[2024-05-21 04:02:55] [INFO ] Deduced a trap composed of 137 places in 379 ms of which 4 ms to minimize.
[2024-05-21 04:02:56] [INFO ] Deduced a trap composed of 106 places in 497 ms of which 5 ms to minimize.
[2024-05-21 04:02:56] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 5 ms to minimize.
[2024-05-21 04:02:57] [INFO ] Deduced a trap composed of 94 places in 521 ms of which 4 ms to minimize.
[2024-05-21 04:02:57] [INFO ] Deduced a trap composed of 83 places in 519 ms of which 4 ms to minimize.
[2024-05-21 04:02:58] [INFO ] Deduced a trap composed of 89 places in 445 ms of which 17 ms to minimize.
[2024-05-21 04:02:58] [INFO ] Deduced a trap composed of 110 places in 401 ms of which 4 ms to minimize.
[2024-05-21 04:02:58] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 4 ms to minimize.
[2024-05-21 04:02:59] [INFO ] Deduced a trap composed of 84 places in 456 ms of which 3 ms to minimize.
[2024-05-21 04:02:59] [INFO ] Deduced a trap composed of 91 places in 432 ms of which 3 ms to minimize.
[2024-05-21 04:03:00] [INFO ] Deduced a trap composed of 62 places in 339 ms of which 3 ms to minimize.
[2024-05-21 04:03:00] [INFO ] Deduced a trap composed of 115 places in 321 ms of which 2 ms to minimize.
[2024-05-21 04:03:00] [INFO ] Deduced a trap composed of 71 places in 348 ms of which 3 ms to minimize.
[2024-05-21 04:03:01] [INFO ] Deduced a trap composed of 99 places in 333 ms of which 3 ms to minimize.
[2024-05-21 04:03:01] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:03:01] [INFO ] Deduced a trap composed of 94 places in 307 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:02] [INFO ] Deduced a trap composed of 114 places in 271 ms of which 3 ms to minimize.
[2024-05-21 04:03:02] [INFO ] Deduced a trap composed of 92 places in 334 ms of which 3 ms to minimize.
[2024-05-21 04:03:03] [INFO ] Deduced a trap composed of 40 places in 373 ms of which 4 ms to minimize.
[2024-05-21 04:03:03] [INFO ] Deduced a trap composed of 81 places in 387 ms of which 4 ms to minimize.
[2024-05-21 04:03:03] [INFO ] Deduced a trap composed of 87 places in 378 ms of which 2 ms to minimize.
[2024-05-21 04:03:04] [INFO ] Deduced a trap composed of 57 places in 325 ms of which 3 ms to minimize.
[2024-05-21 04:03:04] [INFO ] Deduced a trap composed of 52 places in 302 ms of which 3 ms to minimize.
[2024-05-21 04:03:04] [INFO ] Deduced a trap composed of 83 places in 331 ms of which 3 ms to minimize.
[2024-05-21 04:03:05] [INFO ] Deduced a trap composed of 105 places in 319 ms of which 3 ms to minimize.
[2024-05-21 04:03:05] [INFO ] Deduced a trap composed of 77 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:03:05] [INFO ] Deduced a trap composed of 87 places in 327 ms of which 2 ms to minimize.
[2024-05-21 04:03:06] [INFO ] Deduced a trap composed of 112 places in 310 ms of which 3 ms to minimize.
[2024-05-21 04:03:06] [INFO ] Deduced a trap composed of 99 places in 312 ms of which 3 ms to minimize.
[2024-05-21 04:03:06] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 3 ms to minimize.
[2024-05-21 04:03:07] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 3 ms to minimize.
[2024-05-21 04:03:07] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 3 ms to minimize.
[2024-05-21 04:03:07] [INFO ] Deduced a trap composed of 51 places in 313 ms of which 3 ms to minimize.
[2024-05-21 04:03:08] [INFO ] Deduced a trap composed of 61 places in 270 ms of which 3 ms to minimize.
[2024-05-21 04:03:08] [INFO ] Deduced a trap composed of 98 places in 309 ms of which 2 ms to minimize.
[2024-05-21 04:03:08] [INFO ] Deduced a trap composed of 116 places in 330 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:09] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 2 ms to minimize.
[2024-05-21 04:03:09] [INFO ] Deduced a trap composed of 81 places in 311 ms of which 3 ms to minimize.
[2024-05-21 04:03:10] [INFO ] Deduced a trap composed of 81 places in 365 ms of which 2 ms to minimize.
[2024-05-21 04:03:10] [INFO ] Deduced a trap composed of 62 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:03:10] [INFO ] Deduced a trap composed of 66 places in 333 ms of which 3 ms to minimize.
[2024-05-21 04:03:11] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 2 ms to minimize.
[2024-05-21 04:03:11] [INFO ] Deduced a trap composed of 73 places in 270 ms of which 3 ms to minimize.
[2024-05-21 04:03:11] [INFO ] Deduced a trap composed of 91 places in 324 ms of which 3 ms to minimize.
[2024-05-21 04:03:12] [INFO ] Deduced a trap composed of 88 places in 313 ms of which 3 ms to minimize.
[2024-05-21 04:03:12] [INFO ] Deduced a trap composed of 79 places in 311 ms of which 3 ms to minimize.
[2024-05-21 04:03:13] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 11/67 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:13] [INFO ] Deduced a trap composed of 80 places in 324 ms of which 2 ms to minimize.
[2024-05-21 04:03:14] [INFO ] Deduced a trap composed of 101 places in 314 ms of which 2 ms to minimize.
[2024-05-21 04:03:14] [INFO ] Deduced a trap composed of 94 places in 311 ms of which 2 ms to minimize.
[2024-05-21 04:03:14] [INFO ] Deduced a trap composed of 48 places in 315 ms of which 3 ms to minimize.
[2024-05-21 04:03:15] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 3 ms to minimize.
[2024-05-21 04:03:15] [INFO ] Deduced a trap composed of 94 places in 321 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:16] [INFO ] Deduced a trap composed of 109 places in 317 ms of which 3 ms to minimize.
[2024-05-21 04:03:16] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 2 ms to minimize.
[2024-05-21 04:03:16] [INFO ] Deduced a trap composed of 77 places in 342 ms of which 3 ms to minimize.
[2024-05-21 04:03:17] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:03:17] [INFO ] Deduced a trap composed of 114 places in 325 ms of which 3 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 61 places in 273 ms of which 3 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 96 places in 330 ms of which 3 ms to minimize.
[2024-05-21 04:03:18] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 2 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 77 places in 304 ms of which 3 ms to minimize.
[2024-05-21 04:03:19] [INFO ] Deduced a trap composed of 95 places in 271 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:20] [INFO ] Deduced a trap composed of 96 places in 306 ms of which 4 ms to minimize.
[2024-05-21 04:03:21] [INFO ] Deduced a trap composed of 117 places in 285 ms of which 2 ms to minimize.
[2024-05-21 04:03:21] [INFO ] Deduced a trap composed of 100 places in 304 ms of which 3 ms to minimize.
[2024-05-21 04:03:21] [INFO ] Deduced a trap composed of 77 places in 311 ms of which 3 ms to minimize.
[2024-05-21 04:03:22] [INFO ] Deduced a trap composed of 68 places in 309 ms of which 3 ms to minimize.
[2024-05-21 04:03:22] [INFO ] Deduced a trap composed of 70 places in 327 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:23] [INFO ] Deduced a trap composed of 89 places in 290 ms of which 3 ms to minimize.
[2024-05-21 04:03:24] [INFO ] Deduced a trap composed of 85 places in 395 ms of which 3 ms to minimize.
[2024-05-21 04:03:24] [INFO ] Deduced a trap composed of 76 places in 268 ms of which 4 ms to minimize.
[2024-05-21 04:03:24] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 3 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 68 places in 360 ms of which 2 ms to minimize.
[2024-05-21 04:03:25] [INFO ] Deduced a trap composed of 80 places in 395 ms of which 3 ms to minimize.
[2024-05-21 04:03:26] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 7/96 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 3/248 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:28] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 3 ms to minimize.
[2024-05-21 04:03:28] [INFO ] Deduced a trap composed of 71 places in 268 ms of which 3 ms to minimize.
[2024-05-21 04:03:28] [INFO ] Deduced a trap composed of 92 places in 319 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 52 places in 387 ms of which 3 ms to minimize.
[2024-05-21 04:03:30] [INFO ] Deduced a trap composed of 85 places in 302 ms of which 2 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 44 places in 423 ms of which 4 ms to minimize.
[2024-05-21 04:03:31] [INFO ] Deduced a trap composed of 66 places in 360 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 1176/1424 variables, 248/353 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1424 variables, 80/433 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-21 04:03:36] [INFO ] Deduced a trap composed of 38 places in 493 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1424 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1424/1424 variables, and 434 constraints, problems are : Problem set: 0 solved, 23 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 248/248 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 180/198 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 47/245 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 3/248 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1176/1424 variables, 248/354 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1424 variables, 80/434 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1424 variables, 23/457 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1424 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/1424 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1424/1424 variables, and 457 constraints, problems are : Problem set: 0 solved, 23 unsolved in 20073 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 248/248 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 88/88 constraints]
After SMT, in 65166ms problems are : Problem set: 0 solved, 23 unsolved
Parikh walk visited 0 properties in 998 ms.
Support contains 18 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 1176/1176 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 184 transition count 552
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 184 transition count 552
Applied a total of 128 rules in 72 ms. Remains 184 /248 variables (removed 64) and now considering 552/1176 (removed 624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 184/248 places, 552/1176 transitions.
RANDOM walk for 4000000 steps (8 resets) in 37486 ms. (106 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1709 ms. (233 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1800 ms. (222 steps per ms) remains 21/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1514 ms. (264 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1904 ms. (209 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1356 ms. (294 steps per ms) remains 18/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1803 ms. (221 steps per ms) remains 16/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1049 ms. (380 steps per ms) remains 15/16 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1682 ms. (237 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1118 ms. (357 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1446 ms. (276 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1379 ms. (289 steps per ms) remains 8/10 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1436 ms. (278 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400003 steps (8 resets) in 914 ms. (437 steps per ms) remains 5/7 properties
BEST_FIRST walk for 400004 steps (8 resets) in 905 ms. (441 steps per ms) remains 4/5 properties
BEST_FIRST walk for 400004 steps (8 resets) in 807 ms. (495 steps per ms) remains 4/4 properties
BEST_FIRST walk for 400003 steps (8 resets) in 885 ms. (451 steps per ms) remains 3/4 properties
// Phase 1: matrix 552 rows 184 cols
[2024-05-21 04:04:17] [INFO ] Computed 18 invariants in 4 ms
[2024-05-21 04:04:17] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/175 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/184 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 552/736 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/736 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 736/736 variables, and 258 constraints, problems are : Problem set: 0 solved, 3 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 184/184 constraints, ReadFeed: 56/56 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 113/175 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/184 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 552/736 variables, 184/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/736 variables, 56/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/736 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/736 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 736/736 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 184/184 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1409ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 545 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 552/552 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 171 transition count 357
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 171 transition count 357
Applied a total of 26 rules in 16 ms. Remains 171 /184 variables (removed 13) and now considering 357/552 (removed 195) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 171/184 places, 357/552 transitions.
RANDOM walk for 4000000 steps (8 resets) in 19535 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 5217 ms. (766 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 4710 ms. (849 steps per ms) remains 1/2 properties
BEST_FIRST walk for 742733 steps (1 resets) in 783 ms. (947 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 1208 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 56 Pre rules applied. Total rules applied 0 place count 401 transition count 1272
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 345 transition count 1272
Applied a total of 112 rules in 39 ms. Remains 345 /401 variables (removed 56) and now considering 1272/1328 (removed 56) transitions.
// Phase 1: matrix 1272 rows 345 cols
[2024-05-21 04:04:30] [INFO ] Computed 19 invariants in 8 ms
[2024-05-21 04:04:31] [INFO ] Implicit Places using invariants in 1121 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1126 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 344/401 places, 1272/1328 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 344 transition count 1208
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 280 transition count 1208
Applied a total of 128 rules in 11 ms. Remains 280 /344 variables (removed 64) and now considering 1208/1272 (removed 64) transitions.
// Phase 1: matrix 1208 rows 280 cols
[2024-05-21 04:04:31] [INFO ] Computed 18 invariants in 6 ms
[2024-05-21 04:04:32] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2024-05-21 04:04:32] [INFO ] Invariant cache hit.
[2024-05-21 04:04:33] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-21 04:04:36] [INFO ] Implicit Places using invariants and state equation in 3417 ms returned []
Implicit Place search using SMT with State Equation took 4596 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 280/401 places, 1208/1328 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 5773 ms. Remains : 280/401 places, 1208/1328 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :1208 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 1208 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 219384 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Anderson-PT-08
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 401
TRANSITIONS: 1328
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 5088
NUPN UNITS: 11
LOADING TIME: 1.383
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.124
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.193
OK.
----------------------------------------------------------------------
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: 1021
MODEL NAME: /home/mcc/execution/model
401 places, 1328 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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 Liveness -timeout 180 -rebuildPNML
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-08"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-08, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r012-smll-171620124200219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;