5.11/5.12 YES 5.11/5.12 5.11/5.13 Solver Timeout: 4 5.11/5.13 Global Timeout: 300 5.11/5.13 No parsing errors! 5.11/5.13 Init Location: 0 5.11/5.13 Transitions: 5.11/5.13 5.11/5.13 ~(1)) /\ (arg2 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (arg1 > 0)> 5.11/5.13 ~(1)) /\ (arg2 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (arg1 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> 5.11/5.13 ~(1)) /\ (arg2 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (arg1 > 0)> 5.11/5.13 ~(1)) /\ (arg2 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (arg1 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> 5.11/5.13 (arg1 - 1), arg2 -> (arg1 - 1)}> 5.11/5.13 undef19, arg2 -> undef20}> 5.11/5.13 5.11/5.13 Fresh variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Undef variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Abstraction variables: 5.11/5.13 5.11/5.13 Exit nodes: 5.11/5.13 5.11/5.13 Accepting locations: 5.11/5.13 5.11/5.13 Asserts: 5.11/5.13 5.11/5.13 Preprocessed LLVMGraph 5.11/5.13 Init Location: 0 5.11/5.13 Transitions: 5.11/5.13 ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> 5.11/5.13 ~(1)) /\ (undef20 > 0) /\ ((undef3 - (2 * undef4)) = 1) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> 5.11/5.13 ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef7 > ~(1)) /\ (undef20 > 0) /\ ((undef7 - (2 * undef8)) = 1) /\ (undef19 > 0) /\ ((undef7 - (2 * undef8)) < 2) /\ ((undef7 - (2 * undef8)) >= 0), par{arg1 -> 1, arg2 -> 0}> 5.11/5.13 ~(1)) /\ (undef20 > 0) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef19 > 0) /\ (undef15 > ~(1)) /\ (undef20 > 0) /\ ((undef15 - (2 * undef16)) = 0) /\ (undef19 > 0) /\ ((undef15 - (2 * undef16)) < 2) /\ ((undef15 - (2 * undef16)) >= 0), par{arg1 -> 0, arg2 -> 1}> 5.11/5.13 (arg1 - 1), arg2 -> (arg1 - 1)}> 5.11/5.13 5.11/5.13 Fresh variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Undef variables: 5.11/5.13 undef3, undef4, undef7, undef8, undef11, undef12, undef15, undef16, undef19, undef20, 5.11/5.13 5.11/5.13 Abstraction variables: 5.11/5.13 5.11/5.13 Exit nodes: 5.11/5.13 5.11/5.13 Accepting locations: 5.11/5.13 5.11/5.13 Asserts: 5.11/5.13 5.11/5.13 ************************************************************* 5.11/5.13 ******************************************************************************************* 5.11/5.13 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.11/5.13 ******************************************************************************************* 5.11/5.13 5.11/5.13 Init Location: 0 5.11/5.13 Graph 0: 5.11/5.13 Transitions: 5.11/5.13 Variables: 5.11/5.13 5.11/5.13 Graph 1: 5.11/5.13 Transitions: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 Variables: 5.11/5.13 arg1, arg2 5.11/5.13 5.11/5.13 Precedence: 5.11/5.13 Graph 0 5.11/5.13 5.11/5.13 Graph 1 5.11/5.13 1, arg2 -> 0, rest remain the same}> 5.11/5.13 0, arg2 -> 1, rest remain the same}> 5.11/5.13 1, arg2 -> 0, rest remain the same}> 5.11/5.13 0, arg2 -> 1, rest remain the same}> 5.11/5.13 5.11/5.13 Map Locations to Subgraph: 5.11/5.13 ( 0 , 0 ) 5.11/5.13 ( 3 , 1 ) 5.11/5.13 5.11/5.13 ******************************************************************************************* 5.11/5.13 ******************************** CHECKING ASSERTIONS ******************************** 5.11/5.13 ******************************************************************************************* 5.11/5.13 5.11/5.13 Proving termination of subgraph 0 5.11/5.13 Proving termination of subgraph 1 5.11/5.13 Checking unfeasibility... 5.11/5.13 Time used: 0.003081 5.11/5.13 5.11/5.13 Checking conditional termination of SCC {l3}... 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.000489s 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.001333s 5.11/5.13 Trying to remove transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 Solving with 1 template(s). 5.11/5.13 5.11/5.13 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.13 5.11/5.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004955s 5.11/5.13 Time used: 0.004825 5.11/5.13 Solving with 1 template(s). 5.11/5.13 5.11/5.13 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.13 5.11/5.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000944s 5.11/5.13 Time used: 4.00006 5.11/5.13 Solving with 2 template(s). 5.11/5.13 5.11/5.13 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.13 5.11/5.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055713s 5.11/5.13 Time used: 0.04343 5.11/5.13 Improving Solution with cost 2 ... 5.11/5.13 5.11/5.13 LOG: CALL solveNonLinearGetNextSolution 5.11/5.13 5.11/5.13 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000440s 5.11/5.13 Time used: 1.00035 5.11/5.13 5.11/5.13 LOG: SAT solveNonLinear - Elapsed time: 1.056153s 5.11/5.13 Cost: 2; Total time: 1.04378 5.11/5.13 Failed at location 3: 1 + arg2 <= arg1 5.11/5.13 Failed at location 3: 1 + arg2 <= arg1 5.11/5.13 Before Improving: 5.11/5.13 Quasi-invariant at l3: 1 + arg2 <= arg1 5.11/5.13 Quasi-invariant at l3: 1 <= arg1 + arg2 5.11/5.13 Optimizing invariants... 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.007530s 5.11/5.13 Remaining time after improvement: 0.997203 5.11/5.13 Termination implied by a set of quasi-invariant(s): 5.11/5.13 Quasi-invariant at l3: 1 + arg2 <= arg1 5.11/5.13 Quasi-invariant at l3: 1 <= arg1 + arg2 5.11/5.13 [ Invariant Graph ] 5.11/5.13 Strengthening and disabling transitions... 5.11/5.13 5.11/5.13 LOG: CALL solverLinear in Graph for feasibility 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear in Graph for feasibility 5.11/5.13 It's unfeasible. Removing transition: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 [ Termination Graph ] 5.11/5.13 Strengthening and disabling transitions... 5.11/5.13 5.11/5.13 LOG: CALL solverLinear in Graph for feasibility 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear in Graph for feasibility 5.11/5.13 It's unfeasible. Removing transition: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 New Graphs: 5.11/5.13 Calling Safety with literal 1 + arg2 <= arg1 and entry 0, arg2 -> 1, rest remain the same}> 5.11/5.13 5.11/5.13 LOG: CALL check - Post:1 + arg2 <= arg1 - Process 1 5.11/5.13 * Exit transition: 0, arg2 -> 1, rest remain the same}> 5.11/5.13 * Postcondition : 1 + arg2 <= arg1 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.000759s 5.11/5.13 > Postcondition is not implied! 5.11/5.13 5.11/5.13 LOG: RETURN check - Elapsed time: 0.000888s 5.11/5.13 Calling Safety with literal 1 + arg2 <= arg1 and entry 0, arg2 -> 1, rest remain the same}> 5.11/5.13 5.11/5.13 LOG: CALL check - Post:1 + arg2 <= arg1 - Process 2 5.11/5.13 * Exit transition: 0, arg2 -> 1, rest remain the same}> 5.11/5.13 * Postcondition : 1 + arg2 <= arg1 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.000600s 5.11/5.13 > Postcondition is not implied! 5.11/5.13 5.11/5.13 LOG: RETURN check - Elapsed time: 0.000719s 5.11/5.13 INVARIANTS: 5.11/5.13 3: 5.11/5.13 Quasi-INVARIANTS to narrow Graph: 5.11/5.13 3: 1 + arg2 <= arg1 , 1 <= arg1 + arg2 , 5.11/5.13 Narrowing transition: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 5.11/5.13 LOG: Narrow transition size 2 5.11/5.13 invGraph after Narrowing: 5.11/5.13 Transitions: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 Variables: 5.11/5.13 arg1, arg2 5.11/5.13 Checking conditional termination of SCC {l3}... 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.000431s 5.11/5.13 5.11/5.13 LOG: CALL solveLinear 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear - Elapsed time: 0.001346s 5.11/5.13 Trying to remove transition: -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 Solving with 1 template(s). 5.11/5.13 5.11/5.13 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.13 5.11/5.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004566s 5.11/5.13 Time used: 0.004434 5.11/5.13 Solving with 1 template(s). 5.11/5.13 5.11/5.13 LOG: CALL solveNonLinearGetFirstSolution 5.11/5.13 5.11/5.13 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006485s 5.11/5.13 Time used: 0.006265 5.11/5.13 5.11/5.13 LOG: SAT solveNonLinear - Elapsed time: 0.006485s 5.11/5.13 Cost: 0; Total time: 0.006265 5.11/5.13 Termination implied by a set of invariant(s): 5.11/5.13 Invariant at l3: 1 + arg1 <= arg2 5.11/5.13 [ Invariant Graph ] 5.11/5.13 Strengthening and disabling transitions... 5.11/5.13 5.11/5.13 LOG: CALL solverLinear in Graph for feasibility 5.11/5.13 5.11/5.13 LOG: RETURN solveLinear in Graph for feasibility 5.11/5.13 It's unfeasible. Removing transition: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 [ Termination Graph ] 5.11/5.13 Strengthening and disabling transitions... 5.11/5.13 > It's unfeasible. Removing transition: 5.11/5.13 -1 + arg1, arg2 -> -1 + arg1, rest remain the same}> 5.11/5.13 New Graphs: 5.11/5.13 INVARIANTS: 5.11/5.13 3: 1 + arg1 <= arg2 , 5.11/5.13 Quasi-INVARIANTS to narrow Graph: 5.11/5.13 3: 5.11/5.13 Program Terminates 5.11/5.13 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.11/5.13 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.11/5.13 EOF