About the Execution of LTSMin+red for BlocksWorld-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14455.239 | 292591.00 | 504320.00 | 576.50 | TFF?FFFTTTTTTTFF | 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-171774426800199.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800199
=====================================================================
--------------------
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
here is the order used to build the result vector(from text file)
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-00
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-01
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-02
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-03
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-04
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-05
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-06
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-07
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-08
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-09
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-10
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-11
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-12
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-13
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-14
FORMULA_NAME BlocksWorld-PT-05-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717746702301
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:51:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:51:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:51:43] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-06-07 07:51:43] [INFO ] Transformed 869 places.
[2024-06-07 07:51:43] [INFO ] Transformed 1625 transitions.
[2024-06-07 07:51:43] [INFO ] Found NUPN structural information;
[2024-06-07 07:51: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]
[2024-06-07 07:51:43] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 155 ms.
Working with output stream class java.io.PrintStream
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6920 ms. (5 steps per ms) remains 11/15 properties
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 3514 ms. (11 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17628 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4416 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 6003 ms. (6 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3782 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 930 ms. (42 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 17401 ms. (2 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 878 ms. (45 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 880 ms. (45 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 888 ms. (44 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 784 ms. (50 steps per ms) remains 11/11 properties
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 07:52:00] [INFO ] Computed 57 invariants in 50 ms
[2024-06-07 07:52:00] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-07 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-01 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-04 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-05 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-06 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-09 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-12 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-13 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-14 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/2494 variables, 1/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2494 variables, 0/971 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2494/2494 variables, and 971 constraints, problems are : Problem set: 9 solved, 2 unsolved in 2348 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 81 places in 537 ms of which 53 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 81 places in 491 ms of which 6 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 81 places in 580 ms of which 7 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 5 ms to minimize.
[2024-06-07 07:52:28] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 6 ms to minimize.
[2024-06-07 07:52:28] [INFO ] Deduced a trap composed of 56 places in 440 ms of which 5 ms to minimize.
[2024-06-07 07:52:29] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 5 ms to minimize.
[2024-06-07 07:52:29] [INFO ] Deduced a trap composed of 216 places in 432 ms of which 5 ms to minimize.
[2024-06-07 07:52:30] [INFO ] Deduced a trap composed of 81 places in 471 ms of which 6 ms to minimize.
SMT process timed out in 29765ms, After SMT, problems are : Problem set: 9 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 869 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 153 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 164 ms. Remains : 869/869 places, 1624/1625 transitions.
RANDOM walk for 40000 steps (8 resets) in 5156 ms. (7 steps per ms) remains 2/2 properties
BEST_FIRST walk for 33936 steps (8 resets) in 20064 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 3061 ms. (13 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 348143 steps, run timeout after 21001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 348143 steps, saw 297072 distinct states, run finished after 21005 ms. (steps per millisecond=16 ) properties seen :0
// Phase 1: matrix 1624 rows 869 cols
[2024-06-07 07:52:58] [INFO ] Computed 57 invariants in 13 ms
[2024-06-07 07:52:58] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 81 places in 446 ms of which 6 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 81 places in 462 ms of which 5 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 5 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 81 places in 453 ms of which 5 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 81 places in 463 ms of which 5 ms to minimize.
[2024-06-07 07:53:11] [INFO ] Deduced a trap composed of 56 places in 496 ms of which 5 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 81 places in 478 ms of which 5 ms to minimize.
[2024-06-07 07:53:12] [INFO ] Deduced a trap composed of 216 places in 482 ms of which 5 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 81 places in 470 ms of which 6 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 81 places in 456 ms of which 6 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 56 places in 475 ms of which 7 ms to minimize.
[2024-06-07 07:53:14] [INFO ] Deduced a trap composed of 225 places in 449 ms of which 5 ms to minimize.
[2024-06-07 07:53:15] [INFO ] Deduced a trap composed of 144 places in 474 ms of which 6 ms to minimize.
[2024-06-07 07:53:15] [INFO ] Deduced a trap composed of 81 places in 452 ms of which 5 ms to minimize.
[2024-06-07 07:53:16] [INFO ] Deduced a trap composed of 81 places in 439 ms of which 6 ms to minimize.
[2024-06-07 07:53:16] [INFO ] Deduced a trap composed of 200 places in 446 ms of which 5 ms to minimize.
[2024-06-07 07:53:17] [INFO ] Deduced a trap composed of 29 places in 445 ms of which 5 ms to minimize.
[2024-06-07 07:53:17] [INFO ] Deduced a trap composed of 200 places in 451 ms of which 6 ms to minimize.
[2024-06-07 07:53:18] [INFO ] Deduced a trap composed of 81 places in 455 ms of which 6 ms to minimize.
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 125 places in 449 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 5 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 189 places in 459 ms of which 5 ms to minimize.
[2024-06-07 07:53:20] [INFO ] Deduced a trap composed of 104 places in 453 ms of which 5 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 81 places in 462 ms of which 5 ms to minimize.
[2024-06-07 07:53:21] [INFO ] Deduced a trap composed of 81 places in 468 ms of which 5 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 81 places in 459 ms of which 7 ms to minimize.
[2024-06-07 07:53:22] [INFO ] Deduced a trap composed of 81 places in 488 ms of which 5 ms to minimize.
[2024-06-07 07:53:23] [INFO ] Deduced a trap composed of 125 places in 488 ms of which 6 ms to minimize.
[2024-06-07 07:53:24] [INFO ] Deduced a trap composed of 161 places in 490 ms of which 5 ms to minimize.
[2024-06-07 07:53:24] [INFO ] Deduced a trap composed of 161 places in 482 ms of which 5 ms to minimize.
[2024-06-07 07:53:25] [INFO ] Deduced a trap composed of 81 places in 489 ms of which 6 ms to minimize.
[2024-06-07 07:53:25] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 6 ms to minimize.
[2024-06-07 07:53:26] [INFO ] Deduced a trap composed of 29 places in 533 ms of which 10 ms to minimize.
[2024-06-07 07:53:26] [INFO ] Deduced a trap composed of 29 places in 482 ms of which 5 ms to minimize.
[2024-06-07 07:53:27] [INFO ] Deduced a trap composed of 81 places in 536 ms of which 5 ms to minimize.
[2024-06-07 07:53:28] [INFO ] Deduced a trap composed of 81 places in 479 ms of which 5 ms to minimize.
[2024-06-07 07:53:28] [INFO ] Deduced a trap composed of 176 places in 480 ms of which 5 ms to minimize.
[2024-06-07 07:53:29] [INFO ] Deduced a trap composed of 104 places in 483 ms of which 5 ms to minimize.
[2024-06-07 07:53:29] [INFO ] Deduced a trap composed of 81 places in 483 ms of which 6 ms to minimize.
[2024-06-07 07:53:30] [INFO ] Deduced a trap composed of 200 places in 467 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:53:30] [INFO ] Deduced a trap composed of 29 places in 477 ms of which 5 ms to minimize.
[2024-06-07 07:53:31] [INFO ] Deduced a trap composed of 176 places in 477 ms of which 6 ms to minimize.
[2024-06-07 07:53:32] [INFO ] Deduced a trap composed of 125 places in 478 ms of which 5 ms to minimize.
[2024-06-07 07:53:32] [INFO ] Deduced a trap composed of 161 places in 485 ms of which 5 ms to minimize.
[2024-06-07 07:53:33] [INFO ] Deduced a trap composed of 81 places in 484 ms of which 5 ms to minimize.
[2024-06-07 07:53:33] [INFO ] Deduced a trap composed of 81 places in 471 ms of which 5 ms to minimize.
[2024-06-07 07:53:34] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 6 ms to minimize.
[2024-06-07 07:53:34] [INFO ] Deduced a trap composed of 56 places in 464 ms of which 5 ms to minimize.
[2024-06-07 07:53:35] [INFO ] Deduced a trap composed of 81 places in 472 ms of which 5 ms to minimize.
[2024-06-07 07:53:35] [INFO ] Deduced a trap composed of 81 places in 468 ms of which 6 ms to minimize.
[2024-06-07 07:53:36] [INFO ] Deduced a trap composed of 56 places in 472 ms of which 5 ms to minimize.
[2024-06-07 07:53:37] [INFO ] Deduced a trap composed of 161 places in 477 ms of which 5 ms to minimize.
[2024-06-07 07:53:37] [INFO ] Deduced a trap composed of 221 places in 483 ms of which 5 ms to minimize.
[2024-06-07 07:53:38] [INFO ] Deduced a trap composed of 29 places in 440 ms of which 5 ms to minimize.
[2024-06-07 07:53:38] [INFO ] Deduced a trap composed of 81 places in 443 ms of which 5 ms to minimize.
[2024-06-07 07:53:39] [INFO ] Deduced a trap composed of 29 places in 442 ms of which 5 ms to minimize.
[2024-06-07 07:53:39] [INFO ] Deduced a trap composed of 81 places in 442 ms of which 5 ms to minimize.
[2024-06-07 07:53:40] [INFO ] Deduced a trap composed of 81 places in 444 ms of which 6 ms to minimize.
[2024-06-07 07:53:40] [INFO ] Deduced a trap composed of 29 places in 436 ms of which 5 ms to minimize.
[2024-06-07 07:53:41] [INFO ] Deduced a trap composed of 29 places in 444 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:53:42] [INFO ] Deduced a trap composed of 104 places in 439 ms of which 5 ms to minimize.
[2024-06-07 07:53:42] [INFO ] Deduced a trap composed of 81 places in 434 ms of which 5 ms to minimize.
[2024-06-07 07:53:43] [INFO ] Deduced a trap composed of 209 places in 443 ms of which 5 ms to minimize.
[2024-06-07 07:53:43] [INFO ] Deduced a trap composed of 81 places in 426 ms of which 5 ms to minimize.
Problem BlocksWorld-PT-05-ReachabilityFireability-2024-02 is UNSAT
FORMULA BlocksWorld-PT-05-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-07 07:53:43] [INFO ] Deduced a trap composed of 209 places in 335 ms of which 4 ms to minimize.
[2024-06-07 07:53:44] [INFO ] Deduced a trap composed of 216 places in 330 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 6/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1624/2493 variables, 869/992 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 44/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2493 variables, 0/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2493 variables, 0/1036 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 1036 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37193 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 66/66 constraints]
After SMT, in 46375ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 108 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 1156 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 1158 ms. Remains : 869/869 places, 1624/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 1087 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 2992 ms. (13 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 584866 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 584866 steps, saw 497510 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2024-06-07 07:53:50] [INFO ] Invariant cache hit.
[2024-06-07 07:53:50] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 761/869 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1624/2493 variables, 869/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2493 variables, 44/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2493 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2493/2493 variables, and 970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 761/869 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:53:53] [INFO ] Deduced a trap composed of 56 places in 480 ms of which 6 ms to minimize.
[2024-06-07 07:53:53] [INFO ] Deduced a trap composed of 161 places in 485 ms of which 5 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 56 places in 467 ms of which 5 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 225 places in 289 ms of which 4 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 189 places in 384 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/869 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1624/2493 variables, 869/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2493 variables, 44/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2493 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2493 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2493/2493 variables, and 975 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3039 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 869/869 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 4759ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 108 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 1078 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 1079 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 1104 ms. Remains 869 /869 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-06-07 07:53:57] [INFO ] Invariant cache hit.
[2024-06-07 07:53:58] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-06-07 07:53:58] [INFO ] Invariant cache hit.
[2024-06-07 07:53:58] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-07 07:53:59] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2024-06-07 07:53:59] [INFO ] Redundant transitions in 118 ms returned []
Running 1618 sub problems to find dead transitions.
[2024-06-07 07:53:59] [INFO ] Invariant cache hit.
[2024-06-07 07:53:59] [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 30029 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 71267ms problems are : Problem set: 56 solved, 1562 unsolved
Search for dead transitions found 56 dead transitions in 71283ms
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 841 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 993 ms. Remains 841 /869 variables (removed 28) and now considering 1568/1568 (removed 0) transitions.
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 07:55:11] [INFO ] Computed 57 invariants in 16 ms
[2024-06-07 07:55:12] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-06-07 07:55:12] [INFO ] Invariant cache hit.
[2024-06-07 07:55:13] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 841/869 places, 1568/1624 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76345 ms. Remains : 841/869 places, 1568/1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 888 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2714 ms. (14 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 572066 steps, run timeout after 3011 ms. (steps per millisecond=189 ) properties seen :0 out of 1
Probabilistic random walk after 572066 steps, saw 489394 distinct states, run finished after 3013 ms. (steps per millisecond=189 ) properties seen :0
[2024-06-07 07:55:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 733/841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 733/841 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:55:19] [INFO ] Deduced a trap composed of 56 places in 460 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:55:19] [INFO ] Deduced a trap composed of 224 places in 301 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1568/2409 variables, 841/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1599 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 3151ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 108 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1047 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1014 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 07:55:22] [INFO ] Invariant cache hit.
[2024-06-07 07:55:22] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-06-07 07:55:22] [INFO ] Invariant cache hit.
[2024-06-07 07:55:23] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2024-06-07 07:55:23] [INFO ] Redundant transitions in 87 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 07:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 timeout
0.0)
(s428 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 70510ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 70522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72806 ms. Remains : 841/841 places, 1568/1568 transitions.
[2024-06-07 07:56:34] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2024-06-07 07:56:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 841 places, 1568 transitions and 7784 arcs took 14 ms.
[2024-06-07 07:56:34] [INFO ] Flatten gal took : 181 ms
Total runtime 291248 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-05-ReachabilityFireability-2024-03
BK_STOP 1717746994892
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BlocksWorld-PT-05-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/833/inv_0_
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-05"
export BK_EXAMINATION="ReachabilityFireability"
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-05, examination is ReachabilityFireability"
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-171774426800199"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;