NO Solver Timeout: 4 Global Timeout: 60 Maximum number of concurrent processes: 900 /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||' while (z > 0 && (y == 0 || y > 0 && x > 0)) { ~~ ~~~~~~^~~~~~~~ /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning while (z > 0 && (y == 0 || y > 0 && x > 0)) { ^ ( ) 1 warning generated. /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: warning: '&&' within '||' while (z > 0 && (y == 0 || y > 0 && x > 0)) { ~~ ~~~~~~^~~~~~~~ /export/starexec/sandbox/benchmark/theBenchmark.c:15:38: note: place parentheses around the '&&' expression to silence this warning while (z > 0 && (y == 0 || y > 0 && x > 0)) { ^ ( ) 2 warnings generated. ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> main_y, main_res -> 0}> 0))> 0)> 0))> 0)> 0))> 0)> (main_res + 1), main_y -> main_z}> (main_x + 1), main_y -> (main_y - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2, main_z -> main_y, main_res -> 0}> 0)> 0))> 0)> 0))> 0)> 0))> (main_res + 1), main_y -> main_z}> (main_x + 1), main_y -> (main_y - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | res | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_y = 0) /\ (main_y = 0), par{main_y -> main_z, main_res -> (main_res + 1)}> 0) /\ (main_y < 0) /\ not((main_y > 0))> 0) /\ (main_y > 0) /\ (main_y > 0) /\ (main_x > 0) /\ (main_y > 0), par{main_x -> (main_x + 1), main_y -> (main_y - 1)}> 0) /\ (main_y > 0) /\ (main_y > 0) /\ not((main_x > 0))> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_y, main_z, main_res, main_x Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 13 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.0072 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001252s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010396s [5783 : 5785] [5783 : 5786] Successful child: 5785 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> New Graphs: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> Variables: main_x, main_y, main_z, main_res Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001220s Ranking function: -main_y New Graphs: LOG: CALL check - Post:main_x + main_y <= main_z + main_res - Process 1 * Exit transition: * Postcondition : main_x + main_y <= main_z + main_res LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000668s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000800s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x + main_y <= main_z + main_res , main_z + main_res <= main_y , main_z <= 1 + main_y , Narrowing transition: main_z, main_res -> 1 + main_res, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> main_z, main_res -> 1 + main_res, rest remain the same}> main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_y, main_z, main_res, main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004148s Ranking function: 1 - 3*main_x - 3*main_y - 4*main_z - 4*main_res New Graphs: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z, main_res Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002627s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.118986s [5783 : 5790] [5783 : 5791] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.074667s Time used: 0.072092 LOG: SAT solveNonLinear - Elapsed time: 0.074667s Cost: 0; Total time: 0.072092 Termination implied by a set of invariant(s): Invariant at l2: 1 + main_z + main_res <= main_x + main_y [ 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: main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_y -> -1 + main_y, rest remain the same}> New Graphs: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z, main_res Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001398s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.017405s [5783 : 5795] [5783 : 5796] Successful child: 5795 [ 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: main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_z, main_res -> 1 + main_res, rest remain the same}> New Graphs: INVARIANTS: 2: 1 + main_z + main_res <= main_x + main_y , Quasi-INVARIANTS to narrow Graph: 2: LOG: CALL check - Post:main_y <= 0 - Process 2 * Exit transition: * Postcondition : main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000871s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000986s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_y <= 0 , main_z <= main_y , 1 + main_res <= main_x , It's unfeasible. Removing transition: main_z, main_res -> 1 + main_res, rest remain the same}> It's unfeasible. Removing transition: main_z, main_res -> 1 + main_res, rest remain the same}> Narrowing transition: main_z, main_res -> 1 + main_res, rest remain the same}> LOG: Narrow transition size 3 It's unfeasible. Removing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Narrowing transition: 1 + main_x, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_y, main_z, main_res, main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001545s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018328s [5783 : 5802] [5783 : 5803] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051323s Time used: 0.049754 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000821s Time used: 1.00069 LOG: SAT solveNonLinear - Elapsed time: 1.052144s Cost: 1; Total time: 1.05044 Quasi-ranking function: 50000 - main_res New Graphs: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z, main_res Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001648s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027520s [5783 : 5807] [5783 : 5808] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049873s Time used: 0.047773 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000948s Time used: 1.00082 LOG: SAT solveNonLinear - Elapsed time: 1.050821s Cost: 1; Total time: 1.04859 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_y + main_z [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_z, main_res -> 1 + main_res, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x + 50002*main_z New Graphs: Transitions: main_z, main_res -> 1 + main_res, rest remain the same}> 1 + main_x, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z, main_res Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001887s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.049086s [5783 : 5812] [5783 : 5813] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.103634s Time used: 4.10036 [5783 : 5817] [5783 : 5821] Successful child: 5817 Program does NOT terminate