12.25/12.29 NO 12.25/12.29 12.25/12.29 Solver Timeout: 4 12.25/12.29 Global Timeout: 300 12.25/12.29 No parsing errors! 12.25/12.29 Init Location: 0 12.25/12.29 Transitions: 12.25/12.29 12.25/12.29 12.25/12.29 12.25/12.29 12.25/12.29 12.25/12.29 (~(1) + curr_serv^0)}> 12.25/12.29 (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.25/12.29 undef31}> 12.25/12.29 12.25/12.29 undef42, curr_serv^0 -> (0 + undef45), resp^0 -> 0, servers^0 -> undef45}> 12.25/12.29 12.25/12.29 12.25/12.29 Fresh variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Undef variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Abstraction variables: 12.25/12.29 12.25/12.29 Exit nodes: 12.25/12.29 12.25/12.29 Accepting locations: 12.25/12.29 12.25/12.29 Asserts: 12.25/12.29 12.25/12.29 Preprocessed LLVMGraph 12.25/12.29 Init Location: 0 12.25/12.29 Transitions: 12.25/12.29 12.25/12.29 (~(1) + curr_serv^0)}> 12.25/12.29 (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.25/12.29 12.25/12.29 12.25/12.29 12.25/12.29 Fresh variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Undef variables: 12.25/12.29 undef31, undef42, undef45, 12.25/12.29 12.25/12.29 Abstraction variables: 12.25/12.29 12.25/12.29 Exit nodes: 12.25/12.29 12.25/12.29 Accepting locations: 12.25/12.29 12.25/12.29 Asserts: 12.25/12.29 12.25/12.29 ************************************************************* 12.25/12.29 ******************************************************************************************* 12.25/12.29 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.25/12.29 ******************************************************************************************* 12.25/12.29 12.25/12.29 Init Location: 0 12.25/12.29 Graph 0: 12.25/12.29 Transitions: 12.25/12.29 Variables: 12.25/12.29 12.25/12.29 Graph 1: 12.25/12.29 Transitions: 12.25/12.29 -1 + curr_serv^0, rest remain the same}> 12.25/12.29 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.25/12.29 Variables: 12.25/12.29 c^0, curr_serv^0, resp^0 12.25/12.29 12.25/12.29 Graph 2: 12.25/12.29 Transitions: 12.25/12.29 12.25/12.29 Variables: 12.25/12.29 12.25/12.29 Precedence: 12.25/12.29 Graph 0 12.25/12.29 12.25/12.29 Graph 1 12.25/12.29 12.25/12.29 12.25/12.29 Graph 2 12.25/12.29 12.25/12.29 12.25/12.29 Map Locations to Subgraph: 12.25/12.29 ( 0 , 0 ) 12.25/12.29 ( 1 , 1 ) 12.25/12.29 ( 5 , 2 ) 12.25/12.29 12.25/12.29 ******************************************************************************************* 12.25/12.29 ******************************** CHECKING ASSERTIONS ******************************** 12.25/12.29 ******************************************************************************************* 12.25/12.29 12.25/12.29 Proving termination of subgraph 0 12.25/12.29 Proving termination of subgraph 1 12.25/12.29 Checking unfeasibility... 12.25/12.29 Time used: 0.005372 12.25/12.29 12.25/12.29 Checking conditional termination of SCC {l1}... 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.001332s 12.25/12.29 Ranking function: -1 - c^0 + curr_serv^0 12.25/12.29 New Graphs: 12.25/12.29 Transitions: 12.25/12.29 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.25/12.29 Variables: 12.25/12.29 c^0, curr_serv^0, resp^0 12.25/12.29 Checking conditional termination of SCC {l1}... 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.000711s 12.25/12.29 Ranking function: -1 + curr_serv^0 12.25/12.29 New Graphs: 12.25/12.29 Proving termination of subgraph 2 12.25/12.29 Checking unfeasibility... 12.25/12.29 Time used: 0.000853 12.25/12.29 12.25/12.29 > No variable changes in termination graph. 12.25/12.29 Checking conditional unfeasibility... 12.25/12.29 Termination failed. Trying to show unreachability... 12.25/12.29 Proving unreachability of entry: 12.25/12.29 12.25/12.29 LOG: CALL check - Post:1 <= 0 - Process 1 12.25/12.29 * Exit transition: 12.25/12.29 * Postcondition : 1 <= 0 12.25/12.29 Postcodition moved up: 1 <= 0 12.25/12.29 12.25/12.29 LOG: Try proving POST 12.25/12.29 Postcondition: 1 <= 0 12.25/12.29 12.25/12.29 LOG: CALL check - Post:1 <= 0 - Process 2 12.25/12.29 * Exit transition: 12.25/12.29 * Postcondition : 1 <= 0 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.000561s 12.25/12.29 > Postcondition is not implied! 12.25/12.29 12.25/12.29 LOG: RETURN check - Elapsed time: 0.000664s 12.25/12.29 12.25/12.29 LOG: NarrowEntry size 1 12.25/12.29 Narrowing transition: 12.25/12.29 -1 + curr_serv^0, rest remain the same}> 12.25/12.29 12.25/12.29 LOG: Narrow transition size 1 12.25/12.29 Narrowing transition: 12.25/12.29 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.25/12.29 12.25/12.29 LOG: Narrow transition size 1 12.25/12.29 ENTRIES: 12.25/12.29 12.25/12.29 END ENTRIES: 12.25/12.29 GRAPH: 12.25/12.29 -1 + curr_serv^0, rest remain the same}> 12.25/12.29 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.25/12.29 END GRAPH: 12.25/12.29 EXIT: 12.25/12.29 POST: 1 <= 0 12.25/12.29 12.25/12.29 12.25/12.29 LOG: Try proving POST 12.25/12.29 Solving with 1 template(s). 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetFirstSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012076s 12.25/12.29 Time used: 0.011886 12.25/12.29 Improving Solution with cost 51 ... 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetNextSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032652s 12.25/12.29 Time used: 0.032645 12.25/12.29 12.25/12.29 LOG: SAT solveNonLinear - Elapsed time: 0.044727s 12.25/12.29 Cost: 51; Total time: 0.044531 12.25/12.29 Failed at location 1: curr_serv^0 <= c^0 12.25/12.29 Before Improving: 12.25/12.29 Quasi-invariant at l1: curr_serv^0 <= c^0 12.25/12.29 Optimizing invariants... 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.002377s 12.25/12.29 Remaining time after improvement: 0.998915 12.25/12.29 Some transition disabled by a set of quasi-invariant(s): 12.25/12.29 Quasi-invariant at l1: curr_serv^0 <= c^0 12.25/12.29 12.25/12.29 LOG: NEXT CALL check - disable 12.25/12.29 12.25/12.29 LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3 12.25/12.29 * Exit transition: 12.25/12.29 * Postcondition : curr_serv^0 <= c^0 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.000758s 12.25/12.29 > Postcondition is not implied! 12.25/12.29 12.25/12.29 LOG: RETURN check - Elapsed time: 0.000881s 12.25/12.29 Solving with 2 template(s). 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetFirstSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079443s 12.25/12.29 Time used: 0.079158 12.25/12.29 Improving Solution with cost 51 ... 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetNextSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000640s 12.25/12.29 Time used: 1.00058 12.25/12.29 12.25/12.29 LOG: SAT solveNonLinear - Elapsed time: 1.080083s 12.25/12.29 Cost: 51; Total time: 1.07974 12.25/12.29 Failed at location 1: 1 + curr_serv^0 <= c^0 12.25/12.29 Before Improving: 12.25/12.29 Quasi-invariant at l1: 0 <= 1 + curr_serv^0 12.25/12.29 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.25/12.29 Optimizing invariants... 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.008146s 12.25/12.29 Remaining time after improvement: 0.998248 12.25/12.29 Some transition disabled by a set of quasi-invariant(s): 12.25/12.29 Quasi-invariant at l1: 0 <= 1 + curr_serv^0 12.25/12.29 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.25/12.29 12.25/12.29 LOG: NEXT CALL check - disable 12.25/12.29 12.25/12.29 LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4 12.25/12.29 * Exit transition: 12.25/12.29 * Postcondition : 1 + curr_serv^0 <= c^0 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.000935s 12.25/12.29 > Postcondition is not implied! 12.25/12.29 12.25/12.29 LOG: RETURN check - Elapsed time: 0.001058s 12.25/12.29 Solving with 3 template(s). 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetFirstSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.653658s 12.25/12.29 Time used: 0.653114 12.25/12.29 Improving Solution with cost 51 ... 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetNextSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.347620s 12.25/12.29 Time used: 0.347585 12.25/12.29 12.25/12.29 LOG: SAT solveNonLinear - Elapsed time: 1.001278s 12.25/12.29 Cost: 51; Total time: 1.0007 12.25/12.29 Failed at location 1: 1 + curr_serv^0 <= c^0 12.25/12.29 Before Improving: 12.25/12.29 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.25/12.29 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.25/12.29 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 12.25/12.29 Optimizing invariants... 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.038656s 12.25/12.29 Remaining time after improvement: 0.997541 12.25/12.29 Some transition disabled by a set of quasi-invariant(s): 12.25/12.29 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.25/12.29 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.25/12.29 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 12.25/12.29 12.25/12.29 LOG: NEXT CALL check - disable 12.25/12.29 12.25/12.29 LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 5 12.25/12.29 * Exit transition: 12.25/12.29 * Postcondition : 1 + curr_serv^0 <= c^0 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.001312s 12.25/12.29 > Postcondition is not implied! 12.25/12.29 12.25/12.29 LOG: RETURN check - Elapsed time: 0.001440s 12.25/12.29 12.25/12.29 LOG: Postcondition is not implied - no solution 12.25/12.29 > Postcondition is not implied! 12.25/12.29 12.25/12.29 LOG: RETURN check - Elapsed time: 2.190857s 12.25/12.29 Cannot prove unreachability 12.25/12.29 12.25/12.29 Proving non-termination of subgraph 2 12.25/12.29 Transitions: 12.25/12.29 12.25/12.29 Variables: 12.25/12.29 12.25/12.29 Checking conditional non-termination of SCC {l5}... 12.25/12.29 > No exit transition to close. 12.25/12.29 Calling reachability with... 12.25/12.29 Transition: 12.25/12.29 Conditions: 12.25/12.29 OPEN EXITS: 12.25/12.29 12.25/12.29 12.25/12.29 --- Reachability graph --- 12.25/12.29 > Graph without transitions. 12.25/12.29 12.25/12.29 Calling reachability with... 12.25/12.29 Transition: 12.25/12.29 Conditions: 12.25/12.29 OPEN EXITS: 12.25/12.29 12.25/12.29 12.25/12.29 --- Reachability graph --- 12.25/12.29 > Graph without transitions. 12.25/12.29 12.25/12.29 Calling reachability with... 12.25/12.29 Transition: 12.25/12.29 Conditions: curr_serv^0 <= 0, 12.25/12.29 OPEN EXITS: 12.25/12.29 12.25/12.29 > Conditions are not feasible after transitions. 12.25/12.29 --- Reachability graph --- 12.25/12.29 Transitions: 12.25/12.29 -1 + curr_serv^0, rest remain the same}> 12.25/12.29 Variables: 12.25/12.29 c^0, curr_serv^0 12.25/12.29 Checking edge-closing of SCC {l1}... 12.25/12.29 EXIT TRANSITIONS (TO CLOSE): 12.25/12.29 12.25/12.29 12.25/12.29 Solving with 1 template(s). 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetFirstSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022957s 12.25/12.29 Time used: 0.022853 12.25/12.29 Solving with 2 template(s). 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetFirstSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001743s 12.25/12.29 Time used: 5.00072 12.25/12.29 Solving with 3 template(s). 12.25/12.29 12.25/12.29 LOG: CALL solveNonLinearGetFirstSolution 12.25/12.29 12.25/12.29 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005218s 12.25/12.29 Time used: 5.00061 12.25/12.29 > No quasi-invariants that block all exits have been found. 12.25/12.29 --- Reachability graph --- 12.25/12.29 Transitions: 12.25/12.29 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.25/12.29 Variables: 12.25/12.29 c^0, curr_serv^0, resp^0 12.25/12.29 Checking edge-closing of SCC {l1}... 12.25/12.29 > No exit transition to close. 12.25/12.29 Checking conditional termination of SCC {l1}... 12.25/12.29 12.25/12.29 LOG: CALL solveLinear 12.25/12.29 12.25/12.29 LOG: RETURN solveLinear - Elapsed time: 0.001001s 12.25/12.29 Ranking function: -1 + curr_serv^0 12.25/12.29 New Graphs: 12.25/12.29 Calling reachability with... 12.25/12.29 Transition: 12.25/12.29 Conditions: 12.25/12.29 OPEN EXITS: 12.25/12.29 12.25/12.29 12.25/12.29 > Conditions are reachable! 12.25/12.29 12.25/12.29 Program does NOT terminate 12.25/12.29 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 12.25/12.29 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 12.25/12.29 EOF