/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_j -> 100, main_i -> 0}> (main_j + 1), main_i -> (main_i + 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, main_j -> 100, main_i -> 0}> (main_j + 1), main_i -> (main_i + 1)}> 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, ()] | i | local variable | integer | | j | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: (main_i + 1), main_j -> (main_j + 1)}> 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: 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Variables: main_i, main_j 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.001997 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000509s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001458s [64020 : 64021] [64020 : 64022] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007295s Time used: 0.00698 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.028471s Time used: 1.02843 LOG: SAT solveNonLinear - Elapsed time: 1.035767s Cost: 1; Total time: 1.03541 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + main_i [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 1 + main_j, 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): 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Quasi-ranking function: 50000 - 2*main_i + main_j New Graphs: Transitions: 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000649s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002827s [64020 : 64511] [64020 : 64512] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008847s Time used: 0.008325 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000580s Time used: 1.00055 LOG: SAT solveNonLinear - Elapsed time: 1.009426s Cost: 1; Total time: 1.00887 Quasi-ranking function: 50000 - main_j New Graphs: Transitions: 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000721s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003033s [64020 : 64516] [64020 : 64517] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009118s Time used: 0.00853 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000614s Time used: 1.00045 LOG: SAT solveNonLinear - Elapsed time: 1.009732s Cost: 1; Total time: 1.00898 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_i [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 1 + main_j, 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): 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Quasi-ranking function: 50000 - main_i New Graphs: Transitions: 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000721s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002770s [64020 : 64521] [64020 : 64522] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010363s Time used: 0.009697 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000506s Time used: 1.00049 LOG: SAT solveNonLinear - Elapsed time: 1.010869s Cost: 1; Total time: 1.01018 Quasi-ranking function: 50000 + main_i - 2*main_j New Graphs: Transitions: 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000821s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003471s [64020 : 64526] [64020 : 64527] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010671s Time used: 0.009922 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000583s Time used: 1.00055 LOG: SAT solveNonLinear - Elapsed time: 1.011254s Cost: 1; Total time: 1.01047 Termination implied by a set of invariant(s): Invariant at l2: 0 <= main_i [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_i, main_j -> 1 + main_j, 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): 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Quasi-ranking function: 50000 - main_i - main_j New Graphs: Transitions: 1 + main_i, main_j -> 1 + main_j, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000911s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004346s [64020 : 64531] [64020 : 64532] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102083s Time used: 4.10121 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.010153s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.010258s Cannot prove unreachability [64020 : 64787] [64020 : 64791] Successful child: 64787 Program does NOT terminate