12.49/12.50 NO 12.49/12.50 12.49/12.50 Solver Timeout: 4 12.49/12.50 Global Timeout: 300 12.49/12.50 No parsing errors! 12.49/12.50 Init Location: 0 12.49/12.50 Transitions: 12.49/12.50 12.49/12.50 12.49/12.50 12.49/12.50 12.49/12.50 12.49/12.50 (~(2) + curr_serv^0)}> 12.49/12.50 (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.49/12.50 undef37}> 12.49/12.50 12.49/12.50 undef50, c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}> 12.49/12.50 12.49/12.50 12.49/12.50 Fresh variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Undef variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Abstraction variables: 12.49/12.50 12.49/12.50 Exit nodes: 12.49/12.50 12.49/12.50 Accepting locations: 12.49/12.50 12.49/12.50 Asserts: 12.49/12.50 12.49/12.50 Preprocessed LLVMGraph 12.49/12.50 Init Location: 0 12.49/12.50 Transitions: 12.49/12.50 12.49/12.50 (~(2) + curr_serv^0)}> 12.49/12.50 (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.49/12.50 12.49/12.50 12.49/12.50 12.49/12.50 Fresh variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Undef variables: 12.49/12.50 undef37, undef50, undef51, undef54, 12.49/12.50 12.49/12.50 Abstraction variables: 12.49/12.50 12.49/12.50 Exit nodes: 12.49/12.50 12.49/12.50 Accepting locations: 12.49/12.50 12.49/12.50 Asserts: 12.49/12.50 12.49/12.50 ************************************************************* 12.49/12.50 ******************************************************************************************* 12.49/12.50 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.49/12.50 ******************************************************************************************* 12.49/12.50 12.49/12.50 Init Location: 0 12.49/12.50 Graph 0: 12.49/12.50 Transitions: 12.49/12.50 Variables: 12.49/12.50 12.49/12.50 Graph 1: 12.49/12.50 Transitions: 12.49/12.50 -2 + curr_serv^0, rest remain the same}> 12.49/12.50 -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.49/12.50 Variables: 12.49/12.50 c^0, curr_serv^0, resp^0 12.49/12.50 12.49/12.50 Graph 2: 12.49/12.50 Transitions: 12.49/12.50 12.49/12.50 Variables: 12.49/12.50 12.49/12.50 Precedence: 12.49/12.50 Graph 0 12.49/12.50 12.49/12.50 Graph 1 12.49/12.50 12.49/12.50 12.49/12.50 Graph 2 12.49/12.50 12.49/12.50 12.49/12.50 Map Locations to Subgraph: 12.49/12.50 ( 0 , 0 ) 12.49/12.50 ( 1 , 1 ) 12.49/12.50 ( 5 , 2 ) 12.49/12.50 12.49/12.50 ******************************************************************************************* 12.49/12.50 ******************************** CHECKING ASSERTIONS ******************************** 12.49/12.50 ******************************************************************************************* 12.49/12.50 12.49/12.50 Proving termination of subgraph 0 12.49/12.50 Proving termination of subgraph 1 12.49/12.50 Checking unfeasibility... 12.49/12.50 Time used: 0.024633 12.49/12.50 12.49/12.50 Checking conditional termination of SCC {l1}... 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.001559s 12.49/12.50 Ranking function: -1 - c^0 + curr_serv^0 12.49/12.50 New Graphs: 12.49/12.50 Transitions: 12.49/12.50 -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.49/12.50 Variables: 12.49/12.50 c^0, curr_serv^0, resp^0 12.49/12.50 Checking conditional termination of SCC {l1}... 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.000729s 12.49/12.50 Ranking function: (~(1) / 2) + (1 / 2)*curr_serv^0 12.49/12.50 New Graphs: 12.49/12.50 Proving termination of subgraph 2 12.49/12.50 Checking unfeasibility... 12.49/12.50 Time used: 0.000845 12.49/12.50 12.49/12.50 > No variable changes in termination graph. 12.49/12.50 Checking conditional unfeasibility... 12.49/12.50 Termination failed. Trying to show unreachability... 12.49/12.50 Proving unreachability of entry: 12.49/12.50 12.49/12.50 LOG: CALL check - Post:1 <= 0 - Process 1 12.49/12.50 * Exit transition: 12.49/12.50 * Postcondition : 1 <= 0 12.49/12.50 Postcodition moved up: 1 <= 0 12.49/12.50 12.49/12.50 LOG: Try proving POST 12.49/12.50 Postcondition: 1 <= 0 12.49/12.50 12.49/12.50 LOG: CALL check - Post:1 <= 0 - Process 2 12.49/12.50 * Exit transition: 12.49/12.50 * Postcondition : 1 <= 0 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.000637s 12.49/12.50 > Postcondition is not implied! 12.49/12.50 12.49/12.50 LOG: RETURN check - Elapsed time: 0.000753s 12.49/12.50 12.49/12.50 LOG: NarrowEntry size 1 12.49/12.50 Narrowing transition: 12.49/12.50 -2 + curr_serv^0, rest remain the same}> 12.49/12.50 12.49/12.50 LOG: Narrow transition size 1 12.49/12.50 Narrowing transition: 12.49/12.50 -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.49/12.50 12.49/12.50 LOG: Narrow transition size 1 12.49/12.50 ENTRIES: 12.49/12.50 12.49/12.50 END ENTRIES: 12.49/12.50 GRAPH: 12.49/12.50 -2 + curr_serv^0, rest remain the same}> 12.49/12.50 -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.49/12.50 END GRAPH: 12.49/12.50 EXIT: 12.49/12.50 POST: 1 <= 0 12.49/12.50 12.49/12.50 12.49/12.50 LOG: Try proving POST 12.49/12.50 Solving with 1 template(s). 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetFirstSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012819s 12.49/12.50 Time used: 0.012628 12.49/12.50 Improving Solution with cost 51 ... 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetNextSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048439s 12.49/12.50 Time used: 0.048434 12.49/12.50 12.49/12.50 LOG: SAT solveNonLinear - Elapsed time: 0.061258s 12.49/12.50 Cost: 51; Total time: 0.061062 12.49/12.50 Failed at location 1: curr_serv^0 <= c^0 12.49/12.50 Before Improving: 12.49/12.50 Quasi-invariant at l1: curr_serv^0 <= c^0 12.49/12.50 Optimizing invariants... 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.002756s 12.49/12.50 Remaining time after improvement: 0.998867 12.49/12.50 Some transition disabled by a set of quasi-invariant(s): 12.49/12.50 Quasi-invariant at l1: curr_serv^0 <= c^0 12.49/12.50 12.49/12.50 LOG: NEXT CALL check - disable 12.49/12.50 12.49/12.50 LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3 12.49/12.50 * Exit transition: 12.49/12.50 * Postcondition : curr_serv^0 <= c^0 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.000871s 12.49/12.50 > Postcondition is not implied! 12.49/12.50 12.49/12.50 LOG: RETURN check - Elapsed time: 0.001006s 12.49/12.50 Solving with 2 template(s). 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetFirstSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079904s 12.49/12.50 Time used: 0.079478 12.49/12.50 Improving Solution with cost 51 ... 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetNextSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000887s 12.49/12.50 Time used: 1.00083 12.49/12.50 12.49/12.50 LOG: SAT solveNonLinear - Elapsed time: 1.080791s 12.49/12.50 Cost: 51; Total time: 1.08031 12.49/12.50 Failed at location 1: 1 + curr_serv^0 <= c^0 12.49/12.50 Before Improving: 12.49/12.50 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.49/12.50 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.49/12.50 Optimizing invariants... 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.009694s 12.49/12.50 Remaining time after improvement: 0.998148 12.49/12.50 Some transition disabled by a set of quasi-invariant(s): 12.49/12.50 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.49/12.50 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.49/12.50 12.49/12.50 LOG: NEXT CALL check - disable 12.49/12.50 12.49/12.50 LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4 12.49/12.50 * Exit transition: 12.49/12.50 * Postcondition : 1 + curr_serv^0 <= c^0 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.001050s 12.49/12.50 > Postcondition is not implied! 12.49/12.50 12.49/12.50 LOG: RETURN check - Elapsed time: 0.001191s 12.49/12.50 Solving with 3 template(s). 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetFirstSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.556397s 12.49/12.50 Time used: 0.555994 12.49/12.50 Improving Solution with cost 51 ... 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetNextSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.445134s 12.49/12.50 Time used: 0.444965 12.49/12.50 12.49/12.50 LOG: SAT solveNonLinear - Elapsed time: 1.001530s 12.49/12.50 Cost: 51; Total time: 1.00096 12.49/12.50 Failed at location 1: 1 + curr_serv^0 <= c^0 12.49/12.50 Before Improving: 12.49/12.50 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.49/12.50 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.49/12.50 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.49/12.50 Optimizing invariants... 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.050940s 12.49/12.50 Remaining time after improvement: 0.997404 12.49/12.50 Some transition disabled by a set of quasi-invariant(s): 12.49/12.50 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.49/12.50 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.49/12.50 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.49/12.50 12.49/12.50 LOG: NEXT CALL check - disable 12.49/12.50 12.49/12.50 LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 5 12.49/12.50 * Exit transition: 12.49/12.50 * Postcondition : 1 + curr_serv^0 <= c^0 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.001477s 12.49/12.50 > Postcondition is not implied! 12.49/12.50 12.49/12.50 LOG: RETURN check - Elapsed time: 0.001612s 12.49/12.50 12.49/12.50 LOG: Postcondition is not implied - no solution 12.49/12.50 > Postcondition is not implied! 12.49/12.50 12.49/12.50 LOG: RETURN check - Elapsed time: 2.224136s 12.49/12.50 Cannot prove unreachability 12.49/12.50 12.49/12.50 Proving non-termination of subgraph 2 12.49/12.50 Transitions: 12.49/12.50 12.49/12.50 Variables: 12.49/12.50 12.49/12.50 Checking conditional non-termination of SCC {l5}... 12.49/12.50 > No exit transition to close. 12.49/12.50 Calling reachability with... 12.49/12.50 Transition: 12.49/12.50 Conditions: 12.49/12.50 OPEN EXITS: 12.49/12.50 12.49/12.50 12.49/12.50 --- Reachability graph --- 12.49/12.50 > Graph without transitions. 12.49/12.50 12.49/12.50 Calling reachability with... 12.49/12.50 Transition: 12.49/12.50 Conditions: 12.49/12.50 OPEN EXITS: 12.49/12.50 12.49/12.50 12.49/12.50 --- Reachability graph --- 12.49/12.50 > Graph without transitions. 12.49/12.50 12.49/12.50 Calling reachability with... 12.49/12.50 Transition: 12.49/12.50 Conditions: curr_serv^0 <= 0, 12.49/12.50 OPEN EXITS: 12.49/12.50 12.49/12.50 > Conditions are not feasible after transitions. 12.49/12.50 --- Reachability graph --- 12.49/12.50 Transitions: 12.49/12.50 -2 + curr_serv^0, rest remain the same}> 12.49/12.50 Variables: 12.49/12.50 c^0, curr_serv^0 12.49/12.50 Checking edge-closing of SCC {l1}... 12.49/12.50 EXIT TRANSITIONS (TO CLOSE): 12.49/12.50 12.49/12.50 12.49/12.50 Solving with 1 template(s). 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetFirstSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.176156s 12.49/12.50 Time used: 0.176052 12.49/12.50 Solving with 2 template(s). 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetFirstSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001685s 12.49/12.50 Time used: 5.00047 12.49/12.50 Solving with 3 template(s). 12.49/12.50 12.49/12.50 LOG: CALL solveNonLinearGetFirstSolution 12.49/12.50 12.49/12.50 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004757s 12.49/12.50 Time used: 5.00079 12.49/12.50 > No quasi-invariants that block all exits have been found. 12.49/12.50 --- Reachability graph --- 12.49/12.50 Transitions: 12.49/12.50 -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.49/12.50 Variables: 12.49/12.50 c^0, curr_serv^0, resp^0 12.49/12.50 Checking edge-closing of SCC {l1}... 12.49/12.50 > No exit transition to close. 12.49/12.50 Checking conditional termination of SCC {l1}... 12.49/12.50 12.49/12.50 LOG: CALL solveLinear 12.49/12.50 12.49/12.50 LOG: RETURN solveLinear - Elapsed time: 0.001035s 12.49/12.50 Ranking function: (~(1) / 2) + (1 / 2)*curr_serv^0 12.49/12.50 New Graphs: 12.49/12.50 Calling reachability with... 12.49/12.50 Transition: 12.49/12.50 Conditions: 12.49/12.50 OPEN EXITS: 12.49/12.50 12.49/12.50 12.49/12.50 > Conditions are reachable! 12.49/12.50 12.49/12.50 Program does NOT terminate 12.49/12.50 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 12.49/12.50 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 12.49/12.50 EOF