/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_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_t -> 0}> 0))> 0)> 0))> 0)> main_i, main_i -> main_j, main_j -> main_t}> main_j)> main_j))> main_i}> (main_i - 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, main_t -> 0}> 0)> 0))> 0)> 0))> main_i, main_i -> main_j, main_j -> main_t}> main_j)> main_j))> main_i}> (main_i - 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 15, 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, ()] | i | local variable | integer | | j | local variable | integer | | t | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (main_j > 0) /\ (main_i < main_j), par{main_i -> main_j, main_j -> main_i}> 0) /\ (main_j > 0) /\ not((main_i < main_j)) /\ (main_i > main_j), par{main_j -> main_i}> 0) /\ (main_j > 0) /\ not((main_i < main_j)) /\ not((main_i > main_j)), par{main_i -> (main_i - 1)}> 0) /\ not((main_j > 0))> 0))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 15, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_j, main_j -> main_i, rest remain the same}> main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_j Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 15 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004702 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001520s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.036142s [14103 : 14104] [14103 : 14105] Successful child: 14104 [ 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_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, 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_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + main_i, rest remain the same}> New Graphs: Transitions: -1 + main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000999s Ranking function: main_i - main_j New Graphs: LOG: CALL check - Post:main_i + main_j <= 2 - Process 1 * Exit transition: * Postcondition : main_i + main_j <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000537s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000624s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i + main_j <= 2 , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001712s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053388s [14103 : 14109] [14103 : 14110] Successful child: 14109 [ 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_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, 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_i, 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_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_i <= 0 - Process 2 * Exit transition: * Postcondition : main_i <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000690s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000781s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 0 , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001748s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052667s [14103 : 14114] [14103 : 14115] Successful child: 14114 [ 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_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, 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_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_j <= 0 - Process 3 * Exit transition: * Postcondition : 1 + main_j <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000784s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000883s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_j <= 0 , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001751s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053151s [14103 : 14119] [14103 : 14120] Successful child: 14119 [ 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_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_i, 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_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, 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_i, rest remain the same}> New Graphs: LOG: CALL check - Post:main_j <= 0 - Process 4 * Exit transition: * Postcondition : main_j <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000841s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000956s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_j <= 0 , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_i, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + main_i, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_i, rest remain the same}> -1 + main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001747s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.052932s [14103 : 14124] [14103 : 14125] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041301s Time used: 0.040269 [14103 : 14129] [14103 : 14133] Successful child: 14129 Program does NOT terminate