5.36/5.42 NO 5.36/5.42 5.36/5.42 Solver Timeout: 4 5.36/5.42 Global Timeout: 300 5.36/5.42 No parsing errors! 5.36/5.42 Init Location: 0 5.36/5.42 Transitions: 5.36/5.42 5.36/5.42 5.36/5.42 undef3}> 5.36/5.42 (1 + undef7)}> 5.36/5.42 5.36/5.42 (~(1) + undef12)}> 5.36/5.42 5.36/5.42 5.36/5.42 5.36/5.42 Fresh variables: 5.36/5.42 undef3, undef7, undef12, 5.36/5.42 5.36/5.42 Undef variables: 5.36/5.42 undef3, undef7, undef12, 5.36/5.42 5.36/5.42 Abstraction variables: 5.36/5.42 5.36/5.42 Exit nodes: 5.36/5.42 5.36/5.42 Accepting locations: 5.36/5.42 5.36/5.42 Asserts: 5.36/5.42 5.36/5.42 Preprocessed LLVMGraph 5.36/5.42 Init Location: 0 5.36/5.42 Transitions: 5.36/5.42 5.36/5.42 5.36/5.42 (1 + undef7)}> 5.36/5.42 (~(1) + undef12)}> 5.36/5.42 5.36/5.42 Fresh variables: 5.36/5.42 undef3, undef7, undef12, 5.36/5.42 5.36/5.42 Undef variables: 5.36/5.42 undef3, undef7, undef12, 5.36/5.42 5.36/5.42 Abstraction variables: 5.36/5.42 5.36/5.42 Exit nodes: 5.36/5.42 5.36/5.42 Accepting locations: 5.36/5.42 5.36/5.42 Asserts: 5.36/5.42 5.36/5.42 ************************************************************* 5.36/5.42 ******************************************************************************************* 5.36/5.42 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.36/5.42 ******************************************************************************************* 5.36/5.42 5.36/5.42 Init Location: 0 5.36/5.42 Graph 0: 5.36/5.42 Transitions: 5.36/5.42 Variables: 5.36/5.42 5.36/5.42 Graph 1: 5.36/5.42 Transitions: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 Variables: 5.36/5.42 x_5^0 5.36/5.42 5.36/5.42 Graph 2: 5.36/5.42 Transitions: 5.36/5.42 Variables: 5.36/5.42 5.36/5.42 Precedence: 5.36/5.42 Graph 0 5.36/5.42 5.36/5.42 Graph 1 5.36/5.42 5.36/5.42 5.36/5.42 Graph 2 5.36/5.42 5.36/5.42 5.36/5.42 Map Locations to Subgraph: 5.36/5.42 ( 0 , 0 ) 5.36/5.42 ( 2 , 1 ) 5.36/5.42 ( 3 , 2 ) 5.36/5.42 5.36/5.42 ******************************************************************************************* 5.36/5.42 ******************************** CHECKING ASSERTIONS ******************************** 5.36/5.42 ******************************************************************************************* 5.36/5.42 5.36/5.42 Proving termination of subgraph 0 5.36/5.42 Proving termination of subgraph 1 5.36/5.42 Checking unfeasibility... 5.36/5.42 Time used: 0.002321 5.36/5.42 5.36/5.42 Checking conditional termination of SCC {l2}... 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.000851s 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.002503s 5.36/5.42 Trying to remove transition: -1 + undef12, rest remain the same}> 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005002s 5.36/5.42 Time used: 0.00482 5.36/5.42 Trying to remove transition: 1 + undef7, rest remain the same}> 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004477s 5.36/5.42 Time used: 0.004205 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008304s 5.36/5.42 Time used: 0.008024 5.36/5.42 Solving with 2 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031520s 5.36/5.42 Time used: 0.030989 5.36/5.42 Improving Solution with cost 2 ... 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetNextSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.151673s 5.36/5.42 Time used: 0.151661 5.36/5.42 5.36/5.42 LOG: SAT solveNonLinear - Elapsed time: 0.183193s 5.36/5.42 Cost: 2; Total time: 0.18265 5.36/5.42 Failed at location 2: x_5^0 <= 0 5.36/5.42 Failed at location 2: 0 <= x_5^0 5.36/5.42 Before Improving: 5.36/5.42 Quasi-invariant at l2: x_5^0 <= 0 5.36/5.42 Quasi-invariant at l2: 0 <= x_5^0 5.36/5.42 Optimizing invariants... 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.010894s 5.36/5.42 Remaining time after improvement: 0.998449 5.36/5.42 Termination implied by a set of quasi-invariant(s): 5.36/5.42 Quasi-invariant at l2: x_5^0 <= 0 5.36/5.42 Quasi-invariant at l2: 0 <= x_5^0 5.36/5.42 [ Invariant Graph ] 5.36/5.42 Strengthening and disabling transitions... 5.36/5.42 5.36/5.42 LOG: CALL solverLinear in Graph for feasibility 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear in Graph for feasibility 5.36/5.42 It's unfeasible. Removing transition: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 5.36/5.42 LOG: CALL solverLinear in Graph for feasibility 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear in Graph for feasibility 5.36/5.42 It's unfeasible. Removing transition: 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 [ Termination Graph ] 5.36/5.42 Strengthening and disabling transitions... 5.36/5.42 > It's unfeasible. Removing transition: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 5.36/5.42 LOG: CALL solverLinear in Graph for feasibility 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear in Graph for feasibility 5.36/5.42 It's unfeasible. Removing transition: 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 New Graphs: 5.36/5.42 Calling Safety with literal x_5^0 <= 0 and entry 5.36/5.42 5.36/5.42 LOG: CALL check - Post:x_5^0 <= 0 - Process 1 5.36/5.42 * Exit transition: 5.36/5.42 * Postcondition : x_5^0 <= 0 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.000428s 5.36/5.42 > Postcondition is not implied! 5.36/5.42 5.36/5.42 LOG: RETURN check - Elapsed time: 0.000491s 5.36/5.42 Calling Safety with literal 0 <= x_5^0 and entry 5.36/5.42 5.36/5.42 LOG: CALL check - Post:0 <= x_5^0 - Process 2 5.36/5.42 * Exit transition: 5.36/5.42 * Postcondition : 0 <= x_5^0 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.000353s 5.36/5.42 > Postcondition is not implied! 5.36/5.42 5.36/5.42 LOG: RETURN check - Elapsed time: 0.000409s 5.36/5.42 INVARIANTS: 5.36/5.42 2: 5.36/5.42 Quasi-INVARIANTS to narrow Graph: 5.36/5.42 2: x_5^0 <= 0 , 0 <= x_5^0 , 5.36/5.42 Narrowing transition: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 5.36/5.42 LOG: Narrow transition size 2 5.36/5.42 Narrowing transition: 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 5.36/5.42 LOG: Narrow transition size 2 5.36/5.42 invGraph after Narrowing: 5.36/5.42 Transitions: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 Variables: 5.36/5.42 x_5^0 5.36/5.42 Checking conditional termination of SCC {l2}... 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.000823s 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.002448s 5.36/5.42 Trying to remove transition: -1 + undef12, rest remain the same}> 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004551s 5.36/5.42 Time used: 0.004403 5.36/5.42 Trying to remove transition: 1 + undef7, rest remain the same}> 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004536s 5.36/5.42 Time used: 0.004256 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009010s 5.36/5.42 Time used: 0.00873 5.36/5.42 Solving with 2 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.031585s 5.36/5.42 Time used: 4.03062 5.36/5.42 Solving with 3 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014833s 5.36/5.42 Time used: 1.00059 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015389s 5.36/5.42 Time used: 0.008407 5.36/5.42 5.36/5.42 Proving non-termination of subgraph 1 5.36/5.42 Transitions: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 Variables: 5.36/5.42 x_5^0 5.36/5.42 5.36/5.42 Checking conditional non-termination of SCC {l2}... 5.36/5.42 EXIT TRANSITIONS: 5.36/5.42 5.36/5.42 5.36/5.42 Solving with 1 template(s). 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetFirstSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009610s 5.36/5.42 Time used: 0.009437 5.36/5.42 Improving Solution with cost 1 ... 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinearGetNextSolution 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017099s 5.36/5.42 Time used: 0.017093 5.36/5.42 5.36/5.42 LOG: SAT solveNonLinear - Elapsed time: 0.026709s 5.36/5.42 Cost: 1; Total time: 0.02653 5.36/5.42 Failed at location 2: 1 <= x_5^0 5.36/5.42 Before Improving: 5.36/5.42 Quasi-invariant at l2: 1 <= x_5^0 5.36/5.42 Optimizing invariants... 5.36/5.42 5.36/5.42 LOG: CALL solveLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear - Elapsed time: 0.005343s 5.36/5.42 Remaining time after improvement: 0.998803 5.36/5.42 Minimizing number of undef constraints... 5.36/5.42 5.36/5.42 LOG: CALL solveNonLinear 5.36/5.42 5.36/5.42 LOG: RETURN solveNonLinear - Elapsed time: 0.002280s 5.36/5.42 Number of undef constraints reduced! 5.36/5.42 5.36/5.42 Non-termination implied by a set of quasi-invariant(s): 5.36/5.42 Quasi-invariant at l2: 1 <= x_5^0 5.36/5.42 Constraint over undef 'x_5^0 <= 1 + undef7' in transition: 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 5.36/5.42 Strengthening and disabling EXIT transitions... 5.36/5.42 Closed exits from l2: 1 5.36/5.42 5.36/5.42 Strengthening and disabling transitions... 5.36/5.42 5.36/5.42 LOG: CALL solverLinear in Graph for feasibility 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear in Graph for feasibility 5.36/5.42 Strengthening transition (result): 5.36/5.42 1 + undef7, rest remain the same}> 5.36/5.42 5.36/5.42 LOG: CALL solverLinear in Graph for feasibility 5.36/5.42 5.36/5.42 LOG: RETURN solveLinear in Graph for feasibility 5.36/5.42 It's unfeasible. Removing transition: 5.36/5.42 -1 + undef12, rest remain the same}> 5.36/5.42 5.36/5.42 Calling reachability with... 5.36/5.42 Transition: 5.36/5.42 Conditions: 1 <= x_5^0, 5.36/5.42 OPEN EXITS: 5.36/5.42 5.36/5.42 5.36/5.42 --- Reachability graph --- 5.36/5.42 > Graph without transitions. 5.36/5.42 5.36/5.42 Calling reachability with... 5.36/5.42 Transition: 5.36/5.42 Conditions: 1 <= x_5^0, 5.36/5.42 OPEN EXITS: 5.36/5.42 5.36/5.42 5.36/5.42 > Conditions are reachable! 5.36/5.42 5.36/5.42 Program does NOT terminate 5.36/5.42 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.36/5.42 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.36/5.42 EOF