/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_y1 -> ¿functionCall(__VERIFIER_nondet_int), main_y2 -> ¿functionCall(__VERIFIER_nondet_int)}> = 0))> = 0)> = 0)> = 0))> main_y2)> main_y2))> (main_y1 - main_y2)}> (main_y2 - main_y1)}> 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_y2)> main_y2))> (main_y1 - main_y2)}> (main_y2 - main_y1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 13, 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 [4 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | y1 | local variable | integer | | y2 | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (undef4 >= 0)> = 0) /\ not((undef4 >= 0))> = 0))> main_y2)), par{main_y2 -> (main_y2 - main_y1)}> main_y2) /\ (main_y1 > main_y2), par{main_y1 -> (main_y1 - main_y2)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 13, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 13 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003606 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000879s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003153s [59784 : 59785] [59784 : 59786] Successful child: 59785 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y1 - main_y2, 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_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y1 - main_y2, rest remain the same}> Ranking function: main_y1 New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000559s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001825s [59784 : 59790] [59784 : 59791] Successful child: 59790 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_y1 - main_y2, 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_y1 + main_y2, rest remain the same}> Ranking function: main_y2 New Graphs: LOG: CALL check - Post:1 <= main_y2 - Process 1 * Exit transition: * Postcondition : 1 <= main_y2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000610s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000716s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: 1 <= main_y2 , LOG: CALL check - Post:1 <= main_y1 - Process 2 * Exit transition: * Postcondition : 1 <= main_y1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000617s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000712s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: 1 <= main_y1 , Narrowing transition: -main_y1 + main_y2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_y1 - main_y2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001709s Ranking function: 1 - main_y1 New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000980s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003863s [59784 : 59805] [59784 : 59807] Successful child: 59805 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000590s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001868s [59784 : 59819] [59784 : 59820] Successful child: 59819 [ 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_y1 + main_y2, 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_y1 + main_y2, rest remain the same}> New Graphs: LOG: CALL check - Post:main_y1 <= main_y2 - Process 3 * Exit transition: * Postcondition : main_y1 <= main_y2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000864s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000988s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: main_y1 <= main_y2 , LOG: CALL check - Post:main_y2 <= main_y1 - Process 4 * Exit transition: * Postcondition : main_y2 <= main_y1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000655s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000767s INVARIANTS: 4: Quasi-INVARIANTS to narrow Graph: 4: main_y2 <= main_y1 , Narrowing transition: -main_y1 + main_y2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_y1 - main_y2, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_y1 - main_y2, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001765s Ranking function: 1 - main_y1 New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> main_y1 - main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000989s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003858s [59784 : 59824] [59784 : 59825] Successful child: 59824 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -main_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, 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_y1 + main_y2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_y1 - main_y2, rest remain the same}> New Graphs: Transitions: -main_y1 + main_y2, rest remain the same}> Variables: main_y1, main_y2 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000588s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001871s [59784 : 59829] [59784 : 59830] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006653s Time used: 0.006386 [59784 : 59943] [59784 : 59947] Successful child: 59947 Program does NOT terminate