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_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.007582 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001785s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032694s [22588 : 22592] [22588 : 22593] Successful child: 22592 [ 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.001542s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026696s [22588 : 22602] [22588 : 22603] Successful child: 22602 [ 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.001342s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014949s [22588 : 22612] [22588 : 22613] Successful child: 22612 [ 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.000970s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001094s 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.000630s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000717s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i + main_j <= 1 , [22588 : 22628] [22588 : 22629] 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.001791s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.031550s [22588 : 22630] [22588 : 22632] Successful child: 22630 [ 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.001601s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.028662s [22588 : 22643] [22588 : 22644] Successful child: 22643 [ 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.001157s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009319s [22588 : 22651] [22588 : 22652] Successful child: 22651 [ 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: [22588 : 22672] [22588 : 22673] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i + main_j <= 0 , [22588 : 22674] [22588 : 22675] [22588 : 22676] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_i + main_j , [22588 : 22677] [22588 : 22678] [22588 : 22679] 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.002784s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.072771s [22588 : 22681] [22588 : 22682] Successful child: 22681 [ 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.002544s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.126946s [22588 : 22700] [22588 : 22701] Successful child: 22700 [ 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.002100s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042184s [22588 : 22724] [22588 : 22725] Successful child: 22724 [ 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.001295s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009608s [22588 : 22736] [22588 : 22737] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013278s Time used: 0.012564 [22588 : 22985] [22588 : 22989] Successful child: 22985 Program does NOT terminate