/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 -> 1, main_y -> 1}> = 0))> = 0)> (2 * main_x), main_y -> (3 * main_y)}> 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, main_x -> 1, main_y -> 1}> = 0)> = 0))> (2 * main_x), main_y -> (3 * main_y)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [1 functions]: 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: = 0), par{main_x -> (2 * main_x), main_y -> (3 * main_y)}> = 0))> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 2*main_x, main_y -> 3*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.002155 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000506s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001201s [37080 : 37082] [37080 : 37083] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008093s Time used: 0.007781 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032758s Time used: 0.032754 LOG: SAT solveNonLinear - Elapsed time: 0.040852s Cost: 1; Total time: 0.040535 Termination implied by a set of invariant(s): Invariant at l2: 1 <= main_x [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x, main_y -> 3*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): 2*main_x, main_y -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: 2*main_x, main_y -> 3*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.000491s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001481s [37080 : 37388] [37080 : 37389] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010937s Time used: 0.010559 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000894s Time used: 1.00091 LOG: SAT solveNonLinear - Elapsed time: 1.011830s Cost: 1; Total time: 1.01147 Termination implied by a set of invariant(s): Invariant at l2: main_x <= main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x, main_y -> 3*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): 2*main_x, main_y -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 - main_y New Graphs: Transitions: 2*main_x, main_y -> 3*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.000638s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002291s [37080 : 37575] [37080 : 37576] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014168s Time used: 0.013625 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000613s Time used: 1.00062 LOG: SAT solveNonLinear - Elapsed time: 1.014781s Cost: 1; Total time: 1.01425 Termination implied by a set of invariant(s): Invariant at l2: main_x <= 1 + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x, main_y -> 3*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): 2*main_x, main_y -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 + main_x - main_y New Graphs: Transitions: 2*main_x, main_y -> 3*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.000632s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003301s [37080 : 37778] [37080 : 37779] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015386s Time used: 0.014775 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.005985s Time used: 1.00584 LOG: SAT solveNonLinear - Elapsed time: 1.021371s Cost: 1; Total time: 1.02062 Termination implied by a set of invariant(s): Invariant at l2: main_x <= 1 + main_y [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x, main_y -> 3*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): 2*main_x, main_y -> 3*main_y, rest remain the same}> Quasi-ranking function: 50000 - main_x - main_y New Graphs: Transitions: 2*main_x, main_y -> 3*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.000714s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003084s [37080 : 38180] [37080 : 38181] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104826s Time used: 4.10436 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044407s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.044512s Cannot prove unreachability [37080 : 38814] [37080 : 38819] Successful child: 38814 Program does NOT terminate