5.02/5.09 NO 5.02/5.09 5.02/5.09 Solver Timeout: 4 5.02/5.09 Global Timeout: 300 5.02/5.09 No parsing errors! 5.02/5.09 Init Location: 0 5.02/5.09 Transitions: 5.02/5.09 5.02/5.09 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> 5.02/5.09 4), par{arg2 -> undef4}> 5.02/5.09 0) /\ (arg1 < 5), par{arg1 -> (arg1 - 1), arg2 -> undef6}> 5.02/5.09 undef7, arg2 -> undef8}> 5.02/5.09 5.02/5.09 Fresh variables: 5.02/5.09 undef2, undef4, undef6, undef7, undef8, 5.02/5.09 5.02/5.09 Undef variables: 5.02/5.09 undef2, undef4, undef6, undef7, undef8, 5.02/5.09 5.02/5.09 Abstraction variables: 5.02/5.09 5.02/5.09 Exit nodes: 5.02/5.09 5.02/5.09 Accepting locations: 5.02/5.09 5.02/5.09 Asserts: 5.02/5.09 5.02/5.09 Preprocessed LLVMGraph 5.02/5.09 Init Location: 0 5.02/5.09 Transitions: 5.02/5.09 0) /\ (undef8 > ~(1))> 5.02/5.09 4)> 5.02/5.09 0) /\ (arg1 < 5), par{arg1 -> (arg1 - 1)}> 5.02/5.09 5.02/5.09 Fresh variables: 5.02/5.09 undef2, undef4, undef6, undef7, undef8, 5.02/5.09 5.02/5.09 Undef variables: 5.02/5.09 undef2, undef4, undef6, undef7, undef8, 5.02/5.09 5.02/5.09 Abstraction variables: 5.02/5.09 5.02/5.09 Exit nodes: 5.02/5.09 5.02/5.09 Accepting locations: 5.02/5.09 5.02/5.09 Asserts: 5.02/5.09 5.02/5.09 ************************************************************* 5.02/5.09 ******************************************************************************************* 5.02/5.09 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.02/5.09 ******************************************************************************************* 5.02/5.09 5.02/5.09 Init Location: 0 5.02/5.09 Graph 0: 5.02/5.09 Transitions: 5.02/5.09 Variables: 5.02/5.09 5.02/5.09 Graph 1: 5.02/5.09 Transitions: 5.02/5.09 5.02/5.09 -1 + arg1, rest remain the same}> 5.02/5.09 Variables: 5.02/5.09 arg1 5.02/5.09 5.02/5.09 Precedence: 5.02/5.09 Graph 0 5.02/5.09 5.02/5.09 Graph 1 5.02/5.09 5.02/5.09 5.02/5.09 Map Locations to Subgraph: 5.02/5.09 ( 0 , 0 ) 5.02/5.09 ( 2 , 1 ) 5.02/5.09 5.02/5.09 ******************************************************************************************* 5.02/5.09 ******************************** CHECKING ASSERTIONS ******************************** 5.02/5.09 ******************************************************************************************* 5.02/5.09 5.02/5.09 Proving termination of subgraph 0 5.02/5.09 Proving termination of subgraph 1 5.02/5.09 Checking unfeasibility... 5.02/5.09 Time used: 0.002881 5.02/5.09 5.02/5.09 Checking conditional termination of SCC {l2}... 5.02/5.10 5.02/5.10 LOG: CALL solveLinear 5.02/5.10 5.02/5.10 LOG: RETURN solveLinear - Elapsed time: 0.000650s 5.02/5.10 Ranking function: -1 + arg1 5.02/5.10 New Graphs: 5.02/5.10 Transitions: 5.02/5.10 5.02/5.10 Variables: 5.02/5.10 arg1 5.02/5.10 > No variable changes in termination graph. 5.02/5.10 Checking conditional unfeasibility... 5.02/5.10 Calling Safety with literal arg1 <= 4 and entry 5.02/5.10 5.02/5.10 LOG: CALL check - Post:arg1 <= 4 - Process 1 5.02/5.10 * Exit transition: 5.02/5.10 * Postcondition : arg1 <= 4 5.02/5.10 Quasi-invariants: 5.02/5.10 Location 2: arg1 <= 4 ; 5.02/5.10 Postcondition: arg1 <= 4 5.02/5.10 5.02/5.10 LOG: CALL check - Post:arg1 <= 4 - Process 2 5.02/5.10 * Exit transition: 5.02/5.10 * Postcondition : arg1 <= 4 5.02/5.10 5.02/5.10 LOG: CALL solveLinear 5.02/5.10 5.02/5.10 LOG: RETURN solveLinear - Elapsed time: 0.000390s 5.02/5.10 > Postcondition is not implied! 5.02/5.10 5.02/5.10 LOG: RETURN check - Elapsed time: 0.000482s 5.02/5.10 5.02/5.10 LOG: NarrowEntry size 1 5.02/5.10 Narrowing transition: 5.02/5.10 5.02/5.10 5.02/5.10 LOG: Narrow transition size 1 5.02/5.10 It's unfeasible. Removing transition: 5.02/5.10 -1 + arg1, rest remain the same}> 5.02/5.10 ENTRIES: 5.02/5.10 5.02/5.10 END ENTRIES: 5.02/5.10 GRAPH: 5.02/5.10 5.02/5.10 END GRAPH: 5.02/5.10 EXIT: 5.02/5.10 POST: arg1 <= 4 5.02/5.10 5.02/5.10 5.02/5.10 LOG: Try proving POST 5.02/5.10 Solving with 1 template(s). 5.02/5.10 5.02/5.10 LOG: CALL solveNonLinearGetFirstSolution 5.02/5.10 5.02/5.10 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008828s 5.02/5.10 Time used: 0.008728 5.02/5.10 Solving with 2 template(s). 5.02/5.10 5.02/5.10 LOG: CALL solveNonLinearGetFirstSolution 5.02/5.10 5.02/5.10 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000749s 5.02/5.10 Time used: 4.0005 5.02/5.10 Solving with 3 template(s). 5.02/5.10 5.02/5.10 LOG: CALL solveNonLinearGetFirstSolution 5.02/5.10 5.02/5.10 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006389s 5.02/5.10 Time used: 1.00036 5.02/5.10 5.02/5.10 LOG: Postcondition is not implied - no solution 5.02/5.10 > Postcondition is not implied! 5.02/5.10 5.02/5.10 LOG: RETURN check - Elapsed time: 5.022158s 5.02/5.10 5.02/5.10 Proving non-termination of subgraph 1 5.02/5.10 Transitions: 5.02/5.10 5.02/5.10 -1 + arg1, rest remain the same}> 5.02/5.10 Variables: 5.02/5.10 arg1 5.02/5.10 5.02/5.10 Checking conditional non-termination of SCC {l2}... 5.02/5.10 EXIT TRANSITIONS: 5.02/5.10 5.02/5.10 5.02/5.10 Solving with 1 template(s). 5.02/5.10 5.02/5.10 LOG: CALL solveNonLinearGetFirstSolution 5.02/5.10 5.02/5.10 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020568s 5.02/5.10 Time used: 0.020405 5.02/5.10 Improving Solution with cost 1 ... 5.02/5.10 5.02/5.10 LOG: CALL solveNonLinearGetNextSolution 5.02/5.10 5.02/5.10 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006080s 5.02/5.10 Time used: 0.006075 5.02/5.10 5.02/5.10 LOG: SAT solveNonLinear - Elapsed time: 0.026648s 5.02/5.10 Cost: 1; Total time: 0.02648 5.02/5.10 Failed at location 2: 5 <= arg1 5.02/5.10 Before Improving: 5.02/5.10 Quasi-invariant at l2: 5 <= arg1 5.02/5.10 Optimizing invariants... 5.02/5.10 5.02/5.10 LOG: CALL solveLinear 5.02/5.10 5.02/5.10 LOG: RETURN solveLinear - Elapsed time: 0.001512s 5.02/5.10 Remaining time after improvement: 0.999257 5.02/5.10 Non-termination implied by a set of quasi-invariant(s): 5.02/5.10 Quasi-invariant at l2: 5 <= arg1 5.02/5.10 5.02/5.10 Strengthening and disabling EXIT transitions... 5.02/5.10 Closed exits from l2: 1 5.02/5.10 5.02/5.10 Strengthening and disabling transitions... 5.02/5.10 5.02/5.10 LOG: CALL solverLinear in Graph for feasibility 5.02/5.10 5.02/5.10 LOG: RETURN solveLinear in Graph for feasibility 5.02/5.10 Strengthening transition (result): 5.02/5.10 5.02/5.10 5.02/5.10 LOG: CALL solverLinear in Graph for feasibility 5.02/5.10 5.02/5.10 LOG: RETURN solveLinear in Graph for feasibility 5.02/5.10 It's unfeasible. Removing transition: 5.02/5.10 -1 + arg1, rest remain the same}> 5.02/5.10 5.02/5.10 Calling reachability with... 5.02/5.10 Transition: 5.02/5.10 Conditions: 5 <= arg1, 5.02/5.10 OPEN EXITS: 5.02/5.10 5.02/5.10 5.02/5.10 --- Reachability graph --- 5.02/5.10 > Graph without transitions. 5.02/5.10 5.02/5.10 Calling reachability with... 5.02/5.10 Transition: 5.02/5.10 Conditions: 5 <= arg1, 5.02/5.10 OPEN EXITS: 5.02/5.10 5.02/5.10 5.02/5.10 > Conditions are reachable! 5.02/5.10 5.02/5.10 Program does NOT terminate 5.02/5.10 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.02/5.10 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.02/5.10 EOF