/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES 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_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> 1}> ~(1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> (main_y + main_x), main_z -> (main_z - main_x)}> 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}> ¿functionCall(__VERIFIER_nondet_int)}> 1}> ~(1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> 0)> 0))> (main_x + 1)}> (main_x - 1)}> (main_y + main_x), main_z -> (main_z - main_x)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 52, 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0)) /\ not(((~(1) - 1) > 0)) /\ not((((~(1) - 1) - 1) > 0)) /\ not(((((~(1) - 1) - 1) - 1) > 0)) /\ not((((((~(1) - 1) - 1) - 1) - 1) > 0)) /\ not(((((((~(1) - 1) - 1) - 1) - 1) - 1) > 0)) /\ not((((((((~(1) - 1) - 1) - 1) - 1) - 1) - 1) > 0)) /\ not(((((((((~(1) - 1) - 1) - 1) - 1) - 1) - 1) - 1) > 0)), par{main_x -> ((((((((~(1) - 1) - 1) - 1) - 1) - 1) - 1) - 1) - 1)}> 0) /\ ((1 + 1) > 0) /\ (((1 + 1) + 1) > 0) /\ ((((1 + 1) + 1) + 1) > 0) /\ (((((1 + 1) + 1) + 1) + 1) > 0) /\ ((((((1 + 1) + 1) + 1) + 1) + 1) > 0) /\ (((((((1 + 1) + 1) + 1) + 1) + 1) + 1) > 0) /\ ((((((((1 + 1) + 1) + 1) + 1) + 1) + 1) + 1) > 0), par{main_x -> ((((((((1 + 1) + 1) + 1) + 1) + 1) + 1) + 1) + 1)}> (main_y + main_x), main_z -> (main_z - main_x)}> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 52, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_x + main_y, main_z -> -main_x + main_z, rest remain the same}> Variables: main_x, main_y, main_z Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 -9, rest remain the same}> 9, rest remain the same}> Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 47 , 1 ) ( 52 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00235 Checking conditional termination of SCC {l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000640s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001880s [6106 : 6107] [6106 : 6108] Successful child: 6107 [ 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_z -> -main_x + main_z, 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_z -> -main_x + main_z, rest remain the same}> Ranking function: 196 - main_x - main_z New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: 9, rest remain the same}> * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000601s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000707s INVARIANTS: 47: Quasi-INVARIANTS to narrow Graph: 47: 1 + main_x <= 0 , Narrowing transition: main_x + main_y, main_z -> -main_x + main_z, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_y, main_z -> -main_x + main_z, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000670s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002397s [6106 : 6118] [6106 : 6119] Successful child: 6118 [ 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_z -> -main_x + main_z, 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_z -> -main_x + main_z, rest remain the same}> Ranking function: 99 - main_y New Graphs: INVARIANTS: 47: 1 <= main_x , Quasi-INVARIANTS to narrow Graph: 47: Proving termination of subgraph 2 Analyzing SCC {l52}... No cycles found. Program Terminates