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

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

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-07 07:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:32:46] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-07 07:32:46] [INFO ] Transformed 869 places.
[2024-06-07 07:32:46] [INFO ] Transformed 1625 transitions.
[2024-06-07 07:32:46] [INFO ] Found NUPN structural information;
[2024-06-07 07:32:46] [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 07:32:46] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 264 ms.
RANDOM walk for 40000 steps (8 resets) in 3701 ms. (10 steps per ms) remains 28/869 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 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 21 ms. (182 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 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 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 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 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 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 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 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 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 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 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 22 ms. (174 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 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 07:32:48] [INFO ] Computed 57 invariants in 28 ms
[2024-06-07 07:32:48] [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 4231 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 07:32:53] [INFO ] Deduced a trap composed of 29 places in 706 ms of which 170 ms to minimize.
[2024-06-07 07:32:53] [INFO ] Deduced a trap composed of 29 places in 487 ms of which 7 ms to minimize.
[2024-06-07 07:32:54] [INFO ] Deduced a trap composed of 29 places in 519 ms of which 6 ms to minimize.
[2024-06-07 07:32:54] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 6 ms to minimize.
[2024-06-07 07:32:55] [INFO ] Deduced a trap composed of 29 places in 466 ms of which 6 ms to minimize.
[2024-06-07 07:32:55] [INFO ] Deduced a trap composed of 29 places in 393 ms of which 5 ms to minimize.
[2024-06-07 07:32:56] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 4 ms to minimize.
[2024-06-07 07:32:56] [INFO ] Deduced a trap composed of 29 places in 325 ms of which 4 ms to minimize.
[2024-06-07 07:32:56] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 5 ms to minimize.
[2024-06-07 07:32:57] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 4 ms to minimize.
[2024-06-07 07:32:57] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/2494 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 0/28 constraints, Known Traps: 11/11 constraints]
After SMT, in 9355ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
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 2340 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 2350 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 4000000 steps (8 resets) in 94623 ms. (42 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1550 ms. (257 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1506 ms. (265 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1770 ms. (225 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1537 ms. (260 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1483 ms. (269 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1468 ms. (272 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1490 ms. (268 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1562 ms. (255 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1484 ms. (269 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1446 ms. (276 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1493 ms. (267 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1465 ms. (272 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1484 ms. (269 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1482 ms. (269 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1480 ms. (270 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1461 ms. (273 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1509 ms. (264 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1479 ms. (270 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1509 ms. (264 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1491 ms. (268 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1509 ms. (264 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1466 ms. (272 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1524 ms. (262 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1501 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1512 ms. (264 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1486 ms. (269 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1489 ms. (268 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1478 ms. (270 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 4861299 steps, run timeout after 105001 ms. (steps per millisecond=46 ) properties seen :0 out of 28
Probabilistic random walk after 4861299 steps, saw 4165342 distinct states, run finished after 105009 ms. (steps per millisecond=46 ) properties seen :0
// Phase 1: matrix 1624 rows 869 cols
[2024-06-07 07:35:20] [INFO ] Computed 57 invariants in 15 ms
[2024-06-07 07:35:20] [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 2889 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 07:35:23] [INFO ] Deduced a trap composed of 29 places in 475 ms of which 6 ms to minimize.
[2024-06-07 07:35:24] [INFO ] Deduced a trap composed of 29 places in 474 ms of which 6 ms to minimize.
[2024-06-07 07:35:24] [INFO ] Deduced a trap composed of 29 places in 478 ms of which 6 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 29 places in 482 ms of which 6 ms to minimize.
[2024-06-07 07:35:25] [INFO ] Deduced a trap composed of 29 places in 474 ms of which 5 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 5 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 5 ms to minimize.
[2024-06-07 07:35:26] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 5 ms to minimize.
[2024-06-07 07:35:27] [INFO ] Deduced a trap composed of 29 places in 327 ms of which 4 ms to minimize.
[2024-06-07 07:35:27] [INFO ] Deduced a trap composed of 29 places in 302 ms of which 4 ms to minimize.
[2024-06-07 07:35:27] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 4 ms to minimize.
[2024-06-07 07:35:28] [INFO ] Deduced a trap composed of 29 places in 399 ms of which 5 ms to minimize.
[2024-06-07 07:35:28] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 4 ms to minimize.
[2024-06-07 07:35:29] [INFO ] Deduced a trap composed of 29 places in 366 ms of which 5 ms to minimize.
[2024-06-07 07:35:29] [INFO ] Deduced a trap composed of 29 places in 364 ms of which 4 ms to minimize.
[2024-06-07 07:35:29] [INFO ] Deduced a trap composed of 29 places in 313 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 9541ms, 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 1701 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 1702 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 1642 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-06-07 07:35:33] [INFO ] Invariant cache hit.
[2024-06-07 07:35:33] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-06-07 07:35:33] [INFO ] Invariant cache hit.
[2024-06-07 07:35:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-07 07:35:35] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2024-06-07 07:35:35] [INFO ] Redundant transitions in 115 ms returned []
Running 1618 sub problems to find dead transitions.
[2024-06-07 07:35:35] [INFO ] Invariant cache hit.
[2024-06-07 07:35:35] [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 30042 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 30035 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 72097ms problems are : Problem set: 56 solved, 1562 unsolved
Search for dead transitions found 56 dead transitions in 72127ms
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.11 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 21 ms. Remains 28 /869 variables (removed 841) and now considering 0/1568 (removed 1568) transitions.
[2024-06-07 07:36:47] [INFO ] Computed 0 invariants in 0 ms
[2024-06-07 07:36:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-07 07:36:47] [INFO ] Invariant cache hit.
[2024-06-07 07:36:47] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 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 75895 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 241206 ms.
ITS solved all properties within timeout

BK_STOP 1717745807507

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="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-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 r612-tall-171774431200123"
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 ;