/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_oldx)))> (2 * main_oldx))> main_x, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> main_z}> 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_oldx))> (2 * main_oldx)))> main_x}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4, main_y -> main_z}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 8, 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 [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | oldx | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_x < main_y) /\ (main_x > (2 * main_oldx)), par{main_x -> undef8, main_y -> main_z, main_oldx -> main_x}> 0) /\ (main_x < main_y) /\ not((main_x > (2 * main_oldx)))> 0) /\ not((main_x < main_y))> 0))> Fresh variables: undef5, undef6, undef7, undef8, Undef variables: undef5, undef6, undef7, undef8, Abstraction variables: Exit nodes: 8, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_oldx Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 8 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002961 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000813s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003059s [63987 : 63988] [63987 : 63989] Successful child: 63988 [ 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: undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_y <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000572s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000666s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_y <= 0 , Narrowing transition: undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> Variables: main_x, main_y, main_z, main_oldx Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000833s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003902s [63987 : 63993] [63987 : 63994] Successful child: 63993 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef8, main_y -> main_z, main_oldx -> main_x, 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): undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> Ranking function: main_y - 2*main_oldx New Graphs: LOG: CALL check - Post:main_z <= 1 + main_y - Process 2 * Exit transition: * Postcondition : main_z <= 1 + main_y LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000698s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000808s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_z <= 1 + main_y , It's unfeasible. Removing transition: undef8, main_y -> main_z, main_oldx -> main_x, rest remain the same}> invGraph after Narrowing: Transitions: Variables: main_x, main_y, main_z, main_oldx Analyzing SCC {l2}... No cycles found. Proving termination of subgraph 2 Analyzing SCC {l8}... No cycles found. Program Terminates