/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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)}> 0))> 0)> 3)> 3))> (main_i + 1)}> (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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> 0)> 0))> 3)> 3))> (main_i + 1)}> (main_i - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 10, 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 [3 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_i > 3), par{main_i -> (main_i + 1)}> 0) /\ not((main_i > 3)), par{main_i -> (main_i - 1)}> 0))> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: 10, 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_i, rest remain the same}> Variables: main_i Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002249 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000740s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003262s Piecewise ranking function: min(-5 + 5*main_i,39 - 6*main_i) New Graphs: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000389s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001149s [43430 : 43431] [43430 : 43432] Successful child: 43431 [ 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, 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, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_i, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_i <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_i <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000394s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000464s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i <= 0 , Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000720s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003482s Piecewise ranking function: min(-5 + 5*main_i,39 - 6*main_i) New Graphs: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000382s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001181s [43430 : 43436] [43430 : 43437] Successful child: 43436 [ 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 3 - Process 2 * Exit transition: * Postcondition : main_i <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000416s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000512s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 3 , Narrowing transition: 1 + main_i, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + main_i, rest remain the same}> invGraph after Narrowing: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000421s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001264s [43430 : 43441] [43430 : 43442] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004672s Time used: 0.004377 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015119s Time used: 0.015116 LOG: SAT solveNonLinear - Elapsed time: 0.019791s Cost: 1; Total time: 0.019493 Quasi-ranking function: 50000 - main_i New Graphs: Transitions: 1 + main_i, rest remain the same}> Variables: main_i Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000394s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001183s [43430 : 43670] [43430 : 43671] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004829s Time used: 0.004555 [43430 : 43675] [43430 : 43679] Successful child: 43675 Program does NOT terminate