About the Execution of LTSMin+red for BlocksWorld-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8595.907 | 354878.00 | 479318.00 | 738.20 | TTTT?TTTTTFF???F | 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.r605-tall-171774426800222.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 ltsminxred
Input is BlocksWorld-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800222
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 622K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 610K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 446K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 31K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 74K 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 1.9M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-00
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-01
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-02
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-03
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-04
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-05
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-06
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-07
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-08
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-09
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-10
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-11
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-12
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-13
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-14
FORMULA_NAME BlocksWorld-PT-08-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717748982143
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 08:29:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 08:29:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 08:29:43] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-06-07 08:29:43] [INFO ] Transformed 1979 places.
[2024-06-07 08:29:43] [INFO ] Transformed 3785 transitions.
[2024-06-07 08:29:43] [INFO ] Found NUPN structural information;
[2024-06-07 08:29:43] [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]
[2024-06-07 08:29:43] [INFO ] Parsed PT model containing 1979 places and 3785 transitions and 18910 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 142 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 8854 ms. (4 steps per ms) remains 11/16 properties
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 5798 ms. (6 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5969 ms. (6 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1791 ms. (22 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 6218 ms. (6 steps per ms) remains 10/11 properties
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 2579 ms. (15 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4445 ms. (8 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1963 ms. (20 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1020 ms. (39 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1149 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1002 ms. (39 steps per ms) remains 10/10 properties
// Phase 1: matrix 3785 rows 1979 cols
[2024-06-07 08:29:55] [INFO ] Computed 87 invariants in 67 ms
[2024-06-07 08:29:55] [INFO ] State equation strengthened by 75 read => feed constraints.
Problem BlocksWorld-PT-08-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-08-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-08-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-08-ReachabilityCardinality-2024-03 is UNSAT
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-08-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-08-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BlocksWorld-PT-08-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1979 variables, 87/87 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1979 variables, 0/87 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 3784/5763 variables, 1979/2066 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5763 variables, 74/2140 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5763 variables, 0/2140 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/5764 variables, 1/2141 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5764 variables, 0/2141 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5764 variables, 0/2141 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5764/5764 variables, and 2141 constraints, problems are : Problem set: 6 solved, 4 unsolved in 4318 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 1979/1979 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1937 variables, 45/45 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1937 variables, 0/45 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 42/1979 variables, 42/87 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-07 08:30:07] [INFO ] Deduced a trap composed of 126 places in 1867 ms of which 105 ms to minimize.
[2024-06-07 08:30:08] [INFO ] Deduced a trap composed of 86 places in 1654 ms of which 14 ms to minimize.
[2024-06-07 08:30:10] [INFO ] Deduced a trap composed of 86 places in 1529 ms of which 13 ms to minimize.
SMT process timed out in 15517ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1937 out of 1979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1979/1979 places, 3785/3785 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 1979 transition count 3784
Applied a total of 1 rules in 490 ms. Remains 1979 /1979 variables (removed 0) and now considering 3784/3785 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 501 ms. Remains : 1979/1979 places, 3784/3785 transitions.
RANDOM walk for 40000 steps (8 resets) in 1772 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1296 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 129334 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 129334 steps, saw 109955 distinct states, run finished after 3010 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 3784 rows 1979 cols
[2024-06-07 08:30:15] [INFO ] Computed 87 invariants in 35 ms
[2024-06-07 08:30:15] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1937 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1937 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 42/1979 variables, 42/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1979 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3784/5763 variables, 1979/2066 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5763 variables, 74/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5763 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5763 variables, 0/2140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5763/5763 variables, and 2140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3463 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 1979/1979 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1937 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1937 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 42/1979 variables, 42/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:30:21] [INFO ] Deduced a trap composed of 126 places in 1734 ms of which 14 ms to minimize.
[2024-06-07 08:30:23] [INFO ] Deduced a trap composed of 86 places in 1715 ms of which 13 ms to minimize.
[2024-06-07 08:30:24] [INFO ] Deduced a trap composed of 86 places in 1816 ms of which 14 ms to minimize.
[2024-06-07 08:30:26] [INFO ] Deduced a trap composed of 126 places in 1835 ms of which 15 ms to minimize.
[2024-06-07 08:30:28] [INFO ] Deduced a trap composed of 450 places in 1808 ms of which 13 ms to minimize.
[2024-06-07 08:30:30] [INFO ] Deduced a trap composed of 164 places in 1794 ms of which 12 ms to minimize.
[2024-06-07 08:30:32] [INFO ] Deduced a trap composed of 126 places in 1780 ms of which 14 ms to minimize.
[2024-06-07 08:30:34] [INFO ] Deduced a trap composed of 44 places in 1755 ms of which 13 ms to minimize.
[2024-06-07 08:30:35] [INFO ] Deduced a trap composed of 44 places in 1654 ms of which 13 ms to minimize.
[2024-06-07 08:30:37] [INFO ] Deduced a trap composed of 44 places in 1687 ms of which 13 ms to minimize.
[2024-06-07 08:30:39] [INFO ] Deduced a trap composed of 44 places in 1669 ms of which 12 ms to minimize.
[2024-06-07 08:30:41] [INFO ] Deduced a trap composed of 126 places in 1828 ms of which 12 ms to minimize.
[2024-06-07 08:30:42] [INFO ] Deduced a trap composed of 44 places in 1779 ms of which 13 ms to minimize.
[2024-06-07 08:30:44] [INFO ] Deduced a trap composed of 86 places in 1680 ms of which 13 ms to minimize.
[2024-06-07 08:30:46] [INFO ] Deduced a trap composed of 126 places in 1747 ms of which 12 ms to minimize.
[2024-06-07 08:30:48] [INFO ] Deduced a trap composed of 164 places in 1805 ms of which 13 ms to minimize.
[2024-06-07 08:30:50] [INFO ] Deduced a trap composed of 416 places in 1791 ms of which 13 ms to minimize.
[2024-06-07 08:30:52] [INFO ] Deduced a trap composed of 126 places in 1792 ms of which 13 ms to minimize.
[2024-06-07 08:30:53] [INFO ] Deduced a trap composed of 126 places in 1791 ms of which 13 ms to minimize.
[2024-06-07 08:30:55] [INFO ] Deduced a trap composed of 396 places in 1765 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1979 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:30:57] [INFO ] Deduced a trap composed of 200 places in 1789 ms of which 13 ms to minimize.
[2024-06-07 08:30:59] [INFO ] Deduced a trap composed of 126 places in 1800 ms of which 15 ms to minimize.
[2024-06-07 08:31:01] [INFO ] Deduced a trap composed of 126 places in 1727 ms of which 13 ms to minimize.
[2024-06-07 08:31:03] [INFO ] Deduced a trap composed of 44 places in 1764 ms of which 13 ms to minimize.
[2024-06-07 08:31:04] [INFO ] Deduced a trap composed of 44 places in 1807 ms of which 13 ms to minimize.
SMT process timed out in 49714ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1937 out of 1979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1979/1979 places, 3784/3784 transitions.
Applied a total of 0 rules in 359 ms. Remains 1979 /1979 variables (removed 0) and now considering 3784/3784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 1979/1979 places, 3784/3784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1979/1979 places, 3784/3784 transitions.
Applied a total of 0 rules in 391 ms. Remains 1979 /1979 variables (removed 0) and now considering 3784/3784 (removed 0) transitions.
[2024-06-07 08:31:05] [INFO ] Invariant cache hit.
[2024-06-07 08:31:06] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-07 08:31:06] [INFO ] Invariant cache hit.
[2024-06-07 08:31:07] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-07 08:31:08] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2670 ms to find 0 implicit places.
[2024-06-07 08:31:08] [INFO ] Redundant transitions in 213 ms returned []
Running 3778 sub problems to find dead transitions.
[2024-06-07 08:31:08] [INFO ] Invariant cache hit.
[2024-06-07 08:31:08] [INFO ] State equation strengthened by 74 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3322 is UNSAT
Problem TDEAD3404 is UNSAT
Problem TDEAD3442 is UNSAT
Problem TDEAD3478 is UNSAT
Problem TDEAD3512 is UNSAT
Problem TDEAD3544 is UNSAT
Problem TDEAD3574 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3628 is UNSAT
Problem TDEAD3674 is UNSAT
Problem TDEAD3694 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3728 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3772 is UNSAT
Problem TDEAD3778 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1973 variables, 77/77 constraints. Problems are: Problem set: 78 solved, 3700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1973/5763 variables, and 77 constraints, problems are : Problem set: 78 solved, 3700 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 77/87 constraints, State Equation: 0/1979 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 3739/1892 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 3700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1934 variables, 5/5 constraints. Problems are: Problem set: 78 solved, 3700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/5763 variables, and 5 constraints, problems are : Problem set: 78 solved, 3700 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/87 constraints, State Equation: 0/1979 constraints, ReadFeed: 0/74 constraints, PredecessorRefiner: 1847/1892 constraints, Known Traps: 0/0 constraints]
After SMT, in 89948ms problems are : Problem set: 78 solved, 3700 unsolved
Search for dead transitions found 78 dead transitions in 89987ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 1979/1979 places, 3706/3784 transitions.
Deduced a syphon composed of 39 places in 3 ms
Applied a total of 0 rules in 293 ms. Remains 1979 /1979 variables (removed 0) and now considering 3706/3706 (removed 0) transitions.
[2024-06-07 08:32:39] [INFO ] Redundant transitions in 186 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 93786 ms. Remains : 1979/1979 places, 3706/3784 transitions.
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
RANDOM walk for 40000 steps (8 resets) in 1779 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1090 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 161667 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 4
Probabilistic random walk after 161667 steps, saw 136015 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 3706 rows 1940 cols
[2024-06-07 08:32:43] [INFO ] Computed 87 invariants in 27 ms
[2024-06-07 08:32:43] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1898 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1898 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 42/1940 variables, 42/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1940 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 3706/5646 variables, 1940/2027 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5646 variables, 8/2035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5646 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5646 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5646/5646 variables, and 2035 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2444 ms.
Refiners :[Positive P Invariants (semi-flows): 87/87 constraints, State Equation: 1940/1940 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1898 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1898 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 42/1940 variables, 42/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:32:48] [INFO ] Deduced a trap composed of 164 places in 1738 ms of which 12 ms to minimize.
[2024-06-07 08:32:49] [INFO ] Deduced a trap composed of 396 places in 1658 ms of which 13 ms to minimize.
[2024-06-07 08:32:51] [INFO ] Deduced a trap composed of 200 places in 1654 ms of which 12 ms to minimize.
[2024-06-07 08:32:53] [INFO ] Deduced a trap composed of 126 places in 1671 ms of which 13 ms to minimize.
[2024-06-07 08:32:54] [INFO ] Deduced a trap composed of 126 places in 1686 ms of which 13 ms to minimize.
[2024-06-07 08:32:56] [INFO ] Deduced a trap composed of 200 places in 1686 ms of which 15 ms to minimize.
[2024-06-07 08:32:58] [INFO ] Deduced a trap composed of 126 places in 1651 ms of which 20 ms to minimize.
[2024-06-07 08:33:00] [INFO ] Deduced a trap composed of 234 places in 1707 ms of which 14 ms to minimize.
[2024-06-07 08:33:01] [INFO ] Deduced a trap composed of 126 places in 1697 ms of which 13 ms to minimize.
[2024-06-07 08:33:03] [INFO ] Deduced a trap composed of 44 places in 1668 ms of which 12 ms to minimize.
[2024-06-07 08:33:05] [INFO ] Deduced a trap composed of 200 places in 1694 ms of which 12 ms to minimize.
[2024-06-07 08:33:06] [INFO ] Deduced a trap composed of 86 places in 1677 ms of which 12 ms to minimize.
[2024-06-07 08:33:08] [INFO ] Deduced a trap composed of 494 places in 1619 ms of which 13 ms to minimize.
[2024-06-07 08:33:10] [INFO ] Deduced a trap composed of 86 places in 1652 ms of which 12 ms to minimize.
[2024-06-07 08:33:12] [INFO ] Deduced a trap composed of 126 places in 1641 ms of which 13 ms to minimize.
[2024-06-07 08:33:13] [INFO ] Deduced a trap composed of 126 places in 1626 ms of which 12 ms to minimize.
[2024-06-07 08:33:15] [INFO ] Deduced a trap composed of 126 places in 1504 ms of which 12 ms to minimize.
[2024-06-07 08:33:16] [INFO ] Deduced a trap composed of 86 places in 1616 ms of which 13 ms to minimize.
[2024-06-07 08:33:18] [INFO ] Deduced a trap composed of 434 places in 1623 ms of which 13 ms to minimize.
[2024-06-07 08:33:20] [INFO ] Deduced a trap composed of 126 places in 1632 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1940 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:33:22] [INFO ] Deduced a trap composed of 86 places in 1736 ms of which 12 ms to minimize.
[2024-06-07 08:33:23] [INFO ] Deduced a trap composed of 86 places in 1685 ms of which 13 ms to minimize.
[2024-06-07 08:33:25] [INFO ] Deduced a trap composed of 126 places in 1745 ms of which 13 ms to minimize.
[2024-06-07 08:33:27] [INFO ] Deduced a trap composed of 434 places in 1621 ms of which 12 ms to minimize.
[2024-06-07 08:33:29] [INFO ] Deduced a trap composed of 126 places in 1735 ms of which 14 ms to minimize.
[2024-06-07 08:33:30] [INFO ] Deduced a trap composed of 324 places in 1676 ms of which 12 ms to minimize.
[2024-06-07 08:33:32] [INFO ] Deduced a trap composed of 126 places in 1747 ms of which 13 ms to minimize.
[2024-06-07 08:33:34] [INFO ] Deduced a trap composed of 126 places in 1633 ms of which 12 ms to minimize.
[2024-06-07 08:33:36] [INFO ] Deduced a trap composed of 126 places in 1592 ms of which 13 ms to minimize.
[2024-06-07 08:33:37] [INFO ] Deduced a trap composed of 200 places in 1674 ms of which 12 ms to minimize.
[2024-06-07 08:33:39] [INFO ] Deduced a trap composed of 296 places in 1628 ms of which 12 ms to minimize.
[2024-06-07 08:33:41] [INFO ] Deduced a trap composed of 126 places in 1763 ms of which 13 ms to minimize.
[2024-06-07 08:33:42] [INFO ] Deduced a trap composed of 126 places in 1668 ms of which 13 ms to minimize.
[2024-06-07 08:33:44] [INFO ] Deduced a trap composed of 200 places in 1637 ms of which 12 ms to minimize.
[2024-06-07 08:33:46] [INFO ] Deduced a trap composed of 126 places in 1673 ms of which 13 ms to minimize.
[2024-06-07 08:33:47] [INFO ] Deduced a trap composed of 86 places in 1554 ms of which 12 ms to minimize.
[2024-06-07 08:33:49] [INFO ] Deduced a trap composed of 126 places in 1642 ms of which 14 ms to minimize.
[2024-06-07 08:33:51] [INFO ] Deduced a trap composed of 234 places in 1652 ms of which 13 ms to minimize.
[2024-06-07 08:33:52] [INFO ] Deduced a trap composed of 126 places in 1503 ms of which 11 ms to minimize.
[2024-06-07 08:33:54] [INFO ] Deduced a trap composed of 164 places in 1639 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1940 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 08:33:56] [INFO ] Deduced a trap composed of 86 places in 1666 ms of which 11 ms to minimize.
[2024-06-07 08:33:58] [INFO ] Deduced a trap composed of 126 places in 1656 ms of which 13 ms to minimize.
[2024-06-07 08:33:59] [INFO ] Deduced a trap composed of 126 places in 1635 ms of which 13 ms to minimize.
[2024-06-07 08:34:01] [INFO ] Deduced a trap composed of 86 places in 1559 ms of which 13 ms to minimize.
SMT process timed out in 78287ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1898 out of 1940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1940/1940 places, 3706/3706 transitions.
Applied a total of 0 rules in 319 ms. Remains 1940 /1940 variables (removed 0) and now considering 3706/3706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 1940/1940 places, 3706/3706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1940/1940 places, 3706/3706 transitions.
Applied a total of 0 rules in 390 ms. Remains 1940 /1940 variables (removed 0) and now considering 3706/3706 (removed 0) transitions.
[2024-06-07 08:34:02] [INFO ] Invariant cache hit.
[2024-06-07 08:34:02] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-07 08:34:02] [INFO ] Invariant cache hit.
[2024-06-07 08:34:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-07 08:34:04] [INFO ] Implicit Places using invariants and state equation in 1836 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2024-06-07 08:34:04] [INFO ] Redundant transitions in 103 ms returned []
Running 3700 sub problems to find dead transitions.
[2024-06-07 08:34:04] [INFO ] Invariant cache hit.
[2024-06-07 08:34:04] [INFO ] State equation strengthened by 8 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1934 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 3700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1934/5646 variables, and 77 constraints, problems are : Problem set: 0 solved, 3700 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 77/87 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 3700/1853 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1934 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 3700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/5646 variables, and 77 constraints, problems are : Problem set: 0 solved, 3700 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 77/87 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1847/1853 constraints, Known Traps: 0/0 constraints]
After SMT, in 89054ms problems are : Problem set: 0 solved, 3700 unsolved
Search for dead transitions found 0 dead transitions in 89088ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91889 ms. Remains : 1940/1940 places, 3706/3706 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 308 ms. Remains 1940 /1940 variables (removed 0) and now considering 3706/3706 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-06-07 08:35:34] [INFO ] Invariant cache hit.
[2024-06-07 08:35:34] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-07 08:35:34] [INFO ] [Nat]Absence check using 87 positive place invariants in 40 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-07 08:35:36] [INFO ] After 1173ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :4
[2024-06-07 08:35:36] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2533 ms.
[2024-06-07 08:35:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-07 08:35:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1940 places, 3706 transitions and 18444 arcs took 22 ms.
[2024-06-07 08:35:36] [INFO ] Flatten gal took : 321 ms
Total runtime 353405 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BlocksWorld-PT-08-ReachabilityCardinality-2024-04
Could not compute solution for formula : BlocksWorld-PT-08-ReachabilityCardinality-2024-12
Could not compute solution for formula : BlocksWorld-PT-08-ReachabilityCardinality-2024-13
Could not compute solution for formula : BlocksWorld-PT-08-ReachabilityCardinality-2024-14
BK_STOP 1717749337021
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BlocksWorld-PT-08-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/804/inv_0_
rfs formula name BlocksWorld-PT-08-ReachabilityCardinality-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/804/inv_1_
rfs formula name BlocksWorld-PT-08-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/804/inv_2_
rfs formula name BlocksWorld-PT-08-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/804/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BlocksWorld-PT-08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r605-tall-171774426800222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-08.tgz
mv BlocksWorld-PT-08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;