5.15/5.18 NO 5.15/5.18 5.15/5.18 Solver Timeout: 4 5.15/5.18 Global Timeout: 300 5.15/5.18 No parsing errors! 5.15/5.18 Init Location: 0 5.15/5.18 Transitions: 5.15/5.18 5.15/5.18 ~(1)) /\ (arg2 > 1) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 5.15/5.18 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> 5.15/5.18 undef5, arg2 -> undef6}> 5.15/5.18 5.15/5.18 Fresh variables: 5.15/5.18 undef1, undef2, undef5, undef6, 5.15/5.18 5.15/5.18 Undef variables: 5.15/5.18 undef1, undef2, undef5, undef6, 5.15/5.18 5.15/5.18 Abstraction variables: 5.15/5.18 5.15/5.18 Exit nodes: 5.15/5.18 5.15/5.18 Accepting locations: 5.15/5.18 5.15/5.18 Asserts: 5.15/5.18 5.15/5.18 Preprocessed LLVMGraph 5.15/5.18 Init Location: 0 5.15/5.18 Transitions: 5.15/5.18 ~(1)) /\ (undef6 > 1) /\ (undef2 > ~(1)) /\ (undef5 > 0)> 5.15/5.18 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}> 5.15/5.18 5.15/5.18 Fresh variables: 5.15/5.18 undef1, undef2, undef5, undef6, 5.15/5.18 5.15/5.18 Undef variables: 5.15/5.18 undef1, undef2, undef5, undef6, 5.15/5.18 5.15/5.18 Abstraction variables: 5.15/5.18 5.15/5.18 Exit nodes: 5.15/5.18 5.15/5.18 Accepting locations: 5.15/5.18 5.15/5.18 Asserts: 5.15/5.18 5.15/5.18 ************************************************************* 5.15/5.18 ******************************************************************************************* 5.15/5.18 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.15/5.18 ******************************************************************************************* 5.15/5.18 5.15/5.18 Init Location: 0 5.15/5.18 Graph 0: 5.15/5.18 Transitions: 5.15/5.18 Variables: 5.15/5.18 5.15/5.18 Graph 1: 5.15/5.18 Transitions: 5.15/5.18 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.18 Variables: 5.15/5.18 arg1, arg2 5.15/5.18 5.15/5.18 Precedence: 5.15/5.18 Graph 0 5.15/5.18 5.15/5.18 Graph 1 5.15/5.18 5.15/5.18 5.15/5.18 Map Locations to Subgraph: 5.15/5.18 ( 0 , 0 ) 5.15/5.18 ( 2 , 1 ) 5.15/5.18 5.15/5.18 ******************************************************************************************* 5.15/5.18 ******************************** CHECKING ASSERTIONS ******************************** 5.15/5.18 ******************************************************************************************* 5.15/5.18 5.15/5.18 Proving termination of subgraph 0 5.15/5.18 Proving termination of subgraph 1 5.15/5.18 Checking unfeasibility... 5.15/5.18 Time used: 0.002537 5.15/5.18 5.15/5.18 Checking conditional termination of SCC {l2}... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.000618s 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.001899s 5.15/5.19 Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006025s 5.15/5.19 Time used: 0.005861 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008284s 5.15/5.19 Time used: 0.007971 5.15/5.19 Improving Solution with cost 1 ... 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetNextSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014515s 5.15/5.19 Time used: 0.01451 5.15/5.19 5.15/5.19 LOG: SAT solveNonLinear - Elapsed time: 0.022799s 5.15/5.19 Cost: 1; Total time: 0.022481 5.15/5.19 Failed at location 2: arg1 <= 0 5.15/5.19 Before Improving: 5.15/5.19 Quasi-invariant at l2: arg1 <= 0 5.15/5.19 Optimizing invariants... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.002035s 5.15/5.19 Remaining time after improvement: 0.999008 5.15/5.19 Termination implied by a set of quasi-invariant(s): 5.15/5.19 Quasi-invariant at l2: arg1 <= 0 5.15/5.19 [ Invariant Graph ] 5.15/5.19 Strengthening and disabling transitions... 5.15/5.19 5.15/5.19 LOG: CALL solverLinear in Graph for feasibility 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear in Graph for feasibility 5.15/5.19 It's unfeasible. Removing transition: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 [ Termination Graph ] 5.15/5.19 Strengthening and disabling transitions... 5.15/5.19 > It's unfeasible. Removing transition: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 New Graphs: 5.15/5.19 Calling Safety with literal arg1 <= 0 and entry 5.15/5.19 5.15/5.19 LOG: CALL check - Post:arg1 <= 0 - Process 1 5.15/5.19 * Exit transition: 5.15/5.19 * Postcondition : arg1 <= 0 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.000637s 5.15/5.19 > Postcondition is not implied! 5.15/5.19 5.15/5.19 LOG: RETURN check - Elapsed time: 0.000772s 5.15/5.19 INVARIANTS: 5.15/5.19 2: 5.15/5.19 Quasi-INVARIANTS to narrow Graph: 5.15/5.19 2: arg1 <= 0 , 5.15/5.19 Narrowing transition: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 5.15/5.19 LOG: Narrow transition size 1 5.15/5.19 invGraph after Narrowing: 5.15/5.19 Transitions: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 Variables: 5.15/5.19 arg1, arg2 5.15/5.19 Checking conditional termination of SCC {l2}... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.000558s 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.001836s 5.15/5.19 Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005556s 5.15/5.19 Time used: 0.005407 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007948s 5.15/5.19 Time used: 0.007602 5.15/5.19 Improving Solution with cost 1 ... 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetNextSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013360s 5.15/5.19 Time used: 0.013356 5.15/5.19 5.15/5.19 LOG: SAT solveNonLinear - Elapsed time: 0.021307s 5.15/5.19 Cost: 1; Total time: 0.020958 5.15/5.19 Failed at location 2: arg2 <= 0 5.15/5.19 Before Improving: 5.15/5.19 Quasi-invariant at l2: arg2 <= 0 5.15/5.19 Optimizing invariants... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.001925s 5.15/5.19 Remaining time after improvement: 0.999029 5.15/5.19 Termination implied by a set of quasi-invariant(s): 5.15/5.19 Quasi-invariant at l2: arg2 <= 0 5.15/5.19 [ Invariant Graph ] 5.15/5.19 Strengthening and disabling transitions... 5.15/5.19 5.15/5.19 LOG: CALL solverLinear in Graph for feasibility 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear in Graph for feasibility 5.15/5.19 It's unfeasible. Removing transition: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 [ Termination Graph ] 5.15/5.19 Strengthening and disabling transitions... 5.15/5.19 > It's unfeasible. Removing transition: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 New Graphs: 5.15/5.19 Calling Safety with literal arg2 <= 0 and entry 5.15/5.19 5.15/5.19 LOG: CALL check - Post:arg2 <= 0 - Process 2 5.15/5.19 * Exit transition: 5.15/5.19 * Postcondition : arg2 <= 0 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.000645s 5.15/5.19 > Postcondition is not implied! 5.15/5.19 5.15/5.19 LOG: RETURN check - Elapsed time: 0.000766s 5.15/5.19 INVARIANTS: 5.15/5.19 2: 5.15/5.19 Quasi-INVARIANTS to narrow Graph: 5.15/5.19 2: arg2 <= 0 , 5.15/5.19 Narrowing transition: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 5.15/5.19 LOG: Narrow transition size 1 5.15/5.19 invGraph after Narrowing: 5.15/5.19 Transitions: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 Variables: 5.15/5.19 arg1, arg2 5.15/5.19 Checking conditional termination of SCC {l2}... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.000542s 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.001809s 5.15/5.19 Trying to remove transition: arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005572s 5.15/5.19 Time used: 0.00543 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010139s 5.15/5.19 Time used: 0.009842 5.15/5.19 Solving with 2 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001555s 5.15/5.19 Time used: 4.0014 5.15/5.19 Solving with 3 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011264s 5.15/5.19 Time used: 1.00036 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008541s 5.15/5.19 Time used: 0.005906 5.15/5.19 5.15/5.19 Proving non-termination of subgraph 1 5.15/5.19 Transitions: 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 Variables: 5.15/5.19 arg1, arg2 5.15/5.19 5.15/5.19 Checking conditional non-termination of SCC {l2}... 5.15/5.19 EXIT TRANSITIONS: 5.15/5.19 5.15/5.19 5.15/5.19 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007315s 5.15/5.19 Time used: 0.007133 5.15/5.19 Improving Solution with cost 2 ... 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetNextSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009897s 5.15/5.19 Time used: 0.009893 5.15/5.19 5.15/5.19 LOG: SAT solveNonLinear - Elapsed time: 0.017212s 5.15/5.19 Cost: 2; Total time: 0.017026 5.15/5.19 Failed at location 2: 1 <= arg1 5.15/5.19 Before Improving: 5.15/5.19 Quasi-invariant at l2: 1 <= arg1 5.15/5.19 Optimizing invariants... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.001455s 5.15/5.19 Remaining time after improvement: 0.999211 5.15/5.19 Non-termination implied by a set of quasi-invariant(s): 5.15/5.19 Quasi-invariant at l2: 1 <= arg1 5.15/5.19 5.15/5.19 Strengthening and disabling EXIT transitions... 5.15/5.19 Closed exits from l2: 1 5.15/5.19 Strengthening exit transition (result): 5.15/5.19 5.15/5.19 5.15/5.19 Strengthening and disabling transitions... 5.15/5.19 5.15/5.19 LOG: CALL solverLinear in Graph for feasibility 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear in Graph for feasibility 5.15/5.19 Strengthening transition (result): 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 5.15/5.19 Checking conditional non-termination of SCC {l2}... 5.15/5.19 EXIT TRANSITIONS: 5.15/5.19 5.15/5.19 5.15/5.19 Solving with 1 template(s). 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetFirstSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004669s 5.15/5.19 Time used: 0.004488 5.15/5.19 Improving Solution with cost 1 ... 5.15/5.19 5.15/5.19 LOG: CALL solveNonLinearGetNextSolution 5.15/5.19 5.15/5.19 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004870s 5.15/5.19 Time used: 0.004867 5.15/5.19 5.15/5.19 LOG: SAT solveNonLinear - Elapsed time: 0.009539s 5.15/5.19 Cost: 1; Total time: 0.009355 5.15/5.19 Failed at location 2: 1 <= arg2 5.15/5.19 Before Improving: 5.15/5.19 Quasi-invariant at l2: 1 <= arg2 5.15/5.19 Optimizing invariants... 5.15/5.19 5.15/5.19 LOG: CALL solveLinear 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear - Elapsed time: 0.001272s 5.15/5.19 Remaining time after improvement: 0.999273 5.15/5.19 Non-termination implied by a set of quasi-invariant(s): 5.15/5.19 Quasi-invariant at l2: 1 <= arg2 5.15/5.19 5.15/5.19 Strengthening and disabling EXIT transitions... 5.15/5.19 Closed exits from l2: 1 5.15/5.19 5.15/5.19 Strengthening and disabling transitions... 5.15/5.19 5.15/5.19 LOG: CALL solverLinear in Graph for feasibility 5.15/5.19 5.15/5.19 LOG: RETURN solveLinear in Graph for feasibility 5.15/5.19 Strengthening transition (result): 5.15/5.19 arg2, arg2 -> arg1, rest remain the same}> 5.15/5.19 5.15/5.19 Calling reachability with... 5.15/5.19 Transition: 5.15/5.19 Conditions: 1 <= arg1, 1 <= arg2, 5.15/5.19 OPEN EXITS: 5.15/5.19 5.15/5.19 5.15/5.19 --- Reachability graph --- 5.15/5.19 > Graph without transitions. 5.15/5.19 5.15/5.19 Calling reachability with... 5.15/5.19 Transition: 5.15/5.19 Conditions: 1 <= arg1, 1 <= arg2, 5.15/5.19 OPEN EXITS: 5.15/5.19 5.15/5.19 5.15/5.19 > Conditions are reachable! 5.15/5.19 5.15/5.19 Program does NOT terminate 5.15/5.19 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.15/5.19 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.15/5.19 EOF