YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0}> 1}> 1}> 1}> (0 + tmp___2^0), ni^0 -> (1 + ni^0)}> 1}> 0}> 0}> 0}> undef317}> (0 + tmp___1^0), nj^0 -> (1 + nj^0)}> 1}> 0}> 0}> (1 + ni^0)}> 0}> (1 + ni^0)}> (0 + tmp___0^0), ni^0 -> (1 + ni^0)}> 1}> 0}> 0}> 0}> 0}> 0}> (1 + ni^0)}> 1, bDomain^0 -> 1, bGray^0 -> 1, nDim^0 -> (0 + __const_12^0), ni^0 -> 0, tmp^0 -> undef685}> Fresh variables: undef317, undef685, Undef variables: undef317, undef685, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0}> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> 0}> 0, nj^0 -> (1 + 0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> (0 + 1), ni^0 -> (1 + ni^0)}> (0 + 0), ni^0 -> (1 + ni^0)}> 0}> (1 + ni^0), nj^0 -> (1 + (1 + ni^0))}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> (0 + 0), nj^0 -> (1 + nj^0)}> (0 + 1), nj^0 -> (1 + nj^0)}> Fresh variables: undef317, undef685, Undef variables: undef317, undef685, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + ni^0, rest remain the same}> Variables: nDim^0, ni^0 Graph 2: Transitions: 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> Variables: bDomain^0, nDim^0, ni^0 Graph 3: Transitions: 1 + ni^0, nj^0 -> 2 + ni^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: nDim^0, ni^0, nj^0, bAllDiff^0 Graph 4: Transitions: 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 0, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> 1, ni^0 -> 1 + ni^0, rest remain the same}> Variables: bGray^0, nDim^0, ni^0 Graph 5: Transitions: Variables: Graph 6: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, rest remain the same}> Graph 3 0, nj^0 -> 1, rest remain the same}> Graph 4 0, rest remain the same}> 0, rest remain the same}> Graph 5 Graph 6 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 6 ) ( 4 , 5 ) ( 7 , 1 ) ( 10 , 4 ) ( 15 , 2 ) ( 19 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.000937 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000543s Ranking function: -1 + nDim^0 - ni^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.008597 Checking conditional termination of SCC {l15}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002279s Ranking function: -2 + 2*nDim^0 - 2*ni^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.22536 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004586s Ranking function: -3 + nDim^0 - ni^0 New Graphs: Transitions: 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> 0, nj^0 -> 1 + nj^0, rest remain the same}> 1, nj^0 -> 1 + nj^0, rest remain the same}> Variables: bAllDiff^0, nDim^0, nj^0 Checking conditional termination of SCC {l19}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001614s Ranking function: -2 + 2*nDim^0 - 2*nj^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.011873 Checking conditional termination of SCC {l10}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003573s Ranking function: -1 + nDim^0 - ni^0 New Graphs: Proving termination of subgraph 5 Analyzing SCC {l4}... No cycles found. Proving termination of subgraph 6 Analyzing SCC {l2}... No cycles found. Program Terminates