YES 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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> main_y, main_oldy -> main_y, main_y -> ¿functionCall(__VERIFIER_nondet_int)}> 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}> 0)> 0))> main_y, main_oldy -> main_y}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> 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, ()] | x | local variable | integer | | y | local variable | integer | | oldy | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_y <= ~(main_oldy)), par{main_x -> main_y, main_y -> undef6, main_oldy -> main_y}> 0) /\ not((main_y <= ~(main_oldy)))> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> Variables: main_x, main_y, main_oldy 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.002207 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000782s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002103s [24006 : 24008] [24006 : 24009] Successful child: 24008 [ 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_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 <= main_y + main_oldy - Process 1 * Exit transition: * Postcondition : 1 <= main_y + main_oldy LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000333s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000385s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_y + main_oldy , Narrowing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> Variables: main_x, main_y, main_oldy Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000517s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001572s [24006 : 24013] [24006 : 24014] Successful child: 24013 [ 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_y, main_y -> undef6, main_oldy -> main_y, 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_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 2 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000312s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000366s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , Narrowing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> Variables: main_x, main_y, main_oldy Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000439s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001365s [24006 : 24018] [24006 : 24019] Successful child: 24018 [ 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_y, main_y -> undef6, main_oldy -> main_y, 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_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= main_y + main_oldy - Process 3 * Exit transition: * Postcondition : main_x <= main_y + main_oldy LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000302s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000364s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= main_y + main_oldy , Narrowing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> Variables: main_x, main_y, main_oldy Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000438s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001605s [24006 : 24023] [24006 : 24024] Successful child: 24023 [ 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_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:main_x <= 0 - Process 4 * Exit transition: * Postcondition : main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000320s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000374s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 0 , Narrowing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> Variables: main_x, main_y, main_oldy Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000417s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001381s [24006 : 24028] [24006 : 24029] Successful child: 24028 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> undef6, main_oldy -> main_y, 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_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> Ranking function: main_x New Graphs: LOG: CALL check - Post:main_x <= 1 + main_oldy - Process 5 * Exit transition: * Postcondition : main_x <= 1 + main_oldy LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000252s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000305s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_x <= 1 + main_oldy , It's unfeasible. Removing transition: main_y, main_y -> undef6, main_oldy -> main_y, rest remain the same}> invGraph after Narrowing: Transitions: Variables: main_x, main_y, main_oldy Analyzing SCC {l2}... No cycles found. Proving termination of subgraph 2 Analyzing SCC {l7}... No cycles found. Program Terminates