10.89/10.97 NO 10.89/10.97 10.89/10.97 Solver Timeout: 4 10.89/10.97 Global Timeout: 300 10.89/10.97 No parsing errors! 10.89/10.97 Init Location: 0 10.89/10.97 Transitions: 10.89/10.97 10.89/10.97 ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> 10.89/10.97 ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}> 10.89/10.97 ~(5), arg2 -> undef12}> 10.89/10.97 (arg1 + 1), arg2 -> undef14}> 10.89/10.97 ~(5)), par{arg1 -> (arg1 + 1), arg2 -> undef16}> 10.89/10.97 undef17, arg2 -> undef18}> 10.89/10.97 10.89/10.97 Fresh variables: 10.89/10.97 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 10.89/10.97 10.89/10.97 Undef variables: 10.89/10.97 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 10.89/10.97 10.89/10.97 Abstraction variables: 10.89/10.97 10.89/10.97 Exit nodes: 10.89/10.97 10.89/10.97 Accepting locations: 10.89/10.97 10.89/10.97 Asserts: 10.89/10.97 10.89/10.97 Preprocessed LLVMGraph 10.89/10.97 Init Location: 0 10.89/10.97 Transitions: 10.89/10.97 ~(1)) /\ (undef18 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef17 > 0) /\ (undef8 > ~(1)) /\ (undef18 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef17 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0)> 10.89/10.97 ~(5)}> 10.89/10.97 (arg1 + 1)}> 10.89/10.97 ~(5)), par{arg1 -> (arg1 + 1)}> 10.89/10.97 10.89/10.97 Fresh variables: 10.89/10.97 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 10.89/10.97 10.89/10.97 Undef variables: 10.89/10.97 undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef14, undef16, undef17, undef18, 10.89/10.97 10.89/10.97 Abstraction variables: 10.89/10.97 10.89/10.97 Exit nodes: 10.89/10.97 10.89/10.97 Accepting locations: 10.89/10.97 10.89/10.97 Asserts: 10.89/10.97 10.89/10.97 ************************************************************* 10.89/10.97 ******************************************************************************************* 10.89/10.97 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 10.89/10.97 ******************************************************************************************* 10.89/10.97 10.89/10.97 Init Location: 0 10.89/10.97 Graph 0: 10.89/10.97 Transitions: 10.89/10.97 Variables: 10.89/10.97 10.89/10.97 Graph 1: 10.89/10.97 Transitions: 10.89/10.97 -5, rest remain the same}> 10.89/10.97 1 + arg1, rest remain the same}> 10.89/10.97 1 + arg1, rest remain the same}> 10.89/10.97 Variables: 10.89/10.97 arg1 10.89/10.97 10.89/10.97 Precedence: 10.89/10.97 Graph 0 10.89/10.97 10.89/10.97 Graph 1 10.89/10.97 10.89/10.97 10.89/10.97 Map Locations to Subgraph: 10.89/10.97 ( 0 , 0 ) 10.89/10.97 ( 3 , 1 ) 10.89/10.97 10.89/10.97 ******************************************************************************************* 10.89/10.97 ******************************** CHECKING ASSERTIONS ******************************** 10.89/10.97 ******************************************************************************************* 10.89/10.97 10.89/10.97 Proving termination of subgraph 0 10.89/10.97 Proving termination of subgraph 1 10.89/10.97 Checking unfeasibility... 10.89/10.97 Time used: 0.005545 10.89/10.97 10.89/10.97 Checking conditional termination of SCC {l3}... 10.89/10.97 10.89/10.97 LOG: CALL solveLinear 10.89/10.97 10.89/10.97 LOG: RETURN solveLinear - Elapsed time: 0.001114s 10.89/10.97 Ranking function: -6 - arg1 10.89/10.97 New Graphs: 10.89/10.97 Transitions: 10.89/10.97 -5, rest remain the same}> 10.89/10.97 1 + arg1, rest remain the same}> 10.89/10.97 Variables: 10.89/10.97 arg1 10.89/10.97 Checking conditional termination of SCC {l3}... 10.89/10.97 10.89/10.97 LOG: CALL solveLinear 10.89/10.97 10.89/10.97 LOG: RETURN solveLinear - Elapsed time: 0.000790s 10.89/10.97 Ranking function: -1 - arg1 10.89/10.97 New Graphs: 10.89/10.97 Transitions: 10.89/10.97 -5, rest remain the same}> 10.89/10.97 Variables: 10.89/10.97 arg1 10.89/10.97 Checking conditional termination of SCC {l3}... 10.89/10.97 10.89/10.97 LOG: CALL solveLinear 10.89/10.97 10.89/10.97 LOG: RETURN solveLinear - Elapsed time: 0.000356s 10.89/10.97 10.89/10.97 LOG: CALL solveLinear 10.89/10.97 10.89/10.97 LOG: RETURN solveLinear - Elapsed time: 0.001000s 10.89/10.97 Trying to remove transition: -5, rest remain the same}> 10.89/10.97 Solving with 1 template(s). 10.89/10.97 10.89/10.97 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.97 10.89/10.97 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.659703s 10.89/10.97 Time used: 0.659176 10.89/10.97 Solving with 1 template(s). 10.89/10.97 10.89/10.97 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.97 10.89/10.97 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011133s 10.89/10.97 Time used: 0.008237 10.89/10.97 Improving Solution with cost 1 ... 10.89/10.97 10.89/10.97 LOG: CALL solveNonLinearGetNextSolution 10.89/10.97 10.89/10.97 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021792s 10.89/10.97 Time used: 0.021785 10.89/10.97 10.89/10.97 LOG: SAT solveNonLinear - Elapsed time: 0.032925s 10.89/10.97 Cost: 1; Total time: 0.030022 10.89/10.97 Failed at location 3: 0 <= 1 + arg1 10.89/10.97 Before Improving: 10.89/10.97 Quasi-invariant at l3: 0 <= 1 + arg1 10.89/10.97 Optimizing invariants... 10.89/10.97 10.89/10.97 LOG: CALL solveLinear 10.89/10.97 10.89/10.97 LOG: RETURN solveLinear - Elapsed time: 0.004867s 10.89/10.97 Quasi-invariant improved 10.89/10.97 10.89/10.97 LOG: CALL solveLinear 10.89/10.97 10.89/10.97 LOG: RETURN solveLinear - Elapsed time: 0.001534s 10.89/10.97 Remaining time after improvement: 0.996891 10.89/10.97 Termination implied by a set of quasi-invariant(s): 10.89/10.97 Quasi-invariant at l3: 0 <= 4 + arg1 10.89/10.97 [ Invariant Graph ] 10.89/10.97 Strengthening and disabling transitions... 10.89/10.98 10.89/10.98 LOG: CALL solverLinear in Graph for feasibility 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear in Graph for feasibility 10.89/10.98 It's unfeasible. Removing transition: 10.89/10.98 -5, rest remain the same}> 10.89/10.98 10.89/10.98 LOG: CALL solverLinear in Graph for feasibility 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear in Graph for feasibility 10.89/10.98 It's unfeasible. Removing transition: 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 10.89/10.98 LOG: CALL solverLinear in Graph for feasibility 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear in Graph for feasibility 10.89/10.98 Strengthening transition (result): 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 [ Termination Graph ] 10.89/10.98 Strengthening and disabling transitions... 10.89/10.98 10.89/10.98 LOG: CALL solverLinear in Graph for feasibility 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear in Graph for feasibility 10.89/10.98 It's unfeasible. Removing transition: 10.89/10.98 -5, rest remain the same}> 10.89/10.98 New Graphs: 10.89/10.98 Calling Safety with literal 0 <= 4 + arg1 and entry 10.89/10.98 10.89/10.98 LOG: CALL check - Post:0 <= 4 + arg1 - Process 1 10.89/10.98 * Exit transition: 10.89/10.98 * Postcondition : 0 <= 4 + arg1 10.89/10.98 10.89/10.98 LOG: CALL solveLinear 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear - Elapsed time: 0.000594s 10.89/10.98 > Postcondition is not implied! 10.89/10.98 10.89/10.98 LOG: RETURN check - Elapsed time: 0.000743s 10.89/10.98 INVARIANTS: 10.89/10.98 3: 10.89/10.98 Quasi-INVARIANTS to narrow Graph: 10.89/10.98 3: 0 <= 4 + arg1 , 10.89/10.98 Narrowing transition: 10.89/10.98 -5, rest remain the same}> 10.89/10.98 10.89/10.98 LOG: Narrow transition size 1 10.89/10.98 Narrowing transition: 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 10.89/10.98 LOG: Narrow transition size 1 10.89/10.98 It's unfeasible. Removing transition: 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 invGraph after Narrowing: 10.89/10.98 Transitions: 10.89/10.98 -5, rest remain the same}> 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 Variables: 10.89/10.98 arg1 10.89/10.98 Checking conditional termination of SCC {l3}... 10.89/10.98 10.89/10.98 LOG: CALL solveLinear 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear - Elapsed time: 0.000778s 10.89/10.98 Ranking function: -5 - arg1 10.89/10.98 New Graphs: 10.89/10.98 Transitions: 10.89/10.98 -5, rest remain the same}> 10.89/10.98 Variables: 10.89/10.98 arg1 10.89/10.98 Checking conditional termination of SCC {l3}... 10.89/10.98 10.89/10.98 LOG: CALL solveLinear 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear - Elapsed time: 0.000366s 10.89/10.98 10.89/10.98 LOG: CALL solveLinear 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear - Elapsed time: 0.001022s 10.89/10.98 Trying to remove transition: -5, rest remain the same}> 10.89/10.98 Solving with 1 template(s). 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.655521s 10.89/10.98 Time used: 0.655362 10.89/10.98 Solving with 1 template(s). 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003708s 10.89/10.98 Time used: 4.0007 10.89/10.98 Solving with 2 template(s). 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.037037s 10.89/10.98 Time used: 4.0321 10.89/10.98 Solving with 3 template(s). 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008550s 10.89/10.98 Time used: 1.00052 10.89/10.98 Solving with 1 template(s). 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.434692s 10.89/10.98 Time used: 0.427553 10.89/10.98 10.89/10.98 Proving non-termination of subgraph 1 10.89/10.98 Transitions: 10.89/10.98 -5, rest remain the same}> 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 Variables: 10.89/10.98 arg1 10.89/10.98 10.89/10.98 Checking conditional non-termination of SCC {l3}... 10.89/10.98 EXIT TRANSITIONS: 10.89/10.98 10.89/10.98 10.89/10.98 Solving with 1 template(s). 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetFirstSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016938s 10.89/10.98 Time used: 0.01674 10.89/10.98 Improving Solution with cost 1 ... 10.89/10.98 10.89/10.98 LOG: CALL solveNonLinearGetNextSolution 10.89/10.98 10.89/10.98 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008804s 10.89/10.98 Time used: 0.008791 10.89/10.98 10.89/10.98 LOG: SAT solveNonLinear - Elapsed time: 0.025743s 10.89/10.98 Cost: 1; Total time: 0.025531 10.89/10.98 Failed at location 3: 5 + arg1 <= 0 10.89/10.98 Before Improving: 10.89/10.98 Quasi-invariant at l3: 5 + arg1 <= 0 10.89/10.98 Optimizing invariants... 10.89/10.98 10.89/10.98 LOG: CALL solveLinear 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear - Elapsed time: 0.002391s 10.89/10.98 Remaining time after improvement: 0.998924 10.89/10.98 Non-termination implied by a set of quasi-invariant(s): 10.89/10.98 Quasi-invariant at l3: 5 + arg1 <= 0 10.89/10.98 10.89/10.98 Strengthening and disabling EXIT transitions... 10.89/10.98 Closed exits from l3: 1 10.89/10.98 10.89/10.98 Strengthening and disabling transitions... 10.89/10.98 10.89/10.98 LOG: CALL solverLinear in Graph for feasibility 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear in Graph for feasibility 10.89/10.98 Strengthening transition (result): 10.89/10.98 -5, rest remain the same}> 10.89/10.98 10.89/10.98 LOG: CALL solverLinear in Graph for feasibility 10.89/10.98 10.89/10.98 LOG: RETURN solveLinear in Graph for feasibility 10.89/10.98 Strengthening transition (result): 10.89/10.98 1 + arg1, rest remain the same}> 10.89/10.98 10.89/10.98 Calling reachability with... 10.89/10.98 Transition: 10.89/10.98 Conditions: 5 + arg1 <= 0, 10.89/10.98 OPEN EXITS: 10.89/10.98 10.89/10.98 10.89/10.98 --- Reachability graph --- 10.89/10.98 > Graph without transitions. 10.89/10.98 10.89/10.98 Calling reachability with... 10.89/10.98 Transition: 10.89/10.98 Conditions: 5 + arg1 <= 0, 10.89/10.98 OPEN EXITS: 10.89/10.98 10.89/10.98 10.89/10.98 > Conditions are reachable! 10.89/10.98 10.89/10.98 Program does NOT terminate 10.89/10.98 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 10.89/10.98 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 10.89/10.98 EOF