About the Execution of LTSMin+red for BlocksWorld-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4910.315 | 837382.00 | 1166706.00 | 2170.20 | FFFFFTTFFTTFTF?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-171774426800195.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BlocksWorld-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 190K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 859K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 153K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 637K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 502K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 783K Jun 7 06:26 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717746421177
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:47:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:47:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:47:02] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-07 07:47:02] [INFO ] Transformed 869 places.
[2024-06-07 07:47:02] [INFO ] Transformed 1625 transitions.
[2024-06-07 07:47:02] [INFO ] Found NUPN structural information;
[2024-06-07 07:47:02] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27]
[2024-06-07 07:47:02] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BlocksWorld-PT-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1625/1625 transitions.
Applied a total of 0 rules in 94 ms. Remains 869 /869 variables (removed 0) and now considering 1625/1625 (removed 0) transitions.
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 07:47:02] [INFO ] Computed 57 invariants in 42 ms
[2024-06-07 07:47:03] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-06-07 07:47:03] [INFO ] Invariant cache hit.
[2024-06-07 07:47:04] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-07 07:47:05] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
Running 1619 sub problems to find dead transitions.
[2024-06-07 07:47:05] [INFO ] Invariant cache hit.
[2024-06-07 07:47:05] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
[2024-06-07 07:47:35] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 23 ms to minimize.
[2024-06-07 07:47:35] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:47:36] [INFO ] Deduced a trap composed of 144 places in 216 ms of which 3 ms to minimize.
[2024-06-07 07:47:36] [INFO ] Deduced a trap composed of 125 places in 172 ms of which 2 ms to minimize.
[2024-06-07 07:47:36] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.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 1.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 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.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 1.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 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.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 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.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 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.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)
(s247 0.0)
(s248 0.0)
(s249 1.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 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.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 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 timeout
0.0)
(s297 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2494 variables, and 51 constraints, problems are : Problem set: 46 solved, 1573 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 1596/813 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 5/11 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/869 variables, 51/62 constraints. Problems are: Problem set: 56 solved, 1563 unsolved
[2024-06-07 07:48:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:48:07] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:48:07] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:48:08] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:48:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2494 variables, and 67 constraints, problems are : Problem set: 56 solved, 1563 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 783/813 constraints, Known Traps: 10/10 constraints]
After SMT, in 70814ms problems are : Problem set: 56 solved, 1563 unsolved
Search for dead transitions found 56 dead transitions in 70851ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in LTL mode, iteration 1 : 869/869 places, 1569/1625 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 841 transition count 1569
Applied a total of 28 rules in 25 ms. Remains 841 /869 variables (removed 28) and now considering 1569/1569 (removed 0) transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 07:48:15] [INFO ] Computed 57 invariants in 9 ms
[2024-06-07 07:48:16] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-07 07:48:16] [INFO ] Invariant cache hit.
[2024-06-07 07:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:48:17] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 841/869 places, 1569/1625 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74645 ms. Remains : 841/869 places, 1569/1625 transitions.
Support contains 85 out of 841 places after structural reductions.
[2024-06-07 07:48:17] [INFO ] Flatten gal took : 162 ms
[2024-06-07 07:48:17] [INFO ] Flatten gal took : 115 ms
[2024-06-07 07:48:18] [INFO ] Input system was already deterministic with 1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 3643 ms. (10 steps per ms) remains 11/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 366 ms. (109 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
[2024-06-07 07:48:20] [INFO ] Invariant cache hit.
[2024-06-07 07:48:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 781/841 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 9 solved, 2 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 784/841 variables, 57/57 constraints. Problems are: Problem set: 9 solved, 2 unsolved
[2024-06-07 07:48:21] [INFO ] Deduced a trap composed of 56 places in 449 ms of which 5 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-06-07 07:48:21] [INFO ] Deduced a trap composed of 81 places in 459 ms of which 5 ms to minimize.
[2024-06-07 07:48:22] [INFO ] Deduced a trap composed of 125 places in 461 ms of which 5 ms to minimize.
[2024-06-07 07:48:22] [INFO ] Deduced a trap composed of 81 places in 454 ms of which 5 ms to minimize.
[2024-06-07 07:48:23] [INFO ] Deduced a trap composed of 81 places in 456 ms of which 5 ms to minimize.
[2024-06-07 07:48:23] [INFO ] Deduced a trap composed of 81 places in 457 ms of which 5 ms to minimize.
[2024-06-07 07:48:24] [INFO ] Deduced a trap composed of 125 places in 456 ms of which 5 ms to minimize.
[2024-06-07 07:48:24] [INFO ] Deduced a trap composed of 81 places in 468 ms of which 5 ms to minimize.
[2024-06-07 07:48:25] [INFO ] Deduced a trap composed of 125 places in 453 ms of which 5 ms to minimize.
[2024-06-07 07:48:25] [INFO ] Deduced a trap composed of 56 places in 451 ms of which 5 ms to minimize.
[2024-06-07 07:48:26] [INFO ] Deduced a trap composed of 104 places in 426 ms of which 5 ms to minimize.
SMT process timed out in 6067ms, After SMT, problems are : Problem set: 9 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 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 841 transition count 1568
Applied a total of 1 rules in 2165 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2165 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 966 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 555182 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 555182 steps, saw 475075 distinct states, run finished after 3004 ms. (steps per millisecond=184 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 07:48:31] [INFO ] Computed 57 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 784/812 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/812 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 29/841 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 784/812 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/812 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/841 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:48:32] [INFO ] Deduced a trap composed of 81 places in 411 ms of which 5 ms to minimize.
[2024-06-07 07:48:33] [INFO ] Deduced a trap composed of 81 places in 418 ms of which 5 ms to minimize.
[2024-06-07 07:48:33] [INFO ] Deduced a trap composed of 56 places in 421 ms of which 4 ms to minimize.
[2024-06-07 07:48:34] [INFO ] Deduced a trap composed of 81 places in 432 ms of which 5 ms to minimize.
[2024-06-07 07:48:34] [INFO ] Deduced a trap composed of 176 places in 428 ms of which 5 ms to minimize.
[2024-06-07 07:48:35] [INFO ] Deduced a trap composed of 81 places in 430 ms of which 5 ms to minimize.
[2024-06-07 07:48:35] [INFO ] Deduced a trap composed of 125 places in 424 ms of which 5 ms to minimize.
[2024-06-07 07:48:36] [INFO ] Deduced a trap composed of 56 places in 420 ms of which 5 ms to minimize.
[2024-06-07 07:48:36] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 5 ms to minimize.
[2024-06-07 07:48:36] [INFO ] Deduced a trap composed of 81 places in 456 ms of which 5 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 81 places in 479 ms of which 5 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 81 places in 461 ms of which 5 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 81 places in 439 ms of which 6 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 104 places in 429 ms of which 8 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 81 places in 413 ms of which 5 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 81 places in 414 ms of which 5 ms to minimize.
[2024-06-07 07:48:40] [INFO ] Deduced a trap composed of 81 places in 419 ms of which 5 ms to minimize.
[2024-06-07 07:48:40] [INFO ] Deduced a trap composed of 81 places in 421 ms of which 4 ms to minimize.
[2024-06-07 07:48:41] [INFO ] Deduced a trap composed of 144 places in 421 ms of which 5 ms to minimize.
[2024-06-07 07:48:41] [INFO ] Deduced a trap composed of 200 places in 449 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:48:41] [INFO ] Deduced a trap composed of 81 places in 427 ms of which 5 ms to minimize.
[2024-06-07 07:48:42] [INFO ] Deduced a trap composed of 81 places in 419 ms of which 4 ms to minimize.
[2024-06-07 07:48:42] [INFO ] Deduced a trap composed of 81 places in 412 ms of which 4 ms to minimize.
[2024-06-07 07:48:43] [INFO ] Deduced a trap composed of 176 places in 418 ms of which 5 ms to minimize.
[2024-06-07 07:48:43] [INFO ] Deduced a trap composed of 81 places in 461 ms of which 5 ms to minimize.
[2024-06-07 07:48:44] [INFO ] Deduced a trap composed of 81 places in 429 ms of which 5 ms to minimize.
[2024-06-07 07:48:44] [INFO ] Deduced a trap composed of 216 places in 425 ms of which 4 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 144 places in 423 ms of which 5 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 56 places in 442 ms of which 5 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 221 places in 429 ms of which 5 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 81 places in 436 ms of which 5 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 81 places in 432 ms of which 5 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 224 places in 435 ms of which 5 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 81 places in 428 ms of which 5 ms to minimize.
[2024-06-07 07:48:48] [INFO ] Deduced a trap composed of 125 places in 450 ms of which 5 ms to minimize.
[2024-06-07 07:48:48] [INFO ] Deduced a trap composed of 81 places in 424 ms of which 7 ms to minimize.
[2024-06-07 07:48:49] [INFO ] Deduced a trap composed of 56 places in 452 ms of which 5 ms to minimize.
[2024-06-07 07:48:49] [INFO ] Deduced a trap composed of 125 places in 452 ms of which 5 ms to minimize.
[2024-06-07 07:48:50] [INFO ] Deduced a trap composed of 81 places in 440 ms of which 5 ms to minimize.
[2024-06-07 07:48:50] [INFO ] Deduced a trap composed of 81 places in 453 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/841 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:48:51] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 5 ms to minimize.
[2024-06-07 07:48:51] [INFO ] Deduced a trap composed of 81 places in 416 ms of which 5 ms to minimize.
[2024-06-07 07:48:51] [INFO ] Deduced a trap composed of 125 places in 413 ms of which 5 ms to minimize.
[2024-06-07 07:48:52] [INFO ] Deduced a trap composed of 81 places in 452 ms of which 5 ms to minimize.
[2024-06-07 07:48:52] [INFO ] Deduced a trap composed of 56 places in 425 ms of which 5 ms to minimize.
[2024-06-07 07:48:53] [INFO ] Deduced a trap composed of 125 places in 422 ms of which 5 ms to minimize.
[2024-06-07 07:48:53] [INFO ] Deduced a trap composed of 81 places in 429 ms of which 5 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 189 places in 459 ms of which 6 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 125 places in 450 ms of which 5 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 104 places in 429 ms of which 6 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 125 places in 449 ms of which 5 ms to minimize.
[2024-06-07 07:48:56] [INFO ] Deduced a trap composed of 81 places in 420 ms of which 5 ms to minimize.
[2024-06-07 07:48:56] [INFO ] Deduced a trap composed of 56 places in 433 ms of which 5 ms to minimize.
[2024-06-07 07:48:57] [INFO ] Deduced a trap composed of 125 places in 444 ms of which 5 ms to minimize.
[2024-06-07 07:48:57] [INFO ] Deduced a trap composed of 81 places in 427 ms of which 5 ms to minimize.
[2024-06-07 07:48:57] [INFO ] Deduced a trap composed of 56 places in 445 ms of which 6 ms to minimize.
[2024-06-07 07:48:58] [INFO ] Deduced a trap composed of 104 places in 456 ms of which 5 ms to minimize.
[2024-06-07 07:48:58] [INFO ] Deduced a trap composed of 104 places in 447 ms of which 5 ms to minimize.
[2024-06-07 07:48:59] [INFO ] Deduced a trap composed of 81 places in 449 ms of which 5 ms to minimize.
[2024-06-07 07:48:59] [INFO ] Deduced a trap composed of 144 places in 448 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:49:00] [INFO ] Deduced a trap composed of 224 places in 443 ms of which 5 ms to minimize.
[2024-06-07 07:49:00] [INFO ] Deduced a trap composed of 81 places in 455 ms of which 5 ms to minimize.
[2024-06-07 07:49:01] [INFO ] Deduced a trap composed of 56 places in 453 ms of which 5 ms to minimize.
[2024-06-07 07:49:01] [INFO ] Deduced a trap composed of 161 places in 447 ms of which 5 ms to minimize.
[2024-06-07 07:49:02] [INFO ] Deduced a trap composed of 56 places in 457 ms of which 5 ms to minimize.
[2024-06-07 07:49:02] [INFO ] Deduced a trap composed of 81 places in 461 ms of which 5 ms to minimize.
[2024-06-07 07:49:03] [INFO ] Deduced a trap composed of 81 places in 425 ms of which 6 ms to minimize.
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 841/2409 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31578 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 67/67 constraints]
After SMT, in 32339ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-05-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA BlocksWorld-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)||(p1 U p2)))))'
Support contains 57 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 28 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 07:49:04] [INFO ] Computed 57 invariants in 17 ms
[2024-06-07 07:49:04] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-07 07:49:04] [INFO ] Invariant cache hit.
[2024-06-07 07:49:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:05] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:49:05] [INFO ] Invariant cache hit.
[2024-06-07 07:49:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:49:36] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 2 ms to minimize.
[2024-06-07 07:49:36] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 2 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 Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:49:49] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:50:09] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 2 ms to minimize.
[2024-06-07 07:50:09] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:50:10] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71846ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71861ms
Finished structural reductions in LTL mode , in 1 iterations and 73394 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-03
Product exploration explored 100000 steps with 2 reset in 1987 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BlocksWorld-PT-05-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLCardinality-03 finished in 75705 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(G(p0)))'
Support contains 28 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 15 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:50:19] [INFO ] Invariant cache hit.
[2024-06-07 07:50:20] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-06-07 07:50:20] [INFO ] Invariant cache hit.
[2024-06-07 07:50:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:50:21] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:50:21] [INFO ] Invariant cache hit.
[2024-06-07 07:50:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:50:51] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 3 ms to minimize.
[2024-06-07 07:50:51] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:51:03] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:51:24] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-06-07 07:51:24] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:51:24] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 07:51:25] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-06-07 07:51:25] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:51:25] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:51:25] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
[2024-06-07 07:51:25] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:51:25] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 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 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70496ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70521ms
Finished structural reductions in LTL mode , in 1 iterations and 72205 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLCardinality-04 finished in 72313 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 57 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:51:32] [INFO ] Invariant cache hit.
[2024-06-07 07:51:32] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-07 07:51:32] [INFO ] Invariant cache hit.
[2024-06-07 07:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:51:33] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:51:33] [INFO ] Invariant cache hit.
[2024-06-07 07:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:52:04] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-06-07 07:52:04] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:52:16] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:52:37] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-06-07 07:52:37] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:52:37] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-06-07 07:52:37] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 2 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71029ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71043ms
Finished structural reductions in LTL mode , in 1 iterations and 72420 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLCardinality-07 finished in 72578 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' '!(G(F((p0||G(p1)||G(p2)))))'
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 135 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:52:45] [INFO ] Invariant cache hit.
[2024-06-07 07:52:45] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-06-07 07:52:45] [INFO ] Invariant cache hit.
[2024-06-07 07:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:52:46] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2024-06-07 07:52:46] [INFO ] Redundant transitions in 101 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:52:46] [INFO ] Invariant cache hit.
[2024-06-07 07:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:53:17] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 2 ms to minimize.
[2024-06-07 07:53:17] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:53:29] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:53:49] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 2 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:53:50] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:53:51] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70933ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70947ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72893 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-11
Product exploration explored 100000 steps with 207 reset in 1786 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-05-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLCardinality-11 finished in 74786 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 1 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 96 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:53:59] [INFO ] Invariant cache hit.
[2024-06-07 07:54:00] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-07 07:54:00] [INFO ] Invariant cache hit.
[2024-06-07 07:54:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:54:01] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2024-06-07 07:54:01] [INFO ] Redundant transitions in 69 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:54:01] [INFO ] Invariant cache hit.
[2024-06-07 07:54:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:54:32] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 3 ms to minimize.
[2024-06-07 07:54:32] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 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 Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:54:44] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:55:06] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 1)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)timeout
(s510 0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71782ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71798ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73660 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 1628 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA BlocksWorld-PT-05-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLCardinality-13 finished in 75358 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' '!(G(F(p0)))'
Support contains 2 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 105 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:55:15] [INFO ] Invariant cache hit.
[2024-06-07 07:55:15] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-07 07:55:15] [INFO ] Invariant cache hit.
[2024-06-07 07:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:55:16] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
[2024-06-07 07:55:16] [INFO ] Redundant transitions in 26 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:55:16] [INFO ] Invariant cache hit.
[2024-06-07 07:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:55:46] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 3 ms to minimize.
[2024-06-07 07:55:46] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:55:58] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:56:19] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 07:56:19] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:56:19] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 1 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:56:20] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70360ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70376ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72283 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-14
Product exploration explored 100000 steps with 429 reset in 1713 ms.
Product exploration explored 100000 steps with 449 reset in 1762 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 232 steps (0 resets) in 11 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 92 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:56:31] [INFO ] Invariant cache hit.
[2024-06-07 07:56:31] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-07 07:56:31] [INFO ] Invariant cache hit.
[2024-06-07 07:56:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:56:33] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2024-06-07 07:56:33] [INFO ] Redundant transitions in 28 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:56:33] [INFO ] Invariant cache hit.
[2024-06-07 07:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:57:03] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-06-07 07:57:03] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.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)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 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 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 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 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.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 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)timeout
(s274 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:57:15] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:57:36] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-06-07 07:57:36] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:57:36] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-07 07:57:36] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 07:57:37] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:57:37] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:57:37] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-07 07:57:37] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:57:37] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70628ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72543 ms. Remains : 841/841 places, 1569/1569 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 398 steps (0 resets) in 12 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 447 reset in 1709 ms.
Product exploration explored 100000 steps with 495 reset in 1783 ms.
Support contains 2 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 76 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:57:48] [INFO ] Invariant cache hit.
[2024-06-07 07:57:48] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-07 07:57:48] [INFO ] Invariant cache hit.
[2024-06-07 07:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:57:49] [INFO ] Implicit Places using invariants and state equation in 1274 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
[2024-06-07 07:57:49] [INFO ] Redundant transitions in 26 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:57:49] [INFO ] Invariant cache hit.
[2024-06-07 07:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:58:19] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 2 ms to minimize.
[2024-06-07 07:58:19] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.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)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 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 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 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 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.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 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.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 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 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)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.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 0.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 1.0)
(s468 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:58:31] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:58:52] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:58:52] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:58:52] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-07 07:58:52] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-07 07:58:53] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:58:53] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:58:53] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:58:53] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:58:53] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70397ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72308 ms. Remains : 841/841 places, 1569/1569 transitions.
Treatment of property BlocksWorld-PT-05-LTLCardinality-14 finished in 225502 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)&&X(X(!p0))))'
Support contains 1 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 32 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:59:00] [INFO ] Invariant cache hit.
[2024-06-07 07:59:01] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-06-07 07:59:01] [INFO ] Invariant cache hit.
[2024-06-07 07:59:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:59:02] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:59:02] [INFO ] Invariant cache hit.
[2024-06-07 07:59:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:59:33] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 2 ms to minimize.
[2024-06-07 07:59:33] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 2 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 Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 07:59:45] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 08:00:06] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 2 ms to minimize.
[2024-06-07 08:00:06] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 08:00:06] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:00:06] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:00:07] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71630ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71646ms
Finished structural reductions in LTL mode , in 1 iterations and 73463 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), p0, p0, true]
Running random walk in product with property : BlocksWorld-PT-05-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 19517 steps with 79 reset in 343 ms.
FORMULA BlocksWorld-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLCardinality-15 finished in 74029 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' '!(G(F(p0)))'
[2024-06-07 08:00:14] [INFO ] Flatten gal took : 76 ms
[2024-06-07 08:00:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-07 08:00:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 841 places, 1569 transitions and 7830 arcs took 16 ms.
Total runtime 792505 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BlocksWorld-PT-05-LTLCardinality-14
BK_STOP 1717747258559
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BlocksWorld-PT-05-LTLCardinality-14
ltl formula formula --ltl=/tmp/1477/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 841 places, 1569 transitions and 7830 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.070 user 0.040 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1477/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1477/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1477/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1477/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 843 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 842, there are 1572 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2304 levels ~10000 states ~43612 transitions
pnml2lts-mc( 0/ 4): ~4625 levels ~20000 states ~90804 transitions
pnml2lts-mc( 0/ 4): ~9445 levels ~40000 states ~175256 transitions
pnml2lts-mc( 3/ 4): ~18431 levels ~80000 states ~404940 transitions
pnml2lts-mc( 3/ 4): ~37031 levels ~160000 states ~819408 transitions
pnml2lts-mc( 3/ 4): ~75122 levels ~320000 states ~1580672 transitions
pnml2lts-mc( 3/ 4): ~149637 levels ~640000 states ~3121852 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25960
pnml2lts-mc( 0/ 4): unique states count: 904158
pnml2lts-mc( 0/ 4): unique transitions count: 5102110
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1042946
pnml2lts-mc( 0/ 4): - claim success count: 904162
pnml2lts-mc( 0/ 4): - cum. max stack depth: 878005
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 904162 states 5102138 transitions, fanout: 5.643
pnml2lts-mc( 0/ 4): Total exploration time 42.640 sec (42.620 sec minimum, 42.635 sec on average)
pnml2lts-mc( 0/ 4): States per second: 21205, Transitions per second: 119656
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 92.9MB, 25.7 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1599 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 92.9MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BlocksWorld-PT-05, examination is 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 r605-tall-171774426800195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-05.tgz
mv BlocksWorld-PT-05 execution
cd execution
if [ "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 ;