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.r602-tall-171774424600171.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 itstools
Input is BlocksWorld-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600171
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717745705040

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-07 07:35:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 07:35:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:35:06] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-07 07:35:06] [INFO ] Transformed 209 places.
[2024-06-07 07:35:06] [INFO ] Transformed 365 transitions.
[2024-06-07 07:35:06] [INFO ] Found NUPN structural information;
[2024-06-07 07:35:06] [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:35:06] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BlocksWorld-PT-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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 20 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:35:06] [INFO ] Computed 27 invariants in 19 ms
[2024-06-07 07:35:06] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-06-07 07:35:06] [INFO ] Invariant cache hit.
[2024-06-07 07:35:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-07 07:35:07] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-06-07 07:35:07] [INFO ] Invariant cache hit.
[2024-06-07 07:35:07] [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:35:11] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 13 ms to minimize.
[2024-06-07 07:35:12] [INFO ] Deduced a trap composed of 15 places in 27 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 17433 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:35:33] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:35:33] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:35:34] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:35:35] [INFO ] Deduced a trap composed of 54 places in 62 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:35:39] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:35:39] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:35:39] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-06-07 07:35:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:35:39] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:35:40] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:35:40] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:35:40] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:35:40] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:35:41] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:35:41] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:35:42] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 2 ms to minimize.
[2024-06-07 07:35:43] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2024-06-07 07:35:44] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 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:35:50] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:35:50] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:35:51] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:35:53] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 7 ms to minimize.
[2024-06-07 07:35:53] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2024-06-07 07:35:53] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:35:54] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:35:54] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:35:55] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:35:55] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 18 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 30045 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 49056ms problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 49073ms
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.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 196 transition count 339
Applied a total of 13 rules in 14 ms. Remains 196 /209 variables (removed 13) and now considering 339/339 (removed 0) transitions.
// Phase 1: matrix 339 rows 196 cols
[2024-06-07 07:35:56] [INFO ] Computed 27 invariants in 3 ms
[2024-06-07 07:35:56] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-07 07:35:56] [INFO ] Invariant cache hit.
[2024-06-07 07:35:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:35:56] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 196/209 places, 339/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50144 ms. Remains : 196/209 places, 339/365 transitions.
Support contains 40 out of 196 places after structural reductions.
[2024-06-07 07:35:56] [INFO ] Flatten gal took : 56 ms
[2024-06-07 07:35:57] [INFO ] Flatten gal took : 29 ms
[2024-06-07 07:35:57] [INFO ] Input system was already deterministic with 339 transitions.
RANDOM walk for 40000 steps (8 resets) in 3072 ms. (13 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 283 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
[2024-06-07 07:35:58] [INFO ] Invariant cache hit.
[2024-06-07 07:35:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 156/196 variables, 26/27 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 6 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/183 variables, 14/14 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-07 07:35:58] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:35:58] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:35:58] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:35:59] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:36:00] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Int declared 183/535 variables, and 31 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1480 ms.
Refiners :[Positive P Invariants (semi-flows): 14/27 constraints, State Equation: 0/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 17/17 constraints]
After SMT, in 1683ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
FORMULA BlocksWorld-PT-02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X((F(G(p1))||p0)) U !p1)))))'
Support contains 39 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:36:00] [INFO ] Invariant cache hit.
[2024-06-07 07:36:00] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-07 07:36:00] [INFO ] Invariant cache hit.
[2024-06-07 07:36:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:36:00] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:36:00] [INFO ] Invariant cache hit.
[2024-06-07 07:36:00] [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 13199 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:21] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:36:21] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:36:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:36:23] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:36:24] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:36:24] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:36: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:36:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:36:29] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:36:30] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:36:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:36:32] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:36:32] [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:36:37] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-07 07:36:38] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:36:39] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:36:40] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:36:40] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:36:40] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:36:40] [INFO ] Deduced a trap composed of 36 places in 43 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 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 44349ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44354ms
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 305 ms :[p1, p1, false, false]
Running random walk in product with property : BlocksWorld-PT-02-LTLCardinality-00
Product exploration explored 100000 steps with 71 reset in 734 ms.
Stack based approach found an accepted trace after 2254 steps with 0 reset with depth 2255 and stack size 1469 in 15 ms.
FORMULA BlocksWorld-PT-02-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLCardinality-00 finished in 45785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 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 35 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:36:46] [INFO ] Invariant cache hit.
[2024-06-07 07:36:46] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-07 07:36:46] [INFO ] Invariant cache hit.
[2024-06-07 07:36:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:36:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-06-07 07:36:46] [INFO ] Redundant transitions in 17 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:36:46] [INFO ] Invariant cache hit.
[2024-06-07 07:36: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 12965 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:37:07] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-06-07 07:37:07] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:37:08] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:09] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:37:10] [INFO ] Deduced a trap composed of 26 places in 62 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:37:15] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:37:15] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:37:16] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 3 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:37:17] [INFO ] Deduced a trap composed of 36 places in 41 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:37:23] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:37:23] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:37:23] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:37:23] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:37:24] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:37:25] [INFO ] Deduced a trap composed of 36 places in 47 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 43965ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44366 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 585 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLCardinality-01 finished in 45030 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 26 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 8 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:37:31] [INFO ] Invariant cache hit.
[2024-06-07 07:37:31] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-07 07:37:31] [INFO ] Invariant cache hit.
[2024-06-07 07:37:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:37:31] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:37:31] [INFO ] Invariant cache hit.
[2024-06-07 07:37: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 13021 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:37:52] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:37:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:37:53] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-07 07:37:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:37:55] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 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:00] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:38:00] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:38:01] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:02] [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:08] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-06-07 07:38:08] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:38:08] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:38:08] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:38:08] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-07 07:38:09] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 2 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [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 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 43993ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43997ms
Finished structural reductions in LTL mode , in 1 iterations and 44302 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Running random walk in product with property : BlocksWorld-PT-02-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2905 steps with 0 reset in 22 ms.
FORMULA BlocksWorld-PT-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLCardinality-03 finished in 44429 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||F(G(p1))) U X(G((G(p1) U !p0)))))'
Support contains 2 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 29 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:38:15] [INFO ] Invariant cache hit.
[2024-06-07 07:38:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-07 07:38:15] [INFO ] Invariant cache hit.
[2024-06-07 07:38:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:38:15] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-06-07 07:38:15] [INFO ] Redundant transitions in 4 ms returned []
Running 335 sub problems to find dead transitions.
[2024-06-07 07:38:15] [INFO ] Invariant cache hit.
[2024-06-07 07:38: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 13278 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:37] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:37] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-07 07:38:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:38:39] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:38:40] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:38:40] [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:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:38:44] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:38:45] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:38:46] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:38:47] [INFO ] Deduced a trap composed of 36 places in 36 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:53] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:38:53] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-06-07 07:38:53] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:38:53] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:38:53] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:38:53] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:38:54] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:38:55] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-07 07:38:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:55] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:38:55] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:38:55] [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 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 44278ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44281ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44628 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : BlocksWorld-PT-02-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 554 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA BlocksWorld-PT-02-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLCardinality-09 finished in 45403 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((F(p1)&&p0))))'
Support contains 3 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:39:00] [INFO ] Invariant cache hit.
[2024-06-07 07:39:01] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-07 07:39:01] [INFO ] Invariant cache hit.
[2024-06-07 07:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:01] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:39:01] [INFO ] Invariant cache hit.
[2024-06-07 07:39: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 12796 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:21] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:39:21] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:39:22] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:39:23] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:39:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:39:25] [INFO ] Deduced a trap composed of 26 places in 74 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:29] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:39:29] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:39:30] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:39:31] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:39:32] [INFO ] Deduced a trap composed of 36 places in 47 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:37] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-07 07:39:37] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:39:40] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:39:40] [INFO ] Deduced a trap composed of 36 places in 43 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 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 43676ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 43679ms
Finished structural reductions in LTL mode , in 1 iterations and 44083 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLCardinality-11 finished in 44256 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 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 5 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-06-07 07:39:45] [INFO ] Invariant cache hit.
[2024-06-07 07:39:45] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-07 07:39:45] [INFO ] Invariant cache hit.
[2024-06-07 07:39:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:45] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-07 07:39:45] [INFO ] Invariant cache hit.
[2024-06-07 07:39: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 13024 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:06] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:06] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:40:07] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:40:08] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:40:08] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:40:09] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:40:09] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:40:09] [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:13] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:40:14] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:40:15] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:40:16] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:40:16] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:40:16] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-07 07:40:16] [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:40:22] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-07 07:40:22] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 26 places in 51 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 44 places in 83 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2024-06-07 07:40:23] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:40:24] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:40:24] [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 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 44134ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 44138ms
Finished structural reductions in LTL mode , in 1 iterations and 44468 ms. Remains : 196/196 places, 339/339 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLCardinality-15
Product exploration explored 100000 steps with 535 reset in 555 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA BlocksWorld-PT-02-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLCardinality-15 finished in 45182 ms.
All properties solved by simple procedures.
Total runtime 324256 ms.

BK_STOP 1717746030467

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BlocksWorld-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424600171"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;