Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r605-tall-171774426700179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BlocksWorld-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r605-tall-171774426700179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 83K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 410K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 176K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 991K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 13K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 186K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 89K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 444K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 510K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K 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 330K 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-03-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717745829080

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:37:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:37:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:37:10] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-07 07:37:10] [INFO ] Transformed 379 places.
[2024-06-07 07:37:10] [INFO ] Transformed 685 transitions.
[2024-06-07 07:37:10] [INFO ] Found NUPN structural information;
[2024-06-07 07:37:10] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17]
[2024-06-07 07:37:10] [INFO ] Parsed PT model containing 379 places and 685 transitions and 3412 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 379/379 places, 685/685 transitions.
Applied a total of 0 rules in 42 ms. Remains 379 /379 variables (removed 0) and now considering 685/685 (removed 0) transitions.
// Phase 1: matrix 685 rows 379 cols
[2024-06-07 07:37:10] [INFO ] Computed 37 invariants in 31 ms
[2024-06-07 07:37:11] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-07 07:37:11] [INFO ] Invariant cache hit.
[2024-06-07 07:37:11] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-07 07:37:11] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Running 680 sub problems to find dead transitions.
[2024-06-07 07:37:11] [INFO ] Invariant cache hit.
[2024-06-07 07:37:11] [INFO ] State equation strengthened by 27 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD682 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 654 unsolved
[2024-06-07 07:37:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 1/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 0/28 constraints. Problems are: Problem set: 26 solved, 654 unsolved
Problem TDEAD93 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD678 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/379 variables, 10/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 443 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 680/680 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 36 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 1/1 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 1/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 23/379 variables, 36/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/38 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 5 (OVERLAPS) 684/1063 variables, 379/417 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 26/443 constraints. Problems are: Problem set: 36 solved, 644 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 644/1087 constraints. Problems are: Problem set: 36 solved, 644 unsolved
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 4 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2024-06-07 07:38:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:11] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:38:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:38:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
[2024-06-07 07:38:13] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 20 ms to minimize.
[2024-06-07 07:38:13] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:38:14] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
[2024-06-07 07:38:14] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:38:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:38:15] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 1104 constraints, problems are : Problem set: 36 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 379/379 constraints, ReadFeed: 26/27 constraints, PredecessorRefiner: 644/680 constraints, Known Traps: 18/18 constraints]
After SMT, in 64493ms problems are : Problem set: 36 solved, 644 unsolved
Search for dead transitions found 36 dead transitions in 64518ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 379/379 places, 649/685 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 361 transition count 649
Applied a total of 18 rules in 17 ms. Remains 361 /379 variables (removed 18) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 07:38:16] [INFO ] Computed 37 invariants in 3 ms
[2024-06-07 07:38:16] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-07 07:38:16] [INFO ] Invariant cache hit.
[2024-06-07 07:38:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:38:16] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 361/379 places, 649/685 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66199 ms. Remains : 361/379 places, 649/685 transitions.
Support contains 55 out of 361 places after structural reductions.
[2024-06-07 07:38:17] [INFO ] Flatten gal took : 85 ms
[2024-06-07 07:38:17] [INFO ] Flatten gal took : 48 ms
[2024-06-07 07:38:17] [INFO ] Input system was already deterministic with 649 transitions.
RANDOM walk for 40000 steps (8 resets) in 2472 ms. (16 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 324 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
[2024-06-07 07:38:18] [INFO ] Invariant cache hit.
[2024-06-07 07:38:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (OVERLAPS) 306/361 variables, 36/37 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1010 variables, 0/399 constraints. Problems are: Problem set: 5 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 5 solved, 5 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 3 (OVERLAPS) 306/361 variables, 36/38 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-07 07:38:19] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 2 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 2 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 2 ms to minimize.
[2024-06-07 07:38:20] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-06-07 07:38:21] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 2 ms to minimize.
[2024-06-07 07:38:21] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 2 ms to minimize.
[2024-06-07 07:38:21] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 2 ms to minimize.
[2024-06-07 07:38:21] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-06-07 07:38:21] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
[2024-06-07 07:38:21] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
[2024-06-07 07:38:22] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 2 ms to minimize.
[2024-06-07 07:38:22] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2024-06-07 07:38:22] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 5 ms to minimize.
[2024-06-07 07:38:22] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 2 ms to minimize.
[2024-06-07 07:38:22] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 3 ms to minimize.
[2024-06-07 07:38:22] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2024-06-07 07:38:23] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/58 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-07 07:38:23] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 3 ms to minimize.
[2024-06-07 07:38:23] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 2 ms to minimize.
[2024-06-07 07:38:23] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 2 ms to minimize.
[2024-06-07 07:38:23] [INFO ] Deduced a trap composed of 96 places in 180 ms of which 3 ms to minimize.
[2024-06-07 07:38:23] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-06-07 07:38:24] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 3 ms to minimize.
[2024-06-07 07:38:24] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 2 ms to minimize.
[2024-06-07 07:38:24] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2024-06-07 07:38:24] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 3 ms to minimize.
[2024-06-07 07:38:24] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
SMT process timed out in 5781ms, After SMT, problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 649/649 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 648
Applied a total of 1 rules in 331 ms. Remains 361 /361 variables (removed 0) and now considering 648/649 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 361/361 places, 648/649 transitions.
RANDOM walk for 40000 steps (8 resets) in 704 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 186337 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 4
Probabilistic random walk after 186337 steps, saw 147555 distinct states, run finished after 3007 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 648 rows 361 cols
[2024-06-07 07:38:28] [INFO ] Computed 37 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 307/361 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 398 constraints, problems are : Problem set: 0 solved, 4 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 307/361 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 3 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 2 ms to minimize.
[2024-06-07 07:38:29] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 2 ms to minimize.
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 3 ms to minimize.
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 51 places in 157 ms of which 3 ms to minimize.
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 10 ms to minimize.
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 2 ms to minimize.
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-06-07 07:38:30] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 3 ms to minimize.
[2024-06-07 07:38:31] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 2 ms to minimize.
[2024-06-07 07:38:31] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-06-07 07:38:31] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 3 ms to minimize.
[2024-06-07 07:38:31] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 3 ms to minimize.
[2024-06-07 07:38:31] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-07 07:38:31] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-07 07:38:32] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 2 ms to minimize.
[2024-06-07 07:38:32] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 3 ms to minimize.
[2024-06-07 07:38:32] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:38:32] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
[2024-06-07 07:38:32] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-06-07 07:38:32] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 2 ms to minimize.
[2024-06-07 07:38:33] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 2 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 2 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 3 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 2 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
[2024-06-07 07:38:34] [INFO ] Deduced a trap composed of 51 places in 153 ms of which 3 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 3 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 2 ms to minimize.
[2024-06-07 07:38:35] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 3 ms to minimize.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 361/1009 variables, and 76 constraints, problems are : Problem set: 4 solved, 0 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 39/39 constraints]
After SMT, in 7024ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BlocksWorld-PT-03-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA BlocksWorld-PT-03-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-03-LTLCardinality-11 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(X(X(G(p0)))))'
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
// Phase 1: matrix 649 rows 361 cols
[2024-06-07 07:38:36] [INFO ] Computed 37 invariants in 9 ms
[2024-06-07 07:38:36] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-07 07:38:36] [INFO ] Invariant cache hit.
[2024-06-07 07:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:38:36] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:38:36] [INFO ] Invariant cache hit.
[2024-06-07 07:38:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:39:32] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 1 ms to minimize.
[2024-06-07 07:39:33] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:39:35] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 3 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:39:36] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:39:38] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:39:39] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:39:40] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63615ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63621ms
Finished structural reductions in LTL mode , in 1 iterations and 64206 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 383 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 569 steps with 0 reset in 31 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-00 finished in 64681 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)||G(p1))))'
Support contains 54 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 63 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:39:40] [INFO ] Invariant cache hit.
[2024-06-07 07:39:41] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-07 07:39:41] [INFO ] Invariant cache hit.
[2024-06-07 07:39:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:39:41] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2024-06-07 07:39:41] [INFO ] Redundant transitions in 32 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:39:41] [INFO ] Invariant cache hit.
[2024-06-07 07:39:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:40:37] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:40:38] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:40:40] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-07 07:40:40] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:40:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:40:40] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:40:41] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:40:41] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:40:41] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:40:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:40:43] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:40:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:40:44] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2024-06-07 07:40:44] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63891ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63896ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65105 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 1409 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-01 finished in 66622 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 36 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 15 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:40:47] [INFO ] Invariant cache hit.
[2024-06-07 07:40:47] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-07 07:40:47] [INFO ] Invariant cache hit.
[2024-06-07 07:40:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:40:47] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:40:47] [INFO ] Invariant cache hit.
[2024-06-07 07:40:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:41:43] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:41:43] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 1 ms to minimize.
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:41:44] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-07 07:41:45] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 0 ms to minimize.
[2024-06-07 07:41:46] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 07:41:47] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-06-07 07:41:47] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-06-07 07:41:47] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:41:48] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:41:49] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-07 07:41:50] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:41:50] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-06-07 07:41:51] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:41:51] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 2 ms to minimize.
[2024-06-07 07:41:51] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
SMT process timed out in 63552ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63558ms
Finished structural reductions in LTL mode , in 1 iterations and 64138 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-03 finished in 64256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 36 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 35 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:41:51] [INFO ] Invariant cache hit.
[2024-06-07 07:41:51] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-06-07 07:41:51] [INFO ] Invariant cache hit.
[2024-06-07 07:41:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:41:52] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-06-07 07:41:52] [INFO ] Redundant transitions in 7 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:41:52] [INFO ] Invariant cache hit.
[2024-06-07 07:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2024-06-07 07:42:47] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:42:48] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-06-07 07:42:48] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 3 ms to minimize.
[2024-06-07 07:42:49] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:42:50] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-06-07 07:42:50] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:42:50] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:42:51] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 1 ms to minimize.
[2024-06-07 07:42:51] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-07 07:42:51] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:42:51] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-06-07 07:42:52] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:42:53] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:42:54] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:42:55] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1061 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 19/19 constraints]
After SMT, in 63476ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64120 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-05
Product exploration explored 100000 steps with 170 reset in 1045 ms.
Stack based approach found an accepted trace after 1474 steps with 3 reset with depth 342 and stack size 269 in 16 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-05 finished in 65267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 21 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:42:56] [INFO ] Invariant cache hit.
[2024-06-07 07:42:57] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-07 07:42:57] [INFO ] Invariant cache hit.
[2024-06-07 07:42:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:42:57] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-06-07 07:42:57] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:42:57] [INFO ] Invariant cache hit.
[2024-06-07 07:42:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:43:53] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:43:53] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-06-07 07:43:54] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:43:54] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-06-07 07:43:55] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:43:56] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:43:57] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2024-06-07 07:43:57] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-06-07 07:43:57] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-06-07 07:43:57] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-07 07:43:59] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:43:59] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:44:00] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:44:00] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63807ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63813ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64458 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 24856 reset in 682 ms.
Product exploration explored 100000 steps with 25187 reset in 708 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-07 07:44:03] [INFO ] Invariant cache hit.
[2024-06-07 07:44:03] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2024-06-07 07:44:04] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2024-06-07 07:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:44:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 30 ms returned sat
[2024-06-07 07:44:05] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2024-06-07 07:44:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:44:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2024-06-07 07:44:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 435 ms
[2024-06-07 07:44:05] [INFO ] Computed and/alt/rep : 85/85/85 causal constraints (skipped 559 transitions) in 94 ms.
[2024-06-07 07:44:05] [INFO ] Added : 0 causal constraints over 0 iterations in 188 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 23 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:44:06] [INFO ] Invariant cache hit.
[2024-06-07 07:44:06] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-07 07:44:06] [INFO ] Invariant cache hit.
[2024-06-07 07:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:44:06] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-06-07 07:44:06] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:44:06] [INFO ] Invariant cache hit.
[2024-06-07 07:44:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:45:03] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:45:04] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:45:04] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2024-06-07 07:45:04] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:45:06] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:45:06] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:45:06] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:45:06] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:45:07] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:45:07] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:45:07] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:45:07] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-07 07:45:09] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:45:10] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1056 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 14/14 constraints]
After SMT, in 63737ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63743ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64398 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-06-07 07:45:10] [INFO ] Invariant cache hit.
[2024-06-07 07:45:11] [INFO ] [Real]Absence check using 37 positive place invariants in 19 ms returned sat
[2024-06-07 07:45:11] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-06-07 07:45:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 07:45:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 27 ms returned sat
[2024-06-07 07:45:12] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2024-06-07 07:45:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-06-07 07:45:12] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-06-07 07:45:13] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:45:13] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-06-07 07:45:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2024-06-07 07:45:13] [INFO ] Computed and/alt/rep : 85/85/85 causal constraints (skipped 559 transitions) in 63 ms.
[2024-06-07 07:45:13] [INFO ] Added : 0 causal constraints over 0 iterations in 132 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25053 reset in 689 ms.
Product exploration explored 100000 steps with 25121 reset in 714 ms.
Support contains 18 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 23 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:45:14] [INFO ] Invariant cache hit.
[2024-06-07 07:45:15] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-07 07:45:15] [INFO ] Invariant cache hit.
[2024-06-07 07:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:15] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-06-07 07:45:15] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:45:15] [INFO ] Invariant cache hit.
[2024-06-07 07:45:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:46:11] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:46:11] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 1 ms to minimize.
[2024-06-07 07:46:11] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:46:12] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:46:14] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 07:46:14] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:46:14] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:46:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:46:16] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:46:17] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:46:17] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:46:18] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63345ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63354ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64012 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLCardinality-06 finished in 202117 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 U G((!p1||X(X(p1))))))'
Support contains 19 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 7 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:46:18] [INFO ] Invariant cache hit.
[2024-06-07 07:46:19] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-07 07:46:19] [INFO ] Invariant cache hit.
[2024-06-07 07:46:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:46:19] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:46:19] [INFO ] Invariant cache hit.
[2024-06-07 07:46:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:47:15] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 1 ms to minimize.
[2024-06-07 07:47:16] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:47:18] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:47:18] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:47:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:47:18] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:47:19] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-06-07 07:47:19] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:47:19] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:47:19] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:47:21] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2024-06-07 07:47:21] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:47:22] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:47:22] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63627ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63633ms
Finished structural reductions in LTL mode , in 1 iterations and 64172 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 389 ms :[false, (NOT p1), false, false, (NOT p1), true, false, false, (NOT p1), false]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 20038 reset in 897 ms.
Product exploration explored 100000 steps with 19926 reset in 907 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 10 states, 19 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 11 factoid took 134 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 160 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:47:26] [INFO ] Invariant cache hit.
[2024-06-07 07:47:26] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-07 07:47:26] [INFO ] Invariant cache hit.
[2024-06-07 07:47:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:47:26] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:47:26] [INFO ] Invariant cache hit.
[2024-06-07 07:47:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:48:23] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-06-07 07:48:23] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 1 ms to minimize.
[2024-06-07 07:48:24] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:48:24] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:48:25] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:48:26] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 3 ms to minimize.
[2024-06-07 07:48:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:48:26] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:48:27] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:48:27] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:48:27] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:48:27] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:48:28] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:48:29] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-07 07:48:30] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1057 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 15/15 constraints]
After SMT, in 63787ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63792ms
Finished structural reductions in LTL mode , in 1 iterations and 64385 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 168 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 160 ms :[false, (NOT p1), false, (NOT p1), true]
Product exploration explored 100000 steps with 14310 reset in 900 ms.
Product exploration explored 100000 steps with 14246 reset in 927 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 49 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:48:33] [INFO ] Redundant transitions in 4 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:48:33] [INFO ] Invariant cache hit.
[2024-06-07 07:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:49:29] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:49:30] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-07 07:49:31] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-06-07 07:49:32] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:49:34] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:49:35] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:49:35] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 3 ms to minimize.
[2024-06-07 07:49:35] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-06-07 07:49:36] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-06-07 07:49:36] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2024-06-07 07:49:37] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:49:37] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 20/1062 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1062 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 20/20 constraints]
After SMT, in 63851ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63857ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63921 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 10 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:49:37] [INFO ] Invariant cache hit.
[2024-06-07 07:49:37] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-07 07:49:37] [INFO ] Invariant cache hit.
[2024-06-07 07:49:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:38] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:49:38] [INFO ] Invariant cache hit.
[2024-06-07 07:49:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:50:34] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:50:34] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2024-06-07 07:50:34] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-07 07:50:35] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:50:36] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:50:36] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:50:36] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:50:36] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:50:37] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:50:37] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:50:37] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:50:37] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:50:39] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:50:40] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-07 07:50:40] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:50:41] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-06-07 07:50:42] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
SMT process timed out in 63883ms, After SMT, problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63889ms
Finished structural reductions in LTL mode , in 1 iterations and 64476 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLCardinality-07 finished in 263139 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(p0))&&F(p1))))'
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 9 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:50:42] [INFO ] Invariant cache hit.
[2024-06-07 07:50:42] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-07 07:50:42] [INFO ] Invariant cache hit.
[2024-06-07 07:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:50:42] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:50:42] [INFO ] Invariant cache hit.
[2024-06-07 07:50:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 (/ 1.0 4.0))
(s27 0.0)
(s28 1.0)
(s29 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:51:38] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:51:39] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:51:41] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:51:42] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-06-07 07:51:42] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-06-07 07:51:42] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-06-07 07:51:42] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:51:44] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:51:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:51:45] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:51:46] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63657ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63663ms
Finished structural reductions in LTL mode , in 1 iterations and 64225 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 19855 reset in 912 ms.
Stack based approach found an accepted trace after 10064 steps with 1990 reset with depth 23 and stack size 22 in 93 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-08 finished in 65500 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((X(F(p0))||(p1&&X(p1))))&&F(G(p2))))'
Support contains 6 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 5 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:51:47] [INFO ] Invariant cache hit.
[2024-06-07 07:51:47] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-07 07:51:47] [INFO ] Invariant cache hit.
[2024-06-07 07:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:51:48] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:51:48] [INFO ] Invariant cache hit.
[2024-06-07 07:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:52:45] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:52:46] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 1 ms to minimize.
[2024-06-07 07:52:46] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-06-07 07:52:46] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-06-07 07:52:48] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-07 07:52:48] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 2 ms to minimize.
[2024-06-07 07:52:48] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:52:48] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:52:49] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-07 07:52:49] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:52:49] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:52:49] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:52:51] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-07 07:52:52] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1056 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 14/14 constraints]
After SMT, in 64102ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 64110ms
Finished structural reductions in LTL mode , in 1 iterations and 64892 ms. Remains : 361/361 places, 649/649 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-09
Product exploration explored 100000 steps with 1 reset in 952 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA BlocksWorld-PT-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-03-LTLCardinality-09 finished in 66054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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 U G((!p1||X(X(p1))))))'
Found a Lengthening insensitive property : BlocksWorld-PT-03-LTLCardinality-07
Stuttering acceptance computed with spot in 391 ms :[false, (NOT p1), false, false, (NOT p1), true, false, false, (NOT p1), false]
Support contains 19 out of 361 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 12 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:52:54] [INFO ] Invariant cache hit.
[2024-06-07 07:52:54] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-07 07:52:54] [INFO ] Invariant cache hit.
[2024-06-07 07:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:52:54] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:52:54] [INFO ] Invariant cache hit.
[2024-06-07 07:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 timeout
0.0)
(s160 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:53:51] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:53:52] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 1 ms to minimize.
[2024-06-07 07:53:52] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 07:53:52] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:53:54] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:53:55] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 07:53:55] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-07 07:53:55] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:53:55] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:53:57] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:53:58] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1056 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 14/14 constraints]
After SMT, in 63770ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63776ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 64369 ms. Remains : 361/361 places, 649/649 transitions.
Running random walk in product with property : BlocksWorld-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 20062 reset in 883 ms.
Product exploration explored 100000 steps with 19944 reset in 965 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 133 ms. Reduced automaton from 10 states, 19 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 11 factoid took 149 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 167 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:54:01] [INFO ] Invariant cache hit.
[2024-06-07 07:54:01] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-07 07:54:01] [INFO ] Invariant cache hit.
[2024-06-07 07:54:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:54:01] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:54:01] [INFO ] Invariant cache hit.
[2024-06-07 07:54:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:54:57] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2024-06-07 07:54:58] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-06-07 07:54:59] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-06-07 07:55:00] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-06-07 07:55:00] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-06-07 07:55:00] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:55:00] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:55:01] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-06-07 07:55:01] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-06-07 07:55:01] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-06-07 07:55:02] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-07 07:55:03] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:55:04] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-06-07 07:55:05] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1058 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 16/16 constraints]
After SMT, in 63790ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63796ms
Finished structural reductions in LTL mode , in 1 iterations and 64377 ms. Remains : 361/361 places, 649/649 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[false, (NOT p1), false, (NOT p1), true]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 163 ms :[false, (NOT p1), false, (NOT p1), true]
Stuttering acceptance computed with spot in 190 ms :[false, (NOT p1), false, (NOT p1), true]
Product exploration explored 100000 steps with 14240 reset in 926 ms.
Product exploration explored 100000 steps with 14278 reset in 960 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[false, (NOT p1), false, (NOT p1), true]
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 22 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:55:08] [INFO ] Redundant transitions in 3 ms returned []
Running 644 sub problems to find dead transitions.
[2024-06-07 07:55:08] [INFO ] Invariant cache hit.
[2024-06-07 07:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:56:05] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2024-06-07 07:56:05] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-06-07 07:56:06] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2024-06-07 07:56:06] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 2 ms to minimize.
[2024-06-07 07:56:08] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:56:08] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-06-07 07:56:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-07 07:56:08] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-07 07:56:09] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-07 07:56:09] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:56:09] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-06-07 07:56:09] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-06-07 07:56:11] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:56:12] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1056 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 14/14 constraints]
After SMT, in 63551ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63556ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63589 ms. Remains : 361/361 places, 649/649 transitions.
Support contains 1 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 649/649 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 649/649 (removed 0) transitions.
[2024-06-07 07:56:12] [INFO ] Invariant cache hit.
[2024-06-07 07:56:12] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-07 07:56:12] [INFO ] Invariant cache hit.
[2024-06-07 07:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:56:12] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 644 sub problems to find dead transitions.
[2024-06-07 07:56:12] [INFO ] Invariant cache hit.
[2024-06-07 07:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 6 (OVERLAPS) 1/1010 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 399 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 2 (OVERLAPS) 5/361 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 4 (OVERLAPS) 648/1009 variables, 361/398 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 644/1042 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-06-07 07:57:10] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-07 07:57:10] [INFO ] Deduced a trap composed of 99 places in 144 ms of which 2 ms to minimize.
[2024-06-07 07:57:11] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 1 ms to minimize.
[2024-06-07 07:57:11] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 1 ms to minimize.
[2024-06-07 07:57:12] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-07 07:57:12] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-06-07 07:57:13] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:57:13] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2024-06-07 07:57:13] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 1 ms to minimize.
[2024-06-07 07:57:14] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-07 07:57:14] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-07 07:57:14] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-07 07:57:15] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1010 variables, and 1055 constraints, problems are : Problem set: 0 solved, 644 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 361/361 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 644/644 constraints, Known Traps: 13/13 constraints]
After SMT, in 63411ms problems are : Problem set: 0 solved, 644 unsolved
Search for dead transitions found 0 dead transitions in 63418ms
Finished structural reductions in LTL mode , in 1 iterations and 64007 ms. Remains : 361/361 places, 649/649 transitions.
Treatment of property BlocksWorld-PT-03-LTLCardinality-07 finished in 262664 ms.
[2024-06-07 07:57:16] [INFO ] Flatten gal took : 44 ms
[2024-06-07 07:57:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-07 07:57:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 361 places, 649 transitions and 3232 arcs took 8 ms.
Total runtime 1206298 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BlocksWorld-PT-03-LTLCardinality-06
Could not compute solution for formula : BlocksWorld-PT-03-LTLCardinality-07

BK_STOP 1717747076614

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BlocksWorld-PT-03-LTLCardinality-06
ltl formula formula --ltl=/tmp/2550/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2550/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2550/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2550/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2550/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 363 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 362, there are 652 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1636 levels ~10000 states ~35692 transitions
pnml2lts-mc( 2/ 4): ~3289 levels ~20000 states ~75204 transitions
pnml2lts-mc( 2/ 4): ~6580 levels ~40000 states ~148704 transitions
pnml2lts-mc( 2/ 4): ~13184 levels ~80000 states ~299000 transitions
pnml2lts-mc( 2/ 4): ~26379 levels ~160000 states ~596976 transitions
pnml2lts-mc( 3/ 4): ~52782 levels ~320000 states ~1190812 transitions
pnml2lts-mc( 3/ 4): ~105666 levels ~640000 states ~2423860 transitions
pnml2lts-mc( 3/ 4): ~211457 levels ~1280000 states ~4888892 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 421639
pnml2lts-mc( 0/ 4): unique states count: 1266461
pnml2lts-mc( 0/ 4): unique transitions count: 5729422
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 474415
pnml2lts-mc( 0/ 4): - claim found count: 949449
pnml2lts-mc( 0/ 4): - claim success count: 1266464
pnml2lts-mc( 0/ 4): - cum. max stack depth: 840351
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1266464 states 5729452 transitions, fanout: 4.524
pnml2lts-mc( 0/ 4): Total exploration time 15.750 sec (15.680 sec minimum, 15.713 sec on average)
pnml2lts-mc( 0/ 4): States per second: 80410, Transitions per second: 363775
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 94.8MB, 24.6 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 94.8MB (~256.0MB paged-in)
ltl formula name BlocksWorld-PT-03-LTLCardinality-07
ltl formula formula --ltl=/tmp/2550/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 361 places, 649 transitions and 3232 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2550/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2550/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2550/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2550/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4): There are 362 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 362, there are 668 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~1043 levels ~10000 states ~33904 transitions
pnml2lts-mc( 3/ 4): ~2007 levels ~20000 states ~68248 transitions
pnml2lts-mc( 3/ 4): ~4049 levels ~40000 states ~137664 transitions
pnml2lts-mc( 3/ 4): ~8080 levels ~80000 states ~276544 transitions
pnml2lts-mc( 3/ 4): ~16227 levels ~160000 states ~553672 transitions
pnml2lts-mc( 1/ 4): ~32516 levels ~320000 states ~1082136 transitions
pnml2lts-mc( 1/ 4): ~65447 levels ~640000 states ~2160804 transitions
pnml2lts-mc( 1/ 4): ~130653 levels ~1280000 states ~4330108 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1069250
pnml2lts-mc( 0/ 4): unique states count: 1734127
pnml2lts-mc( 0/ 4): unique transitions count: 6228001
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 196399
pnml2lts-mc( 0/ 4): - claim found count: 776382
pnml2lts-mc( 0/ 4): - claim success count: 1734134
pnml2lts-mc( 0/ 4): - cum. max stack depth: 663651
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1734134 states 6228039 transitions, fanout: 3.591
pnml2lts-mc( 0/ 4): Total exploration time 22.920 sec (22.810 sec minimum, 22.862 sec on average)
pnml2lts-mc( 0/ 4): States per second: 75660, Transitions per second: 271729
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 99.0MB, 22.6 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 661 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 99.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BlocksWorld-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BlocksWorld-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r605-tall-171774426700179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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