About the Execution of 2024-gold for BlocksWorld-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15691.800 | 191289.00 | 384474.00 | 592.80 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r028-smll-174853774400013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is BlocksWorld-PT-03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-smll-174853774400013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 330K May 29 14:32 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 1748542081117
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:08:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 18:08:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:08:04] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2025-05-29 18:08:04] [INFO ] Transformed 379 places.
[2025-05-29 18:08:04] [INFO ] Transformed 685 transitions.
[2025-05-29 18:08:04] [INFO ] Found NUPN structural information;
[2025-05-29 18:08:04] [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]
[2025-05-29 18:08:04] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 538 ms.
RANDOM walk for 40000 steps (8 resets) in 6086 ms. (6 steps per ms) remains 18/379 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
// Phase 1: matrix 685 rows 379 cols
[2025-05-29 18:08:06] [INFO ] Computed 37 invariants in 27 ms
[2025-05-29 18:08:06] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 360/378 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/379 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/1064 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/1064 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1064/1064 variables, and 443 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2914 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 360/378 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-29 18:08:10] [INFO ] Deduced a trap composed of 19 places in 648 ms of which 77 ms to minimize.
[2025-05-29 18:08:11] [INFO ] Deduced a trap composed of 19 places in 716 ms of which 20 ms to minimize.
[2025-05-29 18:08:11] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 5 ms to minimize.
[2025-05-29 18:08:11] [INFO ] Deduced a trap composed of 19 places in 494 ms of which 7 ms to minimize.
[2025-05-29 18:08:12] [INFO ] Deduced a trap composed of 19 places in 556 ms of which 6 ms to minimize.
[2025-05-29 18:08:12] [INFO ] Deduced a trap composed of 19 places in 416 ms of which 6 ms to minimize.
[2025-05-29 18:08:13] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 6 ms to minimize.
[2025-05-29 18:08:13] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 5 ms to minimize.
[2025-05-29 18:08:14] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 5 ms to minimize.
[2025-05-29 18:08:14] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 5 ms to minimize.
SMT process timed out in 8134ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 685/685 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 379 transition count 684
Applied a total of 1 rules in 963 ms. Remains 379 /379 variables (removed 0) and now considering 684/685 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 986 ms. Remains : 379/379 places, 684/685 transitions.
RANDOM walk for 4000000 steps (8 resets) in 68295 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1962 ms. (203 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1358 ms. (294 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1351 ms. (295 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1393 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1346 ms. (296 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1318 ms. (303 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1369 ms. (291 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1301 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1300 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1311 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1309 ms. (305 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1785 ms. (223 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1344 ms. (297 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1912 ms. (209 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1618 ms. (247 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1302 ms. (306 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1313 ms. (304 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1308 ms. (305 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 3581837 steps, run timeout after 75001 ms. (steps per millisecond=47 ) properties seen :0 out of 18
Probabilistic random walk after 3581837 steps, saw 2766124 distinct states, run finished after 75011 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 684 rows 379 cols
[2025-05-29 18:09:55] [INFO ] Computed 37 invariants in 5 ms
[2025-05-29 18:09:55] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 360/378 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 1/379 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/1063 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 442 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1685 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 360/378 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-29 18:09:58] [INFO ] Deduced a trap composed of 19 places in 448 ms of which 5 ms to minimize.
[2025-05-29 18:09:58] [INFO ] Deduced a trap composed of 19 places in 396 ms of which 6 ms to minimize.
[2025-05-29 18:09:59] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 6 ms to minimize.
[2025-05-29 18:09:59] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 6 ms to minimize.
[2025-05-29 18:09:59] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 6 ms to minimize.
[2025-05-29 18:10:00] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 6 ms to minimize.
[2025-05-29 18:10:00] [INFO ] Deduced a trap composed of 19 places in 365 ms of which 5 ms to minimize.
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 5 ms to minimize.
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 4 ms to minimize.
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 4 ms to minimize.
[2025-05-29 18:10:01] [INFO ] Deduced a trap composed of 19 places in 390 ms of which 4 ms to minimize.
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 4 ms to minimize.
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 4 ms to minimize.
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 3 ms to minimize.
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 3 ms to minimize.
[2025-05-29 18:10:02] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2025-05-29 18:10:03] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2025-05-29 18:10:03] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 9 ms to minimize.
Problem smplace_55 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 7310ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 684/684 transitions.
Applied a total of 0 rules in 360 ms. Remains 379 /379 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 379/379 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 684/684 transitions.
Applied a total of 0 rules in 529 ms. Remains 379 /379 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2025-05-29 18:10:04] [INFO ] Invariant cache hit.
[2025-05-29 18:10:04] [INFO ] Implicit Places using invariants in 581 ms returned []
[2025-05-29 18:10:04] [INFO ] Invariant cache hit.
[2025-05-29 18:10:05] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 18:10:05] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2025-05-29 18:10:05] [INFO ] Redundant transitions in 69 ms returned []
Running 679 sub problems to find dead transitions.
[2025-05-29 18:10:05] [INFO ] Invariant cache hit.
[2025-05-29 18:10:05] [INFO ] State equation strengthened by 26 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 653 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 653 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/379 variables, 10/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 36 solved, 643 unsolved
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 Real declared 1063/1063 variables, and 442 constraints, problems are : Problem set: 36 solved, 643 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 36 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/1 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 2 (OVERLAPS) 23/379 variables, 36/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 0/37 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 4 (OVERLAPS) 684/1063 variables, 379/416 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1063 variables, 26/442 constraints. Problems are: Problem set: 36 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 643/1085 constraints. Problems are: Problem set: 36 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 1085 constraints, problems are : Problem set: 36 solved, 643 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 643/679 constraints, Known Traps: 0/0 constraints]
After SMT, in 66299ms problems are : Problem set: 36 solved, 643 unsolved
Search for dead transitions found 36 dead transitions in 66330ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/379 places, 648/684 transitions.
Graph (complete) has 1674 edges and 379 vertex of which 18 are kept as prefixes of interest. Removing 361 places using SCC suffix rule.2 ms
Discarding 361 places :
Also discarding 648 output transitions
Drop transitions (Output transitions of discarded places.) removed 648 transitions
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 18 /379 variables (removed 361) and now considering 0/648 (removed 648) transitions.
[2025-05-29 18:11:12] [INFO ] Computed 0 invariants in 0 ms
[2025-05-29 18:11:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-29 18:11:12] [INFO ] Invariant cache hit.
[2025-05-29 18:11:12] [INFO ] Implicit Places using invariants and state equation in 24 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 : 18/379 places, 0/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68845 ms. Remains : 18/379 places, 0/684 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 188797 ms.
ITS solved all properties within timeout
BK_STOP 1748542272406
--------------------
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-03"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BlocksWorld-PT-03, 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 r028-smll-174853774400013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-03.tgz
mv BlocksWorld-PT-03 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.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 [ "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 ;