Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 292K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 356K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 31K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 230K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 933K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 599K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.1M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 1.5M 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-07-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717757712290

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-07 10:55:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 10:55:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 10:55:13] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-06-07 10:55:13] [INFO ] Transformed 1559 places.
[2024-06-07 10:55:13] [INFO ] Transformed 2965 transitions.
[2024-06-07 10:55:13] [INFO ] Found NUPN structural information;
[2024-06-07 10:55:13] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37]
[2024-06-07 10:55:13] [INFO ] Parsed PT model containing 1559 places and 2965 transitions and 14810 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BlocksWorld-PT-07-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1524 out of 1559 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 2965/2965 transitions.
Applied a total of 0 rules in 31 ms. Remains 1559 /1559 variables (removed 0) and now considering 2965/2965 (removed 0) transitions.
// Phase 1: matrix 2965 rows 1559 cols
[2024-06-07 10:55:14] [INFO ] Computed 77 invariants in 68 ms
[2024-06-07 10:55:14] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-07 10:55:14] [INFO ] Invariant cache hit.
[2024-06-07 10:55:16] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-07 10:55:16] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
Running 2958 sub problems to find dead transitions.
[2024-06-07 10:55:16] [INFO ] Invariant cache hit.
[2024-06-07 10:55:16] [INFO ] State equation strengthened by 63 read => feed constraints.
Problem TDEAD115 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2754 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2808 is UNSAT
Problem TDEAD2832 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2874 is UNSAT
Problem TDEAD2892 is UNSAT
Problem TDEAD2908 is UNSAT
Problem TDEAD2922 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2962 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1553 variables, 66/66 constraints. Problems are: Problem set: 66 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1553/4524 variables, and 66 constraints, problems are : Problem set: 66 solved, 2892 unsolved in 30182 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/63 constraints, PredecessorRefiner: 2925/1483 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 6/6 constraints. Problems are: Problem set: 66 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4524 variables, and 6 constraints, problems are : Problem set: 66 solved, 2892 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 6/77 constraints, State Equation: 0/1559 constraints, ReadFeed: 0/63 constraints, PredecessorRefiner: 1442/1483 constraints, Known Traps: 0/0 constraints]
After SMT, in 81036ms problems are : Problem set: 66 solved, 2892 unsolved
Search for dead transitions found 66 dead transitions in 81089ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 1559/1559 places, 2899/2965 transitions.
Deduced a syphon composed of 33 places in 2 ms
Applied a total of 0 rules in 18 ms. Remains 1559 /1559 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83400 ms. Remains : 1559/1559 places, 2899/2965 transitions.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Support contains 1491 out of 1526 places after structural reductions.
[2024-06-07 10:56:38] [INFO ] Flatten gal took : 327 ms
[2024-06-07 10:56:38] [INFO ] Flatten gal took : 213 ms
[2024-06-07 10:56:39] [INFO ] Input system was already deterministic with 2899 transitions.
Reduction of identical properties reduced properties to check from 20 to 18
RANDOM walk for 40000 steps (8 resets) in 4420 ms. (9 steps per ms) remains 2/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 7061 ms. (5 steps per ms) remains 2/2 properties
// Phase 1: matrix 2899 rows 1526 cols
[2024-06-07 10:56:42] [INFO ] Computed 77 invariants in 33 ms
[2024-06-07 10:56:42] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1488 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1488 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/1526 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/4425 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 1614 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1488 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:56:49] [INFO ] Deduced a trap composed of 144 places in 1155 ms of which 78 ms to minimize.
[2024-06-07 10:56:49] [INFO ] Deduced a trap composed of 231 places in 521 ms of which 6 ms to minimize.
[2024-06-07 10:56:50] [INFO ] Deduced a trap composed of 391 places in 1030 ms of which 9 ms to minimize.
[2024-06-07 10:56:51] [INFO ] Deduced a trap composed of 204 places in 833 ms of which 8 ms to minimize.
[2024-06-07 10:56:52] [INFO ] Deduced a trap composed of 279 places in 630 ms of which 6 ms to minimize.
[2024-06-07 10:56:53] [INFO ] Deduced a trap composed of 204 places in 1045 ms of which 9 ms to minimize.
SMT process timed out in 10915ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1488 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2899/2899 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 1526 transition count 2898
Applied a total of 1 rules in 449 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2899 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 450 ms. Remains : 1526/1526 places, 2898/2899 transitions.
RANDOM walk for 40000 steps (8 resets) in 2100 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6293 ms. (6 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 222786 steps, run timeout after 6002 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 222786 steps, saw 187695 distinct states, run finished after 6005 ms. (steps per millisecond=37 ) properties seen :0
// Phase 1: matrix 2898 rows 1526 cols
[2024-06-07 10:57:02] [INFO ] Computed 77 invariants in 34 ms
[2024-06-07 10:57:02] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1488 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1488 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/1526 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4424/4424 variables, and 1613 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1488 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:57:08] [INFO ] Deduced a trap composed of 144 places in 1161 ms of which 11 ms to minimize.
[2024-06-07 10:57:09] [INFO ] Deduced a trap composed of 231 places in 664 ms of which 6 ms to minimize.
[2024-06-07 10:57:10] [INFO ] Deduced a trap composed of 391 places in 1042 ms of which 8 ms to minimize.
[2024-06-07 10:57:11] [INFO ] Deduced a trap composed of 204 places in 715 ms of which 6 ms to minimize.
[2024-06-07 10:57:12] [INFO ] Deduced a trap composed of 279 places in 609 ms of which 7 ms to minimize.
[2024-06-07 10:57:13] [INFO ] Deduced a trap composed of 204 places in 963 ms of which 9 ms to minimize.
[2024-06-07 10:57:13] [INFO ] Deduced a trap composed of 144 places in 551 ms of which 6 ms to minimize.
[2024-06-07 10:57:14] [INFO ] Deduced a trap composed of 256 places in 1052 ms of which 9 ms to minimize.
[2024-06-07 10:57:15] [INFO ] Deduced a trap composed of 76 places in 1006 ms of which 8 ms to minimize.
[2024-06-07 10:57:16] [INFO ] Deduced a trap composed of 76 places in 693 ms of which 7 ms to minimize.
[2024-06-07 10:57:17] [INFO ] Deduced a trap composed of 76 places in 940 ms of which 8 ms to minimize.
[2024-06-07 10:57:18] [INFO ] Deduced a trap composed of 39 places in 800 ms of which 8 ms to minimize.
[2024-06-07 10:57:19] [INFO ] Deduced a trap composed of 175 places in 658 ms of which 7 ms to minimize.
[2024-06-07 10:57:19] [INFO ] Deduced a trap composed of 231 places in 528 ms of which 5 ms to minimize.
[2024-06-07 10:57:20] [INFO ] Deduced a trap composed of 111 places in 901 ms of which 7 ms to minimize.
[2024-06-07 10:57:21] [INFO ] Deduced a trap composed of 175 places in 868 ms of which 8 ms to minimize.
[2024-06-07 10:57:22] [INFO ] Deduced a trap composed of 111 places in 876 ms of which 9 ms to minimize.
[2024-06-07 10:57:23] [INFO ] Deduced a trap composed of 76 places in 772 ms of which 7 ms to minimize.
[2024-06-07 10:57:24] [INFO ] Deduced a trap composed of 204 places in 762 ms of which 8 ms to minimize.
[2024-06-07 10:57:25] [INFO ] Deduced a trap composed of 76 places in 877 ms of which 9 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1488 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:57:26] [INFO ] Deduced a trap composed of 375 places in 547 ms of which 6 ms to minimize.
[2024-06-07 10:57:26] [INFO ] Deduced a trap composed of 76 places in 661 ms of which 6 ms to minimize.
[2024-06-07 10:57:27] [INFO ] Deduced a trap composed of 76 places in 949 ms of which 9 ms to minimize.
[2024-06-07 10:57:28] [INFO ] Deduced a trap composed of 231 places in 963 ms of which 9 ms to minimize.
[2024-06-07 10:57:29] [INFO ] Deduced a trap composed of 204 places in 883 ms of which 8 ms to minimize.
[2024-06-07 10:57:30] [INFO ] Deduced a trap composed of 76 places in 907 ms of which 8 ms to minimize.
[2024-06-07 10:57:31] [INFO ] Deduced a trap composed of 76 places in 781 ms of which 8 ms to minimize.
[2024-06-07 10:57:32] [INFO ] Deduced a trap composed of 76 places in 989 ms of which 8 ms to minimize.
[2024-06-07 10:57:33] [INFO ] Deduced a trap composed of 144 places in 765 ms of which 7 ms to minimize.
[2024-06-07 10:57:34] [INFO ] Deduced a trap composed of 76 places in 933 ms of which 8 ms to minimize.
[2024-06-07 10:57:35] [INFO ] Deduced a trap composed of 144 places in 958 ms of which 10 ms to minimize.
[2024-06-07 10:57:36] [INFO ] Deduced a trap composed of 175 places in 968 ms of which 9 ms to minimize.
[2024-06-07 10:57:37] [INFO ] Deduced a trap composed of 256 places in 878 ms of which 8 ms to minimize.
[2024-06-07 10:57:38] [INFO ] Deduced a trap composed of 364 places in 890 ms of which 8 ms to minimize.
[2024-06-07 10:57:39] [INFO ] Deduced a trap composed of 204 places in 619 ms of which 7 ms to minimize.
[2024-06-07 10:57:40] [INFO ] Deduced a trap composed of 279 places in 892 ms of which 8 ms to minimize.
[2024-06-07 10:57:41] [INFO ] Deduced a trap composed of 300 places in 1013 ms of which 8 ms to minimize.
[2024-06-07 10:57:42] [INFO ] Deduced a trap composed of 76 places in 743 ms of which 7 ms to minimize.
[2024-06-07 10:57:43] [INFO ] Deduced a trap composed of 279 places in 980 ms of which 8 ms to minimize.
[2024-06-07 10:57:44] [INFO ] Deduced a trap composed of 319 places in 860 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1488 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 10:57:44] [INFO ] Deduced a trap composed of 396 places in 704 ms of which 7 ms to minimize.
[2024-06-07 10:57:46] [INFO ] Deduced a trap composed of 144 places in 1054 ms of which 9 ms to minimize.
[2024-06-07 10:57:47] [INFO ] Deduced a trap composed of 351 places in 842 ms of which 8 ms to minimize.
[2024-06-07 10:57:48] [INFO ] Deduced a trap composed of 76 places in 898 ms of which 8 ms to minimize.
[2024-06-07 10:57:48] [INFO ] Deduced a trap composed of 111 places in 825 ms of which 8 ms to minimize.
[2024-06-07 10:57:49] [INFO ] Deduced a trap composed of 144 places in 766 ms of which 7 ms to minimize.
[2024-06-07 10:57:50] [INFO ] Deduced a trap composed of 231 places in 1065 ms of which 9 ms to minimize.
[2024-06-07 10:57:51] [INFO ] Deduced a trap composed of 175 places in 392 ms of which 5 ms to minimize.
[2024-06-07 10:57:52] [INFO ] Deduced a trap composed of 384 places in 667 ms of which 6 ms to minimize.
[2024-06-07 10:57:52] [INFO ] Deduced a trap composed of 300 places in 685 ms of which 7 ms to minimize.
SMT process timed out in 50385ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1488 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 364 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 365 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 266 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
[2024-06-07 10:57:53] [INFO ] Invariant cache hit.
[2024-06-07 10:57:53] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-07 10:57:53] [INFO ] Invariant cache hit.
[2024-06-07 10:57:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-07 10:57:55] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-06-07 10:57:55] [INFO ] Redundant transitions in 171 ms returned []
Running 2891 sub problems to find dead transitions.
[2024-06-07 10:57:55] [INFO ] Invariant cache hit.
[2024-06-07 10:57:55] [INFO ] State equation strengthened by 10 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.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 1.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 1.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 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 2891/1449 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 1)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 timeout
1)
(s534 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1442/1449 constraints, Known Traps: 0/0 constraints]
After SMT, in 82647ms problems are : Problem set: 0 solved, 2891 unsolved
Search for dead transitions found 0 dead transitions in 82678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84643 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 1450 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 11 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
// Phase 1: matrix 2899 rows 1526 cols
[2024-06-07 10:59:18] [INFO ] Computed 77 invariants in 25 ms
[2024-06-07 10:59:18] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-07 10:59:18] [INFO ] Invariant cache hit.
[2024-06-07 10:59:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 10:59:19] [INFO ] Implicit Places using invariants and state equation in 1255 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 10:59:19] [INFO ] Invariant cache hit.
[2024-06-07 10:59:19] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 80626ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 80653ms
Finished structural reductions in LTL mode , in 1 iterations and 82232 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 3055 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-00 finished in 85593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0 U (p1||G(!p0)))))))'
Support contains 1488 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 10 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:00:43] [INFO ] Invariant cache hit.
[2024-06-07 11:00:44] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-07 11:00:44] [INFO ] Invariant cache hit.
[2024-06-07 11:00:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:00:45] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1541 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:00:45] [INFO ] Invariant cache hit.
[2024-06-07 11:00:45] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 81361ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 81386ms
Finished structural reductions in LTL mode , in 1 iterations and 82947 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-04
Product exploration timeout after 96130 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-04 finished in 93107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X(G(p1)))))))'
Support contains 71 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 132 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:02:17] [INFO ] Invariant cache hit.
[2024-06-07 11:02:18] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-06-07 11:02:18] [INFO ] Invariant cache hit.
[2024-06-07 11:02:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:02:20] [INFO ] Implicit Places using invariants and state equation in 2784 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:02:20] [INFO ] Invariant cache hit.
[2024-06-07 11:02:20] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.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 1.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 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 84345ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 84372ms
Finished structural reductions in LTL mode , in 1 iterations and 88279 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 2744 ms.
Product exploration explored 100000 steps with 0 reset in 2815 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1213 ms. (32 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 1/1 properties
[2024-06-07 11:03:51] [INFO ] Invariant cache hit.
[2024-06-07 11:03:51] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/4425 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/4425 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4425 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4425 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4425/4425 variables, and 1615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 33 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2899/2899 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 1526 transition count 2898
Applied a total of 1 rules in 6834 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2899 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6834 ms. Remains : 1526/1526 places, 2898/2899 transitions.
RANDOM walk for 40000 steps (8 resets) in 1207 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 431249 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 431249 steps, saw 375259 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 2898 rows 1526 cols
[2024-06-07 11:04:04] [INFO ] Computed 77 invariants in 17 ms
[2024-06-07 11:04:04] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4424/4424 variables, and 1613 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4424/4424 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2319ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 33 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 5206 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5208 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 5192 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
[2024-06-07 11:04:17] [INFO ] Invariant cache hit.
[2024-06-07 11:04:18] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-06-07 11:04:18] [INFO ] Invariant cache hit.
[2024-06-07 11:04:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-07 11:04:21] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 3681 ms to find 0 implicit places.
[2024-06-07 11:04:21] [INFO ] Redundant transitions in 139 ms returned []
Running 2891 sub problems to find dead transitions.
[2024-06-07 11:04:21] [INFO ] Invariant cache hit.
[2024-06-07 11:04:21] [INFO ] State equation strengthened by 10 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 2891/1449 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1442/1449 constraints, Known Traps: 0/0 constraints]
After SMT, in 82357ms problems are : Problem set: 0 solved, 2891 unsolved
Search for dead transitions found 0 dead transitions in 82382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91423 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 2899 rows 1526 cols
[2024-06-07 11:05:44] [INFO ] Computed 77 invariants in 17 ms
[2024-06-07 11:05:46] [INFO ] [Real]Absence check using 77 positive place invariants in 163 ms returned sat
[2024-06-07 11:05:53] [INFO ] [Real]Absence check using state equation in 7436 ms returned sat
[2024-06-07 11:05:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 11:05:55] [INFO ] [Nat]Absence check using 77 positive place invariants in 209 ms returned sat
[2024-06-07 11:06:07] [INFO ] [Nat]Absence check using state equation in 12234 ms returned sat
[2024-06-07 11:06:07] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:06:07] [INFO ] [Nat]Added 11 Read/Feed constraints in 52 ms returned sat
[2024-06-07 11:06:07] [INFO ] Deduced a trap composed of 111 places in 188 ms of which 30 ms to minimize.
[2024-06-07 11:06:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2024-06-07 11:06:08] [INFO ] Computed and/alt/rep : 259/259/259 causal constraints (skipped 2633 transitions) in 350 ms.
[2024-06-07 11:06:08] [INFO ] Added : 0 causal constraints over 0 iterations in 615 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 71 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 42 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:06:08] [INFO ] Invariant cache hit.
[2024-06-07 11:06:09] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-06-07 11:06:09] [INFO ] Invariant cache hit.
[2024-06-07 11:06:10] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:06:12] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3687 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:06:12] [INFO ] Invariant cache hit.
[2024-06-07 11:06:12] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 83179ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 83207ms
Finished structural reductions in LTL mode , in 1 iterations and 86944 ms. Remains : 1526/1526 places, 2899/2899 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 p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 2196 ms. (18 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 1/1 properties
[2024-06-07 11:07:36] [INFO ] Invariant cache hit.
[2024-06-07 11:07:36] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/4425 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/4425 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/4425 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4425 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4425 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4425/4425 variables, and 1615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 165 ms.
Support contains 33 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2899/2899 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 1526 transition count 2898
Applied a total of 1 rules in 6853 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2899 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6853 ms. Remains : 1526/1526 places, 2898/2899 transitions.
RANDOM walk for 40000 steps (8 resets) in 2125 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 434546 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 1
Probabilistic random walk after 434546 steps, saw 378264 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
// Phase 1: matrix 2898 rows 1526 cols
[2024-06-07 11:07:49] [INFO ] Computed 77 invariants in 16 ms
[2024-06-07 11:07:49] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4424 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4424/4424 variables, and 1613 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1456/1489 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1489 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/1526 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2898/4424 variables, 1526/1603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4424 variables, 10/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4424 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4424 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4424/4424 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 77/77 constraints, State Equation: 1526/1526 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2206ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 168 ms.
Support contains 33 out of 1526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 5261 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5262 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1526/1526 places, 2898/2898 transitions.
Applied a total of 0 rules in 5171 ms. Remains 1526 /1526 variables (removed 0) and now considering 2898/2898 (removed 0) transitions.
[2024-06-07 11:08:02] [INFO ] Invariant cache hit.
[2024-06-07 11:08:03] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-06-07 11:08:03] [INFO ] Invariant cache hit.
[2024-06-07 11:08:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-07 11:08:06] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 3587 ms to find 0 implicit places.
[2024-06-07 11:08:06] [INFO ] Redundant transitions in 66 ms returned []
Running 2891 sub problems to find dead transitions.
[2024-06-07 11:08:06] [INFO ] Invariant cache hit.
[2024-06-07 11:08:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 2891/1449 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/4424 variables, and 64 constraints, problems are : Problem set: 0 solved, 2891 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 64/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 1442/1449 constraints, Known Traps: 0/0 constraints]
After SMT, in 83040ms problems are : Problem set: 0 solved, 2891 unsolved
Search for dead transitions found 0 dead transitions in 83064ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91902 ms. Remains : 1526/1526 places, 2898/2898 transitions.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 2899 rows 1526 cols
[2024-06-07 11:09:30] [INFO ] Computed 77 invariants in 17 ms
[2024-06-07 11:09:31] [INFO ] [Real]Absence check using 77 positive place invariants in 163 ms returned sat
[2024-06-07 11:09:38] [INFO ] [Real]Absence check using state equation in 7481 ms returned sat
[2024-06-07 11:09:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 11:09:40] [INFO ] [Nat]Absence check using 77 positive place invariants in 215 ms returned sat
[2024-06-07 11:09:53] [INFO ] [Nat]Absence check using state equation in 12589 ms returned sat
[2024-06-07 11:09:53] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:09:53] [INFO ] [Nat]Added 11 Read/Feed constraints in 51 ms returned sat
[2024-06-07 11:09:53] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 2 ms to minimize.
[2024-06-07 11:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2024-06-07 11:09:53] [INFO ] Computed and/alt/rep : 259/259/259 causal constraints (skipped 2633 transitions) in 316 ms.
[2024-06-07 11:09:54] [INFO ] Added : 0 causal constraints over 0 iterations in 574 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 2867 ms.
Product exploration explored 100000 steps with 0 reset in 2788 ms.
Applying partial POR strategy [true, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Support contains 71 out of 1526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 644 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:10:01] [INFO ] Redundant transitions in 66 ms returned []
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:10:01] [INFO ] Invariant cache hit.
[2024-06-07 11:10:01] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 82036ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 82066ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 82794 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Built C files in :
/tmp/ltsmin8102128921538004268
[2024-06-07 11:11:23] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8102128921538004268
Running compilation step : cd /tmp/ltsmin8102128921538004268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8102128921538004268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8102128921538004268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 71 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 61 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:11:26] [INFO ] Invariant cache hit.
[2024-06-07 11:11:27] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-06-07 11:11:27] [INFO ] Invariant cache hit.
[2024-06-07 11:11:28] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:11:30] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 3754 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:11:30] [INFO ] Invariant cache hit.
[2024-06-07 11:11:30] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 81911ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 81938ms
Finished structural reductions in LTL mode , in 1 iterations and 85760 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Built C files in :
/tmp/ltsmin14660624975774822481
[2024-06-07 11:12:52] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14660624975774822481
Running compilation step : cd /tmp/ltsmin14660624975774822481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14660624975774822481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14660624975774822481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 11:12:55] [INFO ] Flatten gal took : 214 ms
[2024-06-07 11:12:56] [INFO ] Flatten gal took : 195 ms
[2024-06-07 11:12:56] [INFO ] Time to serialize gal into /tmp/LTL14563089391580572041.gal : 66 ms
[2024-06-07 11:12:56] [INFO ] Time to serialize properties into /tmp/LTL7926257111148697777.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14563089391580572041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1330362272211082387.hoa' '-atoms' '/tmp/LTL7926257111148697777.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7926257111148697777.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1330362272211082387.hoa
Detected timeout of ITS tools.
[2024-06-07 11:13:11] [INFO ] Flatten gal took : 94 ms
[2024-06-07 11:13:11] [INFO ] Flatten gal took : 97 ms
[2024-06-07 11:13:11] [INFO ] Time to serialize gal into /tmp/LTL18074904842803690761.gal : 57 ms
[2024-06-07 11:13:11] [INFO ] Time to serialize properties into /tmp/LTL17807573389629680400.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18074904842803690761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17807573389629680400.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(((((((pred_holding_0>=1)||(pred_holding_21>=1))||((pred_holding_22>=1)||(pred_holding_1>=1)))||(((pred_holding_2>=1)||(p...1583
Formula 0 simplified : XXX(G!"(((((((pred_holding_0>=1)||(pred_holding_21>=1))||((pred_holding_22>=1)||(pred_holding_1>=1)))||(((pred_holding_2>=1)||(pred_...1569
Detected timeout of ITS tools.
[2024-06-07 11:13:26] [INFO ] Flatten gal took : 91 ms
[2024-06-07 11:13:26] [INFO ] Applying decomposition
[2024-06-07 11:13:27] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8133300825915669772.txt' '-o' '/tmp/graph8133300825915669772.bin' '-w' '/tmp/graph8133300825915669772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8133300825915669772.bin' '-l' '-1' '-v' '-w' '/tmp/graph8133300825915669772.weights' '-q' '0' '-e' '0.001'
[2024-06-07 11:13:27] [INFO ] Decomposing Gal with order
[2024-06-07 11:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 11:13:28] [INFO ] Removed a total of 5404 redundant transitions.
[2024-06-07 11:13:28] [INFO ] Flatten gal took : 1071 ms
[2024-06-07 11:13:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 121 ms.
[2024-06-07 11:13:28] [INFO ] Time to serialize gal into /tmp/LTL5672314669324479436.gal : 78 ms
[2024-06-07 11:13:28] [INFO ] Time to serialize properties into /tmp/LTL8998780876906384428.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5672314669324479436.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8998780876906384428.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(((((((i0.u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pr...1863
Formula 0 simplified : XXX(G!"(((((((i0.u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_h...1849
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-07-LTLFireability-05 finished in 687012 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(!p1)||p0)))'
Support contains 71 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 44 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:13:44] [INFO ] Invariant cache hit.
[2024-06-07 11:13:45] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2024-06-07 11:13:45] [INFO ] Invariant cache hit.
[2024-06-07 11:13:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:13:47] [INFO ] Implicit Places using invariants and state equation in 2747 ms returned []
Implicit Place search using SMT with State Equation took 3931 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:13:48] [INFO ] Invariant cache hit.
[2024-06-07 11:13:48] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 82004ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 82030ms
Finished structural reductions in LTL mode , in 1 iterations and 86017 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 734 ms.
Product exploration explored 100000 steps with 50000 reset in 720 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-07-LTLFireability-06 finished in 87630 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))&&F((p1&&X(X(p2))))))'
Support contains 109 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 45 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:15:11] [INFO ] Invariant cache hit.
[2024-06-07 11:15:12] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-06-07 11:15:12] [INFO ] Invariant cache hit.
[2024-06-07 11:15:13] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:15:15] [INFO ] Implicit Places using invariants and state equation in 2533 ms returned []
Implicit Place search using SMT with State Equation took 3389 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:15:15] [INFO ] Invariant cache hit.
[2024-06-07 11:15:15] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 1)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 1)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 1)
(s543 0)
(s544 0)
(s546 1)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 1)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 1)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 1)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 1)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 1)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 1)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 1)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 1)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 1)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 1)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 1)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1009 0)
(s1010 1)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 1)
(s1028 0)
(s1029 0)
(s1030 1)
(s1031 1)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 1)
(s1081 0)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 0)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 0)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 0)
(s1118 1)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 timeout
0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 84628ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 84658ms
Finished structural reductions in LTL mode , in 1 iterations and 88101 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 315 ms :[p0, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), true, (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-07 finished in 88458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((G(p1)&&p0))&&(X(G(p3))||p2)))))'
Support contains 9 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 41 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:16:40] [INFO ] Invariant cache hit.
[2024-06-07 11:16:40] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-06-07 11:16:40] [INFO ] Invariant cache hit.
[2024-06-07 11:16:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:16:43] [INFO ] Implicit Places using invariants and state equation in 2488 ms returned []
Implicit Place search using SMT with State Equation took 3289 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:16:43] [INFO ] Invariant cache hit.
[2024-06-07 11:16:43] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 82085ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 82110ms
Finished structural reductions in LTL mode , in 1 iterations and 85450 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 2910 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-09 finished in 88784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 43 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:18:08] [INFO ] Invariant cache hit.
[2024-06-07 11:18:09] [INFO ] Implicit Places using invariants in 1038 ms returned []
[2024-06-07 11:18:09] [INFO ] Invariant cache hit.
[2024-06-07 11:18:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:18:12] [INFO ] Implicit Places using invariants and state equation in 2995 ms returned []
Implicit Place search using SMT with State Equation took 4038 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:18:13] [INFO ] Invariant cache hit.
[2024-06-07 11:18:13] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 81757ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 81795ms
Finished structural reductions in LTL mode , in 1 iterations and 85883 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-11
Product exploration explored 100000 steps with 276 reset in 2894 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-11 finished in 88923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(!p1 U (G(!p1)||(!p1&&(p2||X(!p3))))))))'
Support contains 38 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 44 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:19:37] [INFO ] Invariant cache hit.
[2024-06-07 11:19:38] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-06-07 11:19:38] [INFO ] Invariant cache hit.
[2024-06-07 11:19:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:19:41] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 3506 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:19:41] [INFO ] Invariant cache hit.
[2024-06-07 11:19:41] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 84437ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 84472ms
Finished structural reductions in LTL mode , in 1 iterations and 88030 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p3)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Product exploration explored 100000 steps with 50000 reset in 686 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 (NOT p3)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) p3 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-07-LTLFireability-12 finished in 89614 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||F(p1)))))'
Support contains 34 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 46 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:21:07] [INFO ] Invariant cache hit.
[2024-06-07 11:21:08] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2024-06-07 11:21:08] [INFO ] Invariant cache hit.
[2024-06-07 11:21:09] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:21:11] [INFO ] Implicit Places using invariants and state equation in 2880 ms returned []
Implicit Place search using SMT with State Equation took 3922 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:21:11] [INFO ] Invariant cache hit.
[2024-06-07 11:21:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 83036ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 83067ms
Finished structural reductions in LTL mode , in 1 iterations and 87046 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 573 reset in 2637 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-13 finished in 89851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(!p0)||X(G(!p1))))))'
Support contains 3 out of 1526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 48 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:22:37] [INFO ] Invariant cache hit.
[2024-06-07 11:22:38] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2024-06-07 11:22:38] [INFO ] Invariant cache hit.
[2024-06-07 11:22:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:22:41] [INFO ] Implicit Places using invariants and state equation in 2867 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:22:41] [INFO ] Invariant cache hit.
[2024-06-07 11:22:41] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.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 1.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 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 83917ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 83940ms
Finished structural reductions in LTL mode , in 1 iterations and 87887 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 261 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), false, p0]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 98 reset in 2761 ms.
Product exploration explored 100000 steps with 113 reset in 2848 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
RANDOM walk for 40000 steps (8 resets) in 1199 ms. (33 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-06-07 11:24:11] [INFO ] Invariant cache hit.
[2024-06-07 11:24:11] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 225/4425 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 6/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-07-LTLFireability-14 finished in 94590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1526/1526 places, 2899/2899 transitions.
Applied a total of 0 rules in 225 ms. Remains 1526 /1526 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-07 11:24:12] [INFO ] Invariant cache hit.
[2024-06-07 11:24:12] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-06-07 11:24:12] [INFO ] Invariant cache hit.
[2024-06-07 11:24:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-07 11:24:15] [INFO ] Implicit Places using invariants and state equation in 2501 ms returned []
Implicit Place search using SMT with State Equation took 3362 ms to find 0 implicit places.
[2024-06-07 11:24:15] [INFO ] Redundant transitions in 68 ms returned []
Running 2892 sub problems to find dead transitions.
[2024-06-07 11:24:15] [INFO ] Invariant cache hit.
[2024-06-07 11:24:15] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 2892/1450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2892 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 2892 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/4425 variables, and 66 constraints, problems are : Problem set: 0 solved, 2892 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 66/77 constraints, State Equation: 0/1526 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1442/1450 constraints, Known Traps: 0/0 constraints]
After SMT, in 84792ms problems are : Problem set: 0 solved, 2892 unsolved
Search for dead transitions found 0 dead transitions in 84822ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 88492 ms. Remains : 1526/1526 places, 2899/2899 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-07-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 2827 ms.
Stack based approach found an accepted trace after 644 steps with 0 reset with depth 645 and stack size 536 in 20 ms.
FORMULA BlocksWorld-PT-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-07-LTLFireability-15 finished in 91561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X(G(p1)))))))'
[2024-06-07 11:25:43] [INFO ] Flatten gal took : 100 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3475081927039957618
[2024-06-07 11:25:43] [INFO ] Too many transitions (2899) to apply POR reductions. Disabling POR matrices.
[2024-06-07 11:25:43] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3475081927039957618
Running compilation step : cd /tmp/ltsmin3475081927039957618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 11:25:43] [INFO ] Applying decomposition
[2024-06-07 11:25:43] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8909648617316203502.txt' '-o' '/tmp/graph8909648617316203502.bin' '-w' '/tmp/graph8909648617316203502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8909648617316203502.bin' '-l' '-1' '-v' '-w' '/tmp/graph8909648617316203502.weights' '-q' '0' '-e' '0.001'
[2024-06-07 11:25:44] [INFO ] Decomposing Gal with order
[2024-06-07 11:25:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 11:25:44] [INFO ] Removed a total of 5404 redundant transitions.
[2024-06-07 11:25:44] [INFO ] Flatten gal took : 312 ms
[2024-06-07 11:25:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 41 ms.
[2024-06-07 11:25:44] [INFO ] Time to serialize gal into /tmp/LTLFireability17161822143924632155.gal : 27 ms
[2024-06-07 11:25:44] [INFO ] Time to serialize properties into /tmp/LTLFireability5016441373581544943.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17161822143924632155.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5016441373581544943.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F("(((((((u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_...1869
Formula 0 simplified : XXX(G!"(((((((u0.pred_holding_0>=1)||(u21.pred_holding_21>=1))||((u22.pred_holding_22>=1)||(u1.pred_holding_1>=1)))||(((u2.pred_hold...1855
Compilation finished in 8819 ms.
Running link step : cd /tmp/ltsmin3475081927039957618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin3475081927039957618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.044: LTL layer: formula: X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.044: "X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.045: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.112: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.057: DFS-FIFO for weak LTL, using special progress label 2902
pins2lts-mc-linux64( 0/ 8), 1.057: There are 2903 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.057: State length is 1527, there are 2910 groups
pins2lts-mc-linux64( 0/ 8), 1.057: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.057: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.057: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.057: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.324: ~1 levels ~960 states ~6072 transitions
pins2lts-mc-linux64( 4/ 8), 1.540: ~1 levels ~1920 states ~12992 transitions
pins2lts-mc-linux64( 3/ 8), 1.939: ~1 levels ~3840 states ~28936 transitions
pins2lts-mc-linux64( 6/ 8), 2.719: ~1 levels ~7680 states ~51416 transitions
pins2lts-mc-linux64( 6/ 8), 4.176: ~1 levels ~15360 states ~100136 transitions
pins2lts-mc-linux64( 6/ 8), 7.055: ~1 levels ~30720 states ~211440 transitions
pins2lts-mc-linux64( 4/ 8), 12.630: ~1 levels ~61440 states ~438544 transitions
pins2lts-mc-linux64( 4/ 8), 22.993: ~1 levels ~122880 states ~846376 transitions
pins2lts-mc-linux64( 4/ 8), 43.023: ~1 levels ~245760 states ~1649200 transitions
pins2lts-mc-linux64( 4/ 8), 84.112: ~1 levels ~491520 states ~3453992 transitions
pins2lts-mc-linux64( 4/ 8), 167.093: ~1 levels ~983040 states ~7187736 transitions
pins2lts-mc-linux64( 4/ 8), 331.870: ~1 levels ~1966080 states ~13884880 transitions
pins2lts-mc-linux64( 4/ 8), 659.172: ~1 levels ~3932160 states ~27104392 transitions
pins2lts-mc-linux64( 6/ 8), 1401.617: ~1 levels ~7864320 states ~57027864 transitions
pins2lts-mc-linux64( 7/ 8), 1499.732: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1499.918:
pins2lts-mc-linux64( 0/ 8), 1499.918: mean standard work distribution: 1.0% (states) 4.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1499.918:
pins2lts-mc-linux64( 0/ 8), 1499.918: Explored 8314998 states 64696593 transitions, fanout: 7.781
pins2lts-mc-linux64( 0/ 8), 1499.918: Total exploration time 1498.860 sec (1498.670 sec minimum, 1498.739 sec on average)
pins2lts-mc-linux64( 0/ 8), 1499.918: States per second: 5548, Transitions per second: 43164
pins2lts-mc-linux64( 0/ 8), 1499.918:
pins2lts-mc-linux64( 0/ 8), 1499.918: Progress states detected: 35555464
pins2lts-mc-linux64( 0/ 8), 1499.918: Redundant explorations: -76.6140
pins2lts-mc-linux64( 0/ 8), 1499.918:
pins2lts-mc-linux64( 0/ 8), 1499.918: Queue width: 8B, total height: 38682142, memory: 295.12MB
pins2lts-mc-linux64( 0/ 8), 1499.918: Tree memory: 527.3MB, 15.5 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1499.918: Tree fill ratio (roots/leafs): 26.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1499.918: Stored 2991 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1499.918: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1499.918: Est. total memory use: 822.4MB (~1319.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3475081927039957618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3475081927039957618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>((LTLAPp0==true))&&X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-07.tgz
mv BlocksWorld-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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