16.34/16.39 NO 16.34/16.39 16.34/16.39 Solver Timeout: 4 16.34/16.39 Global Timeout: 300 16.34/16.39 No parsing errors! 16.34/16.39 Init Location: 0 16.34/16.39 Transitions: 16.34/16.39 16.34/16.39 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 16.34/16.39 ((~(1) * arg1) + 1), arg2 -> undef4}> 16.34/16.39 0), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef6}> 16.34/16.39 ~(6)) /\ (arg1 < 0), par{arg1 -> 0, arg2 -> undef8}> 16.34/16.39 0), par{arg1 -> 0, arg2 -> undef10}> 16.34/16.39 5), par{arg1 -> ((~(1) * arg1) - 1), arg2 -> undef12}> 16.34/16.39 undef13, arg2 -> undef14}> 16.34/16.39 16.34/16.39 Fresh variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Undef variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Abstraction variables: 16.34/16.39 16.34/16.39 Exit nodes: 16.34/16.39 16.34/16.39 Accepting locations: 16.34/16.39 16.34/16.39 Asserts: 16.34/16.39 16.34/16.39 Preprocessed LLVMGraph 16.34/16.39 Init Location: 0 16.34/16.39 Transitions: 16.34/16.39 0) /\ (undef14 > ~(1))> 16.34/16.39 ((~(1) * arg1) + 1)}> 16.34/16.39 ~(6)) /\ (arg1 < 0), par{arg1 -> 0}> 16.34/16.39 0), par{arg1 -> 0}> 16.34/16.39 5), par{arg1 -> ((~(1) * arg1) - 1)}> 16.34/16.39 16.34/16.39 Fresh variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Undef variables: 16.34/16.39 undef2, undef4, undef6, undef8, undef10, undef12, undef13, undef14, 16.34/16.39 16.34/16.39 Abstraction variables: 16.34/16.39 16.34/16.39 Exit nodes: 16.34/16.39 16.34/16.39 Accepting locations: 16.34/16.39 16.34/16.39 Asserts: 16.34/16.39 16.34/16.39 ************************************************************* 16.34/16.39 ******************************************************************************************* 16.34/16.39 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 16.34/16.39 ******************************************************************************************* 16.34/16.39 16.34/16.39 Init Location: 0 16.34/16.39 Graph 0: 16.34/16.39 Transitions: 16.34/16.39 Variables: 16.34/16.39 16.34/16.39 Graph 1: 16.34/16.39 Transitions: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 0, rest remain the same}> 16.34/16.39 0, rest remain the same}> 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 16.34/16.39 Precedence: 16.34/16.39 Graph 0 16.34/16.39 16.34/16.39 Graph 1 16.34/16.39 16.34/16.39 16.34/16.39 Map Locations to Subgraph: 16.34/16.39 ( 0 , 0 ) 16.34/16.39 ( 2 , 1 ) 16.34/16.39 16.34/16.39 ******************************************************************************************* 16.34/16.39 ******************************** CHECKING ASSERTIONS ******************************** 16.34/16.39 ******************************************************************************************* 16.34/16.39 16.34/16.39 Proving termination of subgraph 0 16.34/16.39 Proving termination of subgraph 1 16.34/16.39 Checking unfeasibility... 16.34/16.39 Time used: 0.005606 16.34/16.39 16.34/16.39 Checking conditional termination of SCC {l2}... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.001282s 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.081129s 16.34/16.39 Trying to remove transition: -1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010544s 16.34/16.39 Time used: 0.010267 16.34/16.39 Trying to remove transition: 0, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009614s 16.34/16.39 Time used: 0.009051 16.34/16.39 Trying to remove transition: 0, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009073s 16.34/16.39 Time used: 0.008504 16.34/16.39 Trying to remove transition: 1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008972s 16.34/16.39 Time used: 0.008397 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021995s 16.34/16.39 Time used: 0.02143 16.34/16.39 Solving with 2 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080021s 16.34/16.39 Time used: 0.078544 16.34/16.39 Improving Solution with cost 1 ... 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetNextSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.515505s 16.34/16.39 Time used: 0.51546 16.34/16.39 16.34/16.39 LOG: SAT solveNonLinear - Elapsed time: 0.595526s 16.34/16.39 Cost: 1; Total time: 0.594004 16.34/16.39 Failed at location 2: arg1 <= 0 16.34/16.39 Before Improving: 16.34/16.39 Quasi-invariant at l2: arg1 <= 0 16.34/16.39 Quasi-invariant at l2: 0 <= 1 + arg1 16.34/16.39 Optimizing invariants... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.035717s 16.34/16.39 Remaining time after improvement: 0.996834 16.34/16.39 Termination implied by a set of quasi-invariant(s): 16.34/16.39 Quasi-invariant at l2: arg1 <= 0 16.34/16.39 Quasi-invariant at l2: 0 <= 1 + arg1 16.34/16.39 [ Invariant Graph ] 16.34/16.39 Strengthening and disabling transitions... 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 Strengthening transition (result): 16.34/16.39 0, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 0, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 [ Termination Graph ] 16.34/16.39 Strengthening and disabling transitions... 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 Strengthening transition (result): 16.34/16.39 0, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 0, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 New Graphs: 16.34/16.39 Transitions: 16.34/16.39 0, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 Checking conditional termination of SCC {l2}... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000643s 16.34/16.39 Ranking function: -1 - arg1 16.34/16.39 New Graphs: 16.34/16.39 Calling Safety with literal arg1 <= 0 and entry 16.34/16.39 16.34/16.39 LOG: CALL check - Post:arg1 <= 0 - Process 1 16.34/16.39 * Exit transition: 16.34/16.39 * Postcondition : arg1 <= 0 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000558s 16.34/16.39 > Postcondition is not implied! 16.34/16.39 16.34/16.39 LOG: RETURN check - Elapsed time: 0.000650s 16.34/16.39 INVARIANTS: 16.34/16.39 2: 16.34/16.39 Quasi-INVARIANTS to narrow Graph: 16.34/16.39 2: arg1 <= 0 , 0 <= 1 + arg1 , 16.34/16.39 Narrowing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: Narrow transition size 2 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 0, rest remain the same}> 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 0, rest remain the same}> 16.34/16.39 Narrowing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: Narrow transition size 2 16.34/16.39 invGraph after Narrowing: 16.34/16.39 Transitions: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 Checking conditional termination of SCC {l2}... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000716s 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.008652s 16.34/16.39 Trying to remove transition: -1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006053s 16.34/16.39 Time used: 0.005893 16.34/16.39 Trying to remove transition: 1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005606s 16.34/16.39 Time used: 0.005367 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010369s 16.34/16.39 Time used: 0.010135 16.34/16.39 Solving with 2 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023207s 16.34/16.39 Time used: 0.022514 16.34/16.39 Improving Solution with cost 1 ... 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetNextSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.090851s 16.34/16.39 Time used: 0.09082 16.34/16.39 16.34/16.39 LOG: SAT solveNonLinear - Elapsed time: 0.114058s 16.34/16.39 Cost: 1; Total time: 0.113334 16.34/16.39 Failed at location 2: arg1 <= 1 16.34/16.39 Before Improving: 16.34/16.39 Quasi-invariant at l2: arg1 <= 1 16.34/16.39 Quasi-invariant at l2: 0 <= arg1 16.34/16.39 Optimizing invariants... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.012445s 16.34/16.39 Quasi-invariant improved 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.001776s 16.34/16.39 Remaining time after improvement: 0.995824 16.34/16.39 Termination implied by a set of quasi-invariant(s): 16.34/16.39 Quasi-invariant at l2: arg1 <= 2 16.34/16.39 Quasi-invariant at l2: 1 <= arg1 16.34/16.39 [ Invariant Graph ] 16.34/16.39 Strengthening and disabling transitions... 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 [ Termination Graph ] 16.34/16.39 Strengthening and disabling transitions... 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 New Graphs: 16.34/16.39 Calling Safety with literal arg1 <= 2 and entry 16.34/16.39 16.34/16.39 LOG: CALL check - Post:arg1 <= 2 - Process 2 16.34/16.39 * Exit transition: 16.34/16.39 * Postcondition : arg1 <= 2 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000663s 16.34/16.39 > Postcondition is not implied! 16.34/16.39 16.34/16.39 LOG: RETURN check - Elapsed time: 0.000762s 16.34/16.39 INVARIANTS: 16.34/16.39 2: 16.34/16.39 Quasi-INVARIANTS to narrow Graph: 16.34/16.39 2: 1 <= arg1 , arg1 <= 2 , 16.34/16.39 Narrowing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: Narrow transition size 2 16.34/16.39 Narrowing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: Narrow transition size 2 16.34/16.39 invGraph after Narrowing: 16.34/16.39 Transitions: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 Checking conditional termination of SCC {l2}... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000751s 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.008715s 16.34/16.39 Trying to remove transition: -1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006185s 16.34/16.39 Time used: 0.006027 16.34/16.39 Trying to remove transition: 1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005698s 16.34/16.39 Time used: 0.005456 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009316s 16.34/16.39 Time used: 0.009084 16.34/16.39 Solving with 2 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076398s 16.34/16.39 Time used: 0.075704 16.34/16.39 Improving Solution with cost 1 ... 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetNextSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.102555s 16.34/16.39 Time used: 0.10254 16.34/16.39 16.34/16.39 LOG: SAT solveNonLinear - Elapsed time: 0.178952s 16.34/16.39 Cost: 1; Total time: 0.178244 16.34/16.39 Failed at location 2: arg1 <= 5 16.34/16.39 Before Improving: 16.34/16.39 Quasi-invariant at l2: arg1 <= 5 16.34/16.39 Quasi-invariant at l2: 0 <= arg1 16.34/16.39 Optimizing invariants... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.013203s 16.34/16.39 Remaining time after improvement: 0.998144 16.34/16.39 Termination implied by a set of quasi-invariant(s): 16.34/16.39 Quasi-invariant at l2: arg1 <= 5 16.34/16.39 Quasi-invariant at l2: 0 <= arg1 16.34/16.39 [ Invariant Graph ] 16.34/16.39 Strengthening and disabling transitions... 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 [ Termination Graph ] 16.34/16.39 Strengthening and disabling transitions... 16.34/16.39 > It's unfeasible. Removing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: CALL solverLinear in Graph for feasibility 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear in Graph for feasibility 16.34/16.39 It's unfeasible. Removing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 New Graphs: 16.34/16.39 Calling Safety with literal arg1 <= 5 and entry 16.34/16.39 16.34/16.39 LOG: CALL check - Post:arg1 <= 5 - Process 3 16.34/16.39 * Exit transition: 16.34/16.39 * Postcondition : arg1 <= 5 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000841s 16.34/16.39 > Postcondition is not implied! 16.34/16.39 16.34/16.39 LOG: RETURN check - Elapsed time: 0.000940s 16.34/16.39 INVARIANTS: 16.34/16.39 2: 16.34/16.39 Quasi-INVARIANTS to narrow Graph: 16.34/16.39 2: 0 <= arg1 , arg1 <= 5 , 16.34/16.39 Narrowing transition: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: Narrow transition size 2 16.34/16.39 Narrowing transition: 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 16.34/16.39 LOG: Narrow transition size 2 16.34/16.39 invGraph after Narrowing: 16.34/16.39 Transitions: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 Checking conditional termination of SCC {l2}... 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.000766s 16.34/16.39 16.34/16.39 LOG: CALL solveLinear 16.34/16.39 16.34/16.39 LOG: RETURN solveLinear - Elapsed time: 0.008770s 16.34/16.39 Trying to remove transition: -1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006218s 16.34/16.39 Time used: 0.006053 16.34/16.39 Trying to remove transition: 1 - arg1, rest remain the same}> 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005721s 16.34/16.39 Time used: 0.005488 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009395s 16.34/16.39 Time used: 0.009156 16.34/16.39 Solving with 2 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002021s 16.34/16.39 Time used: 4.00084 16.34/16.39 Solving with 3 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012478s 16.34/16.39 Time used: 1.00147 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018293s 16.34/16.39 Time used: 0.00932 16.34/16.39 16.34/16.39 Proving non-termination of subgraph 1 16.34/16.39 Transitions: 16.34/16.39 1 - arg1, rest remain the same}> 16.34/16.39 -1 - arg1, rest remain the same}> 16.34/16.39 Variables: 16.34/16.39 arg1 16.34/16.39 16.34/16.39 Checking conditional non-termination of SCC {l2}... 16.34/16.39 EXIT TRANSITIONS: 16.34/16.39 16.34/16.39 16.34/16.39 Solving with 1 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005641s 16.34/16.39 Time used: 0.005539 16.34/16.39 Solving with 2 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002349s 16.34/16.39 Time used: 5.00148 16.34/16.39 Solving with 3 template(s). 16.34/16.39 16.34/16.39 LOG: CALL solveNonLinearGetFirstSolution 16.34/16.39 16.34/16.39 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.008118s 16.34/16.39 Time used: 5.00144 16.34/16.39 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES 16.34/16.39 Calling reachability with... 16.34/16.39 Transition: 16.34/16.39 Conditions: 6 <= arg1, 0 <= 5 + arg1, 16.34/16.39 Transition: 16.34/16.39 Conditions: arg1 <= 5, 6 + arg1 <= 0, 16.34/16.39 OPEN EXITS: 16.34/16.39 16.34/16.39 16.34/16.39 16.34/16.39 --- Reachability graph --- 16.34/16.39 > Graph without transitions. 16.34/16.39 16.34/16.39 Calling reachability with... 16.34/16.39 Transition: 16.34/16.39 Conditions: 6 <= arg1, 16.34/16.39 Transition: 16.34/16.39 Conditions: 6 + arg1 <= 0, 16.34/16.39 OPEN EXITS: 16.34/16.39 16.34/16.39 16.34/16.39 > Conditions are reachable! 16.34/16.39 16.34/16.39 Program does NOT terminate 16.34/16.39 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 16.34/16.39 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 16.34/16.39 EOF