MCC'2024- Execution of r612-tall-171774431200148

About the Execution of GreatSPN+red for BlocksWorld-PT-10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
14182.023	792928.00	1509522.00	1217.70	T	normal

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.r612-tall-171774431200148.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 BlocksWorld-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r612-tall-171774431200148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 38M
-rw-r--r-- 1 mcc users 634K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.8M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 36K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 569K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 2.0M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 9.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.9M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 112K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 2.8M Jun 7 06:26 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717746113236

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:41:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-07 07:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:41:54] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2024-06-07 07:41:54] [INFO ] Transformed 2969 places.
[2024-06-07 07:41:54] [INFO ] Transformed 5725 transitions.
[2024-06-07 07:41:54] [INFO ] Found NUPN structural information;
[2024-06-07 07:41:54] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52]
[2024-06-07 07:41:54] [INFO ] Parsed PT model containing 2969 places and 5725 transitions and 28602 arcs in 454 ms.
RANDOM walk for 40000 steps (8 resets) in 7241 ms. (5 steps per ms) remains 107/2969 properties
BEST_FIRST walk for 402 steps (8 resets) in 21 ms. (18 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 107/107 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 107/107 properties
// Phase 1: matrix 5725 rows 2969 cols
[2024-06-07 07:41:57] [INFO ] Computed 107 invariants in 103 ms
[2024-06-07 07:41:57] [INFO ] State equation strengthened by 95 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 2861/2968 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2968/8694 variables, and 106 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 106/107 constraints, State Equation: 0/2969 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 2861/2968 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-07 07:42:06] [INFO ] Deduced a trap composed of 54 places in 3506 ms of which 153 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 54 places in 3406 ms of which 22 ms to minimize.
SMT process timed out in 13014ms, After SMT, problems are : Problem set: 0 solved, 107 unsolved
Fused 107 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 107 out of 2969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2969/2969 places, 5725/5725 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 2969 transition count 5724
Applied a total of 1 rules in 26760 ms. Remains 2969 /2969 variables (removed 0) and now considering 5724/5725 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26774 ms. Remains : 2969/2969 places, 5724/5725 transitions.
RANDOM walk for 1921644 steps (4 resets) in 120004 ms. (16 steps per ms) remains 53/107 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3457 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3343 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3348 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3461 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3338 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3361 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3421 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3474 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3411 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4819 ms. (82 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4711 ms. (84 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3415 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3420 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3499 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3481 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3473 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3380 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3493 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3448 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3384 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3452 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3450 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3447 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3428 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3377 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3535 ms. (113 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3510 ms. (113 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3396 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3393 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3393 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3424 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3410 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3392 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3501 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3407 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3454 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3430 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3420 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3310 ms. (120 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3402 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3356 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3385 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3435 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3337 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3385 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3373 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3475 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3353 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3449 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3350 ms. (119 steps per ms) remains 53/53 properties
// Phase 1: matrix 5724 rows 2969 cols
[2024-06-07 07:43:52] [INFO ] Computed 107 invariants in 57 ms
[2024-06-07 07:43:52] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2915/2968 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2968 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/2969 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2969 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 5724/8693 variables, 2969/3076 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8693 variables, 94/3170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8693 variables, 0/3170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/8693 variables, 0/3170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8693/8693 variables, and 3170 constraints, problems are : Problem set: 0 solved, 53 unsolved in 23495 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2969/2969 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2915/2968 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-07 07:44:20] [INFO ] Deduced a trap composed of 54 places in 3585 ms of which 20 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 55 places in 3503 ms of which 19 ms to minimize.
[2024-06-07 07:44:27] [INFO ] Deduced a trap composed of 54 places in 3400 ms of which 19 ms to minimize.
[2024-06-07 07:44:31] [INFO ] Deduced a trap composed of 54 places in 3367 ms of which 19 ms to minimize.
[2024-06-07 07:44:34] [INFO ] Deduced a trap composed of 54 places in 3357 ms of which 24 ms to minimize.
[2024-06-07 07:44:37] [INFO ] Deduced a trap composed of 55 places in 3255 ms of which 20 ms to minimize.
[2024-06-07 07:44:41] [INFO ] Deduced a trap composed of 54 places in 3571 ms of which 17 ms to minimize.
[2024-06-07 07:44:45] [INFO ] Deduced a trap composed of 54 places in 3509 ms of which 20 ms to minimize.
[2024-06-07 07:44:48] [INFO ] Deduced a trap composed of 54 places in 3285 ms of which 19 ms to minimize.
[2024-06-07 07:44:51] [INFO ] Deduced a trap composed of 54 places in 3440 ms of which 17 ms to minimize.
[2024-06-07 07:44:55] [INFO ] Deduced a trap composed of 54 places in 3456 ms of which 20 ms to minimize.
[2024-06-07 07:44:59] [INFO ] Deduced a trap composed of 54 places in 3496 ms of which 19 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 54 places in 3376 ms of which 19 ms to minimize.
SMT process timed out in 69568ms, After SMT, problems are : Problem set: 0 solved, 53 unsolved
Fused 53 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 2969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2969/2969 places, 5724/5724 transitions.
Applied a total of 0 rules in 21458 ms. Remains 2969 /2969 variables (removed 0) and now considering 5724/5724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21462 ms. Remains : 2969/2969 places, 5724/5724 transitions.
RANDOM walk for 1670197 steps (4 resets) in 120004 ms. (13 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3954 ms. (101 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3433 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3341 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3388 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3462 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3466 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3418 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3400 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3259 ms. (122 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3379 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3407 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3447 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3327 ms. (120 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3412 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3333 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3389 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3444 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3497 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3435 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3432 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3419 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3349 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3359 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3292 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3381 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3420 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400001 steps (8 resets) in 3401 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3398 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3388 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3350 ms. (119 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3366 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3405 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3446 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3427 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3454 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3459 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3751 ms. (106 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3393 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3505 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3508 ms. (113 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3452 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3402 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3406 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3419 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3477 ms. (115 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3560 ms. (112 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3444 ms. (116 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3382 ms. (118 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3292 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3434 ms. (116 steps per ms) remains 53/53 properties
Interrupted probabilistic random walk after 7671432 steps, run timeout after 225002 ms. (steps per millisecond=34 ) properties seen :0 out of 53
Probabilistic random walk after 7671432 steps, saw 7114008 distinct states, run finished after 225024 ms. (steps per millisecond=34 ) properties seen :0
[2024-06-07 07:50:23] [INFO ] Invariant cache hit.
[2024-06-07 07:50:23] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2915/2968 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2968 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/2969 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2969 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 5724/8693 variables, 2969/3076 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8693 variables, 94/3170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8693 variables, 0/3170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/8693 variables, 0/3170 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8693/8693 variables, and 3170 constraints, problems are : Problem set: 0 solved, 53 unsolved in 29827 ms.
Refiners :[Positive P Invariants (semi-flows): 107/107 constraints, State Equation: 2969/2969 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2915/2968 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-07 07:50:57] [INFO ] Deduced a trap composed of 54 places in 3472 ms of which 20 ms to minimize.
[2024-06-07 07:51:01] [INFO ] Deduced a trap composed of 54 places in 3460 ms of which 19 ms to minimize.
[2024-06-07 07:51:04] [INFO ] Deduced a trap composed of 54 places in 3531 ms of which 20 ms to minimize.
[2024-06-07 07:51:08] [INFO ] Deduced a trap composed of 54 places in 3564 ms of which 20 ms to minimize.
[2024-06-07 07:51:12] [INFO ] Deduced a trap composed of 54 places in 3447 ms of which 21 ms to minimize.
[2024-06-07 07:51:15] [INFO ] Deduced a trap composed of 54 places in 3384 ms of which 25 ms to minimize.
[2024-06-07 07:51:18] [INFO ] Deduced a trap composed of 54 places in 3308 ms of which 20 ms to minimize.
[2024-06-07 07:51:21] [INFO ] Deduced a trap composed of 54 places in 3125 ms of which 19 ms to minimize.
[2024-06-07 07:51:24] [INFO ] Deduced a trap composed of 54 places in 2913 ms of which 16 ms to minimize.
[2024-06-07 07:51:28] [INFO ] Deduced a trap composed of 54 places in 3189 ms of which 18 ms to minimize.
[2024-06-07 07:51:31] [INFO ] Deduced a trap composed of 54 places in 2843 ms of which 19 ms to minimize.
[2024-06-07 07:51:34] [INFO ] Deduced a trap composed of 54 places in 3422 ms of which 20 ms to minimize.
[2024-06-07 07:51:37] [INFO ] Deduced a trap composed of 54 places in 3236 ms of which 16 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 54 places in 3266 ms of which 18 ms to minimize.
[2024-06-07 07:51:44] [INFO ] Deduced a trap composed of 54 places in 2883 ms of which 17 ms to minimize.
[2024-06-07 07:51:46] [INFO ] Deduced a trap composed of 54 places in 2573 ms of which 15 ms to minimize.
[2024-06-07 07:51:49] [INFO ] Deduced a trap composed of 54 places in 2907 ms of which 17 ms to minimize.
[2024-06-07 07:51:52] [INFO ] Deduced a trap composed of 54 places in 2514 ms of which 21 ms to minimize.
[2024-06-07 07:51:54] [INFO ] Deduced a trap composed of 54 places in 2382 ms of which 17 ms to minimize.
[2024-06-07 07:51:57] [INFO ] Deduced a trap composed of 54 places in 2426 ms of which 26 ms to minimize.
Problem smplace_484 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 93185ms, After SMT, problems are : Problem set: 0 solved, 53 unsolved
Fused 53 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 53 out of 2969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2969/2969 places, 5724/5724 transitions.
Applied a total of 0 rules in 20395 ms. Remains 2969 /2969 variables (removed 0) and now considering 5724/5724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20395 ms. Remains : 2969/2969 places, 5724/5724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2969/2969 places, 5724/5724 transitions.
Applied a total of 0 rules in 20127 ms. Remains 2969 /2969 variables (removed 0) and now considering 5724/5724 (removed 0) transitions.
[2024-06-07 07:52:37] [INFO ] Invariant cache hit.
[2024-06-07 07:52:40] [INFO ] Implicit Places using invariants in 2751 ms returned []
[2024-06-07 07:52:40] [INFO ] Invariant cache hit.
[2024-06-07 07:52:43] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-07 07:52:49] [INFO ] Implicit Places using invariants and state equation in 9053 ms returned []
Implicit Place search using SMT with State Equation took 11817 ms to find 0 implicit places.
[2024-06-07 07:52:50] [INFO ] Redundant transitions in 500 ms returned []
Running 5718 sub problems to find dead transitions.
[2024-06-07 07:52:50] [INFO ] Invariant cache hit.
[2024-06-07 07:52:50] [INFO ] State equation strengthened by 94 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2266 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2806 is UNSAT
Problem TDEAD2860 is UNSAT
Problem TDEAD2914 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3174 is UNSAT
Problem TDEAD3274 is UNSAT
Problem TDEAD3372 is UNSAT
Problem TDEAD3468 is UNSAT
Problem TDEAD3562 is UNSAT
Problem TDEAD3654 is UNSAT
Problem TDEAD3744 is UNSAT
Problem TDEAD3832 is UNSAT
Problem TDEAD3918 is UNSAT
Problem TDEAD4002 is UNSAT
Problem TDEAD4164 is UNSAT
Problem TDEAD4392 is UNSAT
Problem TDEAD4534 is UNSAT
Problem TDEAD4602 is UNSAT
Problem TDEAD4668 is UNSAT
Problem TDEAD4732 is UNSAT
Problem TDEAD4794 is UNSAT
Problem TDEAD4854 is UNSAT
Problem TDEAD4912 is UNSAT
Problem TDEAD4968 is UNSAT
Problem TDEAD5022 is UNSAT
Problem TDEAD5074 is UNSAT
Problem TDEAD5124 is UNSAT
Problem TDEAD5172 is UNSAT
Problem TDEAD5218 is UNSAT
Problem TDEAD5262 is UNSAT
Problem TDEAD5304 is UNSAT
Problem TDEAD5344 is UNSAT
Problem TDEAD5382 is UNSAT
Problem TDEAD5418 is UNSAT
Problem TDEAD5452 is UNSAT
Problem TDEAD5484 is UNSAT
Problem TDEAD5514 is UNSAT
Problem TDEAD5542 is UNSAT
Problem TDEAD5568 is UNSAT
Problem TDEAD5592 is UNSAT
Problem TDEAD5614 is UNSAT
Problem TDEAD5634 is UNSAT
Problem TDEAD5652 is UNSAT
Problem TDEAD5668 is UNSAT
Problem TDEAD5682 is UNSAT
Problem TDEAD5694 is UNSAT
Problem TDEAD5704 is UNSAT
Problem TDEAD5712 is UNSAT
Problem TDEAD5718 is UNSAT
Problem TDEAD5722 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2963 variables, 97/97 constraints. Problems are: Problem set: 98 solved, 5620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2963/8693 variables, and 97 constraints, problems are : Problem set: 98 solved, 5620 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 97/107 constraints, State Equation: 0/2969 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 5669/2862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 98 solved, 5620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2914 variables, 5/5 constraints. Problems are: Problem set: 98 solved, 5620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2914/8693 variables, and 5 constraints, problems are : Problem set: 98 solved, 5620 unsolved in 30090 ms.
Refiners :[Positive P Invariants (semi-flows): 5/107 constraints, State Equation: 0/2969 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 2807/2862 constraints, Known Traps: 0/0 constraints]
After SMT, in 114568ms problems are : Problem set: 98 solved, 5620 unsolved
Search for dead transitions found 98 dead transitions in 114634ms
Found 98 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 98 transitions
Dead transitions reduction (with SMT) removed 98 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 2969/2969 places, 5626/5724 transitions.
Deduced a syphon composed of 49 places in 3 ms
Applied a total of 0 rules in 20955 ms. Remains 2969 /2969 variables (removed 0) and now considering 5626/5626 (removed 0) transitions.
[2024-06-07 07:55:06] [INFO ] Redundant transitions in 418 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 168511 ms. Remains : 2969/2969 places, 5626/5724 transitions.
Deduced a syphon composed of 49 places in 10 ms
Reduce places removed 49 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 791686 ms.
ITS solved all properties within timeout

BK_STOP 1717746906164

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="BlocksWorld-PT-10"
export BK_EXAMINATION="StableMarking"
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 BlocksWorld-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r612-tall-171774431200148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-10.tgz
mv BlocksWorld-PT-10 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;