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.r616-tall-171774433000123.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-05, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r616-tall-171774433000123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 190K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 859K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 153K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 637K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 502K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K 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 783K 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 1717775354285

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 15:49:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-07 15:49:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 15:49:15] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-06-07 15:49:15] [INFO ] Transformed 869 places.
[2024-06-07 15:49:15] [INFO ] Transformed 1625 transitions.
[2024-06-07 15:49:15] [INFO ] Found NUPN structural information;
[2024-06-07 15:49:15] [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]
[2024-06-07 15:49:15] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 262 ms.
RANDOM walk for 40000 steps (8 resets) in 3543 ms. (11 steps per ms) remains 28/869 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 15:49:17] [INFO ] Computed 57 invariants in 29 ms
[2024-06-07 15:49:17] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/869 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 1/2494 variables, 1/971 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2494/2494 variables, and 971 constraints, problems are : Problem set: 0 solved, 28 unsolved in 4233 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-07 15:49:22] [INFO ] Deduced a trap composed of 29 places in 625 ms of which 127 ms to minimize.
[2024-06-07 15:49:22] [INFO ] Deduced a trap composed of 29 places in 503 ms of which 6 ms to minimize.
[2024-06-07 15:49:23] [INFO ] Deduced a trap composed of 29 places in 538 ms of which 6 ms to minimize.
[2024-06-07 15:49:23] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 5 ms to minimize.
[2024-06-07 15:49:24] [INFO ] Deduced a trap composed of 29 places in 474 ms of which 5 ms to minimize.
[2024-06-07 15:49:24] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 5 ms to minimize.
[2024-06-07 15:49:25] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 4 ms to minimize.
[2024-06-07 15:49:25] [INFO ] Deduced a trap composed of 29 places in 327 ms of which 4 ms to minimize.
[2024-06-07 15:49:25] [INFO ] Deduced a trap composed of 29 places in 348 ms of which 5 ms to minimize.
[2024-06-07 15:49:26] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 4 ms to minimize.
[2024-06-07 15:49:26] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 3 ms to minimize.
[2024-06-07 15:49:26] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 5 ms to minimize.
SMT process timed out in 9797ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1625/1625 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 869 transition count 1624
Applied a total of 1 rules in 2417 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1625 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2428 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 4000000 steps (8 resets) in 90703 ms. (44 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1642 ms. (243 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1965 ms. (203 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1708 ms. (234 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1605 ms. (249 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1541 ms. (259 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1545 ms. (258 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1558 ms. (256 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1536 ms. (260 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1583 ms. (252 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1554 ms. (257 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1540 ms. (259 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1586 ms. (252 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1560 ms. (256 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1539 ms. (259 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1566 ms. (255 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1549 ms. (258 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1575 ms. (253 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1556 ms. (256 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1564 ms. (255 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1555 ms. (257 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1541 ms. (259 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1547 ms. (258 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1522 ms. (262 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1531 ms. (261 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1510 ms. (264 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1538 ms. (259 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1519 ms. (263 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1504 ms. (265 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 4503918 steps, run timeout after 102001 ms. (steps per millisecond=44 ) properties seen :0 out of 28
Probabilistic random walk after 4503918 steps, saw 3858281 distinct states, run finished after 102007 ms. (steps per millisecond=44 ) properties seen :0
// Phase 1: matrix 1624 rows 869 cols
[2024-06-07 15:51:46] [INFO ] Computed 57 invariants in 9 ms
[2024-06-07 15:51:46] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 1/869 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2965 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 840/868 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-06-07 15:51:50] [INFO ] Deduced a trap composed of 29 places in 493 ms of which 5 ms to minimize.
[2024-06-07 15:51:50] [INFO ] Deduced a trap composed of 29 places in 479 ms of which 5 ms to minimize.
[2024-06-07 15:51:51] [INFO ] Deduced a trap composed of 29 places in 496 ms of which 5 ms to minimize.
[2024-06-07 15:51:51] [INFO ] Deduced a trap composed of 29 places in 498 ms of which 6 ms to minimize.
[2024-06-07 15:51:52] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 5 ms to minimize.
[2024-06-07 15:51:52] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 5 ms to minimize.
[2024-06-07 15:51:52] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 5 ms to minimize.
[2024-06-07 15:51:53] [INFO ] Deduced a trap composed of 29 places in 300 ms of which 4 ms to minimize.
[2024-06-07 15:51:53] [INFO ] Deduced a trap composed of 29 places in 342 ms of which 4 ms to minimize.
[2024-06-07 15:51:53] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 5 ms to minimize.
[2024-06-07 15:51:54] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 3 ms to minimize.
[2024-06-07 15:51:54] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 5 ms to minimize.
[2024-06-07 15:51:54] [INFO ] Deduced a trap composed of 29 places in 389 ms of which 5 ms to minimize.
[2024-06-07 15:51:55] [INFO ] Deduced a trap composed of 29 places in 374 ms of which 5 ms to minimize.
[2024-06-07 15:51:55] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 5 ms to minimize.
[2024-06-07 15:51:56] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 4 ms to minimize.
Problem smplace_85 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 9682ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Fused 28 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1694 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1694 ms. Remains : 869/869 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1624/1624 transitions.
Applied a total of 0 rules in 1680 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-06-07 15:51:59] [INFO ] Invariant cache hit.
[2024-06-07 15:51:59] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-07 15:51:59] [INFO ] Invariant cache hit.
[2024-06-07 15:52:00] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-07 15:52:01] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
[2024-06-07 15:52:01] [INFO ] Redundant transitions in 103 ms returned []
Running 1618 sub problems to find dead transitions.
[2024-06-07 15:52:01] [INFO ] Invariant cache hit.
[2024-06-07 15:52:01] [INFO ] State equation strengthened by 44 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2493 variables, and 46 constraints, problems are : Problem set: 46 solved, 1572 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 1595/812 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 0/6 constraints. Problems are: Problem set: 46 solved, 1572 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 2 (OVERLAPS) 29/869 variables, 51/57 constraints. Problems are: Problem set: 56 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2493 variables, and 57 constraints, problems are : Problem set: 56 solved, 1562 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/44 constraints, PredecessorRefiner: 783/812 constraints, Known Traps: 0/0 constraints]
After SMT, in 71609ms problems are : Problem set: 56 solved, 1562 unsolved
Search for dead transitions found 56 dead transitions in 71633ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 869/869 places, 1568/1624 transitions.
Graph (complete) has 4004 edges and 869 vertex of which 28 are kept as prefixes of interest. Removing 841 places using SCC suffix rule.2 ms
Discarding 841 places :
Also discarding 1568 output transitions
Drop transitions (Output transitions of discarded places.) removed 1568 transitions
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 28 /869 variables (removed 841) and now considering 0/1568 (removed 1568) transitions.
[2024-06-07 15:53:13] [INFO ] Computed 0 invariants in 1 ms
[2024-06-07 15:53:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-07 15:53:13] [INFO ] Invariant cache hit.
[2024-06-07 15:53:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 28/869 places, 0/1624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75522 ms. Remains : 28/869 places, 0/1624 transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 237870 ms.
ITS solved all properties within timeout

BK_STOP 1717775593322

--------------------
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-05"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BlocksWorld-PT-05, 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 r616-tall-171774433000123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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