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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.1M
-rw-r--r-- 1 mcc users 120K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 557K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 164K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 943K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 20K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 405K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 258K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 750K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 532K 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-04-LTLCardinality-00
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-01
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-02
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-03
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-04
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-05
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-06
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-07
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-08
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-09
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-10
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-11
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-12
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-13
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-14
FORMULA_NAME BlocksWorld-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717746052180

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:40:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:40:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:40:53] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-06-07 07:40:53] [INFO ] Transformed 599 places.
[2024-06-07 07:40:53] [INFO ] Transformed 1105 transitions.
[2024-06-07 07:40:53] [INFO ] Found NUPN structural information;
[2024-06-07 07:40:53] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22]
[2024-06-07 07:40:53] [INFO ] Parsed PT model containing 599 places and 1105 transitions and 5512 arcs in 241 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 2 formulas.
FORMULA BlocksWorld-PT-04-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 599 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 599/599 places, 1105/1105 transitions.
Applied a total of 0 rules in 64 ms. Remains 599 /599 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
// Phase 1: matrix 1105 rows 599 cols
[2024-06-07 07:40:53] [INFO ] Computed 47 invariants in 37 ms
[2024-06-07 07:40:54] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-06-07 07:40:54] [INFO ] Invariant cache hit.
[2024-06-07 07:40:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-07 07:40:55] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
Running 1102 sub problems to find dead transitions.
[2024-06-07 07:40:55] [INFO ] Invariant cache hit.
[2024-06-07 07:40:55] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1102 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 41/41 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 62 ms to minimize.
[2024-06-07 07:41:13] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 2/43 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 596/1704 variables, and 43 constraints, problems are : Problem set: 40 solved, 1062 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 41/47 constraints, State Equation: 0/599 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1082/553 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 40 solved, 1062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 4/4 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 2/6 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 0/6 constraints. Problems are: Problem set: 40 solved, 1062 unsolved
Problem TDEAD286 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1092 is UNSAT
At refinement iteration 3 (OVERLAPS) 23/599 variables, 43/49 constraints. Problems are: Problem set: 46 solved, 1056 unsolved
[2024-06-07 07:41:43] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-07 07:41:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 2/51 constraints. Problems are: Problem set: 46 solved, 1056 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/51 constraints. Problems are: Problem set: 46 solved, 1056 unsolved
SMT process timed out in 67631ms, After SMT, problems are : Problem set: 46 solved, 1056 unsolved
Search for dead transitions found 46 dead transitions in 67673ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 599/599 places, 1059/1105 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 576 transition count 1059
Applied a total of 23 rules in 42 ms. Remains 576 /599 variables (removed 23) and now considering 1059/1059 (removed 0) transitions.
// Phase 1: matrix 1059 rows 576 cols
[2024-06-07 07:42:03] [INFO ] Computed 47 invariants in 22 ms
[2024-06-07 07:42:03] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-07 07:42:03] [INFO ] Invariant cache hit.
[2024-06-07 07:42:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:42:03] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 576/599 places, 1059/1105 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70209 ms. Remains : 576/599 places, 1059/1105 transitions.
Support contains 70 out of 576 places after structural reductions.
[2024-06-07 07:42:04] [INFO ] Flatten gal took : 108 ms
[2024-06-07 07:42:04] [INFO ] Flatten gal took : 74 ms
[2024-06-07 07:42:04] [INFO ] Input system was already deterministic with 1059 transitions.
RANDOM walk for 40000 steps (8 resets) in 3146 ms. (12 steps per ms) remains 12/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 453 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 259 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 320 ms. (124 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
[2024-06-07 07:42:06] [INFO ] Invariant cache hit.
[2024-06-07 07:42:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 506/576 variables, 46/47 constraints. Problems are: Problem set: 7 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1058/1634 variables, 576/623 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1634 variables, 0/623 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1635 variables, 1/624 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1635 variables, 0/624 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1635 variables, 0/624 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1635/1635 variables, and 624 constraints, problems are : Problem set: 7 solved, 5 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 576/576 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 5 unsolved
[2024-06-07 07:42:07] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 506/576 variables, 46/48 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 8 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 4 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 66 places in 291 ms of which 4 ms to minimize.
[2024-06-07 07:42:08] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 4 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 3 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 4 ms to minimize.
[2024-06-07 07:42:09] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 3 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 4 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 66 places in 257 ms of which 4 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 3 ms to minimize.
[2024-06-07 07:42:10] [INFO ] Deduced a trap composed of 114 places in 257 ms of which 3 ms to minimize.
[2024-06-07 07:42:11] [INFO ] Deduced a trap composed of 84 places in 258 ms of which 4 ms to minimize.
[2024-06-07 07:42:11] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 5 ms to minimize.
[2024-06-07 07:42:11] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 3 ms to minimize.
[2024-06-07 07:42:11] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 4 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 154 places in 254 ms of which 4 ms to minimize.
[2024-06-07 07:42:12] [INFO ] Deduced a trap composed of 144 places in 267 ms of which 3 ms to minimize.
SMT process timed out in 6214ms, After SMT, problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 1059/1059 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 576 transition count 1058
Applied a total of 1 rules in 722 ms. Remains 576 /576 variables (removed 0) and now considering 1058/1059 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 576/576 places, 1058/1059 transitions.
RANDOM walk for 40000 steps (8 resets) in 881 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 392 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 167643 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 4
Probabilistic random walk after 167643 steps, saw 135802 distinct states, run finished after 3005 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 1058 rows 576 cols
[2024-06-07 07:42:17] [INFO ] Computed 47 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 507/576 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1634 variables, 576/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1634 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/1634 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1634/1634 variables, and 623 constraints, problems are : Problem set: 0 solved, 4 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 576/576 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 507/576 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:42:18] [INFO ] Deduced a trap composed of 66 places in 273 ms of which 3 ms to minimize.
[2024-06-07 07:42:18] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 3 ms to minimize.
[2024-06-07 07:42:18] [INFO ] Deduced a trap composed of 66 places in 267 ms of which 4 ms to minimize.
[2024-06-07 07:42:19] [INFO ] Deduced a trap composed of 154 places in 275 ms of which 4 ms to minimize.
[2024-06-07 07:42:19] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 4 ms to minimize.
[2024-06-07 07:42:19] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 4 ms to minimize.
[2024-06-07 07:42:19] [INFO ] Deduced a trap composed of 144 places in 270 ms of which 3 ms to minimize.
[2024-06-07 07:42:20] [INFO ] Deduced a trap composed of 156 places in 272 ms of which 4 ms to minimize.
[2024-06-07 07:42:20] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 4 ms to minimize.
[2024-06-07 07:42:20] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 4 ms to minimize.
[2024-06-07 07:42:21] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 4 ms to minimize.
[2024-06-07 07:42:21] [INFO ] Deduced a trap composed of 66 places in 271 ms of which 4 ms to minimize.
[2024-06-07 07:42:21] [INFO ] Deduced a trap composed of 156 places in 269 ms of which 3 ms to minimize.
[2024-06-07 07:42:21] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 4 ms to minimize.
[2024-06-07 07:42:22] [INFO ] Deduced a trap composed of 66 places in 274 ms of which 4 ms to minimize.
[2024-06-07 07:42:22] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 3 ms to minimize.
[2024-06-07 07:42:22] [INFO ] Deduced a trap composed of 66 places in 270 ms of which 4 ms to minimize.
[2024-06-07 07:42:23] [INFO ] Deduced a trap composed of 66 places in 295 ms of which 4 ms to minimize.
[2024-06-07 07:42:23] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 3 ms to minimize.
[2024-06-07 07:42:23] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:42:23] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 4 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 66 places in 263 ms of which 3 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 144 places in 278 ms of which 4 ms to minimize.
[2024-06-07 07:42:24] [INFO ] Deduced a trap composed of 154 places in 261 ms of which 4 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 114 places in 273 ms of which 4 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 114 places in 274 ms of which 4 ms to minimize.
[2024-06-07 07:42:25] [INFO ] Deduced a trap composed of 154 places in 255 ms of which 3 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 136 places in 258 ms of which 3 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-07 07:42:26] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 3 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 66 places in 253 ms of which 4 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 4 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 4 ms to minimize.
[2024-06-07 07:42:27] [INFO ] Deduced a trap composed of 154 places in 262 ms of which 3 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 4 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 4 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 3 ms to minimize.
[2024-06-07 07:42:28] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 3 ms to minimize.
[2024-06-07 07:42:29] [INFO ] Deduced a trap composed of 66 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-07 07:42:29] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 4 ms to minimize.
[2024-06-07 07:42:29] [INFO ] Deduced a trap composed of 66 places in 266 ms of which 4 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 126 places in 263 ms of which 3 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 66 places in 260 ms of which 3 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 4 ms to minimize.
[2024-06-07 07:42:30] [INFO ] Deduced a trap composed of 66 places in 255 ms of which 4 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 84 places in 277 ms of which 4 ms to minimize.
[2024-06-07 07:42:31] [INFO ] Deduced a trap composed of 66 places in 264 ms of which 3 ms to minimize.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 576/1634 variables, and 95 constraints, problems are : Problem set: 4 solved, 0 unsolved in 14069 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, State Equation: 0/576 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 48/48 constraints]
After SMT, in 14651ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BlocksWorld-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA BlocksWorld-PT-04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 47 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 12 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
// Phase 1: matrix 1059 rows 576 cols
[2024-06-07 07:42:32] [INFO ] Computed 47 invariants in 9 ms
[2024-06-07 07:42:32] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-07 07:42:32] [INFO ] Invariant cache hit.
[2024-06-07 07:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:42:33] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:42:33] [INFO ] Invariant cache hit.
[2024-06-07 07:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37280ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37290ms
Finished structural reductions in LTL mode , in 1 iterations and 38194 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 902 ms.
Product exploration explored 100000 steps with 33333 reset in 836 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-04-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-04-LTLCardinality-02 finished in 40244 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(p1))&&p0)))'
Support contains 47 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 11 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:43:12] [INFO ] Invariant cache hit.
[2024-06-07 07:43:12] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-07 07:43:12] [INFO ] Invariant cache hit.
[2024-06-07 07:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:13] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:43:13] [INFO ] Invariant cache hit.
[2024-06-07 07:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37227ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37236ms
Finished structural reductions in LTL mode , in 1 iterations and 38207 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X p1), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-04-LTLCardinality-06 finished in 39152 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(G(p0))&&(p0 U p1)))))'
Support contains 2 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 8 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:43:51] [INFO ] Invariant cache hit.
[2024-06-07 07:43:52] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-06-07 07:43:52] [INFO ] Invariant cache hit.
[2024-06-07 07:43:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:43:52] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:43:52] [INFO ] Invariant cache hit.
[2024-06-07 07:43:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 36861ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 36871ms
Finished structural reductions in LTL mode , in 1 iterations and 37901 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-04-LTLCardinality-09 finished in 38207 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 1 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 12 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:44:29] [INFO ] Invariant cache hit.
[2024-06-07 07:44:30] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-07 07:44:30] [INFO ] Invariant cache hit.
[2024-06-07 07:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:44:30] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:44:30] [INFO ] Invariant cache hit.
[2024-06-07 07:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.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 1.0)
(s41 1.0)
(s42 0.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 1.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 1.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 1.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 1.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 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 timeout
0.0)
(s199 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37915ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37926ms
Finished structural reductions in LTL mode , in 1 iterations and 39014 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 2 ms.
FORMULA BlocksWorld-PT-04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-04-LTLCardinality-10 finished in 39129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 1 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 87 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:45:09] [INFO ] Invariant cache hit.
[2024-06-07 07:45:09] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-06-07 07:45:09] [INFO ] Invariant cache hit.
[2024-06-07 07:45:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:10] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2024-06-07 07:45:10] [INFO ] Redundant transitions in 58 ms returned []
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:45:10] [INFO ] Invariant cache hit.
[2024-06-07 07:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37021ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37031ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38368 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 310 ms.
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-04-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-04-LTLCardinality-11 finished in 39068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(X(F(p1))))||G(F(p1)))))'
Support contains 4 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 13 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:45:48] [INFO ] Invariant cache hit.
[2024-06-07 07:45:48] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-06-07 07:45:48] [INFO ] Invariant cache hit.
[2024-06-07 07:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:45:49] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:45:49] [INFO ] Invariant cache hit.
[2024-06-07 07:45:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37946ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37957ms
Finished structural reductions in LTL mode , in 1 iterations and 38959 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 769 ms.
Product exploration explored 100000 steps with 33333 reset in 789 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-04-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-04-LTLCardinality-12 finished in 40698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 50 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:46:28] [INFO ] Invariant cache hit.
[2024-06-07 07:46:29] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-07 07:46:29] [INFO ] Invariant cache hit.
[2024-06-07 07:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:46:29] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2024-06-07 07:46:29] [INFO ] Redundant transitions in 119 ms returned []
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:46:29] [INFO ] Invariant cache hit.
[2024-06-07 07:46:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37538ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37550ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38683 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 1289 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 40 in 1 ms.
FORMULA BlocksWorld-PT-04-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-04-LTLCardinality-13 finished in 40046 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(((X(p0) U (p0&&F(p1)))||X(p2))))'
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 11 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:47:08] [INFO ] Invariant cache hit.
[2024-06-07 07:47:09] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-07 07:47:09] [INFO ] Invariant cache hit.
[2024-06-07 07:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:47:09] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:47:09] [INFO ] Invariant cache hit.
[2024-06-07 07:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37244ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37253ms
Finished structural reductions in LTL mode , in 1 iterations and 38186 ms. Remains : 576/576 places, 1059/1059 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-14
Product exploration explored 100000 steps with 28280 reset in 722 ms.
Product exploration explored 100000 steps with 27450 reset in 824 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 679 ms. (58 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
[2024-06-07 07:47:49] [INFO ] Invariant cache hit.
[2024-06-07 07:47:49] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 5/1635 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/47 constraints, State Equation: 0/576 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (G (OR p2 p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 452 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 11 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:47:50] [INFO ] Invariant cache hit.
[2024-06-07 07:47:50] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-07 07:47:50] [INFO ] Invariant cache hit.
[2024-06-07 07:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:47:51] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:47:51] [INFO ] Invariant cache hit.
[2024-06-07 07:47:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37356ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37365ms
Finished structural reductions in LTL mode , in 1 iterations and 38317 ms. Remains : 576/576 places, 1059/1059 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 5310 steps (1 resets) in 118 ms. (44 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1244 ms.
Product exploration explored 100000 steps with 0 reset in 1326 ms.
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 13 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:48:32] [INFO ] Invariant cache hit.
[2024-06-07 07:48:32] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-07 07:48:32] [INFO ] Invariant cache hit.
[2024-06-07 07:48:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:48:33] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
Running 1056 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/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37208ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37219ms
Finished structural reductions in LTL mode , in 1 iterations and 38179 ms. Remains : 576/576 places, 1059/1059 transitions.
Treatment of property BlocksWorld-PT-04-LTLCardinality-14 finished in 122026 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(((X(p0) U (p0&&F(p1)))||X(p2))))'
Found a Lengthening insensitive property : BlocksWorld-PT-04-LTLCardinality-14
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 22 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:49:11] [INFO ] Invariant cache hit.
[2024-06-07 07:49:11] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-06-07 07:49:11] [INFO ] Invariant cache hit.
[2024-06-07 07:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:12] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:49:12] [INFO ] Invariant cache hit.
[2024-06-07 07:49:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 36856ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 36867ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 37888 ms. Remains : 576/576 places, 1059/1059 transitions.
Running random walk in product with property : BlocksWorld-PT-04-LTLCardinality-14
Product exploration explored 100000 steps with 27840 reset in 723 ms.
Product exploration explored 100000 steps with 28439 reset in 724 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 890 ms. (44 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
[2024-06-07 07:49:51] [INFO ] Invariant cache hit.
[2024-06-07 07:49:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Real declared 5/1635 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/47 constraints, State Equation: 0/576 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (G (OR p2 p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 468 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 10 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:49:52] [INFO ] Invariant cache hit.
[2024-06-07 07:49:52] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-06-07 07:49:52] [INFO ] Invariant cache hit.
[2024-06-07 07:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:49:53] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:49:53] [INFO ] Invariant cache hit.
[2024-06-07 07:49:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37453ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37464ms
Finished structural reductions in LTL mode , in 1 iterations and 38423 ms. Remains : 576/576 places, 1059/1059 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1782 steps (0 resets) in 41 ms. (42 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 366 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1229 ms.
Product exploration explored 100000 steps with 0 reset in 1347 ms.
Support contains 5 out of 576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 576/576 places, 1059/1059 transitions.
Applied a total of 0 rules in 11 ms. Remains 576 /576 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-07 07:50:34] [INFO ] Invariant cache hit.
[2024-06-07 07:50:34] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-07 07:50:34] [INFO ] Invariant cache hit.
[2024-06-07 07:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 07:50:35] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 992 ms to find 0 implicit places.
Running 1056 sub problems to find dead transitions.
[2024-06-07 07:50:35] [INFO ] Invariant cache hit.
[2024-06-07 07:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/573 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 2 (OVERLAPS) 3/576 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/576 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1056 unsolved
SMT process timed out in 37052ms, After SMT, problems are : Problem set: 0 solved, 1056 unsolved
Search for dead transitions found 0 dead transitions in 37063ms
Finished structural reductions in LTL mode , in 1 iterations and 38068 ms. Remains : 576/576 places, 1059/1059 transitions.
Treatment of property BlocksWorld-PT-04-LTLCardinality-14 finished in 121595 ms.
[2024-06-07 07:51:12] [INFO ] Flatten gal took : 66 ms
[2024-06-07 07:51:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-07 07:51:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 576 places, 1059 transitions and 5282 arcs took 11 ms.
Total runtime 619187 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BlocksWorld-PT-04-LTLCardinality-14

BK_STOP 1717746692245

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BlocksWorld-PT-04-LTLCardinality-14
ltl formula formula --ltl=/tmp/1392/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 576 places, 1059 transitions and 5282 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.100 real 0.050 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1392/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1392/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1392/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1392/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 578 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 577, there are 1066 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2494 levels ~10000 states ~50040 transitions
pnml2lts-mc( 1/ 4): ~4999 levels ~20000 states ~105132 transitions
pnml2lts-mc( 0/ 4): ~9994 levels ~40000 states ~198452 transitions
pnml2lts-mc( 0/ 4): ~19991 levels ~80000 states ~387728 transitions
pnml2lts-mc( 0/ 4): ~39926 levels ~160000 states ~764664 transitions
pnml2lts-mc( 0/ 4): ~79832 levels ~320000 states ~1615408 transitions
pnml2lts-mc( 0/ 4): ~159779 levels ~640000 states ~3303000 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 752818
pnml2lts-mc( 0/ 4): unique transitions count: 4279410
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 889552
pnml2lts-mc( 0/ 4): - claim success count: 752823
pnml2lts-mc( 0/ 4): - cum. max stack depth: 752412
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 752823 states 4279430 transitions, fanout: 5.685
pnml2lts-mc( 0/ 4): Total exploration time 18.810 sec (18.780 sec minimum, 18.792 sec on average)
pnml2lts-mc( 0/ 4): States per second: 40022, Transitions per second: 227508
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 87.7MB, 29.6 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1089 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 87.7MB (~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-04"
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-04, 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-171774426700187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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