/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 1}> 0}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0)}> undef189, err^0 -> (0 + undef189)}> (0 + __const_10^0)}> undef283}> undef455}> undef528, err^0 -> (0 + undef528)}> undef636}> undef661}> undef760, fd^0 -> (0 + undef760)}> (1 + listen_index^0)}> undef1101, __rho_3_^0 -> undef1102}> 0}> 1}> (0 + addrs^0)}> 1}> undef1366, ret^0 -> (0 + undef1366)}> undef1458, MaxBackends^0 -> undef1459, added^0 -> 0, addrs^0 -> undef1474, listen_index^0 -> 0, one^0 -> 1, ret^0 -> undef1481}> Fresh variables: undef189, undef283, undef455, undef528, undef636, undef661, undef760, undef1101, undef1102, undef1366, undef1458, undef1459, undef1474, undef1481, Undef variables: undef189, undef283, undef455, undef528, undef636, undef661, undef760, undef1101, undef1102, undef1366, undef1458, undef1459, undef1474, undef1481, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> undef283}> (1 + addr^0), maxconn^0 -> undef283}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> undef283}> (1 + addr^0), maxconn^0 -> undef283}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> undef283}> (1 + addr^0), maxconn^0 -> undef283}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> undef455}> (1 + addr^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> undef283}> (1 + addr^0), maxconn^0 -> undef283}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> undef283}> (1 + addr^0), maxconn^0 -> undef283}> (0 + fd^0), added^0 -> (1 + added^0), addr^0 -> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> (1 + addr^0), maxconn^0 -> (0 + __const_10^0)}> undef455}> (1 + addr^0)}> (1 + addr^0)}> (1 + listen_index^0)}> (1 + listen_index^0)}> undef661, fd^0 -> (0 + undef760)}> (1 + addr^0), fd^0 -> (0 + undef760)}> Fresh variables: undef189, undef283, undef455, undef528, undef636, undef661, undef760, undef1101, undef1102, undef1366, undef1458, undef1459, undef1474, undef1481, Undef variables: undef189, undef283, undef455, undef528, undef636, undef661, undef760, undef1101, undef1102, undef1366, undef1458, undef1459, undef1474, undef1481, 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}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, 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}> undef661, fd^0 -> undef760, rest remain the same}> 1 + addr^0, fd^0 -> undef760, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, __rho_8_^0, added^0, fd^0, maxconn^0, __rho_4_^0, addr_ai_family^0, MaxListen^0, listen_index^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 2 ) ( 7 , 1 ) ( 13 , 1 ) ( 18 , 1 ) ( 24 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.999888 Checking conditional termination of SCC {l7, l13, l18, l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032964s Ranking function: -8 + 8*MAXADDR^0 - 8*addr^0 New Graphs: Transitions: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, 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}> undef661, fd^0 -> undef760, rest remain the same}> 1 + addr^0, fd^0 -> undef760, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, __const_10^0, __rho_4_^0, __rho_8_^0, added^0, addr^0, addr_ai_family^0, fd^0, listen_index^0, maxconn^0 Checking conditional termination of SCC {l7, l13, l18, l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020964s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.278666s [61825 : 61853] [61825 : 61854] Successful child: 61853 [ 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 Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): undef661, fd^0 -> undef760, 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 -> undef760, 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 Strengthening transition (result): fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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): undef661, fd^0 -> undef760, 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 -> undef760, rest remain the same}> Ranking function: MAXADDR^0 + MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002122s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007606s [61825 : 61971] [61825 : 61972] Successful child: 61971 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef661, fd^0 -> undef760, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, fd^0 -> undef760, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> New Graphs: INVARIANTS: 13: 1 + addr^0 + listen_index^0 <= MAXADDR^0 + MaxListen^0 , 18: 1 + addr^0 + listen_index^0 <= MAXADDR^0 + MaxListen^0 , 24: 1 + addr^0 <= MAXADDR^0 , Quasi-INVARIANTS to narrow Graph: 13: 18: 24: [61825 : 62070] [61825 : 62071] [61825 : 62072] [61825 : 62073] [61825 : 62074] [61825 : 62075] [61825 : 62076] [61825 : 62077] [61825 : 62078] INVARIANTS: 7: 13: 18: 24: Quasi-INVARIANTS to narrow Graph: 7: 1 + MAXADDR^0 <= addr^0 , 13: MAXADDR^0 <= addr^0 , 18: 1 <= 0 , 24: 1 <= 0 , Narrowing transition: 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: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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: undef661, fd^0 -> undef760, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef760, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, 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}> undef661, fd^0 -> undef760, rest remain the same}> 1 + addr^0, fd^0 -> undef760, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, __rho_8_^0, added^0, fd^0, maxconn^0, __rho_4_^0, addr_ai_family^0, MaxListen^0, listen_index^0 Checking conditional termination of SCC {l7, l13, l18, l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.056234s Ranking function: -2 + 2*MAXADDR^0 + 2*MaxListen^0 - 2*addr^0 - 2*listen_index^0 New Graphs: Transitions: 1 + addr^0, rest remain the same}> Variables: MAXADDR^0, addr^0 Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003331s Ranking function: -1 + MAXADDR^0 - addr^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002214s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008343s [61825 : 62096] [61825 : 62097] Successful child: 62096 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef661, fd^0 -> undef760, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, fd^0 -> undef760, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> New Graphs: [61825 : 62174] [61825 : 62177] [61825 : 62178] [61825 : 62179] [61825 : 62180] [61825 : 62181] [61825 : 62182] [61825 : 62185] [61825 : 62186] INVARIANTS: 7: 13: 18: 24: Quasi-INVARIANTS to narrow Graph: 7: MAXADDR^0 <= addr^0 , 13: 1 <= 0 , 18: 1 <= 0 , 24: MAXADDR^0 <= addr^0 , Narrowing transition: 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: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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: undef661, fd^0 -> undef760, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef760, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, 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}> undef661, fd^0 -> undef760, rest remain the same}> 1 + addr^0, fd^0 -> undef760, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, __rho_8_^0, added^0, fd^0, maxconn^0, __rho_4_^0, addr_ai_family^0, MaxListen^0, listen_index^0 Checking conditional termination of SCC {l7, l13, l18, l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053121s Ranking function: -2 + 2*MAXADDR^0 + 2*MaxListen^0 - 2*addr^0 - 2*listen_index^0 New Graphs: Transitions: 1 + addr^0, rest remain the same}> Variables: MAXADDR^0, addr^0 Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003502s Ranking function: -1 + MAXADDR^0 - addr^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002437s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008925s [61825 : 62308] [61825 : 62309] Successful child: 62308 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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 It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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): undef661, fd^0 -> undef760, 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 -> undef760, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> New Graphs: [61825 : 62344] [61825 : 62345] [61825 : 62346] [61825 : 62347] [61825 : 62348] [61825 : 62349] [61825 : 62350] [61825 : 62351] [61825 : 62352] INVARIANTS: 7: 13: 18: 24: Quasi-INVARIANTS to narrow Graph: 7: MAXADDR^0 + listen_index^0 <= MaxListen^0 + addr^0 , 13: MAXADDR^0 + listen_index^0 <= MaxListen^0 + addr^0 , 18: MAXADDR^0 + listen_index^0 <= MaxListen^0 + addr^0 , 24: MAXADDR^0 + listen_index^0 <= MaxListen^0 + addr^0 , Narrowing transition: 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: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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: undef661, fd^0 -> undef760, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, fd^0 -> undef760, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, 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}> undef661, fd^0 -> undef760, rest remain the same}> 1 + addr^0, fd^0 -> undef760, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, __rho_8_^0, added^0, fd^0, maxconn^0, __rho_4_^0, addr_ai_family^0, MaxListen^0, listen_index^0 Checking conditional termination of SCC {l7, l13, l18, l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.055976s Ranking function: -1 + MAXADDR^0 - addr^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002219s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010006s [61825 : 62361] [61825 : 62362] Successful child: 62361 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^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, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + addr^0, maxconn^0 -> undef283, 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, maxconn^0 -> __const_10^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, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef455, 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 It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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): undef661, fd^0 -> undef760, 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 -> undef760, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> New Graphs: [61825 : 62381] [61825 : 62382] [61825 : 62383] [61825 : 62384] [61825 : 62385] [61825 : 62386] [61825 : 62387] [61825 : 62388] [61825 : 62389] INVARIANTS: 7: 13: 18: 24: Quasi-INVARIANTS to narrow Graph: 7: 1 + listen_index^0 <= MaxListen^0 , 13: 1 + listen_index^0 <= MaxListen^0 , 18: 1 + listen_index^0 <= MaxListen^0 , 24: 1 + listen_index^0 <= MaxListen^0 , Narrowing transition: 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: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef455, 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 It's unfeasible. Removing transition: undef661, fd^0 -> undef760, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, fd^0 -> undef760, rest remain the same}> invGraph after Narrowing: Transitions: 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, rest remain the same}> 1 + addr^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> undef455, 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}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, __rho_8_^0, added^0, fd^0, maxconn^0, __rho_4_^0, addr_ai_family^0, MaxListen^0, listen_index^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003897s Ranking function: -1 + MAXADDR^0 - MaxListen^0 - addr^0 + listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002223s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010576s [61825 : 62395] [61825 : 62396] Successful child: 62395 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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 It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef455, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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 It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... 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 It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001259s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004995s [61825 : 62417] [61825 : 62418] Successful child: 62417 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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 It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + listen_index^0, rest remain the same}> New Graphs: [61825 : 62423] [61825 : 62424] [61825 : 62425] [61825 : 62426] [61825 : 62427] [61825 : 62428] [61825 : 62429] [61825 : 62430] [61825 : 62431] INVARIANTS: 7: 13: __rho_8_^0 + listen_index^0 <= MaxListen^0 , 18: MAXADDR^0 <= addr^0 , 24: Quasi-INVARIANTS to narrow Graph: 7: MAXADDR^0 + listen_index^0 <= 2 + ListenSocket_OF_listen_index^0 + MaxListen^0 + addr^0 , 13: 18: 24: MAXADDR^0 <= 2 + ListenSocket_OF_listen_index^0 + addr^0 , [61825 : 62435] [61825 : 62436] [61825 : 62437] [61825 : 62438] [61825 : 62439] [61825 : 62440] [61825 : 62441] [61825 : 62442] [61825 : 62443] INVARIANTS: 7: 24: Quasi-INVARIANTS to narrow Graph: 7: ListenSocket_OF_listen_index^0 + MAXADDR^0 + listen_index^0 <= MaxListen^0 + addr^0 , 24: ListenSocket_OF_listen_index^0 + MAXADDR^0 + listen_index^0 <= MaxListen^0 + addr^0 , Narrowing transition: LOG: Narrow transition size 2 Narrowing transition: LOG: Narrow transition size 2 Narrowing transition: 1 + addr^0, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: undef455, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> undef283, rest remain the same}> It's unfeasible. Removing transition: fd^0, added^0 -> 1 + added^0, addr^0 -> 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, maxconn^0 -> __const_10^0, rest remain the same}> It's unfeasible. Removing transition: undef455, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> Narrowing transition: 1 + listen_index^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + listen_index^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 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}> 1 + listen_index^0, rest remain the same}> Variables: MAXADDR^0, addr^0, ListenSocket_OF_listen_index^0, __const_10^0, __rho_8_^0, added^0, fd^0, maxconn^0, __rho_4_^0, addr_ai_family^0, MaxListen^0, listen_index^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005951s Ranking function: -4 + (~(5) / 3)*ListenSocket_OF_listen_index^0 + MAXADDR^0 - MaxListen^0 - addr^0 + listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Transitions: 1 + addr^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006526s Ranking function: 4 - 4*ListenSocket_OF_listen_index^0 - 4*MAXADDR^0 + 4*MaxListen^0 + 4*addr^0 - 4*listen_index^0 New Graphs: Transitions: 1 + addr^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004149s Ranking function: -1 + ListenSocket_OF_listen_index^0 + MAXADDR^0 - MaxListen^0 - addr^0 + listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002476s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011936s [61825 : 62444] [61825 : 62445] Successful child: 62444 [ Invariant Graph ] Strengthening and disabling transitions... 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 It's unfeasible. Removing transition: 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 It's unfeasible. Removing transition: 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 It's unfeasible. Removing transition: 1 + addr^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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): 1 + listen_index^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 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}> New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001343s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005966s [61825 : 62449] [61825 : 62450] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.154750s Time used: 0.152911 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002588s Time used: 1.00261 LOG: SAT solveNonLinear - Elapsed time: 1.157338s Cost: 1; Total time: 1.15552 Termination implied by a set of invariant(s): Invariant at l7: 0 <= addr^0 + listen_index^0 Invariant at l24: 1 + ListenSocket_OF_listen_index^0 <= MAXADDR^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 - 2*MAXADDR^0 - 2*listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001553s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011024s [61825 : 62470] [61825 : 62471] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.138822s Time used: 0.136536 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002793s Time used: 1.00266 LOG: SAT solveNonLinear - Elapsed time: 1.141616s Cost: 1; Total time: 1.13919 Termination implied by a set of invariant(s): Invariant at l24: 1 + MaxListen^0 + addr^0 <= MAXADDR^0 + listen_index^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 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + 2*MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001718s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011277s [61825 : 62480] [61825 : 62481] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.172959s Time used: 0.170658 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002595s Time used: 1.00263 LOG: SAT solveNonLinear - Elapsed time: 1.175554s Cost: 1; Total time: 1.17329 Termination implied by a set of invariant(s): Invariant at l7: 0 <= listen_index^0 Invariant at l24: ListenSocket_OF_listen_index^0 + MAXADDR^0 <= MaxListen^0 + addr^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 + MAXADDR^0 - MaxListen^0 - 4*addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002035s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022311s [61825 : 62485] [61825 : 62486] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.151280s Time used: 0.148736 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003469s Time used: 1.0035 LOG: SAT solveNonLinear - Elapsed time: 1.154749s Cost: 1; Total time: 1.15224 Termination implied by a set of invariant(s): Invariant at l7: 1 <= MAXADDR^0 + addr^0 + listen_index^0 Invariant at l24: addr^0 <= MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 + MAXADDR^0 + MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002236s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.054548s [61825 : 62490] [61825 : 62491] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.167478s Time used: 0.164699 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002833s Time used: 1.00272 LOG: SAT solveNonLinear - Elapsed time: 1.170312s Cost: 1; Total time: 1.16742 Termination implied by a set of invariant(s): Invariant at l7: addr^0 <= MAXADDR^0 + listen_index^0 Invariant at l24: 1 + ListenSocket_OF_listen_index^0 <= listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 + MAXADDR^0 + MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002447s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018979s [61825 : 62641] [61825 : 62642] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.186364s Time used: 0.183385 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002759s Time used: 1.00278 LOG: SAT solveNonLinear - Elapsed time: 1.189123s Cost: 1; Total time: 1.18617 Termination implied by a set of invariant(s): Invariant at l7: MaxListen^0 + listen_index^0 <= MAXADDR^0 + addr^0 Invariant at l24: ListenSocket_OF_listen_index^0 + MaxListen^0 <= 1 + MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 + MAXADDR^0 - MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002703s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024888s [61825 : 62841] [61825 : 62842] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.193553s Time used: 0.190614 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.035295s Time used: 1.03532 LOG: SAT solveNonLinear - Elapsed time: 1.228848s Cost: 1; Total time: 1.22593 Termination implied by a set of invariant(s): Invariant at l7: 1 + listen_index^0 <= MAXADDR^0 Invariant at l24: ListenSocket_OF_listen_index^0 + MAXADDR^0 <= MaxListen^0 + addr^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 + MAXADDR^0 - 5*MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002882s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018928s [61825 : 62994] [61825 : 62995] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.170029s Time used: 0.167158 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.039353s Time used: 1.03939 LOG: SAT solveNonLinear - Elapsed time: 1.209382s Cost: 1; Total time: 1.20655 Termination implied by a set of invariant(s): Invariant at l7: addr^0 <= MAXADDR^0 Invariant at l24: 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 Strengthening transition (result): 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 + 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 + MAXADDR^0 + MaxListen^0 - 2*addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003031s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.031992s [61825 : 62999] [61825 : 63000] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.181639s Time used: 0.178506 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003298s Time used: 1.00317 LOG: SAT solveNonLinear - Elapsed time: 1.184937s Cost: 1; Total time: 1.18167 Termination implied by a set of invariant(s): Invariant at l7: 1 + added^0 <= MAXADDR^0 + addr^0 + listen_index^0 Invariant at l24: ListenSocket_OF_listen_index^0 + MaxListen^0 + addr^0 <= MAXADDR^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + MAXADDR^0 + MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003240s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.091758s [61825 : 63449] [61825 : 63450] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.174584s Time used: 0.171511 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002987s Time used: 1.00299 LOG: SAT solveNonLinear - Elapsed time: 1.177571s Cost: 1; Total time: 1.1745 Termination implied by a set of invariant(s): Invariant at l7: MaxListen^0 + listen_index^0 <= 1 + addr^0 Invariant at l24: ListenSocket_OF_listen_index^0 + MAXADDR^0 <= 1 + MaxListen^0 + addr^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + MAXADDR^0 - MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003369s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.121298s [61825 : 63454] [61825 : 63455] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.184536s Time used: 0.181243 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002438s Time used: 1.00246 LOG: SAT solveNonLinear - Elapsed time: 1.186974s Cost: 1; Total time: 1.18371 Termination implied by a set of invariant(s): Invariant at l7: addr^0 <= 1 + MAXADDR^0 Invariant at l24: MaxListen^0 <= 1 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 + MAXADDR^0 + 3*MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003546s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.085049s [61825 : 63459] [61825 : 63460] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.166926s Time used: 0.16367 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003362s Time used: 1.00323 LOG: SAT solveNonLinear - Elapsed time: 1.170289s Cost: 1; Total time: 1.1669 Termination implied by a set of invariant(s): Invariant at l7: added^0 <= MAXADDR^0 + addr^0 + listen_index^0 Invariant at l24: 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 Strengthening transition (result): 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 + 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 + MAXADDR^0 - MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003763s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046341s [61825 : 63951] [61825 : 63952] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.211685s Time used: 0.208333 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003950s Time used: 1.00311 LOG: SAT solveNonLinear - Elapsed time: 1.215636s Cost: 1; Total time: 1.21144 Termination implied by a set of invariant(s): Invariant at l7: 1 + MaxListen^0 <= MAXADDR^0 + listen_index^0 Invariant at l24: ListenSocket_OF_listen_index^0 + MAXADDR^0 <= MaxListen^0 + addr^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 - MAXADDR^0 + MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003750s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027465s [61825 : 64195] [61825 : 64196] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.178495s Time used: 0.17495 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002612s Time used: 1.00261 LOG: SAT solveNonLinear - Elapsed time: 1.181108s Cost: 1; Total time: 1.17756 Termination implied by a set of invariant(s): Invariant at l7: MaxListen^0 <= 1 + MAXADDR^0 + addr^0 Invariant at l24: 1 + ListenSocket_OF_listen_index^0 + MaxListen^0 <= addr^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 - MAXADDR^0 - MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004171s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.275739s [61825 : 64399] [61825 : 64400] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.197311s Time used: 0.193794 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002581s Time used: 1.00261 LOG: SAT solveNonLinear - Elapsed time: 1.199892s Cost: 1; Total time: 1.1964 Termination implied by a set of invariant(s): Invariant at l7: 1 + added^0 + listen_index^0 <= MAXADDR^0 + addr^0 Invariant at l24: ListenSocket_OF_listen_index^0 + addr^0 <= MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 - MAXADDR^0 + MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004086s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020093s [61825 : 64520] [61825 : 64521] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.200566s Time used: 0.197001 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002536s Time used: 1.00255 LOG: SAT solveNonLinear - Elapsed time: 1.203101s Cost: 1; Total time: 1.19955 Termination implied by a set of invariant(s): Invariant at l7: listen_index^0 <= 0 Invariant at l24: MaxListen^0 <= listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 - MAXADDR^0 + MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004272s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.271808s [61825 : 64530] [61825 : 64531] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.182439s Time used: 0.178824 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.032788s Time used: 1.03283 LOG: SAT solveNonLinear - Elapsed time: 1.215226s Cost: 1; Total time: 1.21166 Termination implied by a set of invariant(s): Invariant at l24: addr^0 <= MAXADDR^0 + listen_index^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 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 - MAXADDR^0 + 3*MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004479s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029988s [61825 : 64536] [61825 : 64537] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.200541s Time used: 0.1966 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002784s Time used: 1.00282 LOG: SAT solveNonLinear - Elapsed time: 1.203325s Cost: 1; Total time: 1.19942 Termination implied by a set of invariant(s): Invariant at l7: listen_index^0 <= 1 Invariant at l24: addr^0 <= 1 + MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 - MAXADDR^0 - MaxListen^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004796s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.030538s [61825 : 64752] [61825 : 64753] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.183783s Time used: 0.179765 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002991s Time used: 1.00288 LOG: SAT solveNonLinear - Elapsed time: 1.186774s Cost: 1; Total time: 1.18264 Termination implied by a set of invariant(s): Invariant at l7: listen_index^0 <= added^0 + addr^0 Invariant at l24: 1 + ListenSocket_OF_listen_index^0 + MaxListen^0 <= addr^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 - MAXADDR^0 - MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004791s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027091s [61825 : 64757] [61825 : 64758] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.209357s Time used: 0.205518 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002786s Time used: 1.00279 LOG: SAT solveNonLinear - Elapsed time: 1.212142s Cost: 1; Total time: 1.20831 Termination implied by a set of invariant(s): Invariant at l7: addr^0 <= 1 + MAXADDR^0 + listen_index^0 Invariant at l24: 1 + MaxListen^0 + addr^0 <= MAXADDR^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 - 5*MAXADDR^0 - MaxListen^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005148s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.516224s [61825 : 65209] [61825 : 65210] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.196915s Time used: 0.192775 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.030972s Time used: 1.03099 LOG: SAT solveNonLinear - Elapsed time: 1.227887s Cost: 1; Total time: 1.22377 Termination implied by a set of invariant(s): Invariant at l24: ListenSocket_OF_listen_index^0 + MAXADDR^0 <= MaxListen^0 + addr^0 + listen_index^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 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 + ListenSocket_OF_listen_index^0 - MAXADDR^0 - MaxListen^0 - addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005293s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.039118s [61825 : 65214] [61825 : 65215] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.192262s Time used: 0.187949 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.003783s Time used: 1.00376 LOG: SAT solveNonLinear - Elapsed time: 1.196044s Cost: 1; Total time: 1.19171 Termination implied by a set of invariant(s): Invariant at l7: addr^0 <= MAXADDR^0 Invariant at l24: 1 + MaxListen^0 + addr^0 <= MAXADDR^0 + listen_index^0 [ Invariant Graph ] Strengthening and disabling transitions... 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): 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}> [ Termination Graph ] Strengthening and disabling transitions... 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}> Quasi-ranking function: 50000 - ListenSocket_OF_listen_index^0 - MAXADDR^0 + addr^0 - listen_index^0 New Graphs: Transitions: 1 + listen_index^0, rest remain the same}> Variables: ListenSocket_OF_listen_index^0, MAXADDR^0, MaxListen^0, addr^0, listen_index^0 Checking conditional termination of SCC {l24}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005670s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.166627s [61825 : 65410] [61825 : 65411] Timeout expired! [61825 : 65440] [61825 : 65475] Successful child: 65475 Program does NOT terminate