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_t -> 0}> main_i, main_i -> main_j, main_j -> main_t}> 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_t -> 0}> main_i, main_i -> main_j, main_j -> main_t}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 7, 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, ()] | i | local variable | integer | | j | local variable | integer | | t | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_j, main_j -> main_i}> 0), par{main_i -> main_j, main_j -> main_i}> 0) /\ (main_j = 0)> 0) /\ (main_j < 0), par{main_i -> main_j, main_j -> main_i}> 0) /\ (main_j > 0), par{main_i -> main_j, main_j -> main_i}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, 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 ) ( 7 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00471 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001191s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015026s [29921 : 29923] [29921 : 29924] Successful child: 29923 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000958s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013952s [29921 : 29928] [29921 : 29929] Successful child: 29928 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000652s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007301s [29921 : 29933] [29921 : 29934] Successful child: 29933 [ 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: main_j, main_j -> 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: main_j, main_j -> 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: main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= 1 + main_i + main_j - Process 1 * Exit transition: * Postcondition : 0 <= 1 + main_i + main_j LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001598s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001780s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_i + main_j , LOG: CALL check - Post:main_i + main_j <= 1 - Process 2 * Exit transition: * Postcondition : main_i + main_j <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001262s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001411s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i + main_j <= 1 , [29921 : 29938] [29921 : 29939] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 0 , 1 + main_j <= 0 , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002005s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019794s [29921 : 29940] [29921 : 29941] Successful child: 29940 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000754s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012976s [29921 : 29945] [29921 : 29946] Successful child: 29945 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000577s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004457s [29921 : 29950] [29921 : 29951] Successful child: 29950 [ 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: main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> New Graphs: [29921 : 29955] [29921 : 29956] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i + main_j <= 0 , [29921 : 29957] [29921 : 29958] [29921 : 29959] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_i + main_j , [29921 : 29960] [29921 : 29961] [29921 : 29962] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 0 , 0 <= 1 + main_i , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002460s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.035582s [29921 : 29963] [29921 : 29964] Successful child: 29963 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> 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 Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001332s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.056378s [29921 : 29968] [29921 : 29969] Successful child: 29968 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001108s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019514s [29921 : 29973] [29921 : 29974] Successful child: 29973 [ 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: main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000809s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005659s [29921 : 29978] [29921 : 29979] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020793s Time used: 0.019475 [29921 : 29983] [29921 : 29987] Successful child: 29987 Program does NOT terminate