/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)}> = 0))> = 0)> (main_x + 1)}> (main_x + 2)}> (main_x + 3)}> (main_x + 4)}> ~(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}> = 0)> = 0))> ¿functionCall(__VERIFIER_nondet_int)}> (main_x + 1)}> ¿functionCall(__VERIFIER_nondet_int)}> (main_x + 2)}> ¿functionCall(__VERIFIER_nondet_int)}> (main_x + 3)}> ¿functionCall(__VERIFIER_nondet_int)}> (main_x + 4)}> ~(1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 22, 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 [3 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | x | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 0) /\ (undef7 = 0) /\ (undef8 = 0) /\ (undef9 = 0) /\ (undef10 = 0), par{main_x -> ~(1)}> = 0) /\ (undef7 = 0) /\ (undef8 = 0) /\ (undef9 = 0) /\ (undef10 = 1), par{main_x -> (main_x + 4)}> = 0) /\ (undef7 = 0) /\ (undef8 = 0) /\ (undef9 = 1), par{main_x -> (main_x + 3)}> = 0) /\ (undef7 = 0) /\ (undef8 = 1), par{main_x -> (main_x + 2)}> = 0) /\ (undef7 = 1), par{main_x -> (main_x + 1)}> = 0))> Fresh variables: undef6, undef7, undef8, undef9, undef10, Undef variables: undef6, undef7, undef8, undef9, undef10, Abstraction variables: Exit nodes: 22, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1, rest remain the same}> 4 + main_x, rest remain the same}> 3 + main_x, rest remain the same}> 2 + main_x, rest remain the same}> 1 + main_x, rest remain the same}> Variables: main_x Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 22 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.0083 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002329s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012996s Piecewise ranking function: min(0,2*main_x) New Graphs: Transitions: 4 + main_x, rest remain the same}> 3 + main_x, rest remain the same}> 2 + main_x, rest remain the same}> 1 + main_x, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001504s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010941s [1402 : 1428] [1402 : 1429] Successful child: 1428 [ 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: -1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 4 + 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: 3 + 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: 2 + 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: 1 + 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 It's unfeasible. Removing transition: 4 + 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: 3 + 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: 2 + 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: 1 + main_x, 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.000571s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000644s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_x <= 0 , It's unfeasible. Removing transition: -1, rest remain the same}> Narrowing transition: 4 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 3 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2 + main_x, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + main_x, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 4 + main_x, rest remain the same}> 3 + main_x, rest remain the same}> 2 + main_x, rest remain the same}> 1 + main_x, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001570s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011053s [1402 : 1466] [1402 : 1467] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028033s Time used: 0.026859 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.101116s Time used: 0.101107 LOG: SAT solveNonLinear - Elapsed time: 0.129149s Cost: 1; Total time: 0.127966 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + main_x [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 4 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 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): 4 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_x, rest remain the same}> Quasi-ranking function: 50000 - main_x New Graphs: Transitions: 4 + main_x, rest remain the same}> 3 + main_x, rest remain the same}> 2 + main_x, rest remain the same}> 1 + main_x, rest remain the same}> Variables: main_x Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001655s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015164s [1402 : 1771] [1402 : 1772] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026591s Time used: 0.025299 [1402 : 1776] [1402 : 1780] Successful child: 1776 Program does NOT terminate