/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/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 -> 100}> arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}> undef5, arg2 -> undef6}> Fresh variables: undef5, undef6, Undef variables: undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: arg1), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}> Fresh variables: undef5, undef6, Undef variables: undef5, undef6, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 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.002151 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000490s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001487s [59009 : 59010] [59009 : 59011] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007251s Time used: 0.006903 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.018052s Time used: 1.01795 LOG: SAT solveNonLinear - Elapsed time: 1.025302s Cost: 1; Total time: 1.02485 Termination implied by a set of invariant(s): Invariant at l2: 0 <= 1 + arg1 [ 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, arg2 -> 1 + arg2, 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): 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - 2*arg1 + arg2 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000649s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002805s [59009 : 59015] [59009 : 59016] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008779s Time used: 0.008273 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000613s Time used: 1.00051 LOG: SAT solveNonLinear - Elapsed time: 1.009391s Cost: 1; Total time: 1.00878 Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000716s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002994s [59009 : 59020] [59009 : 59021] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009103s Time used: 0.008514 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000571s Time used: 1.00047 LOG: SAT solveNonLinear - Elapsed time: 1.009674s Cost: 1; Total time: 1.00899 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 [ 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, arg2 -> 1 + arg2, 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): 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000717s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002755s [59009 : 59025] [59009 : 59026] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010314s Time used: 0.009646 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000605s Time used: 1.0005 LOG: SAT solveNonLinear - Elapsed time: 1.010920s Cost: 1; Total time: 1.01015 Quasi-ranking function: 50000 + arg1 - 2*arg2 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000816s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003445s [59009 : 59030] [59009 : 59031] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010594s Time used: 0.009873 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000760s Time used: 1.00066 LOG: SAT solveNonLinear - Elapsed time: 1.011353s Cost: 1; Total time: 1.01053 Termination implied by a set of invariant(s): Invariant at l2: 0 <= arg1 [ 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, arg2 -> 1 + arg2, 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): 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg1 - arg2 New Graphs: Transitions: 1 + arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000900s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004314s [59009 : 59035] [59009 : 59036] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101745s Time used: 4.1007 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010530s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.010642s Cannot prove unreachability [59009 : 59041] [59009 : 59045] Successful child: 59041 Program does NOT terminate