/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 35), par{arg1 -> 0, arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 30) /\ (arg1 < 36), par{arg1 -> 35, arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > ~(1))> 35), par{arg1 -> 0}> 0), par{arg1 -> (arg1 - 1)}> 30) /\ (arg1 < 36), par{arg1 -> 35}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> 35, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004805 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001172s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013856s Piecewise ranking function: min(60,-2 + 2*arg1) New Graphs: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000467s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001477s [63280 : 63281] [63280 : 63282] Successful child: 63281 [ 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: 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 8 - Process 1 * Exit transition: * Postcondition : arg1 <= 8 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000510s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000619s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 8 , It's unfeasible. Removing transition: 0, rest remain the same}> Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000826s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003579s Piecewise ranking function: min(-9 + arg1,3343 - 109*arg1) New Graphs: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000485s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001543s [63280 : 63286] [63280 : 63287] Successful child: 63286 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 35, 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: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 29 - Process 2 * Exit transition: * Postcondition : arg1 <= 29 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000580s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000679s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 29 , It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000494s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001610s [63280 : 63291] [63280 : 63292] Successful child: 63291 [ 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: 35, 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: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:arg1 <= 30 - Process 3 * Exit transition: * Postcondition : arg1 <= 30 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000658s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000775s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg1 <= 30 , Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000501s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001632s [63280 : 63296] [63280 : 63297] Successful child: 63296 [ 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: 35, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 35, rest remain the same}> New Graphs: LOG: CALL check - Post:36 <= arg1 - Process 4 * Exit transition: * Postcondition : 36 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000677s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000779s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 36 <= arg1 , Narrowing transition: 35, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 35, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000508s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001621s [63280 : 63301] [63280 : 63302] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101542s Time used: 4.10127 [63280 : 63306] [63280 : 63309] Successful child: 63306 Program does NOT terminate