/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> ((2 * main_x) + main_y), main_y -> (main_y + 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> = 0)> = 0))> ((2 * main_x) + main_y), main_y -> (main_y + 1)}> 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 | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (main_x <= main_z), par{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}> = 0) /\ not((main_x <= main_z))> = 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: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z 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.002732 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000686s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002034s [32523 : 32532] [32523 : 32533] Successful child: 32532 [ 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: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_z <= main_x - Process 1 * Exit transition: * Postcondition : 1 + main_z <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000591s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000716s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_z <= main_x , Narrowing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000660s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002149s [32523 : 32554] [32523 : 32555] Successful child: 32554 [ 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: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_y + main_z <= 0 - Process 2 * Exit transition: * Postcondition : 1 + main_y + main_z <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000686s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000797s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_y + main_z <= 0 , Narrowing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000718s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002421s [32523 : 32590] [32523 : 32591] Successful child: 32590 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2*main_x + main_y, main_y -> 1 + 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): 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> Ranking function: -main_x + main_z New Graphs: LOG: CALL check - Post:1 <= main_x + main_y - Process 3 * Exit transition: * Postcondition : 1 <= main_x + main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000518s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000638s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_x + main_y , It's unfeasible. Removing transition: 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}> invGraph after Narrowing: Transitions: Variables: main_x, main_y, main_z Analyzing SCC {l2}... No cycles found. Proving termination of subgraph 2 Analyzing SCC {l7}... No cycles found. Program Terminates