8.53/8.58 NO 8.53/8.58 8.53/8.58 Solver Timeout: 4 8.53/8.58 Global Timeout: 300 8.53/8.58 No parsing errors! 8.53/8.58 Init Location: 0 8.53/8.58 Transitions: 8.53/8.58 8.53/8.58 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> 20}> 8.53/8.58 0, arg2 -> 0}> 8.53/8.58 arg1) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> (arg1 + 1)}> 8.53/8.58 0) /\ (arg1 = arg2), par{arg1 -> 0, arg2 -> (arg1 - 1)}> 8.53/8.58 0) /\ (0 = arg1), par{arg1 -> 1}> 8.53/8.58 undef11, arg2 -> undef12}> 8.53/8.58 8.53/8.58 Fresh variables: 8.53/8.58 undef11, undef12, 8.53/8.58 8.53/8.58 Undef variables: 8.53/8.58 undef11, undef12, 8.53/8.58 8.53/8.58 Abstraction variables: 8.53/8.58 8.53/8.58 Exit nodes: 8.53/8.58 8.53/8.58 Accepting locations: 8.53/8.58 8.53/8.58 Asserts: 8.53/8.58 8.53/8.58 Preprocessed LLVMGraph 8.53/8.58 Init Location: 0 8.53/8.58 Transitions: 8.53/8.58 0) /\ (undef12 > ~(1))> 8.53/8.58 0, arg2 -> 0}> 8.53/8.58 arg1) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> (arg1 + 1)}> 8.53/8.58 0) /\ (arg1 = arg2), par{arg1 -> 0, arg2 -> (arg1 - 1)}> 8.53/8.58 0) /\ (0 = arg1), par{arg1 -> 1}> 8.53/8.58 8.53/8.58 Fresh variables: 8.53/8.58 undef11, undef12, 8.53/8.58 8.53/8.58 Undef variables: 8.53/8.58 undef11, undef12, 8.53/8.58 8.53/8.58 Abstraction variables: 8.53/8.58 8.53/8.58 Exit nodes: 8.53/8.58 8.53/8.58 Accepting locations: 8.53/8.58 8.53/8.58 Asserts: 8.53/8.58 8.53/8.58 ************************************************************* 8.53/8.58 ******************************************************************************************* 8.53/8.58 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 8.53/8.58 ******************************************************************************************* 8.53/8.58 8.53/8.58 Init Location: 0 8.53/8.58 Graph 0: 8.53/8.58 Transitions: 8.53/8.58 Variables: 8.53/8.58 8.53/8.58 Graph 1: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 1, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 8.53/8.58 Precedence: 8.53/8.58 Graph 0 8.53/8.58 8.53/8.58 Graph 1 8.53/8.58 8.53/8.58 8.53/8.58 Map Locations to Subgraph: 8.53/8.58 ( 0 , 0 ) 8.53/8.58 ( 2 , 1 ) 8.53/8.58 8.53/8.58 ******************************************************************************************* 8.53/8.58 ******************************** CHECKING ASSERTIONS ******************************** 8.53/8.58 ******************************************************************************************* 8.53/8.58 8.53/8.58 Proving termination of subgraph 0 8.53/8.58 Proving termination of subgraph 1 8.53/8.58 Checking unfeasibility... 8.53/8.58 Time used: 0.387717 8.53/8.58 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.003084s 8.53/8.58 Ranking function: -1 + arg2 8.53/8.58 New Graphs: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 1, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.001356s 8.53/8.58 Ranking function: -5 - arg1 + 3*arg2 8.53/8.58 New Graphs: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 1, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.000916s 8.53/8.58 Ranking function: -1 - arg1 + arg2 8.53/8.58 New Graphs: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.000424s 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.001241s 8.53/8.58 Trying to remove transition: 0, arg2 -> 0, rest remain the same}> 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003392s 8.53/8.58 Time used: 0.003258 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012193s 8.53/8.58 Time used: 0.011812 8.53/8.58 Improving Solution with cost 1 ... 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetNextSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.410826s 8.53/8.58 Time used: 0.410821 8.53/8.58 8.53/8.58 LOG: SAT solveNonLinear - Elapsed time: 0.423019s 8.53/8.58 Cost: 1; Total time: 0.422633 8.53/8.58 Failed at location 2: 1 + arg2 <= arg1 8.53/8.58 Before Improving: 8.53/8.58 Quasi-invariant at l2: 1 + arg2 <= arg1 8.53/8.58 Optimizing invariants... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.006363s 8.53/8.58 Remaining time after improvement: 0.997992 8.53/8.58 Termination implied by a set of quasi-invariant(s): 8.53/8.58 Quasi-invariant at l2: 1 + arg2 <= arg1 8.53/8.58 [ Invariant Graph ] 8.53/8.58 Strengthening and disabling transitions... 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 It's unfeasible. Removing transition: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 It's unfeasible. Removing transition: 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 It's unfeasible. Removing transition: 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 It's unfeasible. Removing transition: 8.53/8.58 1, rest remain the same}> 8.53/8.58 [ Termination Graph ] 8.53/8.58 Strengthening and disabling transitions... 8.53/8.58 > It's unfeasible. Removing transition: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 New Graphs: 8.53/8.58 Calling Safety with literal 1 + arg2 <= arg1 and entry 8.53/8.58 8.53/8.58 LOG: CALL check - Post:1 + arg2 <= arg1 - Process 1 8.53/8.58 * Exit transition: 8.53/8.58 * Postcondition : 1 + arg2 <= arg1 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.000700s 8.53/8.58 > Postcondition is not implied! 8.53/8.58 8.53/8.58 LOG: RETURN check - Elapsed time: 0.000810s 8.53/8.58 INVARIANTS: 8.53/8.58 2: 8.53/8.58 Quasi-INVARIANTS to narrow Graph: 8.53/8.58 2: 1 + arg2 <= arg1 , 8.53/8.58 Narrowing transition: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: Narrow transition size 1 8.53/8.58 Narrowing transition: 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: Narrow transition size 1 8.53/8.58 Narrowing transition: 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: Narrow transition size 1 8.53/8.58 Narrowing transition: 8.53/8.58 1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: Narrow transition size 1 8.53/8.58 invGraph after Narrowing: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 1, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.001989s 8.53/8.58 Ranking function: -1 + arg2 8.53/8.58 New Graphs: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 1, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.001600s 8.53/8.58 Ranking function: -1 - arg1 + arg2 8.53/8.58 New Graphs: 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 Checking conditional termination of SCC {l2}... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.000504s 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.001532s 8.53/8.58 Trying to remove transition: 0, arg2 -> 0, rest remain the same}> 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003712s 8.53/8.58 Time used: 0.003573 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.423907s 8.53/8.58 Time used: 1.42354 8.53/8.58 Solving with 2 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011354s 8.53/8.58 Time used: 4.00097 8.53/8.58 Solving with 3 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.051305s 8.53/8.58 Time used: 1.0428 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.490272s 8.53/8.58 Time used: 0.479348 8.53/8.58 8.53/8.58 Proving non-termination of subgraph 1 8.53/8.58 Transitions: 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 1, rest remain the same}> 8.53/8.58 Variables: 8.53/8.58 arg1, arg2 8.53/8.58 8.53/8.58 Checking conditional non-termination of SCC {l2}... 8.53/8.58 EXIT TRANSITIONS: 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020668s 8.53/8.58 Time used: 0.02036 8.53/8.58 Improving Solution with cost 3 ... 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetNextSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.591083s 8.53/8.58 Time used: 0.591087 8.53/8.58 8.53/8.58 LOG: SAT solveNonLinear - Elapsed time: 0.611751s 8.53/8.58 Cost: 3; Total time: 0.611447 8.53/8.58 Non-termination implied by a set of quasi-invariant(s): 8.53/8.58 Quasi-invariant at l2: 0 <= arg1 8.53/8.58 8.53/8.58 Strengthening and disabling EXIT transitions... 8.53/8.58 Closed exits from l2: 3 8.53/8.58 Strengthening exit transition (result): 8.53/8.58 8.53/8.58 Strengthening exit transition (result): 8.53/8.58 8.53/8.58 Strengthening exit transition (result): 8.53/8.58 8.53/8.58 8.53/8.58 Strengthening and disabling transitions... 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 1, rest remain the same}> 8.53/8.58 8.53/8.58 Checking conditional non-termination of SCC {l2}... 8.53/8.58 EXIT TRANSITIONS: 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 8.53/8.58 Solving with 1 template(s). 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetFirstSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012414s 8.53/8.58 Time used: 0.012151 8.53/8.58 Improving Solution with cost 1 ... 8.53/8.58 8.53/8.58 LOG: CALL solveNonLinearGetNextSolution 8.53/8.58 8.53/8.58 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019371s 8.53/8.58 Time used: 0.019349 8.53/8.58 8.53/8.58 LOG: SAT solveNonLinear - Elapsed time: 0.031786s 8.53/8.58 Cost: 1; Total time: 0.0315 8.53/8.58 Failed at location 2: arg1 <= arg2 8.53/8.58 Before Improving: 8.53/8.58 Quasi-invariant at l2: arg1 <= arg2 8.53/8.58 Optimizing invariants... 8.53/8.58 8.53/8.58 LOG: CALL solveLinear 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear - Elapsed time: 0.005770s 8.53/8.58 Remaining time after improvement: 0.997464 8.53/8.58 Non-termination implied by a set of quasi-invariant(s): 8.53/8.58 Quasi-invariant at l2: arg1 <= arg2 8.53/8.58 8.53/8.58 Strengthening and disabling EXIT transitions... 8.53/8.58 Closed exits from l2: 3 8.53/8.58 8.53/8.58 Strengthening and disabling transitions... 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 0, arg2 -> 0, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 0, arg2 -> -1 + arg1, rest remain the same}> 8.53/8.58 8.53/8.58 LOG: CALL solverLinear in Graph for feasibility 8.53/8.58 8.53/8.58 LOG: RETURN solveLinear in Graph for feasibility 8.53/8.58 Strengthening transition (result): 8.53/8.58 1, rest remain the same}> 8.53/8.58 8.53/8.58 Calling reachability with... 8.53/8.58 Transition: 8.53/8.58 Conditions: 0 <= arg1, arg1 <= arg2, 8.53/8.58 OPEN EXITS: 8.53/8.58 8.53/8.58 8.53/8.58 --- Reachability graph --- 8.53/8.58 > Graph without transitions. 8.53/8.58 8.53/8.58 Calling reachability with... 8.53/8.58 Transition: 8.53/8.58 Conditions: arg1 <= arg2, 0 <= arg1, 8.53/8.58 OPEN EXITS: 8.53/8.58 8.53/8.58 8.53/8.58 > Conditions are reachable! 8.53/8.58 8.53/8.58 Program does NOT terminate 8.53/8.58 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 8.53/8.58 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 8.53/8.58 EOF