/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 10), par{arg1 -> (arg1 - 1), arg2 -> undef4}> 20), par{arg1 -> (arg1 + 1), arg2 -> undef6}> undef8}> 30), par{arg2 -> undef10}> undef11, arg2 -> undef12}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Undef variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef12 > ~(1))> 10) /\ ((arg1 - 1) < 30), par{arg1 -> (arg1 - 1)}> 20) /\ ((arg1 + 1) < 30), par{arg1 -> (arg1 + 1)}> 20) /\ ((arg1 + 1) > 30), par{arg1 -> (arg1 + 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Undef variables: undef2, undef4, undef6, undef8, undef10, undef11, undef12, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003854 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001023s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009210s Piecewise ranking function: min(900 - 30*arg1,270) New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000682s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003136s Piecewise ranking function: min(-341 + 31*arg1,989 - 34*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000392s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001145s [54637 : 54638] [54637 : 54639] Successful child: 54638 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 2 - Process 1 * Exit transition: * Postcondition : arg1 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000551s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000641s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 2 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001011s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009524s Piecewise ranking function: min(900 - 30*arg1,270) New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000698s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003211s Piecewise ranking function: min(-341 + 31*arg1,989 - 34*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000389s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001151s [54637 : 54643] [54637 : 54644] Successful child: 54643 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 6 - Process 2 * Exit transition: * Postcondition : arg1 <= 6 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000592s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000691s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 6 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001010s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009604s Piecewise ranking function: min(900 - 30*arg1,270) New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000705s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003199s Piecewise ranking function: min(-341 + 31*arg1,989 - 34*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000399s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001157s [54637 : 54648] [54637 : 54649] Successful child: 54648 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 8 - Process 3 * Exit transition: * Postcondition : arg1 <= 8 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000601s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000700s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 8 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001008s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009613s Piecewise ranking function: min(900 - 30*arg1,270) New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000709s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003195s Piecewise ranking function: min(-341 + 31*arg1,989 - 34*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000389s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001147s [54637 : 54653] [54637 : 54654] Successful child: 54653 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 9 - Process 4 * Exit transition: * Postcondition : arg1 <= 9 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000604s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000705s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 9 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001025s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009580s Piecewise ranking function: min(900 - 30*arg1,270) New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000705s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003212s Piecewise ranking function: min(-341 + 31*arg1,989 - 34*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000389s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001153s [54637 : 54658] [54637 : 54659] Successful child: 54658 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 10 - Process 5 * Exit transition: * Postcondition : arg1 <= 10 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000599s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000695s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 10 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001020s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009571s Piecewise ranking function: min(900 - 30*arg1,270) New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000712s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003204s Piecewise ranking function: min(-341 + 31*arg1,989 - 34*arg1) New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000392s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001152s [54637 : 54663] [54637 : 54664] Successful child: 54663 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 20 - Process 6 * Exit transition: * Postcondition : arg1 <= 20 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000559s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000676s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 20 , It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001050s Ranking function: 434 + (~(31) / 2)*arg1 New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000403s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001224s [54637 : 54668] [54637 : 54669] Successful child: 54668 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 29 - Process 7 * Exit transition: * Postcondition : arg1 <= 29 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000585s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000686s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 29 , It's unfeasible. Removing transition: 1 + arg1, rest remain the same}> Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000426s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001243s [54637 : 54673] [54637 : 54674] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005031s Time used: 0.004723 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014492s Time used: 0.014489 LOG: SAT solveNonLinear - Elapsed time: 0.019524s Cost: 1; Total time: 0.019212 Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000394s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001188s [54637 : 54678] [54637 : 54679] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004673s Time used: 0.004395 [54637 : 54683] [54637 : 54687] Successful child: 54683 Program does NOT terminate