5.30/5.37 NO 5.30/5.37 5.30/5.37 Solver Timeout: 4 5.30/5.37 Global Timeout: 300 5.30/5.37 No parsing errors! 5.30/5.37 Init Location: 0 5.30/5.37 Transitions: 5.30/5.37 5.30/5.37 undef1, lt_11^0 -> undef6, lt_12^0 -> undef7}> 5.30/5.37 undef20, lt_12^0 -> undef21, tmp_9^0 -> undef24}> 5.30/5.37 5.30/5.37 undef46, lt_12^0 -> undef47, tmp_9^0 -> undef50}> 5.30/5.37 undef56}> 5.30/5.37 undef71}> 5.30/5.37 5.30/5.37 (0 + undef103), p_7^0 -> (0 + undef102), x_5^0 -> undef102, y_6^0 -> undef103}> 5.30/5.37 5.30/5.37 5.30/5.37 Fresh variables: 5.30/5.37 undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 5.30/5.37 5.30/5.37 Undef variables: 5.30/5.37 undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 5.30/5.37 5.30/5.37 Abstraction variables: 5.30/5.37 5.30/5.37 Exit nodes: 5.30/5.37 5.30/5.37 Accepting locations: 5.30/5.37 5.30/5.37 Asserts: 5.30/5.37 5.30/5.37 Preprocessed LLVMGraph 5.30/5.37 Init Location: 0 5.30/5.37 Transitions: 5.30/5.37 5.30/5.37 5.30/5.37 5.30/5.37 undef56}> 5.30/5.37 5.30/5.37 Fresh variables: 5.30/5.37 undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 5.30/5.37 5.30/5.37 Undef variables: 5.30/5.37 undef1, undef6, undef7, undef13, undef14, undef20, undef21, undef24, undef27, undef28, undef46, undef47, undef50, undef53, undef54, undef56, undef71, undef79, undef102, undef103, 5.30/5.37 5.30/5.37 Abstraction variables: 5.30/5.37 5.30/5.37 Exit nodes: 5.30/5.37 5.30/5.37 Accepting locations: 5.30/5.37 5.30/5.37 Asserts: 5.30/5.37 5.30/5.37 ************************************************************* 5.30/5.37 ******************************************************************************************* 5.30/5.37 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.30/5.37 ******************************************************************************************* 5.30/5.37 5.30/5.37 Init Location: 0 5.30/5.37 Graph 0: 5.30/5.37 Transitions: 5.30/5.37 Variables: 5.30/5.37 5.30/5.37 Graph 1: 5.30/5.37 Transitions: 5.30/5.37 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 Variables: 5.30/5.37 cnt_20^0, cnt_25^0, __disjvr_0^0 5.30/5.37 5.30/5.37 Graph 2: 5.30/5.37 Transitions: 5.30/5.37 Variables: 5.30/5.37 5.30/5.37 Precedence: 5.30/5.37 Graph 0 5.30/5.37 5.30/5.37 Graph 1 5.30/5.37 5.30/5.37 5.30/5.37 Graph 2 5.30/5.37 5.30/5.37 5.30/5.37 Map Locations to Subgraph: 5.30/5.37 ( 0 , 0 ) 5.30/5.37 ( 1 , 1 ) 5.30/5.37 ( 2 , 2 ) 5.30/5.37 5.30/5.37 ******************************************************************************************* 5.30/5.37 ******************************** CHECKING ASSERTIONS ******************************** 5.30/5.37 ******************************************************************************************* 5.30/5.37 5.30/5.37 Proving termination of subgraph 0 5.30/5.37 Proving termination of subgraph 1 5.30/5.37 Checking unfeasibility... 5.30/5.37 Time used: 0.004423 5.30/5.37 5.30/5.37 Checking conditional termination of SCC {l1}... 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000938s 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.003020s 5.30/5.37 Trying to remove transition: undef56, rest remain the same}> 5.30/5.37 Solving with 1 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010423s 5.30/5.37 Time used: 0.01016 5.30/5.37 Solving with 1 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013691s 5.30/5.37 Time used: 0.012945 5.30/5.37 Improving Solution with cost 1 ... 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetNextSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026708s 5.30/5.37 Time used: 0.026698 5.30/5.37 5.30/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.040399s 5.30/5.37 Cost: 1; Total time: 0.039643 5.30/5.37 Failed at location 1: cnt_25^0 <= cnt_20^0 5.30/5.37 Before Improving: 5.30/5.37 Quasi-invariant at l1: cnt_25^0 <= cnt_20^0 5.30/5.37 Optimizing invariants... 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.004941s 5.30/5.37 Remaining time after improvement: 0.997963 5.30/5.37 Termination implied by a set of quasi-invariant(s): 5.30/5.37 Quasi-invariant at l1: cnt_25^0 <= cnt_20^0 5.30/5.37 [ Invariant Graph ] 5.30/5.37 Strengthening and disabling transitions... 5.30/5.37 5.30/5.37 LOG: CALL solverLinear in Graph for feasibility 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.30/5.37 It's unfeasible. Removing transition: 5.30/5.37 5.30/5.37 5.30/5.37 LOG: CALL solverLinear in Graph for feasibility 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.30/5.37 It's unfeasible. Removing transition: 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 [ Termination Graph ] 5.30/5.37 Strengthening and disabling transitions... 5.30/5.37 > It's unfeasible. Removing transition: 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 5.30/5.37 LOG: CALL solverLinear in Graph for feasibility 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.30/5.37 It's unfeasible. Removing transition: 5.30/5.37 5.30/5.37 New Graphs: 5.30/5.37 Calling Safety with literal cnt_25^0 <= cnt_20^0 and entry 5.30/5.37 5.30/5.37 LOG: CALL check - Post:cnt_25^0 <= cnt_20^0 - Process 1 5.30/5.37 * Exit transition: 5.30/5.37 * Postcondition : cnt_25^0 <= cnt_20^0 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000496s 5.30/5.37 > Postcondition is not implied! 5.30/5.37 5.30/5.37 LOG: RETURN check - Elapsed time: 0.000567s 5.30/5.37 INVARIANTS: 5.30/5.37 1: 5.30/5.37 Quasi-INVARIANTS to narrow Graph: 5.30/5.37 1: cnt_25^0 <= cnt_20^0 , 5.30/5.37 Narrowing transition: 5.30/5.37 5.30/5.37 5.30/5.37 LOG: Narrow transition size 1 5.30/5.37 Narrowing transition: 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 5.30/5.37 LOG: Narrow transition size 1 5.30/5.37 invGraph after Narrowing: 5.30/5.37 Transitions: 5.30/5.37 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 Variables: 5.30/5.37 cnt_20^0, cnt_25^0, __disjvr_0^0 5.30/5.37 Checking conditional termination of SCC {l1}... 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.000827s 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.003388s 5.30/5.37 Trying to remove transition: undef56, rest remain the same}> 5.30/5.37 Solving with 1 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008447s 5.30/5.37 Time used: 0.008222 5.30/5.37 Solving with 1 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016271s 5.30/5.37 Time used: 0.0156 5.30/5.37 Solving with 2 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002305s 5.30/5.37 Time used: 4.00062 5.30/5.37 Solving with 3 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005471s 5.30/5.37 Time used: 1.00037 5.30/5.37 Solving with 1 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026711s 5.30/5.37 Time used: 0.011143 5.30/5.37 5.30/5.37 Proving non-termination of subgraph 1 5.30/5.37 Transitions: 5.30/5.37 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 Variables: 5.30/5.37 cnt_20^0, cnt_25^0, __disjvr_0^0 5.30/5.37 5.30/5.37 Checking that every undef value has an assignment... 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.003592s 5.30/5.37 Checking conditional non-termination of SCC {l1}... 5.30/5.37 EXIT TRANSITIONS: 5.30/5.37 5.30/5.37 5.30/5.37 Solving with 1 template(s). 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetFirstSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083338s 5.30/5.37 Time used: 0.082605 5.30/5.37 Improving Solution with cost 1 ... 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinearGetNextSolution 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066949s 5.30/5.37 Time used: 0.066914 5.30/5.37 5.30/5.37 LOG: SAT solveNonLinear - Elapsed time: 0.150287s 5.30/5.37 Cost: 1; Total time: 0.149519 5.30/5.37 Failed at location 1: 1 + cnt_20^0 <= cnt_25^0 5.30/5.37 Before Improving: 5.30/5.37 Quasi-invariant at l1: 1 + cnt_20^0 <= cnt_25^0 5.30/5.37 Optimizing invariants... 5.30/5.37 5.30/5.37 LOG: CALL solveLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear - Elapsed time: 0.008046s 5.30/5.37 Remaining time after improvement: 0.995869 5.30/5.37 Minimizing number of undef constraints... 5.30/5.37 5.30/5.37 LOG: CALL solveNonLinear 5.30/5.37 5.30/5.37 LOG: RETURN solveNonLinear - Elapsed time: 0.008416s 5.30/5.37 Number of undef constraints reduced! 5.30/5.37 5.30/5.37 Non-termination implied by a set of quasi-invariant(s): 5.30/5.37 Quasi-invariant at l1: 1 + cnt_20^0 <= cnt_25^0 5.30/5.37 5.30/5.37 Strengthening and disabling EXIT transitions... 5.30/5.37 Closed exits from l1: 1 5.30/5.37 5.30/5.37 Strengthening and disabling transitions... 5.30/5.37 5.30/5.37 LOG: CALL solverLinear in Graph for feasibility 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.30/5.37 Strengthening transition (result): 5.30/5.37 5.30/5.37 5.30/5.37 LOG: CALL solverLinear in Graph for feasibility 5.30/5.37 5.30/5.37 LOG: RETURN solveLinear in Graph for feasibility 5.30/5.37 Strengthening transition (result): 5.30/5.37 undef56, rest remain the same}> 5.30/5.37 5.30/5.37 Calling reachability with... 5.30/5.37 Transition: 5.30/5.37 Conditions: 1 + cnt_20^0 <= cnt_25^0, 5.30/5.37 OPEN EXITS: 5.30/5.37 (condsUp: 1 + cnt_20^0 <= cnt_25^0) 5.30/5.37 5.30/5.37 --- Reachability graph --- 5.30/5.37 > Graph without transitions. 5.30/5.37 5.30/5.37 Calling reachability with... 5.30/5.37 Transition: 5.30/5.37 Conditions: 1 + cnt_20^0 <= cnt_25^0, 5.30/5.37 OPEN EXITS: 5.30/5.37 5.30/5.37 5.30/5.37 > Conditions are reachable! 5.30/5.37 5.30/5.37 Program does NOT terminate 5.30/5.37 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.30/5.37 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.30/5.37 EOF