NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0}> 0}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0)}> 1}> undef241}> (0 + __const_10^0)}> undef314}> 1}> undef483}> 1}> undef563}> undef688}> undef804}> undef910}> (1 + listen_index^0)}> undef1239}> undef1330}> 0}> 1}> (0 + addrs^0)}> 1}> undef1627}> undef1704, MaxBackends^0 -> undef1705, added^0 -> 0, addrs^0 -> undef1711, listen_index^0 -> 0, one^0 -> 1, ret^0 -> undef1719}> Fresh variables: undef241, undef314, undef483, undef563, undef688, undef804, undef910, undef1239, undef1330, undef1627, undef1704, undef1705, undef1711, undef1719, Undef variables: undef241, undef314, undef483, undef563, undef688, undef804, undef910, undef1239, undef1330, undef1627, undef1704, undef1705, undef1711, undef1719, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + addr^0)}> (1 + listen_index^0)}> (1 + listen_index^0)}> undef910, tmp___35^0 -> undef804}> (1 + addr^0), fd^0 -> undef910}> (1 + addr^0), fd^0 -> undef910}> Fresh variables: undef241, undef314, undef483, undef563, undef688, undef804, undef910, undef1239, undef1330, undef1627, undef1704, undef1705, undef1711, undef1719, Undef variables: undef241, undef314, undef483, undef563, undef688, undef804, undef910, undef1239, undef1330, undef1627, undef1704, undef1705, undef1711, undef1719, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, added^0, addr_ai_family^0, fd^0, tmp___35^0, MaxListen^0, listen_index^0 Graph 2: Transitions: Variables: Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Graph 3 Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 3 ) ( 8 , 2 ) ( 10 , 1 ) ( 17 , 1 ) ( 24 , 1 ) ( 27 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.439898 Checking conditional termination of SCC {l10, l17, l24, l27}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011223s Ranking function: -7 + 7*MAXADDR^0 - 7*addr^0 New Graphs: Transitions: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, __const_10^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, tmp___35^0 Checking conditional termination of SCC {l10, l17, l27}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009803s Ranking function: MaxListen^0 - listen_index^0 New Graphs: Transitions: undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, __const_10^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, tmp___35^0 Checking conditional termination of SCC {l10, l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043669s Ranking function: -7 + 6*MAXADDR^0 + MaxListen^0 - 6*addr^0 - listen_index^0 New Graphs: Transitions: undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, __const_10^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, tmp___35^0 Checking conditional termination of SCC {l10, l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007222s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.092581s Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.333122s Time used: 0.332064 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.523040s Time used: 0.521911 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.320453s Time used: 0.31845 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.413948s Time used: 0.412623 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041762s Time used: 0.039675 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079514s Time used: 0.070134 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040527s Time used: 0.038796 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.073321s Time used: 0.064008 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.068713s Time used: 0.06718 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083063s Time used: 0.073837 Trying to remove transition: 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055875s Time used: 0.054272 Trying to remove transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.057993s Time used: 0.048893 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077642s Time used: 0.076209 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084127s Time used: 0.082459 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077785s Time used: 0.076162 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078481s Time used: 0.07677 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079113s Time used: 0.077442 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.115299s Time used: 0.113594 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076743s Time used: 0.07497 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084111s Time used: 0.082303 Trying to remove transition: undef910, tmp___35^0 -> undef804, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.086918s Time used: 0.085198 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.987394s Time used: 0.98563 LOG: SAT solveNonLinear - Elapsed time: 0.987394s Cost: 0; Total time: 0.98563 Termination implied by a set of invariant(s): Invariant at l17: addr^0 <= MAXADDR^0 Invariant at l24: addr^0 <= MAXADDR^0 Invariant at l27: 1 + addr^0 <= MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef910, tmp___35^0 -> undef804, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, fd^0 -> undef910, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, fd^0 -> undef910, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, rest remain the same}> Ranking function: MAXADDR^0 - addr^0 New Graphs: INVARIANTS: 17: addr^0 <= MAXADDR^0 , 24: addr^0 <= MAXADDR^0 , 27: 1 + addr^0 <= MAXADDR^0 , Quasi-INVARIANTS to narrow Graph: 17: 24: 27: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003629 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001680s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001740s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 3 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001672s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001728s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 4 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001662s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001719s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 5 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001634s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001691s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 6 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001651s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001712s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 7 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001673s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001727s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 8 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001654s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001711s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 9 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001656s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001712s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 10 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001657s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001712s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 11 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001694s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001749s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 12 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001645s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001700s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 13 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001655s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001710s LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + listen_index^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + listen_index^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef910, tmp___35^0 -> undef804, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef910, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef910, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + addr^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> undef910, tmp___35^0 -> undef804, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> 1 + addr^0, fd^0 -> undef910, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.751148s Time used: 0.750053 Improving Solution with cost 62 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001842s Time used: 1.00183 LOG: SAT solveNonLinear - Elapsed time: 1.752989s Cost: 62; Total time: 1.75188 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Failed at location 10: MaxListen^0 <= listen_index^0 Before Improving: Quasi-invariant at l10: MaxListen^0 <= listen_index^0 Quasi-invariant at l17: MaxListen^0 <= listen_index^0 Quasi-invariant at l24: 1 + MaxListen^0 <= listen_index^0 Quasi-invariant at l27: MaxListen^0 <= listen_index^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013822s Remaining time after improvement: 0.991431 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l10: MaxListen^0 <= listen_index^0 Quasi-invariant at l17: MaxListen^0 <= listen_index^0 Quasi-invariant at l24: 1 + MaxListen^0 <= listen_index^0 Quasi-invariant at l27: MaxListen^0 <= listen_index^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:MaxListen^0 <= listen_index^0 - Process 14 * Exit transition: * Postcondition : MaxListen^0 <= listen_index^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003365s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.003435s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000154s Time used: 4.00002 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014118s Time used: 1.00006 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 7.033357s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: Variables: Checking conditional non-termination of SCC {l8}... > No exit transition to close. Calling reachability with... Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: Transition: Conditions: OPEN EXITS: (condsUp: 2 <= undef483, addr_ai_family^0 = 3) (condsUp: undef483 <= 0, addr_ai_family^0 = 3) (condsUp: 2 <= undef483, addr_ai_family^0 = 3) (condsUp: undef483 <= 0, addr_ai_family^0 = 3) (condsUp: 2 <= undef483, addr_ai_family^0 = 3) (condsUp: undef483 <= 0, addr_ai_family^0 = 3) (condsUp: 2 <= undef483, addr_ai_family^0 = 3) (condsUp: undef483 <= 0, addr_ai_family^0 = 3) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, Transition: Conditions: MAXADDR^0 <= addr^0, added^0 = 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate