About the Execution of GreatSPN+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 |
| 4974.020 | 704993.00 | 871234.00 | 1995.30 | TTFTFFTTTFFTFFFT | 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.r601-tall-171774423900203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BlocksWorld-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r601-tall-171774423900203
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717756908138
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 10:41:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 10:41:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:41:49] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-06-07 10:41:49] [INFO ] Transformed 1189 places.
[2024-06-07 10:41:49] [INFO ] Transformed 2245 transitions.
[2024-06-07 10:41:49] [INFO ] Found NUPN structural information;
[2024-06-07 10:41:49] [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 10:41:49] [INFO ] Parsed PT model containing 1189 places and 2245 transitions and 11210 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 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 150 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 10:41:50] [INFO ] Computed 67 invariants in 52 ms
[2024-06-07 10:41:51] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2024-06-07 10:41:51] [INFO ] Invariant cache hit.
[2024-06-07 10:41:51] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-07 10:41:53] [INFO ] Implicit Places using invariants and state equation in 2295 ms returned []
Implicit Place search using SMT with State Equation took 3431 ms to find 0 implicit places.
Running 2241 sub problems to find dead transitions.
[2024-06-07 10:41:53] [INFO ] Invariant cache hit.
[2024-06-07 10:41:53] [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 30078 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 76148ms problems are : Problem set: 60 solved, 2181 unsolved
Search for dead transitions found 60 dead transitions in 76193ms
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.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1159 transition count 2185
Applied a total of 30 rules in 68 ms. Remains 1159 /1189 variables (removed 30) and now considering 2185/2185 (removed 0) transitions.
// Phase 1: matrix 2185 rows 1159 cols
[2024-06-07 10:43:09] [INFO ] Computed 67 invariants in 18 ms
[2024-06-07 10:43:10] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-07 10:43:10] [INFO ] Invariant cache hit.
[2024-06-07 10:43:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:43:11] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1159/1189 places, 2185/2245 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82162 ms. Remains : 1159/1189 places, 2185/2245 transitions.
Support contains 100 out of 1159 places after structural reductions.
[2024-06-07 10:43:12] [INFO ] Flatten gal took : 217 ms
[2024-06-07 10:43:12] [INFO ] Flatten gal took : 139 ms
[2024-06-07 10:43:12] [INFO ] Input system was already deterministic with 2185 transitions.
RANDOM walk for 40000 steps (8 resets) in 4073 ms. (9 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
[2024-06-07 10:43:14] [INFO ] Invariant cache hit.
[2024-06-07 10:43:14] [INFO ] State equation strengthened by 7 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 14 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (OVERLAPS) 1059/1159 variables, 66/67 constraints. Problems are: Problem set: 11 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/3344 variables, 1/1233 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3344 variables, 0/1233 constraints. Problems are: Problem set: 11 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/3344 variables, 0/1233 constraints. Problems are: Problem set: 11 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3344/3344 variables, and 1233 constraints, problems are : Problem set: 11 solved, 7 unsolved in 1811 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 1159/1159 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 15/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 7 unsolved
[2024-06-07 10:43:16] [INFO ] Deduced a trap composed of 66 places in 306 ms of which 10 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 12 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 6 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 3 (OVERLAPS) 1059/1159 variables, 66/68 constraints. Problems are: Problem set: 13 solved, 5 unsolved
[2024-06-07 10:43:18] [INFO ] Deduced a trap composed of 96 places in 787 ms of which 12 ms to minimize.
[2024-06-07 10:43:18] [INFO ] Deduced a trap composed of 96 places in 590 ms of which 7 ms to minimize.
[2024-06-07 10:43:19] [INFO ] Deduced a trap composed of 294 places in 576 ms of which 6 ms to minimize.
[2024-06-07 10:43:20] [INFO ] Deduced a trap composed of 96 places in 806 ms of which 8 ms to minimize.
[2024-06-07 10:43:20] [INFO ] Deduced a trap composed of 96 places in 759 ms of which 7 ms to minimize.
[2024-06-07 10:43:21] [INFO ] Deduced a trap composed of 96 places in 766 ms of which 7 ms to minimize.
SMT process timed out in 7113ms, After SMT, problems are : Problem set: 13 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 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 3135 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 3136 ms. Remains : 1159/1159 places, 2184/2185 transitions.
RANDOM walk for 40000 steps (8 resets) in 1788 ms. (22 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1398 ms. (28 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 349 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 2/2 properties
// Phase 1: matrix 2184 rows 1159 cols
[2024-06-07 10:43:26] [INFO ] Computed 67 invariants in 12 ms
[2024-06-07 10:43:26] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1093/1159 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (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 879 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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1093/1159 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:43:28] [INFO ] Deduced a trap composed of 96 places in 857 ms of which 8 ms to minimize.
[2024-06-07 10:43:28] [INFO ] Deduced a trap composed of 96 places in 799 ms of which 7 ms to minimize.
[2024-06-07 10:43:29] [INFO ] Deduced a trap composed of 234 places in 743 ms of which 8 ms to minimize.
[2024-06-07 10:43:30] [INFO ] Deduced a trap composed of 96 places in 746 ms of which 7 ms to minimize.
[2024-06-07 10:43:31] [INFO ] Deduced a trap composed of 96 places in 754 ms of which 8 ms to minimize.
[2024-06-07 10:43:32] [INFO ] Deduced a trap composed of 234 places in 804 ms of which 8 ms to minimize.
[2024-06-07 10:43:32] [INFO ] Deduced a trap composed of 96 places in 802 ms of which 7 ms to minimize.
[2024-06-07 10:43:33] [INFO ] Deduced a trap composed of 174 places in 809 ms of which 8 ms to minimize.
[2024-06-07 10:43:34] [INFO ] Deduced a trap composed of 96 places in 807 ms of which 7 ms to minimize.
[2024-06-07 10:43:35] [INFO ] Deduced a trap composed of 96 places in 783 ms of which 8 ms to minimize.
[2024-06-07 10:43:36] [INFO ] Deduced a trap composed of 300 places in 776 ms of which 7 ms to minimize.
[2024-06-07 10:43:36] [INFO ] Deduced a trap composed of 66 places in 775 ms of which 7 ms to minimize.
[2024-06-07 10:43:37] [INFO ] Deduced a trap composed of 96 places in 751 ms of which 8 ms to minimize.
[2024-06-07 10:43:38] [INFO ] Deduced a trap composed of 276 places in 753 ms of which 8 ms to minimize.
[2024-06-07 10:43:39] [INFO ] Deduced a trap composed of 216 places in 756 ms of which 7 ms to minimize.
[2024-06-07 10:43:40] [INFO ] Deduced a trap composed of 96 places in 809 ms of which 7 ms to minimize.
[2024-06-07 10:43:40] [INFO ] Deduced a trap composed of 304 places in 795 ms of which 7 ms to minimize.
[2024-06-07 10:43:41] [INFO ] Deduced a trap composed of 276 places in 828 ms of which 7 ms to minimize.
[2024-06-07 10:43:42] [INFO ] Deduced a trap composed of 66 places in 802 ms of which 8 ms to minimize.
[2024-06-07 10:43:43] [INFO ] Deduced a trap composed of 264 places in 779 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:43:44] [INFO ] Deduced a trap composed of 294 places in 739 ms of which 7 ms to minimize.
[2024-06-07 10:43:44] [INFO ] Deduced a trap composed of 96 places in 703 ms of which 7 ms to minimize.
[2024-06-07 10:43:45] [INFO ] Deduced a trap composed of 34 places in 727 ms of which 7 ms to minimize.
[2024-06-07 10:43:46] [INFO ] Deduced a trap composed of 150 places in 738 ms of which 7 ms to minimize.
[2024-06-07 10:43:47] [INFO ] Deduced a trap composed of 250 places in 838 ms of which 8 ms to minimize.
[2024-06-07 10:43:48] [INFO ] Deduced a trap composed of 216 places in 814 ms of which 8 ms to minimize.
[2024-06-07 10:43:48] [INFO ] Deduced a trap composed of 96 places in 766 ms of which 8 ms to minimize.
[2024-06-07 10:43:49] [INFO ] Deduced a trap composed of 294 places in 795 ms of which 12 ms to minimize.
[2024-06-07 10:43:50] [INFO ] Deduced a trap composed of 250 places in 742 ms of which 8 ms to minimize.
[2024-06-07 10:43:51] [INFO ] Deduced a trap composed of 250 places in 787 ms of which 7 ms to minimize.
[2024-06-07 10:43:52] [INFO ] Deduced a trap composed of 66 places in 798 ms of which 8 ms to minimize.
[2024-06-07 10:43:53] [INFO ] Deduced a trap composed of 96 places in 788 ms of which 7 ms to minimize.
[2024-06-07 10:43:53] [INFO ] Deduced a trap composed of 196 places in 788 ms of which 7 ms to minimize.
[2024-06-07 10:43:54] [INFO ] Deduced a trap composed of 96 places in 810 ms of which 7 ms to minimize.
[2024-06-07 10:43:55] [INFO ] Deduced a trap composed of 96 places in 792 ms of which 8 ms to minimize.
[2024-06-07 10:43:56] [INFO ] Deduced a trap composed of 96 places in 789 ms of which 8 ms to minimize.
[2024-06-07 10:43:57] [INFO ] Deduced a trap composed of 96 places in 797 ms of which 8 ms to minimize.
[2024-06-07 10:43:57] [INFO ] Deduced a trap composed of 34 places in 792 ms of which 7 ms to minimize.
[2024-06-07 10:43:58] [INFO ] Deduced a trap composed of 96 places in 809 ms of which 7 ms to minimize.
[2024-06-07 10:43:59] [INFO ] Deduced a trap composed of 150 places in 803 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:00] [INFO ] Deduced a trap composed of 250 places in 805 ms of which 7 ms to minimize.
[2024-06-07 10:44:01] [INFO ] Deduced a trap composed of 96 places in 792 ms of which 8 ms to minimize.
[2024-06-07 10:44:02] [INFO ] Deduced a trap composed of 300 places in 795 ms of which 7 ms to minimize.
[2024-06-07 10:44:02] [INFO ] Deduced a trap composed of 196 places in 800 ms of which 8 ms to minimize.
[2024-06-07 10:44:03] [INFO ] Deduced a trap composed of 96 places in 798 ms of which 8 ms to minimize.
[2024-06-07 10:44:04] [INFO ] Deduced a trap composed of 66 places in 821 ms of which 7 ms to minimize.
[2024-06-07 10:44:05] [INFO ] Deduced a trap composed of 96 places in 762 ms of which 7 ms to minimize.
[2024-06-07 10:44:06] [INFO ] Deduced a trap composed of 264 places in 794 ms of which 7 ms to minimize.
[2024-06-07 10:44:07] [INFO ] Deduced a trap composed of 96 places in 752 ms of which 17 ms to minimize.
[2024-06-07 10:44:07] [INFO ] Deduced a trap composed of 250 places in 786 ms of which 8 ms to minimize.
[2024-06-07 10:44:08] [INFO ] Deduced a trap composed of 96 places in 762 ms of which 7 ms to minimize.
[2024-06-07 10:44:09] [INFO ] Deduced a trap composed of 216 places in 775 ms of which 7 ms to minimize.
[2024-06-07 10:44:10] [INFO ] Deduced a trap composed of 300 places in 839 ms of which 9 ms to minimize.
[2024-06-07 10:44:11] [INFO ] Deduced a trap composed of 96 places in 736 ms of which 8 ms to minimize.
[2024-06-07 10:44:11] [INFO ] Deduced a trap composed of 96 places in 760 ms of which 18 ms to minimize.
[2024-06-07 10:44:12] [INFO ] Deduced a trap composed of 250 places in 771 ms of which 8 ms to minimize.
SMT process timed out in 46651ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 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 2237 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 2237 ms. Remains : 1159/1159 places, 2184/2184 transitions.
RANDOM walk for 40000 steps (8 resets) in 1378 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 202639 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 2
Probabilistic random walk after 202639 steps, saw 173157 distinct states, run finished after 3005 ms. (steps per millisecond=67 ) properties seen :0
[2024-06-07 10:44:18] [INFO ] Invariant cache hit.
[2024-06-07 10:44:18] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1093/1159 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2184/3343 variables, 1159/1226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3343 variables, 6/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3343 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (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 985 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/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1093/1159 variables, 67/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:20] [INFO ] Deduced a trap composed of 96 places in 804 ms of which 7 ms to minimize.
[2024-06-07 10:44:21] [INFO ] Deduced a trap composed of 96 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:44:22] [INFO ] Deduced a trap composed of 96 places in 794 ms of which 7 ms to minimize.
[2024-06-07 10:44:22] [INFO ] Deduced a trap composed of 96 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:44:23] [INFO ] Deduced a trap composed of 250 places in 792 ms of which 7 ms to minimize.
[2024-06-07 10:44:24] [INFO ] Deduced a trap composed of 96 places in 789 ms of which 7 ms to minimize.
[2024-06-07 10:44:25] [INFO ] Deduced a trap composed of 66 places in 763 ms of which 7 ms to minimize.
[2024-06-07 10:44:26] [INFO ] Deduced a trap composed of 96 places in 804 ms of which 7 ms to minimize.
[2024-06-07 10:44:27] [INFO ] Deduced a trap composed of 96 places in 822 ms of which 7 ms to minimize.
[2024-06-07 10:44:27] [INFO ] Deduced a trap composed of 304 places in 819 ms of which 8 ms to minimize.
[2024-06-07 10:44:28] [INFO ] Deduced a trap composed of 96 places in 801 ms of which 7 ms to minimize.
[2024-06-07 10:44:29] [INFO ] Deduced a trap composed of 96 places in 817 ms of which 8 ms to minimize.
[2024-06-07 10:44:30] [INFO ] Deduced a trap composed of 66 places in 817 ms of which 7 ms to minimize.
[2024-06-07 10:44:31] [INFO ] Deduced a trap composed of 96 places in 803 ms of which 8 ms to minimize.
[2024-06-07 10:44:32] [INFO ] Deduced a trap composed of 96 places in 810 ms of which 8 ms to minimize.
[2024-06-07 10:44:32] [INFO ] Deduced a trap composed of 96 places in 809 ms of which 7 ms to minimize.
[2024-06-07 10:44:33] [INFO ] Deduced a trap composed of 96 places in 803 ms of which 7 ms to minimize.
[2024-06-07 10:44:34] [INFO ] Deduced a trap composed of 96 places in 801 ms of which 7 ms to minimize.
[2024-06-07 10:44:35] [INFO ] Deduced a trap composed of 96 places in 807 ms of which 8 ms to minimize.
[2024-06-07 10:44:36] [INFO ] Deduced a trap composed of 96 places in 775 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:37] [INFO ] Deduced a trap composed of 66 places in 805 ms of which 8 ms to minimize.
[2024-06-07 10:44:37] [INFO ] Deduced a trap composed of 34 places in 818 ms of which 8 ms to minimize.
[2024-06-07 10:44:38] [INFO ] Deduced a trap composed of 66 places in 744 ms of which 8 ms to minimize.
[2024-06-07 10:44:39] [INFO ] Deduced a trap composed of 294 places in 798 ms of which 7 ms to minimize.
[2024-06-07 10:44:40] [INFO ] Deduced a trap composed of 96 places in 799 ms of which 7 ms to minimize.
[2024-06-07 10:44:41] [INFO ] Deduced a trap composed of 150 places in 771 ms of which 7 ms to minimize.
[2024-06-07 10:44:41] [INFO ] Deduced a trap composed of 96 places in 781 ms of which 7 ms to minimize.
[2024-06-07 10:44:42] [INFO ] Deduced a trap composed of 96 places in 775 ms of which 7 ms to minimize.
[2024-06-07 10:44:43] [INFO ] Deduced a trap composed of 96 places in 767 ms of which 7 ms to minimize.
[2024-06-07 10:44:44] [INFO ] Deduced a trap composed of 96 places in 781 ms of which 7 ms to minimize.
[2024-06-07 10:44:45] [INFO ] Deduced a trap composed of 124 places in 782 ms of which 7 ms to minimize.
[2024-06-07 10:44:46] [INFO ] Deduced a trap composed of 174 places in 811 ms of which 7 ms to minimize.
[2024-06-07 10:44:46] [INFO ] Deduced a trap composed of 96 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:44:47] [INFO ] Deduced a trap composed of 96 places in 780 ms of which 7 ms to minimize.
[2024-06-07 10:44:48] [INFO ] Deduced a trap composed of 174 places in 772 ms of which 7 ms to minimize.
[2024-06-07 10:44:49] [INFO ] Deduced a trap composed of 96 places in 772 ms of which 7 ms to minimize.
[2024-06-07 10:44:50] [INFO ] Deduced a trap composed of 286 places in 812 ms of which 8 ms to minimize.
[2024-06-07 10:44:50] [INFO ] Deduced a trap composed of 174 places in 803 ms of which 8 ms to minimize.
[2024-06-07 10:44:51] [INFO ] Deduced a trap composed of 124 places in 727 ms of which 7 ms to minimize.
[2024-06-07 10:44:52] [INFO ] Deduced a trap composed of 96 places in 804 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:44:53] [INFO ] Deduced a trap composed of 66 places in 777 ms of which 7 ms to minimize.
[2024-06-07 10:44:54] [INFO ] Deduced a trap composed of 174 places in 782 ms of which 7 ms to minimize.
[2024-06-07 10:44:54] [INFO ] Deduced a trap composed of 174 places in 760 ms of which 7 ms to minimize.
[2024-06-07 10:44:55] [INFO ] Deduced a trap composed of 96 places in 742 ms of which 7 ms to minimize.
[2024-06-07 10:44:56] [INFO ] Deduced a trap composed of 66 places in 750 ms of which 7 ms to minimize.
[2024-06-07 10:44:57] [INFO ] Deduced a trap composed of 66 places in 774 ms of which 7 ms to minimize.
[2024-06-07 10:44:58] [INFO ] Deduced a trap composed of 150 places in 781 ms of which 6 ms to minimize.
[2024-06-07 10:44:58] [INFO ] Deduced a trap composed of 96 places in 787 ms of which 7 ms to minimize.
[2024-06-07 10:44:59] [INFO ] Deduced a trap composed of 234 places in 764 ms of which 7 ms to minimize.
[2024-06-07 10:45:00] [INFO ] Deduced a trap composed of 96 places in 765 ms of which 7 ms to minimize.
[2024-06-07 10:45:01] [INFO ] Deduced a trap composed of 276 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:45:02] [INFO ] Deduced a trap composed of 66 places in 776 ms of which 7 ms to minimize.
[2024-06-07 10:45:02] [INFO ] Deduced a trap composed of 174 places in 730 ms of which 7 ms to minimize.
[2024-06-07 10:45:03] [INFO ] Deduced a trap composed of 66 places in 765 ms of which 7 ms to minimize.
[2024-06-07 10:45:04] [INFO ] Deduced a trap composed of 96 places in 809 ms of which 7 ms to minimize.
[2024-06-07 10:45:05] [INFO ] Deduced a trap composed of 96 places in 766 ms of which 7 ms to minimize.
[2024-06-07 10:45:06] [INFO ] Deduced a trap composed of 96 places in 775 ms of which 8 ms to minimize.
[2024-06-07 10:45:06] [INFO ] Deduced a trap composed of 196 places in 781 ms of which 7 ms to minimize.
[2024-06-07 10:45:07] [INFO ] Deduced a trap composed of 150 places in 777 ms of which 7 ms to minimize.
[2024-06-07 10:45:08] [INFO ] Deduced a trap composed of 96 places in 761 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1159 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:45:09] [INFO ] Deduced a trap composed of 234 places in 810 ms of which 8 ms to minimize.
[2024-06-07 10:45:10] [INFO ] Deduced a trap composed of 306 places in 810 ms of which 8 ms to minimize.
[2024-06-07 10:45:10] [INFO ] Deduced a trap composed of 96 places in 806 ms of which 8 ms to minimize.
[2024-06-07 10:45:11] [INFO ] Deduced a trap composed of 96 places in 758 ms of which 7 ms to minimize.
[2024-06-07 10:45:12] [INFO ] Deduced a trap composed of 124 places in 756 ms of which 8 ms to minimize.
[2024-06-07 10:45:13] [INFO ] Deduced a trap composed of 300 places in 786 ms of which 9 ms to minimize.
[2024-06-07 10:45:14] [INFO ] Deduced a trap composed of 124 places in 779 ms of which 8 ms to minimize.
[2024-06-07 10:45:15] [INFO ] Deduced a trap composed of 34 places in 781 ms of which 9 ms to minimize.
[2024-06-07 10:45:15] [INFO ] Deduced a trap composed of 96 places in 750 ms of which 7 ms to minimize.
[2024-06-07 10:45:16] [INFO ] Deduced a trap composed of 66 places in 714 ms of which 7 ms to minimize.
[2024-06-07 10:45:17] [INFO ] Deduced a trap composed of 124 places in 780 ms of which 7 ms to minimize.
[2024-06-07 10:45:18] [INFO ] Deduced a trap composed of 306 places in 784 ms of which 7 ms to minimize.
[2024-06-07 10:45:19] [INFO ] Deduced a trap composed of 150 places in 778 ms of which 7 ms to minimize.
[2024-06-07 10:45:19] [INFO ] Deduced a trap composed of 234 places in 754 ms of which 7 ms to minimize.
[2024-06-07 10:45:20] [INFO ] Deduced a trap composed of 96 places in 699 ms of which 6 ms to minimize.
[2024-06-07 10:45:21] [INFO ] Deduced a trap composed of 96 places in 769 ms of which 7 ms to minimize.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Int declared 1159/3343 variables, and 143 constraints, problems are : Problem set: 2 solved, 0 unsolved in 63533 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 76/76 constraints]
After SMT, in 64553ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 15 atomic propositions for a total of 14 simplifications.
FORMULA BlocksWorld-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&F(((p1&&X(F(p2)))||G(F(p2))))))))'
Support contains 67 out of 1159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 34 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
// Phase 1: matrix 2185 rows 1159 cols
[2024-06-07 10:45:23] [INFO ] Computed 67 invariants in 14 ms
[2024-06-07 10:45:24] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-06-07 10:45:24] [INFO ] Invariant cache hit.
[2024-06-07 10:45:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:45:25] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2495 ms to find 0 implicit places.
Running 2181 sub problems to find dead transitions.
[2024-06-07 10:45:25] [INFO ] Invariant cache hit.
[2024-06-07 10:45:26] [INFO ] State equation strengthened by 7 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 0.0)
(s35 0.0)
(s36 1.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 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.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 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.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 0.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 1.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 0.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 1.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 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.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)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.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 0.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 1.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 0.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 1.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)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.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 0.0)
(s349 0.0)
(s350 0.0)
(s351timeout
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, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3344 variables, and 60 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 2181/1093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-06-07 10:46:15] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3344 variables, and 61 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1088/1093 constraints, Known Traps: 1/1 constraints]
After SMT, in 76772ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 76792ms
Finished structural reductions in LTL mode , in 1 iterations and 79336 ms. Remains : 1159/1159 places, 2185/2185 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-02
Product exploration explored 100000 steps with 15 reset in 2590 ms.
Stack based approach found an accepted trace after 39241 steps with 11 reset with depth 3 and stack size 3 in 1014 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-02 finished in 83408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 1159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 313 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
[2024-06-07 10:46:47] [INFO ] Invariant cache hit.
[2024-06-07 10:46:47] [INFO ] Implicit Places using invariants in 701 ms returned []
[2024-06-07 10:46:47] [INFO ] Invariant cache hit.
[2024-06-07 10:46:48] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:46:49] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2520 ms to find 0 implicit places.
[2024-06-07 10:46:49] [INFO ] Redundant transitions in 147 ms returned []
Running 2181 sub problems to find dead transitions.
[2024-06-07 10:46:49] [INFO ] Invariant cache hit.
[2024-06-07 10:46:49] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3344 variables, and 60 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 2181/1093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-06-07 10:47:39] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3344 variables, and 61 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1088/1093 constraints, Known Traps: 1/1 constraints]
After SMT, in 77044ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 77065ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80060 ms. Remains : 1159/1159 places, 2185/2185 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 2249 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-05 finished in 82378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p0)))))'
Support contains 1 out of 1159 places. Attempting structural reductions.
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.
[2024-06-07 10:48:09] [INFO ] Invariant cache hit.
[2024-06-07 10:48:10] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-06-07 10:48:10] [INFO ] Invariant cache hit.
[2024-06-07 10:48:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:48:11] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2763 ms to find 0 implicit places.
Running 2181 sub problems to find dead transitions.
[2024-06-07 10:48:12] [INFO ] Invariant cache hit.
[2024-06-07 10:48:12] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3344 variables, and 60 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 2181/1093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-06-07 10:49:01] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3344 variables, and 61 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1088/1093 constraints, Known Traps: 1/1 constraints]
After SMT, in 76628ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 76646ms
Finished structural reductions in LTL mode , in 1 iterations and 79447 ms. Remains : 1159/1159 places, 2185/2185 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 2270 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-10 finished in 81938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 156 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
[2024-06-07 10:49:31] [INFO ] Invariant cache hit.
[2024-06-07 10:49:31] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-07 10:49:31] [INFO ] Invariant cache hit.
[2024-06-07 10:49:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:49:33] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2444 ms to find 0 implicit places.
[2024-06-07 10:49:33] [INFO ] Redundant transitions in 102 ms returned []
Running 2181 sub problems to find dead transitions.
[2024-06-07 10:49:33] [INFO ] Invariant cache hit.
[2024-06-07 10:49:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3344 variables, and 60 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 2181/1093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-06-07 10:50:24] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3344 variables, and 61 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1088/1093 constraints, Known Traps: 1/1 constraints]
After SMT, in 77742ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 77764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80480 ms. Remains : 1159/1159 places, 2185/2185 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 2232 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-12 finished in 82790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 1159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 33 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
[2024-06-07 10:50:53] [INFO ] Invariant cache hit.
[2024-06-07 10:50:54] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-06-07 10:50:54] [INFO ] Invariant cache hit.
[2024-06-07 10:50:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:50:56] [INFO ] Implicit Places using invariants and state equation in 1881 ms returned []
Implicit Place search using SMT with State Equation took 2649 ms to find 0 implicit places.
Running 2181 sub problems to find dead transitions.
[2024-06-07 10:50:56] [INFO ] Invariant cache hit.
[2024-06-07 10:50:56] [INFO ] State equation strengthened by 7 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3344 variables, and 60 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 2181/1093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-06-07 10:51:46] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3344 variables, and 61 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1088/1093 constraints, Known Traps: 1/1 constraints]
After SMT, in 77182ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 77204ms
Finished structural reductions in LTL mode , in 1 iterations and 79893 ms. Remains : 1159/1159 places, 2185/2185 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-13 finished in 80077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(!p0)))))'
Support contains 1 out of 1159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1159/1159 places, 2185/2185 transitions.
Applied a total of 0 rules in 28 ms. Remains 1159 /1159 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
[2024-06-07 10:52:14] [INFO ] Invariant cache hit.
[2024-06-07 10:52:14] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-06-07 10:52:14] [INFO ] Invariant cache hit.
[2024-06-07 10:52:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-07 10:52:16] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
Running 2181 sub problems to find dead transitions.
[2024-06-07 10:52:16] [INFO ] Invariant cache hit.
[2024-06-07 10:52:16] [INFO ] State equation strengthened by 7 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 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.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 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.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 0.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 1.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 0.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 1.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 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.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)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.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 0.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 1.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 0.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 1.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)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.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 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.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 0.0)
(s387 0.0)
(s388 1.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)
(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 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 timeout
0.0)
(s468 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, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1155/3344 variables, and 60 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 2181/1093 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1155 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
[2024-06-07 10:53:05] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1155/3344 variables, and 61 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 60/67 constraints, State Equation: 0/1159 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1088/1093 constraints, Known Traps: 1/1 constraints]
After SMT, in 76231ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 76251ms
Finished structural reductions in LTL mode , in 1 iterations and 78929 ms. Remains : 1159/1159 places, 2185/2185 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, true, p0, true]
Running random walk in product with property : BlocksWorld-PT-06-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-06-LTLCardinality-14 finished in 79101 ms.
All properties solved by simple procedures.
Total runtime 703759 ms.
ITS solved all properties within timeout
BK_STOP 1717757613131
--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BlocksWorld-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r601-tall-171774423900203"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;