5.13/5.17 NO 5.13/5.17 5.13/5.17 Solver Timeout: 4 5.13/5.17 Global Timeout: 300 5.13/5.17 No parsing errors! 5.13/5.17 Init Location: 0 5.13/5.17 Transitions: 5.13/5.17 5.13/5.17 ~(1)), par{arg1 -> undef1}> 5.13/5.17 0) /\ (undef2 > ~(1)), par{arg1 -> undef2}> 5.13/5.17 undef3}> 5.13/5.17 5.13/5.17 Fresh variables: 5.13/5.17 undef1, undef2, undef3, 5.13/5.17 5.13/5.17 Undef variables: 5.13/5.17 undef1, undef2, undef3, 5.13/5.17 5.13/5.17 Abstraction variables: 5.13/5.17 5.13/5.17 Exit nodes: 5.13/5.17 5.13/5.17 Accepting locations: 5.13/5.17 5.13/5.17 Asserts: 5.13/5.17 5.13/5.17 Preprocessed LLVMGraph 5.13/5.17 Init Location: 0 5.13/5.17 Transitions: 5.13/5.17 ~(1))> 5.13/5.17 0) /\ (undef2 > ~(1)), par{arg1 -> undef2}> 5.13/5.17 5.13/5.17 Fresh variables: 5.13/5.17 undef1, undef2, undef3, 5.13/5.17 5.13/5.17 Undef variables: 5.13/5.17 undef1, undef2, undef3, 5.13/5.17 5.13/5.17 Abstraction variables: 5.13/5.17 5.13/5.17 Exit nodes: 5.13/5.17 5.13/5.17 Accepting locations: 5.13/5.17 5.13/5.17 Asserts: 5.13/5.17 5.13/5.17 ************************************************************* 5.13/5.17 ******************************************************************************************* 5.13/5.17 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.13/5.17 ******************************************************************************************* 5.13/5.17 5.13/5.17 Init Location: 0 5.13/5.17 Graph 0: 5.13/5.17 Transitions: 5.13/5.17 Variables: 5.13/5.17 5.13/5.17 Graph 1: 5.13/5.17 Transitions: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 Variables: 5.13/5.17 arg1 5.13/5.17 5.13/5.17 Precedence: 5.13/5.17 Graph 0 5.13/5.17 5.13/5.17 Graph 1 5.13/5.17 5.13/5.17 5.13/5.17 Map Locations to Subgraph: 5.13/5.17 ( 0 , 0 ) 5.13/5.17 ( 2 , 1 ) 5.13/5.17 5.13/5.17 ******************************************************************************************* 5.13/5.17 ******************************** CHECKING ASSERTIONS ******************************** 5.13/5.17 ******************************************************************************************* 5.13/5.17 5.13/5.17 Proving termination of subgraph 0 5.13/5.17 Proving termination of subgraph 1 5.13/5.17 Checking unfeasibility... 5.13/5.17 Time used: 0.001783 5.13/5.17 5.13/5.17 Checking conditional termination of SCC {l2}... 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.000616s 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.001771s 5.13/5.17 Trying to remove transition: undef2, rest remain the same}> 5.13/5.17 Solving with 1 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003680s 5.13/5.17 Time used: 0.00353 5.13/5.17 Solving with 1 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005012s 5.13/5.17 Time used: 0.004759 5.13/5.17 Improving Solution with cost 1 ... 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetNextSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013321s 5.13/5.17 Time used: 0.013316 5.13/5.17 5.13/5.17 LOG: SAT solveNonLinear - Elapsed time: 0.018333s 5.13/5.17 Cost: 1; Total time: 0.018075 5.13/5.17 Failed at location 2: arg1 <= 0 5.13/5.17 Before Improving: 5.13/5.17 Quasi-invariant at l2: arg1 <= 0 5.13/5.17 Optimizing invariants... 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.001599s 5.13/5.17 Remaining time after improvement: 0.999195 5.13/5.17 Termination implied by a set of quasi-invariant(s): 5.13/5.17 Quasi-invariant at l2: arg1 <= 0 5.13/5.17 [ Invariant Graph ] 5.13/5.17 Strengthening and disabling transitions... 5.13/5.17 5.13/5.17 LOG: CALL solverLinear in Graph for feasibility 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.17 It's unfeasible. Removing transition: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 [ Termination Graph ] 5.13/5.17 Strengthening and disabling transitions... 5.13/5.17 > It's unfeasible. Removing transition: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 New Graphs: 5.13/5.17 Calling Safety with literal arg1 <= 0 and entry 5.13/5.17 5.13/5.17 LOG: CALL check - Post:arg1 <= 0 - Process 1 5.13/5.17 * Exit transition: 5.13/5.17 * Postcondition : arg1 <= 0 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.000388s 5.13/5.17 > Postcondition is not implied! 5.13/5.17 5.13/5.17 LOG: RETURN check - Elapsed time: 0.000470s 5.13/5.17 INVARIANTS: 5.13/5.17 2: 5.13/5.17 Quasi-INVARIANTS to narrow Graph: 5.13/5.17 2: arg1 <= 0 , 5.13/5.17 Narrowing transition: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 5.13/5.17 LOG: Narrow transition size 1 5.13/5.17 invGraph after Narrowing: 5.13/5.17 Transitions: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 Variables: 5.13/5.17 arg1 5.13/5.17 Checking conditional termination of SCC {l2}... 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.000570s 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.001687s 5.13/5.17 Trying to remove transition: undef2, rest remain the same}> 5.13/5.17 Solving with 1 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003369s 5.13/5.17 Time used: 0.003233 5.13/5.17 Solving with 1 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004464s 5.13/5.17 Time used: 0.004231 5.13/5.17 Solving with 2 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001351s 5.13/5.17 Time used: 4.00057 5.13/5.17 Solving with 3 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.039183s 5.13/5.17 Time used: 1.00051 5.13/5.17 Solving with 1 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007294s 5.13/5.17 Time used: 0.004094 5.13/5.17 5.13/5.17 Proving non-termination of subgraph 1 5.13/5.17 Transitions: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 Variables: 5.13/5.17 arg1 5.13/5.17 5.13/5.17 Checking conditional non-termination of SCC {l2}... 5.13/5.17 EXIT TRANSITIONS: 5.13/5.17 5.13/5.17 5.13/5.17 Solving with 1 template(s). 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetFirstSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006189s 5.13/5.17 Time used: 0.006016 5.13/5.17 Improving Solution with cost 1 ... 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinearGetNextSolution 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011197s 5.13/5.17 Time used: 0.011158 5.13/5.17 5.13/5.17 LOG: SAT solveNonLinear - Elapsed time: 0.017386s 5.13/5.17 Cost: 1; Total time: 0.017174 5.13/5.17 Failed at location 2: 1 <= arg1 5.13/5.17 Before Improving: 5.13/5.17 Quasi-invariant at l2: 1 <= arg1 5.13/5.17 Optimizing invariants... 5.13/5.17 5.13/5.17 LOG: CALL solveLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear - Elapsed time: 0.002978s 5.13/5.17 Remaining time after improvement: 0.99911 5.13/5.17 Minimizing number of undef constraints... 5.13/5.17 5.13/5.17 LOG: CALL solveNonLinear 5.13/5.17 5.13/5.17 LOG: RETURN solveNonLinear - Elapsed time: 0.001771s 5.13/5.17 Non-termination implied by a set of quasi-invariant(s): 5.13/5.17 Quasi-invariant at l2: 1 <= arg1 5.13/5.17 Constraint over undef '1 <= undef2' in transition: 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 5.13/5.17 Strengthening and disabling EXIT transitions... 5.13/5.17 Closed exits from l2: 1 5.13/5.17 5.13/5.17 Strengthening and disabling transitions... 5.13/5.17 5.13/5.17 LOG: CALL solverLinear in Graph for feasibility 5.13/5.17 5.13/5.17 LOG: RETURN solveLinear in Graph for feasibility 5.13/5.17 Strengthening transition (result): 5.13/5.17 undef2, rest remain the same}> 5.13/5.17 5.13/5.17 Calling reachability with... 5.13/5.17 Transition: 5.13/5.17 Conditions: 1 <= arg1, 5.13/5.17 OPEN EXITS: 5.13/5.17 5.13/5.17 5.13/5.17 --- Reachability graph --- 5.13/5.17 > Graph without transitions. 5.13/5.17 5.13/5.17 Calling reachability with... 5.13/5.17 Transition: 5.13/5.17 Conditions: 1 <= arg1, 5.13/5.17 OPEN EXITS: 5.13/5.17 5.13/5.17 5.13/5.17 > Conditions are reachable! 5.13/5.17 5.13/5.17 Program does NOT terminate 5.13/5.17 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.13/5.17 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.13/5.17 EOF