/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> = 0))> = 0)> main_y, main_xtmp -> main_x}> 0}> main_y))> main_y)> (main_xtmp - main_y)}> main_xtmp, main_x -> main_tmp}> 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))> = 0)> = 0))> main_y, main_xtmp -> main_x}> 0}> main_y)> main_y))> (main_xtmp - main_y)}> main_xtmp, main_x -> main_tmp}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 17, 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 | | tmp | local variable | integer | | xtmp | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ not((main_y >= 0))> = 0))> 0) /\ (main_x >= 0) /\ (main_y >= 0) /\ (main_x = main_y), par{main_x -> main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ (main_x >= 0) /\ (main_y >= 0) /\ (main_x < main_y), par{main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ (main_x >= 0) /\ (main_y >= 0) /\ (main_x > main_y), par{main_tmp -> main_y, main_xtmp -> main_x}> 0) /\ not((main_x >= 0))> main_y), par{main_xtmp -> (main_xtmp - main_y)}> main_y)), par{main_x -> main_tmp, main_y -> main_xtmp}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 17, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 10 , 1 ) ( 17 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.018665 Checking conditional termination of SCC {l2, l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002853s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012440s [8371 : 8372] [8371 : 8373] Successful child: 8372 [ 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 -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, 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 -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_x <= 0 - Process 1 * Exit transition: * Postcondition : 1 + main_x <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000642s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000726s INVARIANTS: 2: 10: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , 10: 1 <= 0 , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002204s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012694s [8371 : 8377] [8371 : 8378] Successful child: 8377 [ 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 -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, 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 -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: LOG: CALL check - Post:main_y <= 0 - Process 2 * Exit transition: * Postcondition : main_y <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000935s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001026s INVARIANTS: 2: 10: Quasi-INVARIANTS to narrow Graph: 2: main_y <= 0 , 10: 1 <= 0 , Narrowing transition: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -main_y + main_xtmp, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_tmp, main_y -> main_xtmp, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002262s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012974s [8371 : 8382] [8371 : 8383] Successful child: 8382 [ 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 -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y, main_xtmp -> main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> main_y, main_xtmp -> main_x, rest remain the same}> -main_y + main_xtmp, rest remain the same}> main_tmp, main_y -> main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2, l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002078s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011274s [8371 : 8387] [8371 : 8388] Successful child: 8387 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y + main_xtmp, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_tmp, main_y -> main_xtmp, rest remain the same}> Ranking function: 1 + main_x New Graphs: Transitions: main_y, main_y -> main_x, main_tmp -> main_y, main_xtmp -> main_x, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Transitions: -main_y + main_xtmp, rest remain the same}> Variables: main_x, main_y, main_tmp, main_xtmp Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000767s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002604s [8371 : 8392] [8371 : 8393] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018191s Time used: 0.017812 [8371 : 8397] [8371 : 8401] Successful child: 8397 Program does NOT terminate