8.44/8.54 NO 8.44/8.54 8.44/8.54 Solver Timeout: 4 8.44/8.54 Global Timeout: 300 8.44/8.54 No parsing errors! 8.44/8.54 Init Location: 0 8.44/8.54 Transitions: 8.44/8.54 8.44/8.54 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> 20}> 8.44/8.54 0, arg2 -> 0}> 8.44/8.54 0) /\ (arg2 > arg1), par{arg1 -> (arg1 + 1)}> 8.44/8.54 0) /\ (arg1 = arg2), par{arg1 -> 0, arg2 -> (arg1 - 1)}> 8.44/8.54 0) /\ (0 = arg1), par{arg1 -> 1}> 8.44/8.54 undef11, arg2 -> undef12}> 8.44/8.54 8.44/8.54 Fresh variables: 8.44/8.54 undef11, undef12, 8.44/8.54 8.44/8.54 Undef variables: 8.44/8.54 undef11, undef12, 8.44/8.54 8.44/8.54 Abstraction variables: 8.44/8.54 8.44/8.54 Exit nodes: 8.44/8.54 8.44/8.54 Accepting locations: 8.44/8.54 8.44/8.54 Asserts: 8.44/8.54 8.44/8.54 Preprocessed LLVMGraph 8.44/8.54 Init Location: 0 8.44/8.54 Transitions: 8.44/8.54 0) /\ (undef12 > ~(1))> 8.44/8.54 0, arg2 -> 0}> 8.44/8.54 0) /\ (arg2 > arg1), par{arg1 -> (arg1 + 1)}> 8.44/8.54 0) /\ (arg1 = arg2), par{arg1 -> 0, arg2 -> (arg1 - 1)}> 8.44/8.54 0) /\ (0 = arg1), par{arg1 -> 1}> 8.44/8.54 8.44/8.54 Fresh variables: 8.44/8.54 undef11, undef12, 8.44/8.54 8.44/8.54 Undef variables: 8.44/8.54 undef11, undef12, 8.44/8.54 8.44/8.54 Abstraction variables: 8.44/8.54 8.44/8.54 Exit nodes: 8.44/8.54 8.44/8.54 Accepting locations: 8.44/8.54 8.44/8.54 Asserts: 8.44/8.54 8.44/8.54 ************************************************************* 8.44/8.54 ******************************************************************************************* 8.44/8.54 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 8.44/8.54 ******************************************************************************************* 8.44/8.54 8.44/8.54 Init Location: 0 8.44/8.54 Graph 0: 8.44/8.54 Transitions: 8.44/8.54 Variables: 8.44/8.54 8.44/8.54 Graph 1: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 1 + arg1, rest remain the same}> 8.44/8.54 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.54 1, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 8.44/8.54 Precedence: 8.44/8.54 Graph 0 8.44/8.54 8.44/8.54 Graph 1 8.44/8.54 8.44/8.54 8.44/8.54 Map Locations to Subgraph: 8.44/8.54 ( 0 , 0 ) 8.44/8.54 ( 2 , 1 ) 8.44/8.54 8.44/8.54 ******************************************************************************************* 8.44/8.54 ******************************** CHECKING ASSERTIONS ******************************** 8.44/8.54 ******************************************************************************************* 8.44/8.54 8.44/8.54 Proving termination of subgraph 0 8.44/8.54 Proving termination of subgraph 1 8.44/8.54 Checking unfeasibility... 8.44/8.54 Time used: 0.360518 8.44/8.54 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.003008s 8.44/8.54 Ranking function: -1 + arg2 8.44/8.54 New Graphs: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 1 + arg1, rest remain the same}> 8.44/8.54 1, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.001235s 8.44/8.54 Ranking function: -5 - arg1 + 3*arg2 8.44/8.54 New Graphs: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 1, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.000910s 8.44/8.54 Ranking function: -1 - arg1 + arg2 8.44/8.54 New Graphs: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.000422s 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.001238s 8.44/8.54 Trying to remove transition: 0, arg2 -> 0, rest remain the same}> 8.44/8.54 Solving with 1 template(s). 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003388s 8.44/8.54 Time used: 0.003255 8.44/8.54 Solving with 1 template(s). 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013026s 8.44/8.54 Time used: 0.012624 8.44/8.54 Improving Solution with cost 1 ... 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetNextSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.447049s 8.44/8.54 Time used: 0.447022 8.44/8.54 8.44/8.54 LOG: SAT solveNonLinear - Elapsed time: 0.460075s 8.44/8.54 Cost: 1; Total time: 0.459646 8.44/8.54 Failed at location 2: 1 + arg2 <= arg1 8.44/8.54 Before Improving: 8.44/8.54 Quasi-invariant at l2: 1 + arg2 <= arg1 8.44/8.54 Optimizing invariants... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.006263s 8.44/8.54 Remaining time after improvement: 0.998308 8.44/8.54 Termination implied by a set of quasi-invariant(s): 8.44/8.54 Quasi-invariant at l2: 1 + arg2 <= arg1 8.44/8.54 [ Invariant Graph ] 8.44/8.54 Strengthening and disabling transitions... 8.44/8.54 8.44/8.54 LOG: CALL solverLinear in Graph for feasibility 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.54 It's unfeasible. Removing transition: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: CALL solverLinear in Graph for feasibility 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.54 It's unfeasible. Removing transition: 8.44/8.54 1 + arg1, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: CALL solverLinear in Graph for feasibility 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.54 It's unfeasible. Removing transition: 8.44/8.54 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: CALL solverLinear in Graph for feasibility 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.54 It's unfeasible. Removing transition: 8.44/8.54 1, rest remain the same}> 8.44/8.54 [ Termination Graph ] 8.44/8.54 Strengthening and disabling transitions... 8.44/8.54 8.44/8.54 LOG: CALL solverLinear in Graph for feasibility 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.54 It's unfeasible. Removing transition: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 New Graphs: 8.44/8.54 Calling Safety with literal 1 + arg2 <= arg1 and entry 8.44/8.54 8.44/8.54 LOG: CALL check - Post:1 + arg2 <= arg1 - Process 1 8.44/8.54 * Exit transition: 8.44/8.54 * Postcondition : 1 + arg2 <= arg1 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.000701s 8.44/8.54 > Postcondition is not implied! 8.44/8.54 8.44/8.54 LOG: RETURN check - Elapsed time: 0.000812s 8.44/8.54 INVARIANTS: 8.44/8.54 2: 8.44/8.54 Quasi-INVARIANTS to narrow Graph: 8.44/8.54 2: 1 + arg2 <= arg1 , 8.44/8.54 Narrowing transition: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: Narrow transition size 1 8.44/8.54 Narrowing transition: 8.44/8.54 1 + arg1, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: Narrow transition size 1 8.44/8.54 Narrowing transition: 8.44/8.54 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: Narrow transition size 1 8.44/8.54 Narrowing transition: 8.44/8.54 1, rest remain the same}> 8.44/8.54 8.44/8.54 LOG: Narrow transition size 1 8.44/8.54 invGraph after Narrowing: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 1 + arg1, rest remain the same}> 8.44/8.54 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.54 1, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.001858s 8.44/8.54 Ranking function: -1 + arg2 8.44/8.54 New Graphs: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 1 + arg1, rest remain the same}> 8.44/8.54 1, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.001497s 8.44/8.54 Ranking function: -1 - arg1 + arg2 8.44/8.54 New Graphs: 8.44/8.54 Transitions: 8.44/8.54 0, arg2 -> 0, rest remain the same}> 8.44/8.54 Variables: 8.44/8.54 arg1, arg2 8.44/8.54 Checking conditional termination of SCC {l2}... 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.000513s 8.44/8.54 8.44/8.54 LOG: CALL solveLinear 8.44/8.54 8.44/8.54 LOG: RETURN solveLinear - Elapsed time: 0.001530s 8.44/8.54 Trying to remove transition: 0, arg2 -> 0, rest remain the same}> 8.44/8.54 Solving with 1 template(s). 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003708s 8.44/8.54 Time used: 0.00357 8.44/8.54 Solving with 1 template(s). 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.395588s 8.44/8.54 Time used: 1.39516 8.44/8.54 Solving with 2 template(s). 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011416s 8.44/8.54 Time used: 4.00091 8.44/8.54 Solving with 3 template(s). 8.44/8.54 8.44/8.54 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.54 8.44/8.54 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009536s 8.44/8.55 Time used: 1.00066 8.44/8.55 Solving with 1 template(s). 8.44/8.55 8.44/8.55 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.55 8.44/8.55 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.483376s 8.44/8.55 Time used: 0.472643 8.44/8.55 8.44/8.55 Proving non-termination of subgraph 1 8.44/8.55 Transitions: 8.44/8.55 0, arg2 -> 0, rest remain the same}> 8.44/8.55 1 + arg1, rest remain the same}> 8.44/8.55 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.55 1, rest remain the same}> 8.44/8.55 Variables: 8.44/8.55 arg1, arg2 8.44/8.55 8.44/8.55 Checking conditional non-termination of SCC {l2}... 8.44/8.55 EXIT TRANSITIONS: 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 Solving with 1 template(s). 8.44/8.55 8.44/8.55 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.55 8.44/8.55 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018888s 8.44/8.55 Time used: 0.018593 8.44/8.55 Improving Solution with cost 3 ... 8.44/8.55 8.44/8.55 LOG: CALL solveNonLinearGetNextSolution 8.44/8.55 8.44/8.55 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.621678s 8.44/8.55 Time used: 0.621514 8.44/8.55 8.44/8.55 LOG: SAT solveNonLinear - Elapsed time: 0.640565s 8.44/8.55 Cost: 3; Total time: 0.640107 8.44/8.55 Non-termination implied by a set of quasi-invariant(s): 8.44/8.55 Quasi-invariant at l2: 0 <= arg1 8.44/8.55 8.44/8.55 Strengthening and disabling EXIT transitions... 8.44/8.55 Closed exits from l2: 3 8.44/8.55 Strengthening exit transition (result): 8.44/8.55 8.44/8.55 Strengthening exit transition (result): 8.44/8.55 8.44/8.55 Strengthening exit transition (result): 8.44/8.55 8.44/8.55 8.44/8.55 Strengthening and disabling transitions... 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 0, arg2 -> 0, rest remain the same}> 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 1 + arg1, rest remain the same}> 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 1, rest remain the same}> 8.44/8.55 8.44/8.55 Checking conditional non-termination of SCC {l2}... 8.44/8.55 EXIT TRANSITIONS: 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 8.44/8.55 Solving with 1 template(s). 8.44/8.55 8.44/8.55 LOG: CALL solveNonLinearGetFirstSolution 8.44/8.55 8.44/8.55 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012273s 8.44/8.55 Time used: 0.012008 8.44/8.55 Improving Solution with cost 1 ... 8.44/8.55 8.44/8.55 LOG: CALL solveNonLinearGetNextSolution 8.44/8.55 8.44/8.55 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020118s 8.44/8.55 Time used: 0.02011 8.44/8.55 8.44/8.55 LOG: SAT solveNonLinear - Elapsed time: 0.032391s 8.44/8.55 Cost: 1; Total time: 0.032118 8.44/8.55 Failed at location 2: arg1 <= arg2 8.44/8.55 Before Improving: 8.44/8.55 Quasi-invariant at l2: arg1 <= arg2 8.44/8.55 Optimizing invariants... 8.44/8.55 8.44/8.55 LOG: CALL solveLinear 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear - Elapsed time: 0.005725s 8.44/8.55 Remaining time after improvement: 0.99751 8.44/8.55 Non-termination implied by a set of quasi-invariant(s): 8.44/8.55 Quasi-invariant at l2: arg1 <= arg2 8.44/8.55 8.44/8.55 Strengthening and disabling EXIT transitions... 8.44/8.55 Closed exits from l2: 3 8.44/8.55 8.44/8.55 Strengthening and disabling transitions... 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 0, arg2 -> 0, rest remain the same}> 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 1 + arg1, rest remain the same}> 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 0, arg2 -> -1 + arg1, rest remain the same}> 8.44/8.55 8.44/8.55 LOG: CALL solverLinear in Graph for feasibility 8.44/8.55 8.44/8.55 LOG: RETURN solveLinear in Graph for feasibility 8.44/8.55 Strengthening transition (result): 8.44/8.55 1, rest remain the same}> 8.44/8.55 8.44/8.55 Calling reachability with... 8.44/8.55 Transition: 8.44/8.55 Conditions: 0 <= arg1, arg1 <= arg2, 8.44/8.55 OPEN EXITS: 8.44/8.55 8.44/8.55 8.44/8.55 --- Reachability graph --- 8.44/8.55 > Graph without transitions. 8.44/8.55 8.44/8.55 Calling reachability with... 8.44/8.55 Transition: 8.44/8.55 Conditions: arg1 <= arg2, 0 <= arg1, 8.44/8.55 OPEN EXITS: 8.44/8.55 8.44/8.55 8.44/8.55 > Conditions are reachable! 8.44/8.55 8.44/8.55 Program does NOT terminate 8.44/8.55 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 8.44/8.55 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 8.44/8.55 EOF