About the Execution of LTSMin+red for BlocksWorld-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12380.619 | 363921.00 | 526597.00 | 932.30 | ????F????F?????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r605-tall-171774426800202.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-06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800202
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 253K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 378K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 23K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 149K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 627K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 689K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 817K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.5M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 35K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 86K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.1M 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-06-CTLFireability-2024-00
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-01
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-02
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-03
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-04
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-05
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-06
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-07
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-08
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-09
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-10
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-11
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-12
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-13
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-14
FORMULA_NAME BlocksWorld-PT-06-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717746833211
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:53:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:53:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:53:54] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-06-07 07:53:54] [INFO ] Transformed 1189 places.
[2024-06-07 07:53:54] [INFO ] Transformed 2245 transitions.
[2024-06-07 07:53:54] [INFO ] Found NUPN structural information;
[2024-06-07 07:53:54] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32]
[2024-06-07 07:53:54] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 85 ms.
Support contains 1189 out of 1189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1189/1189 places, 2245/2245 transitions.
Applied a total of 0 rules in 29 ms. Remains 1189 /1189 variables (removed 0) and now considering 2245/2245 (removed 0) transitions.
// Phase 1: matrix 2245 rows 1189 cols
[2024-06-07 07:53:55] [INFO ] Computed 67 invariants in 45 ms
[2024-06-07 07:53:55] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-07 07:53:55] [INFO ] Invariant cache hit.
[2024-06-07 07:53:56] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-07 07:53:56] [INFO ] Implicit Places using invariants and state equation in 943 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
Running 2241 sub problems to find dead transitions.
[2024-06-07 07:53:56] [INFO ] Invariant cache hit.
[2024-06-07 07:53:56] [INFO ] State equation strengthened by 59 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2238 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1185 variables, 60/60 constraints. Problems are: Problem set: 60 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1185/3434 variables, and 60 constraints, problems are : Problem set: 60 solved, 2181 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 2211/1123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 60 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 4/4 constraints. Problems are: Problem set: 60 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3434 variables, and 4 constraints, problems are : Problem set: 60 solved, 2181 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/67 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1088/1123 constraints, Known Traps: 0/0 constraints]
After SMT, in 76325ms problems are : Problem set: 60 solved, 2181 unsolved
Search for dead transitions found 60 dead transitions in 76369ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in LTL mode, iteration 1 : 1189/1189 places, 2185/2245 transitions.
Deduced a syphon composed of 30 places in 2 ms
Applied a total of 0 rules in 10 ms. Remains 1189 /1189 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77776 ms. Remains : 1189/1189 places, 2185/2245 transitions.
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Support contains 1159 out of 1159 places after structural reductions.
[2024-06-07 07:55:13] [INFO ] Flatten gal took : 398 ms
[2024-06-07 07:55:16] [INFO ] Flatten gal took : 384 ms
[2024-06-07 07:55:19] [INFO ] Input system was already deterministic with 2185 transitions.
Reduction of identical properties reduced properties to check from 68 to 64
RANDOM walk for 40000 steps (8 resets) in 10253 ms. (3 steps per ms) remains 8/64 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1509 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9084 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 9672 ms. (4 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 4773 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1046 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1084 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1174 ms. (34 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 907 ms. (44 steps per ms) remains 8/8 properties
// Phase 1: matrix 2185 rows 1159 cols
[2024-06-07 07:55:29] [INFO ] Computed 67 invariants in 23 ms
[2024-06-07 07:55:29] [INFO ] State equation strengthened by 7 read => feed constraints.
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp48 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 33/1159 variables, 33/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/3344 variables, 1/1233 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3344 variables, 0/1233 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/3344 variables, 0/1233 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3344/3344 variables, and 1233 constraints, problems are : Problem set: 5 solved, 3 unsolved in 2303 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-07 07:55:43] [INFO ] Deduced a trap composed of 150 places in 445 ms of which 83 ms to minimize.
[2024-06-07 07:55:43] [INFO ] Deduced a trap composed of 96 places in 400 ms of which 5 ms to minimize.
[2024-06-07 07:55:44] [INFO ] Deduced a trap composed of 196 places in 615 ms of which 11 ms to minimize.
[2024-06-07 07:55:45] [INFO ] Deduced a trap composed of 216 places in 610 ms of which 7 ms to minimize.
[2024-06-07 07:55:45] [INFO ] Deduced a trap composed of 174 places in 492 ms of which 6 ms to minimize.
[2024-06-07 07:55:46] [INFO ] Deduced a trap composed of 66 places in 470 ms of which 6 ms to minimize.
[2024-06-07 07:55:46] [INFO ] Deduced a trap composed of 196 places in 742 ms of which 6 ms to minimize.
[2024-06-07 07:55:47] [INFO ] Deduced a trap composed of 150 places in 563 ms of which 6 ms to minimize.
SMT process timed out in 17778ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1126 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2185/2185 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 1159 transition count 2184
Applied a total of 1 rules in 366 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2185 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 1159/1159 places, 2184/2185 transitions.
RANDOM walk for 40000 steps (8 resets) in 3388 ms. (11 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 607 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8214 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 492 ms. (81 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 158056 steps, run timeout after 9002 ms. (steps per millisecond=17 ) properties seen :1 out of 3
Probabilistic random walk after 158056 steps, saw 136254 distinct states, run finished after 9006 ms. (steps per millisecond=17 ) properties seen :1
// Phase 1: matrix 2184 rows 1159 cols
[2024-06-07 07:56:00] [INFO ] Computed 67 invariants in 15 ms
[2024-06-07 07:56:00] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 33/1159 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3343/3343 variables, and 1232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1490 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:56:05] [INFO ] Deduced a trap composed of 66 places in 324 ms of which 4 ms to minimize.
[2024-06-07 07:56:06] [INFO ] Deduced a trap composed of 150 places in 513 ms of which 6 ms to minimize.
[2024-06-07 07:56:06] [INFO ] Deduced a trap composed of 66 places in 488 ms of which 6 ms to minimize.
[2024-06-07 07:56:07] [INFO ] Deduced a trap composed of 216 places in 425 ms of which 5 ms to minimize.
[2024-06-07 07:56:07] [INFO ] Deduced a trap composed of 66 places in 432 ms of which 6 ms to minimize.
[2024-06-07 07:56:08] [INFO ] Deduced a trap composed of 96 places in 560 ms of which 6 ms to minimize.
[2024-06-07 07:56:09] [INFO ] Deduced a trap composed of 234 places in 556 ms of which 6 ms to minimize.
[2024-06-07 07:56:09] [INFO ] Deduced a trap composed of 196 places in 542 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:56:10] [INFO ] Deduced a trap composed of 294 places in 664 ms of which 7 ms to minimize.
[2024-06-07 07:56:11] [INFO ] Deduced a trap composed of 250 places in 671 ms of which 6 ms to minimize.
[2024-06-07 07:56:11] [INFO ] Deduced a trap composed of 294 places in 654 ms of which 6 ms to minimize.
[2024-06-07 07:56:12] [INFO ] Deduced a trap composed of 304 places in 706 ms of which 6 ms to minimize.
[2024-06-07 07:56:13] [INFO ] Deduced a trap composed of 174 places in 713 ms of which 8 ms to minimize.
[2024-06-07 07:56:14] [INFO ] Deduced a trap composed of 264 places in 729 ms of which 7 ms to minimize.
[2024-06-07 07:56:15] [INFO ] Deduced a trap composed of 304 places in 690 ms of which 6 ms to minimize.
[2024-06-07 07:56:15] [INFO ] Deduced a trap composed of 174 places in 779 ms of which 7 ms to minimize.
[2024-06-07 07:56:16] [INFO ] Deduced a trap composed of 96 places in 704 ms of which 7 ms to minimize.
[2024-06-07 07:56:17] [INFO ] Deduced a trap composed of 286 places in 698 ms of which 7 ms to minimize.
[2024-06-07 07:56:18] [INFO ] Deduced a trap composed of 124 places in 686 ms of which 7 ms to minimize.
[2024-06-07 07:56:18] [INFO ] Deduced a trap composed of 294 places in 732 ms of which 7 ms to minimize.
[2024-06-07 07:56:19] [INFO ] Deduced a trap composed of 276 places in 725 ms of which 7 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 66 places in 677 ms of which 6 ms to minimize.
[2024-06-07 07:56:21] [INFO ] Deduced a trap composed of 300 places in 706 ms of which 7 ms to minimize.
[2024-06-07 07:56:22] [INFO ] Deduced a trap composed of 150 places in 738 ms of which 7 ms to minimize.
[2024-06-07 07:56:22] [INFO ] Deduced a trap composed of 234 places in 722 ms of which 7 ms to minimize.
[2024-06-07 07:56:23] [INFO ] Deduced a trap composed of 150 places in 717 ms of which 7 ms to minimize.
[2024-06-07 07:56:24] [INFO ] Deduced a trap composed of 174 places in 746 ms of which 10 ms to minimize.
[2024-06-07 07:56:25] [INFO ] Deduced a trap composed of 196 places in 742 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1126 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:56:26] [INFO ] Deduced a trap composed of 264 places in 748 ms of which 7 ms to minimize.
[2024-06-07 07:56:26] [INFO ] Deduced a trap composed of 124 places in 739 ms of which 7 ms to minimize.
[2024-06-07 07:56:27] [INFO ] Deduced a trap composed of 150 places in 742 ms of which 7 ms to minimize.
[2024-06-07 07:56:28] [INFO ] Deduced a trap composed of 304 places in 729 ms of which 7 ms to minimize.
[2024-06-07 07:56:29] [INFO ] Deduced a trap composed of 234 places in 732 ms of which 6 ms to minimize.
[2024-06-07 07:56:29] [INFO ] Deduced a trap composed of 66 places in 767 ms of which 7 ms to minimize.
[2024-06-07 07:56:30] [INFO ] Deduced a trap composed of 96 places in 734 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:56:31] [INFO ] Deduced a trap composed of 196 places in 696 ms of which 6 ms to minimize.
[2024-06-07 07:56:32] [INFO ] Deduced a trap composed of 216 places in 736 ms of which 7 ms to minimize.
[2024-06-07 07:56:33] [INFO ] Deduced a trap composed of 174 places in 750 ms of which 7 ms to minimize.
[2024-06-07 07:56:34] [INFO ] Deduced a trap composed of 174 places in 740 ms of which 7 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 150 places in 771 ms of which 7 ms to minimize.
[2024-06-07 07:56:35] [INFO ] Deduced a trap composed of 306 places in 697 ms of which 6 ms to minimize.
[2024-06-07 07:56:36] [INFO ] Deduced a trap composed of 250 places in 730 ms of which 7 ms to minimize.
[2024-06-07 07:56:37] [INFO ] Deduced a trap composed of 286 places in 701 ms of which 7 ms to minimize.
[2024-06-07 07:56:38] [INFO ] Deduced a trap composed of 294 places in 720 ms of which 6 ms to minimize.
[2024-06-07 07:56:38] [INFO ] Deduced a trap composed of 276 places in 702 ms of which 7 ms to minimize.
[2024-06-07 07:56:39] [INFO ] Deduced a trap composed of 196 places in 728 ms of which 7 ms to minimize.
[2024-06-07 07:56:40] [INFO ] Deduced a trap composed of 286 places in 691 ms of which 6 ms to minimize.
[2024-06-07 07:56:41] [INFO ] Deduced a trap composed of 306 places in 721 ms of which 21 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 294 places in 694 ms of which 7 ms to minimize.
[2024-06-07 07:56:42] [INFO ] Deduced a trap composed of 300 places in 723 ms of which 7 ms to minimize.
[2024-06-07 07:56:43] [INFO ] Deduced a trap composed of 304 places in 732 ms of which 6 ms to minimize.
[2024-06-07 07:56:44] [INFO ] Deduced a trap composed of 300 places in 725 ms of which 7 ms to minimize.
[2024-06-07 07:56:45] [INFO ] Deduced a trap composed of 216 places in 757 ms of which 6 ms to minimize.
[2024-06-07 07:56:46] [INFO ] Deduced a trap composed of 276 places in 762 ms of which 7 ms to minimize.
[2024-06-07 07:56:46] [INFO ] Deduced a trap composed of 294 places in 749 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1126 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:56:47] [INFO ] Deduced a trap composed of 124 places in 371 ms of which 4 ms to minimize.
[2024-06-07 07:56:47] [INFO ] Deduced a trap composed of 66 places in 402 ms of which 5 ms to minimize.
[2024-06-07 07:56:48] [INFO ] Deduced a trap composed of 66 places in 714 ms of which 7 ms to minimize.
[2024-06-07 07:56:49] [INFO ] Deduced a trap composed of 66 places in 725 ms of which 6 ms to minimize.
[2024-06-07 07:56:50] [INFO ] Deduced a trap composed of 234 places in 720 ms of which 7 ms to minimize.
SMT process timed out in 49934ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1126 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2184/2184 transitions.
Applied a total of 0 rules in 214 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 1159/1159 places, 2184/2184 transitions.
RANDOM walk for 40000 steps (8 resets) in 3421 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 547 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8312 ms. (4 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 154856 steps, run timeout after 9002 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 154856 steps, saw 133433 distinct states, run finished after 9003 ms. (steps per millisecond=17 ) properties seen :0
[2024-06-07 07:57:02] [INFO ] Invariant cache hit.
[2024-06-07 07:57:02] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 33/1159 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3343/3343 variables, and 1232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1510 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1126 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:57:08] [INFO ] Deduced a trap composed of 174 places in 668 ms of which 7 ms to minimize.
[2024-06-07 07:57:09] [INFO ] Deduced a trap composed of 250 places in 670 ms of which 7 ms to minimize.
[2024-06-07 07:57:09] [INFO ] Deduced a trap composed of 66 places in 305 ms of which 4 ms to minimize.
[2024-06-07 07:57:10] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-06-07 07:57:10] [INFO ] Deduced a trap composed of 66 places in 510 ms of which 6 ms to minimize.
[2024-06-07 07:57:11] [INFO ] Deduced a trap composed of 96 places in 522 ms of which 5 ms to minimize.
[2024-06-07 07:57:11] [INFO ] Deduced a trap composed of 196 places in 483 ms of which 5 ms to minimize.
[2024-06-07 07:57:12] [INFO ] Deduced a trap composed of 124 places in 594 ms of which 6 ms to minimize.
[2024-06-07 07:57:13] [INFO ] Deduced a trap composed of 250 places in 635 ms of which 7 ms to minimize.
[2024-06-07 07:57:13] [INFO ] Deduced a trap composed of 264 places in 596 ms of which 6 ms to minimize.
[2024-06-07 07:57:14] [INFO ] Deduced a trap composed of 276 places in 669 ms of which 6 ms to minimize.
[2024-06-07 07:57:15] [INFO ] Deduced a trap composed of 264 places in 698 ms of which 7 ms to minimize.
[2024-06-07 07:57:16] [INFO ] Deduced a trap composed of 306 places in 729 ms of which 7 ms to minimize.
[2024-06-07 07:57:16] [INFO ] Deduced a trap composed of 96 places in 747 ms of which 7 ms to minimize.
[2024-06-07 07:57:17] [INFO ] Deduced a trap composed of 234 places in 816 ms of which 7 ms to minimize.
[2024-06-07 07:57:18] [INFO ] Deduced a trap composed of 300 places in 751 ms of which 7 ms to minimize.
[2024-06-07 07:57:19] [INFO ] Deduced a trap composed of 306 places in 760 ms of which 7 ms to minimize.
[2024-06-07 07:57:20] [INFO ] Deduced a trap composed of 294 places in 821 ms of which 7 ms to minimize.
[2024-06-07 07:57:21] [INFO ] Deduced a trap composed of 124 places in 751 ms of which 7 ms to minimize.
[2024-06-07 07:57:21] [INFO ] Deduced a trap composed of 276 places in 666 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1126 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:57:22] [INFO ] Deduced a trap composed of 294 places in 699 ms of which 7 ms to minimize.
[2024-06-07 07:57:23] [INFO ] Deduced a trap composed of 216 places in 719 ms of which 7 ms to minimize.
[2024-06-07 07:57:24] [INFO ] Deduced a trap composed of 196 places in 724 ms of which 8 ms to minimize.
[2024-06-07 07:57:25] [INFO ] Deduced a trap composed of 124 places in 743 ms of which 7 ms to minimize.
[2024-06-07 07:57:25] [INFO ] Deduced a trap composed of 66 places in 740 ms of which 7 ms to minimize.
[2024-06-07 07:57:26] [INFO ] Deduced a trap composed of 250 places in 425 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1126 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1126 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 33/1159 variables, 33/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:57:27] [INFO ] Deduced a trap composed of 306 places in 459 ms of which 5 ms to minimize.
[2024-06-07 07:57:28] [INFO ] Deduced a trap composed of 96 places in 718 ms of which 7 ms to minimize.
[2024-06-07 07:57:28] [INFO ] Deduced a trap composed of 34 places in 762 ms of which 7 ms to minimize.
[2024-06-07 07:57:29] [INFO ] Deduced a trap composed of 124 places in 722 ms of which 6 ms to minimize.
[2024-06-07 07:57:30] [INFO ] Deduced a trap composed of 96 places in 720 ms of which 7 ms to minimize.
[2024-06-07 07:57:31] [INFO ] Deduced a trap composed of 96 places in 736 ms of which 7 ms to minimize.
[2024-06-07 07:57:32] [INFO ] Deduced a trap composed of 96 places in 766 ms of which 7 ms to minimize.
[2024-06-07 07:57:33] [INFO ] Deduced a trap composed of 66 places in 804 ms of which 7 ms to minimize.
[2024-06-07 07:57:34] [INFO ] Deduced a trap composed of 150 places in 737 ms of which 7 ms to minimize.
[2024-06-07 07:57:34] [INFO ] Deduced a trap composed of 96 places in 769 ms of which 7 ms to minimize.
[2024-06-07 07:57:35] [INFO ] Deduced a trap composed of 286 places in 763 ms of which 6 ms to minimize.
[2024-06-07 07:57:36] [INFO ] Deduced a trap composed of 66 places in 750 ms of which 7 ms to minimize.
[2024-06-07 07:57:37] [INFO ] Deduced a trap composed of 96 places in 754 ms of which 7 ms to minimize.
[2024-06-07 07:57:38] [INFO ] Deduced a trap composed of 66 places in 758 ms of which 7 ms to minimize.
[2024-06-07 07:57:39] [INFO ] Deduced a trap composed of 196 places in 758 ms of which 7 ms to minimize.
[2024-06-07 07:57:39] [INFO ] Deduced a trap composed of 96 places in 737 ms of which 7 ms to minimize.
[2024-06-07 07:57:40] [INFO ] Deduced a trap composed of 300 places in 754 ms of which 8 ms to minimize.
[2024-06-07 07:57:41] [INFO ] Deduced a trap composed of 96 places in 756 ms of which 7 ms to minimize.
[2024-06-07 07:57:42] [INFO ] Deduced a trap composed of 96 places in 750 ms of which 7 ms to minimize.
[2024-06-07 07:57:43] [INFO ] Deduced a trap composed of 96 places in 756 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1159 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:57:43] [INFO ] Deduced a trap composed of 276 places in 309 ms of which 5 ms to minimize.
[2024-06-07 07:57:44] [INFO ] Deduced a trap composed of 294 places in 748 ms of which 7 ms to minimize.
[2024-06-07 07:57:45] [INFO ] Deduced a trap composed of 66 places in 747 ms of which 7 ms to minimize.
[2024-06-07 07:57:46] [INFO ] Deduced a trap composed of 124 places in 718 ms of which 7 ms to minimize.
[2024-06-07 07:57:47] [INFO ] Deduced a trap composed of 124 places in 735 ms of which 6 ms to minimize.
[2024-06-07 07:57:47] [INFO ] Deduced a trap composed of 300 places in 737 ms of which 6 ms to minimize.
[2024-06-07 07:57:48] [INFO ] Deduced a trap composed of 124 places in 752 ms of which 7 ms to minimize.
[2024-06-07 07:57:49] [INFO ] Deduced a trap composed of 96 places in 765 ms of which 7 ms to minimize.
[2024-06-07 07:57:50] [INFO ] Deduced a trap composed of 66 places in 775 ms of which 8 ms to minimize.
[2024-06-07 07:57:51] [INFO ] Deduced a trap composed of 34 places in 721 ms of which 7 ms to minimize.
[2024-06-07 07:57:52] [INFO ] Deduced a trap composed of 174 places in 706 ms of which 7 ms to minimize.
[2024-06-07 07:57:52] [INFO ] Deduced a trap composed of 96 places in 764 ms of which 7 ms to minimize.
[2024-06-07 07:57:53] [INFO ] Deduced a trap composed of 66 places in 731 ms of which 6 ms to minimize.
[2024-06-07 07:57:54] [INFO ] Deduced a trap composed of 150 places in 754 ms of which 7 ms to minimize.
[2024-06-07 07:57:55] [INFO ] Deduced a trap composed of 96 places in 743 ms of which 7 ms to minimize.
[2024-06-07 07:57:56] [INFO ] Deduced a trap composed of 96 places in 712 ms of which 7 ms to minimize.
[2024-06-07 07:57:57] [INFO ] Deduced a trap composed of 96 places in 720 ms of which 7 ms to minimize.
[2024-06-07 07:57:57] [INFO ] Deduced a trap composed of 66 places in 751 ms of which 6 ms to minimize.
[2024-06-07 07:57:58] [INFO ] Deduced a trap composed of 174 places in 739 ms of which 7 ms to minimize.
[2024-06-07 07:57:59] [INFO ] Deduced a trap composed of 96 places in 733 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1159 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:58:00] [INFO ] Deduced a trap composed of 294 places in 366 ms of which 4 ms to minimize.
[2024-06-07 07:58:00] [INFO ] Deduced a trap composed of 96 places in 759 ms of which 8 ms to minimize.
[2024-06-07 07:58:01] [INFO ] Deduced a trap composed of 286 places in 761 ms of which 7 ms to minimize.
[2024-06-07 07:58:02] [INFO ] Deduced a trap composed of 96 places in 746 ms of which 8 ms to minimize.
[2024-06-07 07:58:03] [INFO ] Deduced a trap composed of 66 places in 762 ms of which 7 ms to minimize.
[2024-06-07 07:58:04] [INFO ] Deduced a trap composed of 66 places in 748 ms of which 7 ms to minimize.
[2024-06-07 07:58:05] [INFO ] Deduced a trap composed of 174 places in 750 ms of which 7 ms to minimize.
[2024-06-07 07:58:06] [INFO ] Deduced a trap composed of 96 places in 750 ms of which 7 ms to minimize.
[2024-06-07 07:58:06] [INFO ] Deduced a trap composed of 96 places in 762 ms of which 9 ms to minimize.
[2024-06-07 07:58:07] [INFO ] Deduced a trap composed of 174 places in 764 ms of which 7 ms to minimize.
[2024-06-07 07:58:08] [INFO ] Deduced a trap composed of 96 places in 760 ms of which 7 ms to minimize.
[2024-06-07 07:58:09] [INFO ] Deduced a trap composed of 96 places in 798 ms of which 8 ms to minimize.
[2024-06-07 07:58:10] [INFO ] Deduced a trap composed of 96 places in 775 ms of which 8 ms to minimize.
[2024-06-07 07:58:11] [INFO ] Deduced a trap composed of 66 places in 736 ms of which 7 ms to minimize.
[2024-06-07 07:58:12] [INFO ] Deduced a trap composed of 234 places in 723 ms of which 7 ms to minimize.
[2024-06-07 07:58:13] [INFO ] Deduced a trap composed of 96 places in 742 ms of which 7 ms to minimize.
[2024-06-07 07:58:14] [INFO ] Deduced a trap composed of 96 places in 735 ms of which 7 ms to minimize.
[2024-06-07 07:58:15] [INFO ] Deduced a trap composed of 234 places in 773 ms of which 7 ms to minimize.
[2024-06-07 07:58:15] [INFO ] Deduced a trap composed of 96 places in 749 ms of which 7 ms to minimize.
[2024-06-07 07:58:16] [INFO ] Deduced a trap composed of 234 places in 772 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1159 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:58:17] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:58:18] [INFO ] Deduced a trap composed of 66 places in 744 ms of which 7 ms to minimize.
[2024-06-07 07:58:18] [INFO ] Deduced a trap composed of 96 places in 756 ms of which 7 ms to minimize.
[2024-06-07 07:58:19] [INFO ] Deduced a trap composed of 96 places in 755 ms of which 7 ms to minimize.
[2024-06-07 07:58:20] [INFO ] Deduced a trap composed of 174 places in 771 ms of which 7 ms to minimize.
[2024-06-07 07:58:21] [INFO ] Deduced a trap composed of 96 places in 728 ms of which 7 ms to minimize.
[2024-06-07 07:58:22] [INFO ] Deduced a trap composed of 234 places in 753 ms of which 7 ms to minimize.
[2024-06-07 07:58:23] [INFO ] Deduced a trap composed of 96 places in 720 ms of which 7 ms to minimize.
SMT process timed out in 80335ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1126 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2184/2184 transitions.
Applied a total of 0 rules in 163 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1159/1159 places, 2184/2184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2184/2184 transitions.
Applied a total of 0 rules in 153 ms. Remains 1159 /1159 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-06-07 07:58:23] [INFO ] Invariant cache hit.
[2024-06-07 07:58:23] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-07 07:58:23] [INFO ] Invariant cache hit.
[2024-06-07 07:58:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-07 07:58:24] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2024-06-07 07:58:24] [INFO ] Redundant transitions in 145 ms returned []
Running 2180 sub problems to find dead transitions.
[2024-06-07 07:58:24] [INFO ] Invariant cache hit.
[2024-06-07 07:58:24] [INFO ] State equation strengthened by 6 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.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 0.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 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3343 variables, and 60 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 2180/1092 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3343 variables, and 60 constraints, problems are : Problem set: 0 solved, 2180 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1088/1092 constraints, Known Traps: 0/0 constraints]
After SMT, in 76930ms problems are : Problem set: 0 solved, 2180 unsolved
Search for dead transitions found 0 dead transitions in 76953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78334 ms. Remains : 1159/1159 places, 2184/2184 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-06-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:59:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-07 07:59:41] [INFO ] Flatten gal took : 205 ms
FORMULA BlocksWorld-PT-06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-07 07:59:43] [INFO ] Flatten gal took : 282 ms
[2024-06-07 07:59:45] [INFO ] Input system was already deterministic with 2185 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 310 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 310 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:46] [INFO ] Flatten gal took : 77 ms
[2024-06-07 07:59:46] [INFO ] Flatten gal took : 83 ms
[2024-06-07 07:59:46] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 8 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:46] [INFO ] Flatten gal took : 84 ms
[2024-06-07 07:59:46] [INFO ] Flatten gal took : 143 ms
[2024-06-07 07:59:47] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 4 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:47] [INFO ] Flatten gal took : 107 ms
[2024-06-07 07:59:47] [INFO ] Flatten gal took : 143 ms
[2024-06-07 07:59:47] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 134 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 134 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:48] [INFO ] Flatten gal took : 63 ms
[2024-06-07 07:59:48] [INFO ] Flatten gal took : 69 ms
[2024-06-07 07:59:48] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 108 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:48] [INFO ] Flatten gal took : 109 ms
[2024-06-07 07:59:48] [INFO ] Flatten gal took : 152 ms
[2024-06-07 07:59:49] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 79 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:49] [INFO ] Flatten gal took : 64 ms
[2024-06-07 07:59:49] [INFO ] Flatten gal took : 79 ms
[2024-06-07 07:59:49] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 165 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 165 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:49] [INFO ] Flatten gal took : 69 ms
[2024-06-07 07:59:49] [INFO ] Flatten gal took : 79 ms
[2024-06-07 07:59:49] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 31 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:50] [INFO ] Flatten gal took : 65 ms
[2024-06-07 07:59:50] [INFO ] Flatten gal took : 70 ms
[2024-06-07 07:59:50] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 137 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 137 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:50] [INFO ] Flatten gal took : 62 ms
[2024-06-07 07:59:50] [INFO ] Flatten gal took : 69 ms
[2024-06-07 07:59:50] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 23 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:50] [INFO ] Flatten gal took : 60 ms
[2024-06-07 07:59:50] [INFO ] Flatten gal took : 65 ms
[2024-06-07 07:59:50] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 24 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:51] [INFO ] Flatten gal took : 63 ms
[2024-06-07 07:59:51] [INFO ] Flatten gal took : 69 ms
[2024-06-07 07:59:51] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 128 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 128 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:51] [INFO ] Flatten gal took : 61 ms
[2024-06-07 07:59:51] [INFO ] Flatten gal took : 69 ms
[2024-06-07 07:59:51] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 23 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:51] [INFO ] Flatten gal took : 61 ms
[2024-06-07 07:59:51] [INFO ] Flatten gal took : 67 ms
[2024-06-07 07:59:51] [INFO ] Input system was already deterministic with 2185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 24 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1159/1159 places, 2185/2185 transitions.
[2024-06-07 07:59:52] [INFO ] Flatten gal took : 62 ms
[2024-06-07 07:59:52] [INFO ] Flatten gal took : 69 ms
[2024-06-07 07:59:52] [INFO ] Input system was already deterministic with 2185 transitions.
[2024-06-07 07:59:52] [INFO ] Flatten gal took : 256 ms
[2024-06-07 07:59:54] [INFO ] Flatten gal took : 260 ms
[2024-06-07 07:59:56] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 86 ms.
[2024-06-07 07:59:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1159 places, 2185 transitions and 10910 arcs took 29 ms.
Total runtime 361770 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-06-CTLFireability-2024-00
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-01
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-02
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-03
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-05
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-06
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-07
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-08
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-10
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-11
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-12
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-13
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-14
Could not compute solution for formula : BlocksWorld-PT-06-CTLFireability-2024-15
BK_STOP 1717747197132
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1054/ctl_0_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1054/ctl_1_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1054/ctl_2_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1054/ctl_3_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1054/ctl_4_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1054/ctl_5_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1054/ctl_6_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1054/ctl_7_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1054/ctl_8_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1054/ctl_9_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/1054/ctl_10_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1054/ctl_11_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1054/ctl_12_
ctl formula name BlocksWorld-PT-06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1054/ctl_13_
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-06"
export BK_EXAMINATION="CTLFireability"
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-06, examination is CTLFireability"
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-171774426800202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-06.tgz
mv BlocksWorld-PT-06 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;