43.32/43.42	NO
43.32/43.42	
43.32/43.42	Solver Timeout: 4
43.32/43.42	Global Timeout: 300
43.32/43.42	No parsing errors!
43.32/43.42	Init Location: 0
43.32/43.42	Transitions:
43.32/43.42	<l0, l7, true>
43.32/43.42	<l1, l2, (undef2 = (0 + x_5^0)) /\ (undef8 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, __cil_tmp2_6^0 -> undef2, selected_11^0 -> (0 + undef8)}>
43.32/43.42	<l3, l2, (undef10 = (0 + x_5^0)) /\ (undef16 = (0 + undef10)) /\ (undef9 = undef9), par{Result_4^0 -> undef9, __cil_tmp2_6^0 -> undef10, selected_11^0 -> (0 + undef16)}>
43.32/43.42	<l4, l5, (undef19 = (0 + selected_11^0)), par{Result_4^0 -> (0 + undef19), __cil_tmp6_12^0 -> undef19}>
43.32/43.42	<l4, l2, (undef25 = (0 + x_5^0)) /\ (undef31 = (0 + undef25)) /\ (undef24 = undef24), par{Result_4^0 -> undef24, __cil_tmp2_6^0 -> undef25, selected_11^0 -> (0 + undef31)}>
43.32/43.42	<l2, l4, true, par{retryCount_10^0 -> (1 + retryCount_10^0)}>
43.32/43.42	<l6, l4, true, par{maxRetries_9^0 -> 4, retryCount_10^0 -> 0, selected_11^0 -> 0}>
43.32/43.42	<l7, l6, true>
43.32/43.42	
43.32/43.42	Fresh variables:
43.32/43.42	undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 
43.32/43.42	
43.32/43.42	Undef variables:
43.32/43.42	undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 
43.32/43.42	
43.32/43.42	Abstraction variables:
43.32/43.42	
43.32/43.42	Exit nodes:
43.32/43.42	
43.32/43.42	Accepting locations:
43.32/43.42	
43.32/43.42	Asserts:
43.32/43.42	
43.32/43.42	Preprocessed LLVMGraph
43.32/43.42	Init Location: 0
43.32/43.42	Transitions:
43.32/43.42	<l0, l4, (retryCount_10^0 = 0) /\ (selected_11^0 = 0)>
43.32/43.42	<l4, l5, (undef19 = (0 + selected_11^0))>
43.32/43.42	<l4, l4, (undef25 = (0 + x_5^0)) /\ (undef31 = (0 + undef25)) /\ (undef24 = undef24), par{retryCount_10^0 -> (1 + retryCount_10^0), selected_11^0 -> (0 + undef31)}>
43.32/43.42	
43.32/43.42	Fresh variables:
43.32/43.42	undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 
43.32/43.42	
43.32/43.42	Undef variables:
43.32/43.42	undef1, undef2, undef8, undef9, undef10, undef16, undef19, undef24, undef25, undef31, 
43.32/43.42	
43.32/43.42	Abstraction variables:
43.32/43.42	
43.32/43.42	Exit nodes:
43.32/43.42	
43.32/43.42	Accepting locations:
43.32/43.42	
43.32/43.42	Asserts:
43.32/43.42	
43.32/43.42	*************************************************************
43.32/43.42	*******************************************************************************************
43.32/43.42	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
43.32/43.42	*******************************************************************************************
43.32/43.42	
43.32/43.42	Init Location: 0
43.32/43.42	Graph 0:
43.32/43.42	Transitions:
43.32/43.42	Variables:
43.32/43.42	
43.32/43.42	Graph 1:
43.32/43.42	Transitions:
43.32/43.42	<l4, l4, x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Variables:
43.32/43.42	retryCount_10^0, selected_11^0, x_5^0
43.32/43.42	
43.32/43.42	Graph 2:
43.32/43.42	Transitions:
43.32/43.42	Variables:
43.32/43.42	
43.32/43.42	Precedence: 
43.32/43.42	Graph 0
43.32/43.42	
43.32/43.42	Graph 1
43.32/43.42	<l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>
43.32/43.42	
43.32/43.42	Graph 2
43.32/43.42	<l4, l5, selected_11^0 = undef19, {all remain the same}>
43.32/43.42	
43.32/43.42	Map Locations to Subgraph:
43.32/43.42	( 0 , 0 )
43.32/43.42	( 4 , 1 )
43.32/43.42	( 5 , 2 )
43.32/43.42	
43.32/43.42	*******************************************************************************************
43.32/43.42	********************************    CHECKING ASSERTIONS    ********************************
43.32/43.42	*******************************************************************************************
43.32/43.42	
43.32/43.42	Proving termination of subgraph 0
43.32/43.42	Proving termination of subgraph 1
43.32/43.42	Checking unfeasibility...
43.32/43.42	Time used: 0.002486
43.32/43.42	
43.32/43.42	Checking conditional termination of SCC {l4}...
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.000837s
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.002210s
43.32/43.42	Trying to remove transition: <l4, l4, x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006959s
43.32/43.42	Time used: 0.00678
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001877s
43.32/43.42	Time used: 4.00073
43.32/43.42	Solving with 2 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.027274s
43.32/43.42	Time used: 4.02172
43.32/43.42	Solving with 3 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006440s
43.32/43.42	Time used: 1.0006
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013500s
43.32/43.42	Time used: 0.008378
43.32/43.42	Improving Solution with cost 1 ...
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetNextSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.010258s
43.32/43.42	Time used: 1.01013
43.32/43.42	
43.32/43.42	LOG: SAT solveNonLinear - Elapsed time: 1.023758s
43.32/43.42	Cost: 1; Total time: 1.01851
43.32/43.42	Termination implied by a set of invariant(s):
43.32/43.42	Invariant at l4: 0 <= 1 + retryCount_10^0
43.32/43.42	[ Invariant Graph ]
43.32/43.42	Strengthening and disabling transitions...
43.32/43.42	
43.32/43.42	LOG: CALL solverLinear in Graph for feasibility
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear in Graph for feasibility
43.32/43.42	Strengthening transition (result): 
43.32/43.42	<l4, l4, 0 <= 1 + retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	[ Termination Graph ]
43.32/43.42	Strengthening and disabling transitions...
43.32/43.42	
43.32/43.42	LOG: CALL solverLinear in Graph for feasibility
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear in Graph for feasibility
43.32/43.42	Strengthening transition (result): 
43.32/43.42	<l4, l4, 0 <= 1 + retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Quasi-ranking function: 50000 - retryCount_10^0
43.32/43.42	New Graphs: 
43.32/43.42	Transitions:
43.32/43.42	<l4, l4, 50001 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Variables:
43.32/43.42	retryCount_10^0, selected_11^0, x_5^0
43.32/43.42	Checking conditional termination of SCC {l4}...
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.000665s
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.002693s
43.32/43.42	Trying to remove transition: <l4, l4, 50001 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007191s
43.32/43.42	Time used: 0.007022
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002346s
43.32/43.42	Time used: 4.00114
43.32/43.42	Solving with 2 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006595s
43.32/43.42	Time used: 4.00162
43.32/43.42	Solving with 3 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006322s
43.32/43.42	Time used: 1.00045
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015520s
43.32/43.42	Time used: 0.010372
43.32/43.42	Improving Solution with cost 1 ...
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetNextSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001023s
43.32/43.42	Time used: 1.00091
43.32/43.42	
43.32/43.42	LOG: SAT solveNonLinear - Elapsed time: 1.016543s
43.32/43.42	Cost: 1; Total time: 1.01128
43.32/43.42	Quasi-ranking function: 50000 - retryCount_10^0 + x_5^0
43.32/43.42	New Graphs: 
43.32/43.42	Transitions:
43.32/43.42	<l4, l4, 50001 <= retryCount_10^0 /\ 50001 + x_5^0 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Variables:
43.32/43.42	retryCount_10^0, selected_11^0, x_5^0
43.32/43.42	Checking conditional termination of SCC {l4}...
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.000809s
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.003219s
43.32/43.42	Trying to remove transition: <l4, l4, 50001 <= retryCount_10^0 /\ 50001 + x_5^0 <= retryCount_10^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007893s
43.32/43.42	Time used: 0.007701
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002940s
43.32/43.42	Time used: 4.00167
43.32/43.42	Solving with 2 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007177s
43.32/43.42	Time used: 4.00101
43.32/43.42	Solving with 3 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006163s
43.32/43.42	Time used: 1.00074
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016403s
43.32/43.42	Time used: 0.01136
43.32/43.42	Improving Solution with cost 1 ...
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetNextSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001401s
43.32/43.42	Time used: 1.00125
43.32/43.42	
43.32/43.42	LOG: SAT solveNonLinear - Elapsed time: 1.017804s
43.32/43.42	Cost: 1; Total time: 1.01261
43.32/43.42	Quasi-ranking function: 50000 - retryCount_10^0 - x_5^0
43.32/43.42	New Graphs: 
43.32/43.42	Transitions:
43.32/43.42	<l4, l4, 50001 <= retryCount_10^0 /\ 50001 + x_5^0 <= retryCount_10^0 /\ 50001 <= retryCount_10^0 + x_5^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Variables:
43.32/43.42	retryCount_10^0, selected_11^0, x_5^0
43.32/43.42	Checking conditional termination of SCC {l4}...
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.000903s
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.003579s
43.32/43.42	Trying to remove transition: <l4, l4, 50001 <= retryCount_10^0 /\ 50001 + x_5^0 <= retryCount_10^0 /\ 50001 <= retryCount_10^0 + x_5^0 /\ x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008154s
43.32/43.42	Time used: 0.007945
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003208s
43.32/43.42	Time used: 4.00173
43.32/43.42	Solving with 2 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006312s
43.32/43.42	Time used: 4.00118
43.32/43.42	Solving with 3 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006157s
43.32/43.42	Time used: 1.00088
43.32/43.42	Solving with 1 template(s).
43.32/43.42	
43.32/43.42	LOG: CALL solveNonLinearGetFirstSolution
43.32/43.42	
43.32/43.42	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.028081s
43.32/43.42	Time used: 4.02251
43.32/43.42	Termination failed. Trying to show unreachability...
43.32/43.42	Proving unreachability of entry: <l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>
43.32/43.42	
43.32/43.42	LOG: CALL check - Post:1 <= 0 - Process 1
43.32/43.42	* Exit transition: <l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>
43.32/43.42	* Postcondition  : 1 <= 0
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.008513s
43.32/43.42	> Postcondition is not implied!
43.32/43.42	
43.32/43.42	LOG: RETURN check - Elapsed time: 0.008641s
43.32/43.42	Cannot prove unreachability
43.32/43.42	
43.32/43.42	Proving non-termination of subgraph 1
43.32/43.42	Transitions:
43.32/43.42	<l4, l4, x_5^0 = undef25 /\ undef25 = undef31, {retryCount_10^0 -> 1 + retryCount_10^0, selected_11^0 -> undef31, rest remain the same}>
43.32/43.42	Variables:
43.32/43.42	retryCount_10^0, selected_11^0, x_5^0
43.32/43.42	
43.32/43.42	Checking conditional non-termination of SCC {l4}...
43.32/43.42	> No exit transition to close.
43.32/43.42	Checking that every undef value has an assignment...
43.32/43.42	
43.32/43.42	LOG: CALL solveLinear
43.32/43.42	
43.32/43.42	LOG: RETURN solveLinear - Elapsed time: 0.002584s
43.32/43.42	Calling reachability with...
43.32/43.42	Transition: <l4, end, true, {all remain the same}>
43.32/43.42	Conditions: 
43.32/43.42	OPEN EXITS: 
43.32/43.42	<l4, end, true, {all remain the same}>
43.32/43.42	
43.32/43.42	--- Reachability graph ---
43.32/43.42	> Graph without transitions.
43.32/43.42	
43.32/43.42	Calling reachability with...
43.32/43.42	Transition: <l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>
43.32/43.42	Conditions: 
43.32/43.42	OPEN EXITS: 
43.32/43.42	<l0, l4, retryCount_10^0 = 0 /\ selected_11^0 = 0, {all remain the same}>
43.32/43.42	
43.32/43.42	> Conditions are reachable!
43.32/43.42	
43.32/43.42	Program does NOT terminate
43.32/43.42	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
43.32/43.42	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
43.32/43.42	EOF