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-171774426800196.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426800196
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717746642227

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
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:50:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:50:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:50:43] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-07 07:50:43] [INFO ] Transformed 869 places.
[2024-06-07 07:50:43] [INFO ] Transformed 1625 transitions.
[2024-06-07 07:50:43] [INFO ] Found NUPN structural information;
[2024-06-07 07:50:43] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27]
[2024-06-07 07:50:43] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 869 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 28 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:50:44] [INFO ] Computed 57 invariants in 28 ms
[2024-06-07 07:50:44] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-06-07 07:50:44] [INFO ] Invariant cache hit.
[2024-06-07 07:50:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-07 07:50:45] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
Running 1619 sub problems to find dead transitions.
[2024-06-07 07:50:45] [INFO ] Invariant cache hit.
[2024-06-07 07:50:45] [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:51:16] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 19 ms to minimize.
[2024-06-07 07:51:16] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:51:16] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 3 ms to minimize.
[2024-06-07 07:51:16] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
[2024-06-07 07:51:17] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
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 30066 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:51:49] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:51:50] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:51:50] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 6 ms to minimize.
[2024-06-07 07:51:51] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:51:51] [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 30034 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 71186ms problems are : Problem set: 56 solved, 1563 unsolved
Search for dead transitions found 56 dead transitions in 71227ms
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.
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 0 rules in 22 ms. Remains 869 /869 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72550 ms. Remains : 869/869 places, 1569/1625 transitions.
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Support contains 841 out of 841 places after structural reductions.
[2024-06-07 07:51:57] [INFO ] Flatten gal took : 244 ms
[2024-06-07 07:51:58] [INFO ] Flatten gal took : 200 ms
[2024-06-07 07:51:59] [INFO ] Input system was already deterministic with 1569 transitions.
Reduction of identical properties reduced properties to check from 24 to 20
RANDOM walk for 40000 steps (8 resets) in 5836 ms. (6 steps per ms) remains 5/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 743 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3290 ms. (12 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 5360 ms. (7 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 407 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 414 ms. (96 steps per ms) remains 5/5 properties
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 07:52:03] [INFO ] Computed 57 invariants in 9 ms
[2024-06-07 07:52:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 28/841 variables, 28/57 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-07 07:52:08] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 2 ms to minimize.
[2024-06-07 07:52:08] [INFO ] Deduced a trap composed of 125 places in 196 ms of which 3 ms to minimize.
[2024-06-07 07:52:09] [INFO ] Deduced a trap composed of 125 places in 417 ms of which 5 ms to minimize.
[2024-06-07 07:52:09] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-06-07 07:52:09] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 3 ms to minimize.
[2024-06-07 07:52:09] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 3 ms to minimize.
[2024-06-07 07:52:10] [INFO ] Deduced a trap composed of 161 places in 301 ms of which 5 ms to minimize.
[2024-06-07 07:52:10] [INFO ] Deduced a trap composed of 104 places in 270 ms of which 3 ms to minimize.
[2024-06-07 07:52:10] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 4 ms to minimize.
[2024-06-07 07:52:11] [INFO ] Deduced a trap composed of 200 places in 414 ms of which 5 ms to minimize.
[2024-06-07 07:52:11] [INFO ] Deduced a trap composed of 216 places in 397 ms of which 5 ms to minimize.
[2024-06-07 07:52:12] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 5 ms to minimize.
[2024-06-07 07:52:12] [INFO ] Deduced a trap composed of 144 places in 369 ms of which 5 ms to minimize.
[2024-06-07 07:52:13] [INFO ] Deduced a trap composed of 189 places in 402 ms of which 5 ms to minimize.
[2024-06-07 07:52:13] [INFO ] Deduced a trap composed of 221 places in 445 ms of which 5 ms to minimize.
SMT process timed out in 9752ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 813 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 242 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 243 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 2320 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 369 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5601 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 232078 steps, run timeout after 6001 ms. (steps per millisecond=38 ) properties seen :0 out of 3
Probabilistic random walk after 232078 steps, saw 199157 distinct states, run finished after 6009 ms. (steps per millisecond=38 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 07:52:22] [INFO ] Computed 57 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 28/841 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1157 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 2 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 125 places in 203 ms of which 3 ms to minimize.
[2024-06-07 07:52:26] [INFO ] Deduced a trap composed of 125 places in 452 ms of which 6 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 125 places in 208 ms of which 4 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 125 places in 200 ms of which 3 ms to minimize.
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 161 places in 305 ms of which 5 ms to minimize.
[2024-06-07 07:52:28] [INFO ] Deduced a trap composed of 104 places in 275 ms of which 4 ms to minimize.
[2024-06-07 07:52:28] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 5 ms to minimize.
[2024-06-07 07:52:29] [INFO ] Deduced a trap composed of 200 places in 395 ms of which 5 ms to minimize.
[2024-06-07 07:52:29] [INFO ] Deduced a trap composed of 216 places in 424 ms of which 5 ms to minimize.
[2024-06-07 07:52:29] [INFO ] Deduced a trap composed of 125 places in 375 ms of which 5 ms to minimize.
[2024-06-07 07:52:30] [INFO ] Deduced a trap composed of 144 places in 338 ms of which 4 ms to minimize.
[2024-06-07 07:52:30] [INFO ] Deduced a trap composed of 189 places in 386 ms of which 5 ms to minimize.
[2024-06-07 07:52:31] [INFO ] Deduced a trap composed of 221 places in 520 ms of which 5 ms to minimize.
[2024-06-07 07:52:31] [INFO ] Deduced a trap composed of 161 places in 447 ms of which 5 ms to minimize.
[2024-06-07 07:52:32] [INFO ] Deduced a trap composed of 200 places in 454 ms of which 7 ms to minimize.
[2024-06-07 07:52:32] [INFO ] Deduced a trap composed of 209 places in 423 ms of which 5 ms to minimize.
[2024-06-07 07:52:33] [INFO ] Deduced a trap composed of 176 places in 448 ms of which 5 ms to minimize.
[2024-06-07 07:52:33] [INFO ] Deduced a trap composed of 200 places in 494 ms of which 5 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 125 places in 453 ms of which 4 ms to minimize.
[2024-06-07 07:52:34] [INFO ] Deduced a trap composed of 161 places in 438 ms of which 5 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 56 places in 438 ms of which 5 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 144 places in 436 ms of which 5 ms to minimize.
[2024-06-07 07:52:36] [INFO ] Deduced a trap composed of 176 places in 440 ms of which 5 ms to minimize.
[2024-06-07 07:52:36] [INFO ] Deduced a trap composed of 104 places in 439 ms of which 6 ms to minimize.
[2024-06-07 07:52:37] [INFO ] Deduced a trap composed of 56 places in 437 ms of which 5 ms to minimize.
[2024-06-07 07:52:37] [INFO ] Deduced a trap composed of 125 places in 447 ms of which 5 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 104 places in 439 ms of which 5 ms to minimize.
[2024-06-07 07:52:38] [INFO ] Deduced a trap composed of 225 places in 432 ms of which 5 ms to minimize.
[2024-06-07 07:52:39] [INFO ] Deduced a trap composed of 176 places in 441 ms of which 5 ms to minimize.
[2024-06-07 07:52:39] [INFO ] Deduced a trap composed of 200 places in 440 ms of which 9 ms to minimize.
[2024-06-07 07:52:40] [INFO ] Deduced a trap composed of 104 places in 430 ms of which 5 ms to minimize.
[2024-06-07 07:52:40] [INFO ] Deduced a trap composed of 81 places in 417 ms of which 5 ms to minimize.
[2024-06-07 07:52:41] [INFO ] Deduced a trap composed of 209 places in 354 ms of which 4 ms to minimize.
[2024-06-07 07:52:41] [INFO ] Deduced a trap composed of 209 places in 350 ms of which 5 ms to minimize.
[2024-06-07 07:52:41] [INFO ] Deduced a trap composed of 225 places in 435 ms of which 5 ms to minimize.
[2024-06-07 07:52:42] [INFO ] Deduced a trap composed of 216 places in 313 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/813 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 07:52:42] [INFO ] Deduced a trap composed of 189 places in 416 ms of which 6 ms to minimize.
[2024-06-07 07:52:43] [INFO ] Deduced a trap composed of 200 places in 447 ms of which 5 ms to minimize.
[2024-06-07 07:52:43] [INFO ] Deduced a trap composed of 216 places in 430 ms of which 5 ms to minimize.
[2024-06-07 07:52:44] [INFO ] Deduced a trap composed of 221 places in 440 ms of which 5 ms to minimize.
[2024-06-07 07:52:44] [INFO ] Deduced a trap composed of 189 places in 415 ms of which 5 ms to minimize.
[2024-06-07 07:52:45] [INFO ] Deduced a trap composed of 81 places in 443 ms of which 5 ms to minimize.
[2024-06-07 07:52:45] [INFO ] Deduced a trap composed of 216 places in 412 ms of which 5 ms to minimize.
[2024-06-07 07:52:46] [INFO ] Deduced a trap composed of 81 places in 435 ms of which 5 ms to minimize.
[2024-06-07 07:52:46] [INFO ] Deduced a trap composed of 161 places in 431 ms of which 5 ms to minimize.
[2024-06-07 07:52:47] [INFO ] Deduced a trap composed of 144 places in 436 ms of which 4 ms to minimize.
[2024-06-07 07:52:47] [INFO ] Deduced a trap composed of 104 places in 430 ms of which 5 ms to minimize.
[2024-06-07 07:52:48] [INFO ] Deduced a trap composed of 125 places in 437 ms of which 5 ms to minimize.
[2024-06-07 07:52:48] [INFO ] Deduced a trap composed of 209 places in 431 ms of which 5 ms to minimize.
[2024-06-07 07:52:49] [INFO ] Deduced a trap composed of 200 places in 436 ms of which 4 ms to minimize.
[2024-06-07 07:52:49] [INFO ] Deduced a trap composed of 224 places in 427 ms of which 5 ms to minimize.
[2024-06-07 07:52:50] [INFO ] Deduced a trap composed of 209 places in 432 ms of which 5 ms to minimize.
[2024-06-07 07:52:50] [INFO ] Deduced a trap composed of 144 places in 429 ms of which 5 ms to minimize.
[2024-06-07 07:52:51] [INFO ] Deduced a trap composed of 176 places in 412 ms of which 5 ms to minimize.
[2024-06-07 07:52:51] [INFO ] Deduced a trap composed of 189 places in 434 ms of which 5 ms to minimize.
[2024-06-07 07:52:52] [INFO ] Deduced a trap composed of 176 places in 433 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/813 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 07:52:52] [INFO ] Deduced a trap composed of 189 places in 436 ms of which 5 ms to minimize.
[2024-06-07 07:52:53] [INFO ] Deduced a trap composed of 176 places in 439 ms of which 5 ms to minimize.
[2024-06-07 07:52:53] [INFO ] Deduced a trap composed of 144 places in 407 ms of which 5 ms to minimize.
[2024-06-07 07:52:54] [INFO ] Deduced a trap composed of 161 places in 443 ms of which 5 ms to minimize.
[2024-06-07 07:52:54] [INFO ] Deduced a trap composed of 224 places in 399 ms of which 5 ms to minimize.
[2024-06-07 07:52:55] [INFO ] Deduced a trap composed of 125 places in 438 ms of which 5 ms to minimize.
[2024-06-07 07:52:55] [INFO ] Deduced a trap composed of 161 places in 411 ms of which 5 ms to minimize.
[2024-06-07 07:52:56] [INFO ] Deduced a trap composed of 176 places in 433 ms of which 5 ms to minimize.
[2024-06-07 07:52:56] [INFO ] Deduced a trap composed of 189 places in 421 ms of which 5 ms to minimize.
[2024-06-07 07:52:57] [INFO ] Deduced a trap composed of 224 places in 459 ms of which 5 ms to minimize.
[2024-06-07 07:52:57] [INFO ] Deduced a trap composed of 144 places in 472 ms of which 5 ms to minimize.
[2024-06-07 07:52:58] [INFO ] Deduced a trap composed of 189 places in 436 ms of which 5 ms to minimize.
[2024-06-07 07:52:58] [INFO ] Deduced a trap composed of 144 places in 450 ms of which 4 ms to minimize.
[2024-06-07 07:52:59] [INFO ] Deduced a trap composed of 104 places in 449 ms of which 5 ms to minimize.
[2024-06-07 07:52:59] [INFO ] Deduced a trap composed of 209 places in 407 ms of which 5 ms to minimize.
[2024-06-07 07:52:59] [INFO ] Deduced a trap composed of 125 places in 425 ms of which 5 ms to minimize.
[2024-06-07 07:53:00] [INFO ] Deduced a trap composed of 216 places in 415 ms of which 5 ms to minimize.
[2024-06-07 07:53:00] [INFO ] Deduced a trap composed of 221 places in 447 ms of which 5 ms to minimize.
[2024-06-07 07:53:01] [INFO ] Deduced a trap composed of 125 places in 460 ms of which 4 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 144 places in 436 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 224 places in 432 ms of which 5 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 144 places in 422 ms of which 5 ms to minimize.
[2024-06-07 07:53:03] [INFO ] Deduced a trap composed of 125 places in 427 ms of which 5 ms to minimize.
[2024-06-07 07:53:04] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 5 ms to minimize.
[2024-06-07 07:53:04] [INFO ] Deduced a trap composed of 161 places in 415 ms of which 4 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 56 places in 404 ms of which 5 ms to minimize.
[2024-06-07 07:53:05] [INFO ] Deduced a trap composed of 224 places in 410 ms of which 4 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 189 places in 406 ms of which 5 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 144 places in 406 ms of which 5 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 176 places in 405 ms of which 5 ms to minimize.
[2024-06-07 07:53:07] [INFO ] Deduced a trap composed of 125 places in 408 ms of which 5 ms to minimize.
[2024-06-07 07:53:07] [INFO ] Deduced a trap composed of 176 places in 395 ms of which 5 ms to minimize.
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 56 places in 390 ms of which 5 ms to minimize.
[2024-06-07 07:53:08] [INFO ] Deduced a trap composed of 144 places in 441 ms of which 5 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 216 places in 449 ms of which 5 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 56 places in 411 ms of which 5 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 125 places in 424 ms of which 5 ms to minimize.
[2024-06-07 07:53:10] [INFO ] Deduced a trap composed of 209 places in 426 ms of which 5 ms to minimize.
SMT process timed out in 48649ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 102 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 134 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 07:53:11] [INFO ] Invariant cache hit.
[2024-06-07 07:53:11] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-07 07:53:11] [INFO ] Invariant cache hit.
[2024-06-07 07:53:11] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2024-06-07 07:53:12] [INFO ] Redundant transitions in 124 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 07:53:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 70996ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 71010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72081 ms. Remains : 841/841 places, 1568/1568 transitions.
FORMULA BlocksWorld-PT-05-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BlocksWorld-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 785 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 8 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:54:23] [INFO ] Computed 57 invariants in 16 ms
[2024-06-07 07:54:23] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-07 07:54:23] [INFO ] Invariant cache hit.
[2024-06-07 07:54:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:54:24] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:54:24] [INFO ] Invariant cache hit.
[2024-06-07 07:54:24] [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:55] [INFO ] Deduced a trap composed of 144 places in 151 ms of which 2 ms to minimize.
[2024-06-07 07:54:55] [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 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:55:07] [INFO ] Deduced a trap composed of 125 places in 131 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:31] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:55:32] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:55:33] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:55:33] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 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 30038 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 71862ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71880ms
Finished structural reductions in LTL mode , in 1 iterations and 72626 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 4731 ms.
Product exploration explored 100000 steps with 33333 reset in 4739 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 : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-05-LTLFireability-00 finished in 82430 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(F(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 75 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:55:46] [INFO ] Invariant cache hit.
[2024-06-07 07:55:46] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-06-07 07:55:46] [INFO ] Invariant cache hit.
[2024-06-07 07:55:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:55:47] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:55:47] [INFO ] Invariant cache hit.
[2024-06-07 07:55:47] [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:56:17] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-06-07 07:56:17] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 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 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 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 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 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 0.0)
(s475 0.0)
(s476 0.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 0.0)
(s674 0.0)
(s675 1.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 timeout
0.0)
(s820 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 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:56:30] [INFO ] Deduced a trap composed of 125 places in 130 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:51] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-06-07 07:56:51] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:56:52] [INFO ] Deduced a trap composed of 81 places in 100 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 71699ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71714ms
Finished structural reductions in LTL mode , in 1 iterations and 73253 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 18174 reset in 1702 ms.
Stack based approach found an accepted trace after 35 steps with 8 reset with depth 10 and stack size 10 in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-01 finished in 75137 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((p0||(X(p1)&&G(!p2)))))'
Support contains 108 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 22 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:57:01] [INFO ] Invariant cache hit.
[2024-06-07 07:57:01] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-06-07 07:57:01] [INFO ] Invariant cache hit.
[2024-06-07 07:57:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:57:02] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:57:02] [INFO ] Invariant cache hit.
[2024-06-07 07:57: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:57:33] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-06-07 07:57:33] [INFO ] Deduced a trap composed of 125 places in 108 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 30034 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:45] [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:58:07] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-06-07 07:58:07] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:58:07] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:58:08] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:58:08] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:58:08] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:58:08] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2024-06-07 07:58:08] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:58:08] [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 30048 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 71536ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71552ms
Finished structural reductions in LTL mode , in 1 iterations and 72980 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-02 finished in 73212 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)&&(!p0||F(p1)))))'
Support contains 85 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 140 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:58:14] [INFO ] Invariant cache hit.
[2024-06-07 07:58:14] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-07 07:58:14] [INFO ] Invariant cache hit.
[2024-06-07 07:58:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:58:15] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2024-06-07 07:58:16] [INFO ] Redundant transitions in 80 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:58:16] [INFO ] Invariant cache hit.
[2024-06-07 07:58: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:58:47] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 3 ms to minimize.
[2024-06-07 07:58:47] [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 30031 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:59] [INFO ] Deduced a trap composed of 125 places in 129 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:59:20] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-06-07 07:59:20] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:59:21] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:59:21] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-07 07:59:21] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:59:21] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:59:21] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-07 07:59:21] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:59:21] [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 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 71822ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71834ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73571 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 12435 reset in 1809 ms.
Stack based approach found an accepted trace after 32 steps with 5 reset with depth 8 and stack size 8 in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-03 finished in 75543 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((G(p1)||p0))&&F(p2))))'
Support contains 813 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 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 07:59:29] [INFO ] Invariant cache hit.
[2024-06-07 07:59:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-07 07:59:30] [INFO ] Invariant cache hit.
[2024-06-07 07:59:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:59:30] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 07:59:30] [INFO ] Invariant cache hit.
[2024-06-07 07:59:30] [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 08:00:01] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 2 ms to minimize.
[2024-06-07 08:00:01] [INFO ] Deduced a trap composed of 125 places in 117 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 30043 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 08:00:13] [INFO ] Deduced a trap composed of 125 places in 131 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:37] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 2 ms to minimize.
[2024-06-07 08:00:37] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:00:38] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-06-07 08:00:38] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 08:00:38] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-06-07 08:00:38] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:00:38] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:00:38] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:00:38] [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 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 71377ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71391ms
Finished structural reductions in LTL mode , in 1 iterations and 72172 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-05 finished in 72462 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(!p0) U !p1)&&X(((!G(!p1) U !p0)||G(p1)))))'
Support contains 79 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 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:00:42] [INFO ] Invariant cache hit.
[2024-06-07 08:00:42] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-07 08:00:42] [INFO ] Invariant cache hit.
[2024-06-07 08:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:00:43] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:00:43] [INFO ] Invariant cache hit.
[2024-06-07 08:00:43] [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 08:01:14] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 3 ms to minimize.
[2024-06-07 08:01:14] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 1 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 30025 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 08:01:26] [INFO ] Deduced a trap composed of 125 places in 132 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:01:47] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-06-07 08:01:48] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 08:01:49] [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 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 71526ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71541ms
Finished structural reductions in LTL mode , in 1 iterations and 73108 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR p0 p1), (AND (NOT p1) p0), (OR p1 p0), (NOT p1), p0, true]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-06 finished in 73383 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((F(!p1)&&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 08:01:55] [INFO ] Invariant cache hit.
[2024-06-07 08:01:56] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-07 08:01:56] [INFO ] Invariant cache hit.
[2024-06-07 08:01:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:01:57] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:01:57] [INFO ] Invariant cache hit.
[2024-06-07 08:01:57] [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 08:02:27] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 3 ms to minimize.
[2024-06-07 08:02:27] [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 30032 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 08:02:39] [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:03:00] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 08:03:00] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:03:01] [INFO ] Deduced a trap composed of 81 places in 97 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 30026 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 71283ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71297ms
Finished structural reductions in LTL mode , in 1 iterations and 72720 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-07 finished in 72948 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((G(p0) U (!p1||G(!p0)))))))'
Support contains 24 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 22 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:03:08] [INFO ] Invariant cache hit.
[2024-06-07 08:03:09] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-06-07 08:03:09] [INFO ] Invariant cache hit.
[2024-06-07 08:03:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:03:10] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:03:10] [INFO ] Invariant cache hit.
[2024-06-07 08:03:10] [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 08:03:40] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 3 ms to minimize.
[2024-06-07 08:03:40] [INFO ] Deduced a trap composed of 125 places in 109 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 08:03:52] [INFO ] Deduced a trap composed of 125 places in 129 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:04:13] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 2 ms to minimize.
[2024-06-07 08:04:13] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:04:13] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 08:04:14] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 08:04:14] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:04:14] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:04:14] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-07 08:04:14] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:04:14] [INFO ] Deduced a trap composed of 81 places in 95 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 30027 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 71100ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71116ms
Finished structural reductions in LTL mode , in 1 iterations and 72804 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (NOT p0), p0, (AND p0 p1), true]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 61 steps with 0 reset in 3 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-10 finished in 73149 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((p0 U G(p1))))'
Support contains 7 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 08:04:21] [INFO ] Invariant cache hit.
[2024-06-07 08:04:22] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-07 08:04:22] [INFO ] Invariant cache hit.
[2024-06-07 08:04:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:04:23] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:04:23] [INFO ] Invariant cache hit.
[2024-06-07 08:04:23] [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 08:04:53] [INFO ] Deduced a trap composed of 144 places in 156 ms of which 3 ms to minimize.
[2024-06-07 08:04:53] [INFO ] Deduced a trap composed of 125 places in 124 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 08:05:05] [INFO ] Deduced a trap composed of 125 places in 130 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:05:26] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-07 08:05:27] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:05:28] [INFO ] Deduced a trap composed of 81 places in 100 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 30026 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 70768ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70785ms
Finished structural reductions in LTL mode , in 1 iterations and 72399 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2760 steps with 0 reset in 44 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-12 finished in 72695 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(F((X((p0&&G(p1)))||(p1&&G(p0)))))))'
Support contains 5 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 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:05:34] [INFO ] Invariant cache hit.
[2024-06-07 08:05:34] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-07 08:05:34] [INFO ] Invariant cache hit.
[2024-06-07 08:05:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:05:36] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:05:36] [INFO ] Invariant cache hit.
[2024-06-07 08:05:36] [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 08:06:06] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 3 ms to minimize.
[2024-06-07 08:06:06] [INFO ] Deduced a trap composed of 125 places in 106 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 30033 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 08:06:18] [INFO ] Deduced a trap composed of 125 places in 125 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 08:06:39] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-06-07 08:06:39] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:06:39] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-07 08:06:40] [INFO ] Deduced a trap composed of 81 places in 103 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 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 71150ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71164ms
Finished structural reductions in LTL mode , in 1 iterations and 72831 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1674 ms.
Product exploration explored 100000 steps with 0 reset in 1663 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 : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 891 ms. (44 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
[2024-06-07 08:06:51] [INFO ] Invariant cache hit.
[2024-06-07 08:06:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 191/2410 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 7/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 314 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 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 17 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:06:52] [INFO ] Invariant cache hit.
[2024-06-07 08:06:53] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-07 08:06:53] [INFO ] Invariant cache hit.
[2024-06-07 08:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:06:54] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:06:54] [INFO ] Invariant cache hit.
[2024-06-07 08:06:54] [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 08:07:25] [INFO ] Deduced a trap composed of 144 places in 256 ms of which 3 ms to minimize.
[2024-06-07 08:07:25] [INFO ] Deduced a trap composed of 125 places in 104 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 08:07:36] [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 08:07:57] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-06-07 08:07:57] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:07:58] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 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 71018ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71034ms
Finished structural reductions in LTL mode , in 1 iterations and 72730 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 : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 11006 steps (1 resets) in 296 ms. (37 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 264 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1643 ms.
Product exploration explored 100000 steps with 0 reset in 1739 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
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 160 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:08:11] [INFO ] Redundant transitions in 32 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:08:11] [INFO ] Invariant cache hit.
[2024-06-07 08:08:11] [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 08:08:42] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-06-07 08:08:42] [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 30033 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 08:08:54] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 4 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:09:16] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-06-07 08:09:16] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:09:16] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 1 ms to minimize.
[2024-06-07 08:09:16] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-07 08:09:17] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:09:17] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:09:17] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:09:17] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2024-06-07 08:09:17] [INFO ] Deduced a trap composed of 81 places in 109 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 1)
(s51 0)
(s52 0)
(s53 1)
(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 timeout
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 30027 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 72136ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 72152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72360 ms. Remains : 841/841 places, 1569/1569 transitions.
Support contains 5 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 17 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:09:23] [INFO ] Invariant cache hit.
[2024-06-07 08:09:23] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-07 08:09:23] [INFO ] Invariant cache hit.
[2024-06-07 08:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:09:25] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1627 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:09:25] [INFO ] Invariant cache hit.
[2024-06-07 08:09:25] [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 08:09:55] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-06-07 08:09:55] [INFO ] Deduced a trap composed of 125 places in 113 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 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.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 0.0)
(s475 0.0)
(s476 0.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)
(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 30032 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 08:10:07] [INFO ] Deduced a trap composed of 125 places in 132 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:10:28] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-06-07 08:10:28] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:10:29] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 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 71070ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71086ms
Finished structural reductions in LTL mode , in 1 iterations and 72735 ms. Remains : 841/841 places, 1569/1569 transitions.
Treatment of property BlocksWorld-PT-05-LTLFireability-13 finished in 302150 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' '!(((p0||X(p1)) U G((F(p2) U p3))))'
Support contains 31 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 22 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:10:36] [INFO ] Invariant cache hit.
[2024-06-07 08:10:37] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-07 08:10:37] [INFO ] Invariant cache hit.
[2024-06-07 08:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:10:38] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:10:38] [INFO ] Invariant cache hit.
[2024-06-07 08:10:38] [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 08:11:07] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 2 ms to minimize.
[2024-06-07 08:11:07] [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 30026 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 08:11:20] [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:11:40] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 2 ms to minimize.
[2024-06-07 08:11:41] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-06-07 08:11:41] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 08:11:41] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-06-07 08:11:41] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 1 ms to minimize.
[2024-06-07 08:11:41] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 08:11:41] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-06-07 08:11:42] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:11:42] [INFO ] Deduced a trap composed of 81 places in 115 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 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 70560ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70573ms
Finished structural reductions in LTL mode , in 1 iterations and 72096 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 477 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-14
Product exploration explored 100000 steps with 135 reset in 1565 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-14 finished in 74180 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(X((F(!p0) U X(p1))))))'
Support contains 24 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 16 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:11:50] [INFO ] Invariant cache hit.
[2024-06-07 08:11:51] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-06-07 08:11:51] [INFO ] Invariant cache hit.
[2024-06-07 08:11:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:11:52] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:11:52] [INFO ] Invariant cache hit.
[2024-06-07 08:11:52] [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 08:12:22] [INFO ] Deduced a trap composed of 144 places in 167 ms of which 2 ms to minimize.
[2024-06-07 08:12:22] [INFO ] Deduced a trap composed of 125 places in 119 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 timeout
1.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 08:12:34] [INFO ] Deduced a trap composed of 125 places in 141 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:12:55] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 2 ms to minimize.
[2024-06-07 08:12:55] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2024-06-07 08:12:55] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-06-07 08:12:56] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 1 ms to minimize.
[2024-06-07 08:12:56] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-06-07 08:12:56] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 08:12:56] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-06-07 08:12:56] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:12:56] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 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 timeout
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 30024 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 70939ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70952ms
Finished structural reductions in LTL mode , in 1 iterations and 72676 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 20000 reset in 1575 ms.
Product exploration explored 100000 steps with 20000 reset in 1560 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 : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 1135 ms. (35 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
[2024-06-07 08:13:07] [INFO ] Invariant cache hit.
[2024-06-07 08:13:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 838 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/2410 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2410/2410 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1498ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 23 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 2130 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 2130 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 709 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 562512 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562512 steps, saw 481331 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 08:13:14] [INFO ] Computed 57 invariants in 13 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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 570 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1199ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1660 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1660 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1670 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 08:13:19] [INFO ] Invariant cache hit.
[2024-06-07 08:13:19] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-07 08:13:19] [INFO ] Invariant cache hit.
[2024-06-07 08:13:20] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1635 ms to find 0 implicit places.
[2024-06-07 08:13:20] [INFO ] Redundant transitions in 23 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 08:13:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
(s713 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 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 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.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 0.0)
(s475 0.0)
(s476 0.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 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.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 0.0)
(s522 0.0)
(s523 1.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 1.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 0.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 0.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 1.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 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 72202ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 72217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75555 ms. Remains : 841/841 places, 1568/1568 transitions.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 24 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 14 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 08:14:33] [INFO ] Computed 57 invariants in 16 ms
[2024-06-07 08:14:34] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-06-07 08:14:34] [INFO ] Invariant cache hit.
[2024-06-07 08:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:14:35] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1698 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:14:35] [INFO ] Invariant cache hit.
[2024-06-07 08:14:35] [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 08:15:06] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 3 ms to minimize.
[2024-06-07 08:15:06] [INFO ] Deduced a trap composed of 125 places in 107 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 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 08:15:18] [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 08:15:39] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-06-07 08:15:39] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-06-07 08:15:39] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-06-07 08:15:40] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-06-07 08:15:40] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 08:15:40] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:15:40] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-06-07 08:15:40] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 0 ms to minimize.
[2024-06-07 08:15:40] [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 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 71588ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71605ms
Finished structural reductions in LTL mode , in 1 iterations and 73322 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 : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 871 ms. (45 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
[2024-06-07 08:15:47] [INFO ] Invariant cache hit.
[2024-06-07 08:15:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/2410 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2410/2410 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1321ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 23 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 2146 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 2146 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 838 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548985 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548985 steps, saw 469796 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 08:15:54] [INFO ] Computed 57 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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 562 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/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, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1592 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1592 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1608 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 08:15:59] [INFO ] Invariant cache hit.
[2024-06-07 08:15:59] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-06-07 08:15:59] [INFO ] Invariant cache hit.
[2024-06-07 08:16:00] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-06-07 08:16:00] [INFO ] Redundant transitions in 25 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 08:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
(s53 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 1timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 71614ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 71627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74921 ms. Remains : 841/841 places, 1568/1568 transitions.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 20000 reset in 1567 ms.
Product exploration explored 100000 steps with 20000 reset in 1584 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 24 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 81 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:17:17] [INFO ] Redundant transitions in 23 ms returned []
Running 1563 sub problems to find dead transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 08:17:17] [INFO ] Computed 57 invariants in 5 ms
[2024-06-07 08:17:17] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 46 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: 1563/785 constraints, Known Traps: 0/0 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, 0/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2410 variables, and 57 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 0/0 constraints]
After SMT, in 71330ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 71477 ms. Remains : 841/841 places, 1569/1569 transitions.
Support contains 24 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 08:18:28] [INFO ] Invariant cache hit.
[2024-06-07 08:18:29] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-06-07 08:18:29] [INFO ] Invariant cache hit.
[2024-06-07 08:18:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:18:30] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:18:30] [INFO ] Invariant cache hit.
[2024-06-07 08:18:30] [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 08:19:01] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 3 ms to minimize.
[2024-06-07 08:19:01] [INFO ] Deduced a trap composed of 125 places in 107 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 30024 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 08:19:13] [INFO ] Deduced a trap composed of 125 places in 125 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:19:34] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 2 ms to minimize.
[2024-06-07 08:19:34] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-06-07 08:19:34] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-06-07 08:19:34] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-06-07 08:19:34] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-06-07 08:19:35] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 08:19:35] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 1 ms to minimize.
[2024-06-07 08:19:35] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:19:35] [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 30026 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 71706ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71722ms
Finished structural reductions in LTL mode , in 1 iterations and 73487 ms. Remains : 841/841 places, 1569/1569 transitions.
Treatment of property BlocksWorld-PT-05-LTLFireability-15 finished in 471484 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(F((X((p0&&G(p1)))||(p1&&G(p0)))))))'
Found a Shortening insensitive property : BlocksWorld-PT-05-LTLFireability-13
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 26 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:19:42] [INFO ] Invariant cache hit.
[2024-06-07 08:19:43] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-06-07 08:19:43] [INFO ] Invariant cache hit.
[2024-06-07 08:19:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:19:44] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:19:44] [INFO ] Invariant cache hit.
[2024-06-07 08:19:44] [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 08:20:14] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 2 ms to minimize.
[2024-06-07 08:20:14] [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: (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 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 08:20:26] [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:20:47] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 2 ms to minimize.
[2024-06-07 08:20:47] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 1 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-07 08:20:48] [INFO ] Deduced a trap composed of 81 places in 103 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 30026 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 70899ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70916ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 72621 ms. Remains : 841/841 places, 1569/1569 transitions.
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1620 ms.
Product exploration explored 100000 steps with 0 reset in 1641 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 : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 699 ms. (57 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-06-07 08:20:59] [INFO ] Invariant cache hit.
[2024-06-07 08:20:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 191/2410 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 7/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 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 13 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:21:00] [INFO ] Invariant cache hit.
[2024-06-07 08:21:00] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-07 08:21:00] [INFO ] Invariant cache hit.
[2024-06-07 08:21:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:21:01] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1727 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:21:01] [INFO ] Invariant cache hit.
[2024-06-07 08:21: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 08:21:31] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2024-06-07 08:21:31] [INFO ] Deduced a trap composed of 125 places in 114 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 30024 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 08:21:44] [INFO ] Deduced a trap composed of 125 places in 120 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:22:05] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 1 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 08:22:05] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:22:06] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 1 ms to minimize.
(s357 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
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 0)
(s53 1)
(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 0timeout
) 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 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 70920ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70935ms
Finished structural reductions in LTL mode , in 1 iterations and 72679 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 : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 18367 steps (2 resets) in 432 ms. (42 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 231 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 392 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1601 ms.
Product exploration explored 100000 steps with 0 reset in 1602 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
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 82 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:22:18] [INFO ] Redundant transitions in 21 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:22:18] [INFO ] Invariant cache hit.
[2024-06-07 08:22:18] [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 08:22:49] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 3 ms to minimize.
[2024-06-07 08:22:49] [INFO ] Deduced a trap composed of 125 places in 100 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 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 08:23:01] [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 08:23:22] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 2 ms to minimize.
[2024-06-07 08:23:22] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-07 08:23:22] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-06-07 08:23:23] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-07 08:23:23] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-06-07 08:23:23] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 08:23:23] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:23:23] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 08:23:23] [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 30039 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 71984ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 72000ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72113 ms. Remains : 841/841 places, 1569/1569 transitions.
Support contains 5 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 14 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 08:23:30] [INFO ] Invariant cache hit.
[2024-06-07 08:23:30] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-06-07 08:23:30] [INFO ] Invariant cache hit.
[2024-06-07 08:23:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 08:23:32] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 08:23:32] [INFO ] Invariant cache hit.
[2024-06-07 08:23:32] [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 08:24:02] [INFO ] Deduced a trap composed of 144 places in 168 ms of which 3 ms to minimize.
[2024-06-07 08:24:03] [INFO ] Deduced a trap composed of 125 places in 110 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 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 08:24:15] [INFO ] Deduced a trap composed of 125 places in 131 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:24:35] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 2 ms to minimize.
[2024-06-07 08:24:36] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 08:24:36] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-06-07 08:24:36] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-06-07 08:24:36] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-06-07 08:24:36] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 08:24:36] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-07 08:24:37] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 08:24: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 30025 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 71644ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71662ms
Finished structural reductions in LTL mode , in 1 iterations and 73342 ms. Remains : 841/841 places, 1569/1569 transitions.
Treatment of property BlocksWorld-PT-05-LTLFireability-13 finished in 301645 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(X((F(!p0) U X(p1))))))'
[2024-06-07 08:24:44] [INFO ] Flatten gal took : 65 ms
[2024-06-07 08:24:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-07 08:24:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 841 places, 1569 transitions and 7830 arcs took 9 ms.
Total runtime 2040827 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BlocksWorld-PT-05-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BlocksWorld-PT-05-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717748686871

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BlocksWorld-PT-05-LTLFireability-13
ltl formula formula --ltl=/tmp/3246/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.160 real 0.040 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3246/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3246/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3246/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3246/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 842 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 842, there are 1639 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( 2/ 4): ~2500 levels ~10000 states ~291636 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~495180 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~4473!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 16301
pnml2lts-mc( 0/ 4): unique transitions count: 411706
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 84138
pnml2lts-mc( 0/ 4): - claim success count: 16304
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16304
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 16304 states 411728 transitions, fanout: 25.253
pnml2lts-mc( 0/ 4): Total exploration time 1.270 sec (1.270 sec minimum, 1.270 sec on average)
pnml2lts-mc( 0/ 4): States per second: 12838, Transitions per second: 324195
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.0MB, 31.4 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.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: 2.0MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-05-LTLFireability-15
ltl formula formula --ltl=/tmp/3246/ltl_1_
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.310 real 0.080 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3246/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3246/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3246/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3246/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 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 1714 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1005
pnml2lts-mc( 0/ 4): unique states count: 1005
pnml2lts-mc( 0/ 4): unique transitions count: 27785
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 27911
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1078
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1078 states 31102 transitions, fanout: 28.852
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.060 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13475, Transitions per second: 388775
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 37.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.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: 0.0MB (~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="LTLFireability"
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 LTLFireability"
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-171774426800196"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;