/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_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int)}> (main_i - 1), 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}> (main_i - 1), main_j -> (main_j + 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, ()] | 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)}> main_j), par{main_i -> (main_i - 1), main_j -> (main_j + 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: -1 + main_i, main_j -> 1 + main_j, rest remain the same}> -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.003068 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000946s Ranking function: 1 + 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.000440s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001539s [46715 : 46716] [46715 : 46717] Successful child: 46716 [ 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: -1 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -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 It's unfeasible. Removing transition: -1 + main_i, main_j -> 1 + main_j, rest remain the same}> New Graphs: [46715 : 46722] [46715 : 46723] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= main_j , main_j <= main_i , Narrowing transition: -1 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: -1 + main_i, main_j -> 1 + main_j, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -1 + main_i, main_j -> 1 + main_j, rest remain the same}> -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.000968s Ranking function: 1 + 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.000446s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001598s [46715 : 46724] [46715 : 46725] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008827s Time used: 0.008469 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014911s Time used: 0.014905 LOG: SAT solveNonLinear - Elapsed time: 0.023738s Cost: 1; Total time: 0.023374 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.000479s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001834s [46715 : 46729] [46715 : 46730] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008714s Time used: 0.008304 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020469s Time used: 0.020463 LOG: SAT solveNonLinear - Elapsed time: 0.029183s Cost: 1; Total time: 0.028767 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.000561s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002035s [46715 : 46850] [46715 : 46851] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009300s Time used: 0.008863 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016197s Time used: 0.016193 LOG: SAT solveNonLinear - Elapsed time: 0.025497s Cost: 1; Total time: 0.025056 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.000630s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002703s [46715 : 46855] [46715 : 46856] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009760s Time used: 0.009283 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019008s Time used: 0.019003 LOG: SAT solveNonLinear - Elapsed time: 0.028768s Cost: 1; Total time: 0.028286 Quasi-ranking function: 50000 + 3*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.000729s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003787s [46715 : 46860] [46715 : 46861] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009716s Time used: 0.009221 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016791s Time used: 0.016786 LOG: SAT solveNonLinear - Elapsed time: 0.026507s Cost: 1; Total time: 0.026007 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.000815s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003832s [46715 : 46865] [46715 : 46866] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009212s Time used: 0.008805 [46715 : 46870] [46715 : 46874] Successful child: 46870 Program does NOT terminate