3.50/3.59 NO 3.50/3.59 3.50/3.59 Solver Timeout: 4 3.50/3.59 Global Timeout: 300 3.50/3.59 No parsing errors! 3.50/3.59 Init Location: 0 3.50/3.59 Transitions: 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 (1 + i^0)}> 3.50/3.59 3.50/3.59 3.50/3.59 undef140, bufHdr_cntxDirty^0 -> 0, bufHdr_flags^0 -> undef142}> 3.50/3.59 undef162}> 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 0}> 3.50/3.59 undef390}> 3.50/3.59 3.50/3.59 0, i^0 -> 1}> 3.50/3.59 (0 + bufHdr_tag_rnode^0), b1111^0 -> (0 + rnode^0), ret_RelFileNodeEquals1313^0 -> undef463, tmp1212^0 -> undef466, tmp___14^0 -> (0 + undef463)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 3.50/3.59 0, bufHdr_flags^0 -> undef534, bufHdr_tag_rnode_relNode^0 -> 1}> 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 (0 + bufHdr_tag_rnode^0), b77^0 -> (0 + rnode^0), ret_RelFileNodeEquals99^0 -> undef724, tmp1^0 -> (0 + undef724), tmp88^0 -> undef728}> 3.50/3.59 3.50/3.59 3.50/3.59 0}> 3.50/3.59 (0 + undef812), NBuffers^0 -> undef810, NLocBuffer^0 -> undef811, R^0 -> undef812, istemp^0 -> undef826}> 3.50/3.59 3.50/3.59 3.50/3.59 Fresh variables: 3.50/3.59 undef140, undef142, undef162, undef365, undef390, undef444, undef463, undef466, undef534, undef724, undef728, undef810, undef811, undef812, undef826, 3.50/3.59 3.50/3.59 Undef variables: 3.50/3.59 undef140, undef142, undef162, undef365, undef390, undef444, undef463, undef466, undef534, undef724, undef728, undef810, undef811, undef812, undef826, 3.50/3.59 3.50/3.59 Abstraction variables: 3.50/3.59 3.50/3.59 Exit nodes: 3.50/3.59 3.50/3.59 Accepting locations: 3.50/3.59 3.50/3.59 Asserts: 3.50/3.59 3.50/3.59 Preprocessed LLVMGraph 3.50/3.59 Init Location: 0 3.50/3.59 Transitions: 3.50/3.59 1}> 3.50/3.59 1}> 3.50/3.59 1}> 3.50/3.59 1}> 3.50/3.59 0}> 3.50/3.59 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 (1 + i^0)}> 3.50/3.59 3.50/3.59 3.50/3.59 3.50/3.59 Fresh variables: 3.50/3.59 undef140, undef142, undef162, undef365, undef390, undef444, undef463, undef466, undef534, undef724, undef728, undef810, undef811, undef812, undef826, 3.50/3.59 3.50/3.59 Undef variables: 3.50/3.59 undef140, undef142, undef162, undef365, undef390, undef444, undef463, undef466, undef534, undef724, undef728, undef810, undef811, undef812, undef826, 3.50/3.59 3.50/3.59 Abstraction variables: 3.50/3.59 3.50/3.59 Exit nodes: 3.50/3.59 3.50/3.59 Accepting locations: 3.50/3.59 3.50/3.59 Asserts: 3.50/3.59 3.50/3.59 ************************************************************* 3.50/3.59 ******************************************************************************************* 3.50/3.59 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 3.50/3.59 ******************************************************************************************* 3.50/3.59 3.50/3.59 Init Location: 0 3.50/3.59 Graph 0: 3.50/3.59 Transitions: 3.50/3.59 Variables: 3.50/3.59 3.50/3.59 Graph 1: 3.50/3.59 Transitions: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 Variables: 3.50/3.59 NLocBuffer^0, i^0, bufHdr_tag_blockNum^0, firstDelBlock^0 3.50/3.59 3.50/3.59 Graph 2: 3.50/3.59 Transitions: 3.50/3.59 3.50/3.59 Variables: 3.50/3.59 3.50/3.59 Graph 3: 3.50/3.59 Transitions: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 Variables: 3.50/3.59 NBuffers^0, i^0, bufHdr_tag_blockNum^0, firstDelBlock^0 3.50/3.59 3.50/3.59 Graph 4: 3.50/3.59 Transitions: 3.50/3.59 3.50/3.59 Variables: 3.50/3.59 3.50/3.59 Precedence: 3.50/3.59 Graph 0 3.50/3.59 3.50/3.59 Graph 1 3.50/3.59 0, rest remain the same}> 3.50/3.59 3.50/3.59 Graph 2 3.50/3.59 3.50/3.59 3.50/3.59 Graph 3 3.50/3.59 1, rest remain the same}> 3.50/3.59 1, rest remain the same}> 3.50/3.59 3.50/3.59 Graph 4 3.50/3.59 1, rest remain the same}> 3.50/3.59 1, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 Map Locations to Subgraph: 3.50/3.59 ( 0 , 0 ) 3.50/3.59 ( 3 , 1 ) 3.50/3.59 ( 7 , 2 ) 3.50/3.59 ( 10 , 3 ) 3.50/3.59 ( 14 , 4 ) 3.50/3.59 3.50/3.59 ******************************************************************************************* 3.50/3.59 ******************************** CHECKING ASSERTIONS ******************************** 3.50/3.59 ******************************************************************************************* 3.50/3.59 3.50/3.59 Proving termination of subgraph 0 3.50/3.59 Proving termination of subgraph 1 3.50/3.59 Checking unfeasibility... 3.50/3.59 Time used: 0.017514 3.50/3.59 3.50/3.59 Checking conditional termination of SCC {l3}... 3.50/3.59 3.50/3.59 LOG: CALL solveLinear 3.50/3.59 3.50/3.59 LOG: RETURN solveLinear - Elapsed time: 0.005207s 3.50/3.59 Ranking function: -2 + NLocBuffer^0 - 2*bufHdr_tag_blockNum^0 + 2*firstDelBlock^0 - i^0 3.50/3.59 New Graphs: 3.50/3.59 Transitions: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 Variables: 3.50/3.59 NLocBuffer^0, bufHdr_tag_blockNum^0, firstDelBlock^0, i^0 3.50/3.59 Checking conditional termination of SCC {l3}... 3.50/3.59 3.50/3.59 LOG: CALL solveLinear 3.50/3.59 3.50/3.59 LOG: RETURN solveLinear - Elapsed time: 0.002687s 3.50/3.59 Ranking function: NLocBuffer^0 + bufHdr_tag_blockNum^0 - firstDelBlock^0 - i^0 3.50/3.59 New Graphs: 3.50/3.59 Transitions: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 Variables: 3.50/3.59 NLocBuffer^0, i^0 3.50/3.59 Checking conditional termination of SCC {l3}... 3.50/3.59 3.50/3.59 LOG: CALL solveLinear 3.50/3.59 3.50/3.59 LOG: RETURN solveLinear - Elapsed time: 0.001230s 3.50/3.59 Ranking function: -1 + NLocBuffer^0 - i^0 3.50/3.59 New Graphs: 3.50/3.59 Proving termination of subgraph 2 3.50/3.59 Checking unfeasibility... 3.50/3.59 Time used: 0.001054 3.50/3.59 3.50/3.59 > No variable changes in termination graph. 3.50/3.59 Checking conditional unfeasibility... 3.50/3.59 Termination failed. Trying to show unreachability... 3.50/3.59 Proving unreachability of entry: 3.50/3.59 3.50/3.59 LOG: CALL check - Post:1 <= 0 - Process 1 3.50/3.59 * Exit transition: 3.50/3.59 * Postcondition : 1 <= 0 3.50/3.59 Postcodition moved up: 1 <= 0 3.50/3.59 3.50/3.59 LOG: Try proving POST 3.50/3.59 Postcondition: 1 <= 0 3.50/3.59 3.50/3.59 LOG: CALL check - Post:1 <= 0 - Process 2 3.50/3.59 * Exit transition: 0, rest remain the same}> 3.50/3.59 * Postcondition : 1 <= 0 3.50/3.59 3.50/3.59 LOG: CALL solveLinear 3.50/3.59 3.50/3.59 LOG: RETURN solveLinear - Elapsed time: 0.000859s 3.50/3.59 > Postcondition is not implied! 3.50/3.59 3.50/3.59 LOG: RETURN check - Elapsed time: 0.000959s 3.50/3.59 3.50/3.59 LOG: NarrowEntry size 1 3.50/3.59 Narrowing transition: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 LOG: Narrow transition size 1 3.50/3.59 Narrowing transition: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 LOG: Narrow transition size 1 3.50/3.59 Narrowing transition: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 LOG: Narrow transition size 1 3.50/3.59 Narrowing transition: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 LOG: Narrow transition size 1 3.50/3.59 Narrowing transition: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 3.50/3.59 LOG: Narrow transition size 1 3.50/3.59 ENTRIES: 3.50/3.59 0, rest remain the same}> 3.50/3.59 END ENTRIES: 3.50/3.59 GRAPH: 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 1 + i^0, rest remain the same}> 3.50/3.59 END GRAPH: 3.50/3.59 EXIT: 3.50/3.59 POST: 1 <= 0 3.50/3.59 3.50/3.59 3.50/3.59 LOG: Try proving POST 3.50/3.59 Solving with 1 template(s). 3.50/3.59 3.50/3.59 LOG: CALL solveNonLinearGetFirstSolution 3.50/3.59 3.50/3.59 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039478s 3.50/3.59 Time used: 0.039168 3.50/3.59 Improving Solution with cost 51 ... 3.50/3.59 3.50/3.59 LOG: CALL solveNonLinearGetNextSolution 3.50/3.59 3.50/3.59 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000783s 3.50/3.59 Time used: 1.00053 3.50/3.59 3.50/3.59 LOG: SAT solveNonLinear - Elapsed time: 1.040261s 3.50/3.59 Cost: 51; Total time: 1.03969 3.50/3.59 Failed at location 3: NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.59 Before Improving: 3.50/3.59 Quasi-invariant at l3: NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.59 Optimizing invariants... 3.50/3.59 3.50/3.59 LOG: CALL solveLinear 3.50/3.59 3.50/3.59 LOG: RETURN solveLinear - Elapsed time: 0.009725s 3.50/3.59 Remaining time after improvement: 0.997295 3.50/3.59 Some transition disabled by a set of quasi-invariant(s): 3.50/3.59 Quasi-invariant at l3: NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.60 3.50/3.60 LOG: NEXT CALL check - disable 3.50/3.60 3.50/3.60 LOG: CALL check - Post:NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 - Process 3 3.50/3.60 * Exit transition: 0, rest remain the same}> 3.50/3.60 * Postcondition : NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.60 3.50/3.60 LOG: CALL solveLinear 3.50/3.60 3.50/3.60 LOG: RETURN solveLinear - Elapsed time: 0.001357s 3.50/3.60 > Postcondition is not implied! 3.50/3.60 3.50/3.60 LOG: RETURN check - Elapsed time: 0.001489s 3.50/3.60 Solving with 2 template(s). 3.50/3.60 3.50/3.60 LOG: CALL solveNonLinearGetFirstSolution 3.50/3.60 3.50/3.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.245367s 3.50/3.60 Time used: 0.244836 3.50/3.60 Improving Solution with cost 51 ... 3.50/3.60 3.50/3.60 LOG: CALL solveNonLinearGetNextSolution 3.50/3.60 3.50/3.60 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000981s 3.50/3.60 Time used: 1.00086 3.50/3.60 3.50/3.60 LOG: SAT solveNonLinear - Elapsed time: 1.246348s 3.50/3.60 Cost: 51; Total time: 1.24569 3.50/3.60 Failed at location 3: NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.60 Before Improving: 3.50/3.60 Quasi-invariant at l3: 0 <= 1 + i^0 3.50/3.60 Quasi-invariant at l3: NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.60 Optimizing invariants... 3.50/3.60 3.50/3.60 LOG: CALL solveLinear 3.50/3.60 3.50/3.60 LOG: RETURN solveLinear - Elapsed time: 0.062734s 3.50/3.60 Remaining time after improvement: 0.996057 3.50/3.60 Some transition disabled by a set of quasi-invariant(s): 3.50/3.60 Quasi-invariant at l3: 0 <= 1 + i^0 3.50/3.60 Quasi-invariant at l3: NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.60 3.50/3.60 LOG: NEXT CALL check - disable 3.50/3.60 3.50/3.60 LOG: CALL check - Post:NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 - Process 4 3.50/3.60 * Exit transition: 0, rest remain the same}> 3.50/3.60 * Postcondition : NLocBuffer^0 + firstDelBlock^0 <= 1 + bufHdr_tag_blockNum^0 + i^0 3.50/3.60 3.50/3.60 LOG: CALL solveLinear 3.50/3.60 3.50/3.60 LOG: RETURN solveLinear - Elapsed time: 0.001888s 3.50/3.60 > Postcondition is not implied! 3.50/3.60 3.50/3.60 LOG: RETURN check - Elapsed time: 0.002049s 3.50/3.60 Solving with 3 template(s). 3.50/3.60 3.50/3.60 LOG: CALL solveNonLinearGetFirstSolution 3.50/3.60 3.50/3.60 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.000383s 3.50/3.60 Time used: 1.00003 3.50/3.60 3.50/3.60 LOG: Postcondition is not implied - no solution 3.50/3.60 > Postcondition is not implied! 3.50/3.60 3.50/3.60 LOG: RETURN check - Elapsed time: 3.390116s 3.50/3.60 Cannot prove unreachability 3.50/3.60 3.50/3.60 Proving non-termination of subgraph 2 3.50/3.60 Transitions: 3.50/3.60 3.50/3.60 Variables: 3.50/3.60 3.50/3.60 Checking conditional non-termination of SCC {l7}... 3.50/3.60 > No exit transition to close. 3.50/3.60 Calling reachability with... 3.50/3.60 Transition: 3.50/3.60 Conditions: 3.50/3.60 OPEN EXITS: 3.50/3.60 3.50/3.60 3.50/3.60 --- Reachability graph --- 3.50/3.60 > Graph without transitions. 3.50/3.60 3.50/3.60 Calling reachability with... 3.50/3.60 Transition: 3.50/3.60 Conditions: 3.50/3.60 OPEN EXITS: 3.50/3.60 3.50/3.60 3.50/3.60 --- Reachability graph --- 3.50/3.60 > Graph without transitions. 3.50/3.60 3.50/3.60 Calling reachability with... 3.50/3.60 Transition: 0, rest remain the same}> 3.50/3.60 Conditions: NLocBuffer^0 <= i^0, 3.50/3.60 OPEN EXITS: 3.50/3.60 0, rest remain the same}> 3.50/3.60 3.50/3.60 > Conditions are reachable! 3.50/3.60 3.50/3.60 Program does NOT terminate 3.50/3.60 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 3.50/3.60 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 3.50/3.60 EOF