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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 73K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 367K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 37K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 224K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 81K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 407K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 631K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 175K 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-02-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717745572230

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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:32:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-07 07:32:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:32:53] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-07 07:32:53] [INFO ] Transformed 209 places.
[2024-06-07 07:32:53] [INFO ] Transformed 365 transitions.
[2024-06-07 07:32:53] [INFO ] Found NUPN structural information;
[2024-06-07 07:32:53] [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]
[2024-06-07 07:32:53] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-02-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 209 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Applied a total of 0 rules in 11 ms. Remains 209 /209 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 209 cols
[2024-06-07 07:32:53] [INFO ] Computed 27 invariants in 21 ms
[2024-06-07 07:32:54] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-07 07:32:54] [INFO ] Invariant cache hit.
[2024-06-07 07:32:54] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-07 07:32:54] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-07 07:32:54] [INFO ] Invariant cache hit.
[2024-06-07 07:32:54] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 20/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/209 variables, 7/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:32:58] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 9 ms to minimize.
[2024-06-07 07:32:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 0/574 variables, 0/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 257 constraints, problems are : Problem set: 26 solved, 335 unsolved in 17590 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 26 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 17/209 variables, 26/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 335/591 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:20] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:33:21] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:33:22] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 20/611 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:26] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:33:26] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:33:27] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-07 07:33:28] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:33:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:33:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:30] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:33:30] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:33:30] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:33:31] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 20/631 constraints. Problems are: Problem set: 26 solved, 335 unsolved
[2024-06-07 07:33:37] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-06-07 07:33:37] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:33:37] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:33:38] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:33:38] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:33:38] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:33:38] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:33:38] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2024-06-07 07:33:40] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:33:41] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:33:42] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:33:42] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 646 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 335/361 constraints, Known Traps: 57/57 constraints]
After SMT, in 49110ms problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 49129ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49536 ms. Remains : 209/209 places, 339/365 transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Support contains 196 out of 196 places after structural reductions.
[2024-06-07 07:33:43] [INFO ] Flatten gal took : 67 ms
[2024-06-07 07:33:43] [INFO ] Flatten gal took : 42 ms
[2024-06-07 07:33:43] [INFO ] Input system was already deterministic with 339 transitions.
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40000 steps (8 resets) in 3078 ms. (12 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 395 ms. (101 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:33:45] [INFO ] Computed 27 invariants in 3 ms
[2024-06-07 07:33:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 174/196 variables, 27/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-07 07:33:45] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 2 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/226 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 2 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 392ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 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 196 transition count 338
Applied a total of 1 rules in 235 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1162935 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 1
Probabilistic random walk after 1162935 steps, saw 812075 distinct states, run finished after 3007 ms. (steps per millisecond=386 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:33:48] [INFO ] Computed 27 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 07:33:49] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 95 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 76 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:33:49] [INFO ] Invariant cache hit.
[2024-06-07 07:33:49] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-07 07:33:49] [INFO ] Invariant cache hit.
[2024-06-07 07:33:49] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-07 07:33:49] [INFO ] Redundant transitions in 18 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:33:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10536 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:34:08] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:34:08] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:34:08] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:34:08] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:34:09] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:34:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:34:09] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:34:10] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:34:10] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:34:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:34:11] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:34:11] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:34:11] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:34:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:34:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:34:13] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:34:19] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:34:20] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:34:21] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:34:28] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:34:28] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:34:29] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:34:29] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41566ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42022 ms. Remains : 196/196 places, 338/338 transitions.
FORMULA BlocksWorld-PT-02-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
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' '!(F((G(p0)||G((p1 U p2)))))'
Support contains 183 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 11 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:34:31] [INFO ] Computed 27 invariants in 1 ms
[2024-06-07 07:34:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-07 07:34:31] [INFO ] Invariant cache hit.
[2024-06-07 07:34:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:34:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-07 07:34:31] [INFO ] Redundant transitions in 4 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:34:31] [INFO ] Invariant cache hit.
[2024-06-07 07:34:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13309 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:34:53] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:34:54] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:34:55] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:34:55] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:34:55] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:34:56] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:34:56] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:34:56] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:35:01] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 0 ms to minimize.
[2024-06-07 07:35:02] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:35:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:35:04] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:09] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-06-07 07:35:10] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:35:11] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:35:12] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:35:12] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:35:12] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:12] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44406ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44410ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44620 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 4843 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-00 finished in 49769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(((!X(p1)||G(p2)) U p2))))'
Support contains 34 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:35:21] [INFO ] Invariant cache hit.
[2024-06-07 07:35:21] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-07 07:35:21] [INFO ] Invariant cache hit.
[2024-06-07 07:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:35:21] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:35:21] [INFO ] Invariant cache hit.
[2024-06-07 07:35:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13154 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:35:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:35:44] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:35:44] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:35:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:35:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:35:45] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:35:46] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:35:52] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:35:53] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:36:01] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:36:01] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:36:01] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:36:01] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44145ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44149ms
Finished structural reductions in LTL mode , in 1 iterations and 44449 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (NOT p2), (AND p0 p1), p0]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-01
Product exploration explored 100000 steps with 14424 reset in 676 ms.
Stack based approach found an accepted trace after 36 steps with 6 reset with depth 3 and stack size 3 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-01 finished in 45332 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)||X(F(p1)))))'
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 19 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:36:06] [INFO ] Invariant cache hit.
[2024-06-07 07:36:06] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-07 07:36:06] [INFO ] Invariant cache hit.
[2024-06-07 07:36:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:36:07] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-07 07:36:07] [INFO ] Redundant transitions in 2 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:36:07] [INFO ] Invariant cache hit.
[2024-06-07 07:36:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13133 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:36:28] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:36:36] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:36:37] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:36:44] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:36:44] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:36:44] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 3 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:36:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 3 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:36:46] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:36:47] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44157ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44503 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 533 ms.
Product exploration explored 100000 steps with 0 reset in 643 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 630 ms. (63 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
[2024-06-07 07:36:53] [INFO ] Invariant cache hit.
[2024-06-07 07:36:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:36:53] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:36:54] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 922ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 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 196 transition count 338
Applied a total of 1 rules in 140 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 570 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 427264 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 2
Probabilistic random walk after 427264 steps, saw 301337 distinct states, run finished after 3005 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:36:57] [INFO ] Computed 27 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:36:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 42 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 48 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 49 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:36:58] [INFO ] Invariant cache hit.
[2024-06-07 07:36:58] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-07 07:36:58] [INFO ] Invariant cache hit.
[2024-06-07 07:36:58] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-07 07:36:58] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10564 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:37:18] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:37:18] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:37:18] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:37:19] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:37:19] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:37:19] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:37:20] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:37:20] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:37:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:21] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:37:28] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:37:29] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:37:30] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:37:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:37:37] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:37:38] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2024-06-07 07:37:38] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41647ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41650ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42023 ms. Remains : 196/196 places, 338/338 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:37:40] [INFO ] Computed 27 invariants in 5 ms
[2024-06-07 07:37:40] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-07 07:37:40] [INFO ] Invariant cache hit.
[2024-06-07 07:37:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:37:41] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-07 07:37:41] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:37:41] [INFO ] Invariant cache hit.
[2024-06-07 07:37:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13287 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:03] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:38:04] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:38:04] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:38:05] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:38:05] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:05] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:38:12] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:12] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:38:12] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:12] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:38:18] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44415ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44419ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44755 ms. Remains : 196/196 places, 339/339 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2024-06-07 07:38:25] [INFO ] Invariant cache hit.
[2024-06-07 07:38:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:38:26] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 228 constraints, problems are : Problem set: 0 solved, 2 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 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 196 transition count 338
Applied a total of 1 rules in 67 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 371 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 457511 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 2
Probabilistic random walk after 457511 steps, saw 321652 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 338 rows 196 cols
[2024-06-07 07:38:29] [INFO ] Computed 27 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/196 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 47 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 46 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2024-06-07 07:38:30] [INFO ] Invariant cache hit.
[2024-06-07 07:38:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-07 07:38:30] [INFO ] Invariant cache hit.
[2024-06-07 07:38:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-07 07:38:30] [INFO ] Redundant transitions in 1 ms returned []
Running 334 sub problems to find dead transitions.
[2024-06-07 07:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 10191 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:38:49] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:38:49] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:49] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:38:49] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:50] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:50] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:38:50] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:38:51] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:38:52] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:38:52] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:38:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:38:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 16/573 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:39:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:01] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:02] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-07 07:39:09] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:39:10] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:39:10] [INFO ] Deduced a trap composed of 44 places in 48 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 Int declared 534/534 variables, and 580 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 23/23 constraints]
After SMT, in 41175ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 41179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41552 ms. Remains : 196/196 places, 338/338 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 543 ms.
Product exploration explored 100000 steps with 0 reset in 577 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 9 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:39:13] [INFO ] Computed 27 invariants in 5 ms
[2024-06-07 07:39:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-07 07:39:13] [INFO ] Invariant cache hit.
[2024-06-07 07:39:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:13] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-07 07:39:14] [INFO ] Redundant transitions in 2 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:39:14] [INFO ] Invariant cache hit.
[2024-06-07 07:39:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13507 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:39:43] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:39:43] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:39:43] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:39:44] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:39:45] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:39:46] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:39:46] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:46] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:39:52] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:53] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:39:54] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:39:54] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:39:54] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:39:54] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44576ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44580ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44927 ms. Remains : 196/196 places, 339/339 transitions.
Treatment of property BlocksWorld-PT-02-LTLFireability-02 finished in 231870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 14 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:39:58] [INFO ] Invariant cache hit.
[2024-06-07 07:39:58] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-07 07:39:58] [INFO ] Invariant cache hit.
[2024-06-07 07:39:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:59] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-07 07:39:59] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:39:59] [INFO ] Invariant cache hit.
[2024-06-07 07:39:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13411 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:40:20] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:21] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:40:28] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2024-06-07 07:40:29] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:30] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:40:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:40:36] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:40:36] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:40:39] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:40:39] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:40:39] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44335ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44670 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-03
Product exploration explored 100000 steps with 19964 reset in 446 ms.
Product exploration explored 100000 steps with 19996 reset in 451 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 11 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:40:44] [INFO ] Invariant cache hit.
[2024-06-07 07:40:44] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-07 07:40:44] [INFO ] Invariant cache hit.
[2024-06-07 07:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:40:45] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-07 07:40:45] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:40:45] [INFO ] Invariant cache hit.
[2024-06-07 07:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13308 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:41:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:41:07] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:41:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 3 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:41:14] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:41:15] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:16] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:22] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:41:22] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:41:22] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:41:22] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:41:22] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 2 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:41:23] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:41:24] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44245ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44582 ms. Remains : 196/196 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19956 reset in 450 ms.
Product exploration explored 100000 steps with 20003 reset in 458 ms.
Support contains 21 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 8 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:41:30] [INFO ] Invariant cache hit.
[2024-06-07 07:41:30] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-07 07:41:30] [INFO ] Invariant cache hit.
[2024-06-07 07:41:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:41:31] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-07 07:41:31] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:41:31] [INFO ] Invariant cache hit.
[2024-06-07 07:41:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13060 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:51] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:52] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:53] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:41:54] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:41:55] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:41:59] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:59] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:41:59] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:42:00] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:42:01] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:42:01] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:42:01] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:42:01] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 2 ms to minimize.
[2024-06-07 07:42:01] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:42:01] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:42:02] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:42:02] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:42:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44064ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44068ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44428 ms. Remains : 196/196 places, 339/339 transitions.
Treatment of property BlocksWorld-PT-02-LTLFireability-03 finished in 136562 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||G(p1)||X(p2)))'
Support contains 48 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:42:15] [INFO ] Invariant cache hit.
[2024-06-07 07:42:15] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-07 07:42:15] [INFO ] Invariant cache hit.
[2024-06-07 07:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:42:15] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:42:15] [INFO ] Invariant cache hit.
[2024-06-07 07:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13675 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:42:37] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:42:38] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:42:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:42:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:42:40] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:42:45] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:42:46] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:42:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:42:53] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:42:53] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2024-06-07 07:42:56] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:42:56] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:42:56] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44697ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44700ms
Finished structural reductions in LTL mode , in 1 iterations and 44951 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 218 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-04 finished in 45572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((!p1 U (!p2||G(!p1))))))'
Support contains 34 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:43:00] [INFO ] Invariant cache hit.
[2024-06-07 07:43:00] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-07 07:43:00] [INFO ] Invariant cache hit.
[2024-06-07 07:43:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:43:01] [INFO ] Invariant cache hit.
[2024-06-07 07:43:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13127 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:43:22] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:43:23] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:43:24] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:43:25] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:43:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:43:25] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:43:30] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:43:31] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:43:32] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:43:32] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:43:32] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:43:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:43:32] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:43:38] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:43:38] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:43:39] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:43:40] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:43:41] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:43:41] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44179ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44183ms
Finished structural reductions in LTL mode , in 1 iterations and 44549 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 206 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 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-05 finished in 45123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 13 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:43:45] [INFO ] Invariant cache hit.
[2024-06-07 07:43:46] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-07 07:43:46] [INFO ] Invariant cache hit.
[2024-06-07 07:43:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:46] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:43:46] [INFO ] Invariant cache hit.
[2024-06-07 07:43:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13336 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:44:07] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:44:08] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:44:09] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:44:10] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:44:10] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:44:10] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:44:15] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:44:16] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:44:17] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:18] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:23] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:44:24] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:44:25] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:44:26] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44342ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44345ms
Finished structural reductions in LTL mode , in 1 iterations and 44663 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, p0, p0]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-07 finished in 44772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)&&F(G(p1))))'
Support contains 10 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 13 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:44:30] [INFO ] Invariant cache hit.
[2024-06-07 07:44:30] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-07 07:44:30] [INFO ] Invariant cache hit.
[2024-06-07 07:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:44:31] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-07 07:44:31] [INFO ] Redundant transitions in 1 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:44:31] [INFO ] Invariant cache hit.
[2024-06-07 07:44:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13212 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:52] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:44:53] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:44:53] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:44:53] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:44:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:44:53] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:44:53] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:44:54] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:44:55] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:44:55] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:44:55] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:45:00] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:45:01] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:45:02] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:45:03] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:08] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:45:11] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:45:11] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:45:11] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44251ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44255ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44618 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 592 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 7 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-08 finished in 45337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:45:16] [INFO ] Invariant cache hit.
[2024-06-07 07:45:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-07 07:45:16] [INFO ] Invariant cache hit.
[2024-06-07 07:45:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:16] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:45:16] [INFO ] Invariant cache hit.
[2024-06-07 07:45:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12814 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:45:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:45:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:45:39] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:45:40] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:44] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:45:45] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 10 ms to minimize.
[2024-06-07 07:45:46] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-07 07:45:47] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:45:53] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:45:53] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:53] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:53] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:45:53] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:53] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:54] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:45:55] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43833ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43837ms
Finished structural reductions in LTL mode , in 1 iterations and 44197 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-09 finished in 44653 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 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:46:00] [INFO ] Invariant cache hit.
[2024-06-07 07:46:00] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-07 07:46:00] [INFO ] Invariant cache hit.
[2024-06-07 07:46:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:46:01] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:46:01] [INFO ] Invariant cache hit.
[2024-06-07 07:46:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12946 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:46:22] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:46:23] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:46:23] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:46:23] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:46:23] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:46:24] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2024-06-07 07:46:24] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:46:25] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:46:25] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 1 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:46:30] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:46:31] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:46:32] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:46:38] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:46:38] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
[2024-06-07 07:46:38] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:46:38] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:46:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:46:40] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43963ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43967ms
Finished structural reductions in LTL mode , in 1 iterations and 44320 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 330 ms.
Product exploration explored 100000 steps with 33333 reset in 331 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-10 finished in 45149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(F(!p1)))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:46:45] [INFO ] Invariant cache hit.
[2024-06-07 07:46:45] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-07 07:46:45] [INFO ] Invariant cache hit.
[2024-06-07 07:46:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:46:46] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:46:46] [INFO ] Invariant cache hit.
[2024-06-07 07:46:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13238 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:47:07] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:47:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:47:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-07 07:47:09] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:47:09] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:47:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:47:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:47:10] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:47:17] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:47:18] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:47:18] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:47:24] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:47:25] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:47:26] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-06-07 07:47:26] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:47:26] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:47:26] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44151ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44154ms
Finished structural reductions in LTL mode , in 1 iterations and 44494 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-11
Product exploration explored 100000 steps with 4224 reset in 441 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 16 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-11 finished in 45050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:47:30] [INFO ] Invariant cache hit.
[2024-06-07 07:47:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-07 07:47:31] [INFO ] Invariant cache hit.
[2024-06-07 07:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:47:31] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:47:31] [INFO ] Invariant cache hit.
[2024-06-07 07:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13228 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:47:52] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:47:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:47:54] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:47:54] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:47:54] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:47:55] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:47:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:47:55] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:48:00] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:48:01] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:48:02] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:08] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:48:08] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:48:09] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:48:10] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:48:11] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:48:11] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:48:11] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44211ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44215ms
Finished structural reductions in LTL mode , in 1 iterations and 44515 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Product exploration explored 100000 steps with 50000 reset in 160 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 (NOT p1)), (X p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-13 finished in 44965 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(p2) U p3))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:48:15] [INFO ] Invariant cache hit.
[2024-06-07 07:48:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-07 07:48:15] [INFO ] Invariant cache hit.
[2024-06-07 07:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:48:16] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:48:16] [INFO ] Invariant cache hit.
[2024-06-07 07:48:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 13512 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:48:37] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:48:38] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:48:39] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:48:40] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:48:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:48:41] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:48:45] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:48:46] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:48:47] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:48:48] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:48:53] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:48:53] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:48:54] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:48:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:48:56] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:48:56] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:48:56] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 44484ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44487ms
Finished structural reductions in LTL mode , in 1 iterations and 44790 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p3) (NOT p1)), (NOT p3), (OR (NOT p0) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-14 finished in 45010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:49:00] [INFO ] Invariant cache hit.
[2024-06-07 07:49:01] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-07 07:49:01] [INFO ] Invariant cache hit.
[2024-06-07 07:49:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:01] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:49:01] [INFO ] Invariant cache hit.
[2024-06-07 07:49:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 12915 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:21] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-07 07:49:21] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:49:21] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:49:22] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:49:23] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:49:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:49:25] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/598 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-07 07:49:37] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:49:37] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:49:38] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:49:39] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:49:40] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:49:40] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 618 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 60/60 constraints]
After SMT, in 43812ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43815ms
Finished structural reductions in LTL mode , in 1 iterations and 44136 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 1167 reset in 472 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-15 finished in 44717 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)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-07 07:49:45] [INFO ] Flatten gal took : 27 ms
[2024-06-07 07:49:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-07 07:49:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 339 transitions and 1680 arcs took 6 ms.
Total runtime 1012645 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BlocksWorld-PT-02-LTLFireability-02
Could not compute solution for formula : BlocksWorld-PT-02-LTLFireability-03

BK_STOP 1717746630032

--------------------
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-02-LTLFireability-02
ltl formula formula --ltl=/tmp/4953/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 196 places, 339 transitions and 1680 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4953/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4953/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4953/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4953/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 198 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 197, there are 342 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( 1/ 4): ~2456 levels ~10000 states ~38400 transitions
pnml2lts-mc( 1/ 4): ~4887 levels ~20000 states ~77000 transitions
pnml2lts-mc( 0/ 4): ~9848 levels ~40000 states ~154856 transitions
pnml2lts-mc( 0/ 4): ~19661 levels ~80000 states ~309208 transitions
pnml2lts-mc( 0/ 4): ~39314 levels ~160000 states ~625228 transitions
pnml2lts-mc( 1/ 4): ~78433 levels ~320000 states ~1296120 transitions
pnml2lts-mc( 1/ 4): ~156814 levels ~640000 states ~2586016 transitions
pnml2lts-mc( 1/ 4): ~313757 levels ~1280000 states ~5155300 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2500325
pnml2lts-mc( 0/ 4): unique transitions count: 10396973
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2803450
pnml2lts-mc( 0/ 4): - claim success count: 2500328
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2464202
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2500328 states 10396984 transitions, fanout: 4.158
pnml2lts-mc( 0/ 4): Total exploration time 14.800 sec (14.780 sec minimum, 14.792 sec on average)
pnml2lts-mc( 0/ 4): States per second: 168941, Transitions per second: 702499
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 118.1MB, 17.5 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 342 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 118.1MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-02-LTLFireability-03
ltl formula formula --ltl=/tmp/4953/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 196 places, 339 transitions and 1680 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.040 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4953/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4953/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4953/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4953/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 198 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 197, there are 548 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): ~1633 levels ~10000 states ~134716 transitions
pnml2lts-mc( 0/ 4): ~3237 levels ~20000 states ~263672 transitions
pnml2lts-mc( 0/ 4): ~6501 levels ~40000 states ~545056 transitions
pnml2lts-mc( 0/ 4): ~13074 levels ~80000 states ~1123980 transitions
pnml2lts-mc( 0/ 4): ~26272 levels ~160000 states ~2305188 transitions
pnml2lts-mc( 0/ 4): ~52414 levels ~320000 states ~4565572 transitions
pnml2lts-mc( 1/ 4): ~105331 levels ~640000 states ~9101040 transitions
pnml2lts-mc( 1/ 4): ~210944 levels ~1280000 states ~18564520 transitions
pnml2lts-mc( 1/ 4): ~421397 levels ~2560000 states ~36267572 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 929986
pnml2lts-mc( 0/ 4): unique states count: 2783943
pnml2lts-mc( 0/ 4): unique transitions count: 41565454
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 14219561
pnml2lts-mc( 0/ 4): - claim found count: 2114134
pnml2lts-mc( 0/ 4): - claim success count: 2783948
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1836977
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2783948 states 41565549 transitions, fanout: 14.930
pnml2lts-mc( 0/ 4): Total exploration time 27.900 sec (27.750 sec minimum, 27.823 sec on average)
pnml2lts-mc( 0/ 4): States per second: 99783, Transitions per second: 1489805
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 130.2MB, 15.7 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 25.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 342 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 130.2MB (~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-02"
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-02, 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-171774426700172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-02.tgz
mv BlocksWorld-PT-02 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 ;