/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_an -> ¿functionCall(__VERIFIER_nondet_int), main_bn -> ¿functionCall(__VERIFIER_nondet_int)}> = main_i))> = main_i)> = main_j)> = main_j))> = main_i))> = main_i)> = main_j)> = main_j))> = main_i))> = main_i)> = main_j)> = main_j))> (main_j + 1)}> (main_i + 1)}> = main_i))> = main_i)> (main_i + 1)}> = main_j)> = main_j))> (main_j + 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4}> = main_i)> = main_i))> = main_j)> = main_j))> = main_i)> = main_i))> = main_j)> = main_j))> = main_i)> = main_i))> = main_j)> = main_j))> ¿functionCall(__VERIFIER_nondet_int)}> (main_j + 1)}> (main_i + 1)}> = main_i)> = main_i))> (main_i + 1)}> = main_j)> = main_j))> (main_j + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 28, 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, ()] | i | local variable | integer | | j | local variable | integer | | an | local variable | integer | | bn | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = main_i) /\ (main_bn >= main_j) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef10 = 0), par{main_i -> (main_i + 1)}> = main_i) /\ (main_bn >= main_j) /\ (main_an >= main_i) /\ (main_bn >= main_j) /\ (undef10 = 1), par{main_j -> (main_j + 1)}> = main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j) /\ (main_an >= main_i) /\ not((main_bn >= main_j)) /\ (main_an >= main_i) /\ (main_bn <= main_j), par{main_i -> (main_i + 1)}> = main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j) /\ not((main_an >= main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ (main_bn >= main_j), par{main_j -> (main_j + 1)}> = main_i)) /\ not((main_an >= main_i)) /\ (main_an <= main_i) /\ not((main_bn >= main_j))> Fresh variables: undef6, undef7, undef8, undef9, undef10, Undef variables: undef6, undef7, undef8, undef9, undef10, Abstraction variables: Exit nodes: 28, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_i, rest remain the same}> 1 + main_j, rest remain the same}> 1 + main_i, rest remain the same}> 1 + main_j, rest remain the same}> Variables: main_i, main_j, main_an, main_bn Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 28 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.011952 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003094s Ranking function: -2*main_i - main_j + 2*main_an + main_bn New Graphs: Transitions: 1 + main_i, rest remain the same}> 1 + main_j, rest remain the same}> Variables: main_i, main_j, main_an, main_bn Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001924s Ranking function: -2*main_i + 2*main_an New Graphs: Transitions: 1 + main_j, rest remain the same}> Variables: main_i, main_j, main_an, main_bn Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001084s Ranking function: -main_j + main_bn New Graphs: Proving termination of subgraph 2 Analyzing SCC {l28}... No cycles found. Program Terminates