/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** 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_x + main_y), 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_x + main_y), main_y -> (main_y - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: (main_x + main_y), main_y -> (main_y - 1)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001905 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000481s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001337s [28803 : 28804] [28803 : 28805] Successful child: 28804 [ 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_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 <= main_x - Process 1 * Exit transition: * Postcondition : 1 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000470s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000557s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_x , Narrowing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000463s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001474s [28803 : 28809] [28803 : 28810] Successful child: 28809 [ 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_x + main_y, main_y -> -1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_x - Process 2 * Exit transition: * Postcondition : 0 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000548s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000640s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , Narrowing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000450s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001423s [28803 : 28814] [28803 : 28815] Successful child: 28814 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, 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_x + main_y, main_y -> -1 + main_y, rest remain the same}> Ranking function: main_y New Graphs: LOG: CALL check - Post:0 <= main_x + main_y - Process 3 * Exit transition: * Postcondition : 0 <= main_x + main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000527s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000625s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_y , Narrowing transition: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000553s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001891s [28803 : 28829] [28803 : 28830] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006765s Time used: 0.006398 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015394s Time used: 0.015371 LOG: SAT solveNonLinear - Elapsed time: 0.022159s Cost: 1; Total time: 0.021769 Quasi-ranking function: 50000 + main_y New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000633s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002681s [28803 : 28942] [28803 : 28943] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008108s Time used: 0.007694 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014192s Time used: 0.014187 LOG: SAT solveNonLinear - Elapsed time: 0.022300s Cost: 1; Total time: 0.021881 Quasi-ranking function: 50000 + main_x + 2*main_y New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000720s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004741s [28803 : 29030] [28803 : 29031] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010880s Time used: 0.01041 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016617s Time used: 0.016613 LOG: SAT solveNonLinear - Elapsed time: 0.027498s Cost: 1; Total time: 0.027023 Termination implied by a set of invariant(s): Invariant at l2: main_x <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_y, 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_x + main_y, main_y -> -1 + main_y, rest remain the same}> Quasi-ranking function: 50000 + main_x New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000727s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008094s [28803 : 29035] [28803 : 29036] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009808s Time used: 0.00933 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016087s Time used: 0.016083 LOG: SAT solveNonLinear - Elapsed time: 0.025895s Cost: 1; Total time: 0.025413 Quasi-ranking function: 50000 + main_x - main_y New Graphs: Transitions: main_x + main_y, main_y -> -1 + main_y, rest remain the same}> Variables: main_x, main_y Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000894s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004423s [28803 : 29339] [28803 : 29340] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010996s Time used: 0.010608 [28803 : 29632] [28803 : 29636] Successful child: 29632 Program does NOT terminate