NO Solver Timeout: 4 Global Timeout: 60 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.003166 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000963s 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.000451s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001558s [57191 : 57193] [57191 : 57194] Successful child: 57193 [ 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: [57191 : 57198] [57191 : 57199] 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.000998s 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.000465s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001632s [57191 : 57200] [57191 : 57201] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009405s Time used: 0.009031 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016635s Time used: 0.016628 LOG: SAT solveNonLinear - Elapsed time: 0.026041s Cost: 1; Total time: 0.025659 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.000474s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001851s [57191 : 57250] [57191 : 57251] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009333s Time used: 0.008843 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022316s Time used: 0.022308 LOG: SAT solveNonLinear - Elapsed time: 0.031648s Cost: 1; Total time: 0.031151 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.000581s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002060s [57191 : 57378] [57191 : 57379] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009961s Time used: 0.009459 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017665s Time used: 0.017659 LOG: SAT solveNonLinear - Elapsed time: 0.027626s Cost: 1; Total time: 0.027118 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.000639s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002744s [57191 : 57383] [57191 : 57384] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010440s Time used: 0.009892 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020557s Time used: 0.020551 LOG: SAT solveNonLinear - Elapsed time: 0.030997s Cost: 1; Total time: 0.030443 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.000753s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003835s [57191 : 57388] [57191 : 57389] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010701s Time used: 0.010111 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018359s Time used: 0.018352 LOG: SAT solveNonLinear - Elapsed time: 0.029060s Cost: 1; Total time: 0.028463 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.000819s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003884s [57191 : 57393] [57191 : 57394] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009754s Time used: 0.009248 [57191 : 57502] [57191 : 57506] Successful child: 57502 Program does NOT terminate