52.30/52.77	NO
52.30/52.77	
52.30/52.77	Solver Timeout: 4
52.30/52.77	Global Timeout: 300
52.30/52.77	No parsing errors!
52.30/52.77	Init Location: 0
52.30/52.77	Transitions:
52.30/52.77	<l0, l5, true>
52.30/52.77	<l1, l2, true, par{arg1 -> 0, arg2 -> undef2}>
52.30/52.77	<l2, l2, (arg1 < 50) /\ (arg1 > 9) /\ (arg1 < 100), par{arg1 -> (arg1 + 1), arg2 -> undef4}>
52.30/52.77	<l3, l3, true, par{arg2 -> undef6}>
52.30/52.77	<l2, l3, (arg1 < 100) /\ (arg1 > 49), par{arg2 -> undef8}>
52.30/52.77	<l2, l4, (arg1 < 10) /\ (arg1 < 100), par{arg2 -> 0}>
52.30/52.77	<l4, l4, (arg2 < 15), par{arg2 -> (arg2 + 1)}>
52.30/52.77	<l4, l2, (arg2 > 14), par{arg1 -> (arg1 + 1), arg2 -> undef14}>
52.30/52.77	<l5, l1, true, par{arg1 -> undef15, arg2 -> undef16}>
52.30/52.77	
52.30/52.77	Fresh variables:
52.30/52.77	undef2, undef4, undef6, undef8, undef14, undef15, undef16, 
52.30/52.77	
52.30/52.77	Undef variables:
52.30/52.77	undef2, undef4, undef6, undef8, undef14, undef15, undef16, 
52.30/52.77	
52.30/52.77	Abstraction variables:
52.30/52.77	
52.30/52.77	Exit nodes:
52.30/52.77	
52.30/52.77	Accepting locations:
52.30/52.77	
52.30/52.77	Asserts:
52.30/52.77	
52.30/52.77	Preprocessed LLVMGraph
52.30/52.77	Init Location: 0
52.30/52.77	Transitions:
52.30/52.77	<l0, l2, (arg1 = 0) /\ (arg2 = undef2)>
52.30/52.77	<l2, l2, (arg1 < 50) /\ (arg1 > 9) /\ (arg1 < 100), par{arg1 -> (arg1 + 1), arg2 -> undef4}>
52.30/52.77	<l2, l3, (arg1 < 100) /\ (arg1 > 49), par{arg2 -> undef8}>
52.30/52.77	<l2, l4, (arg1 < 10) /\ (arg1 < 100), par{arg2 -> 0}>
52.30/52.77	<l3, l3, true, par{arg2 -> undef6}>
52.30/52.77	<l4, l4, (arg2 < 15), par{arg2 -> (arg2 + 1)}>
52.30/52.77	<l4, l2, (arg2 > 14), par{arg1 -> (arg1 + 1), arg2 -> undef14}>
52.30/52.77	
52.30/52.77	Fresh variables:
52.30/52.77	undef2, undef4, undef6, undef8, undef14, undef15, undef16, 
52.30/52.77	
52.30/52.77	Undef variables:
52.30/52.77	undef2, undef4, undef6, undef8, undef14, undef15, undef16, 
52.30/52.77	
52.30/52.77	Abstraction variables:
52.30/52.77	
52.30/52.77	Exit nodes:
52.30/52.77	
52.30/52.77	Accepting locations:
52.30/52.77	
52.30/52.77	Asserts:
52.30/52.77	
52.30/52.77	*************************************************************
52.30/52.77	*******************************************************************************************
52.30/52.77	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
52.30/52.77	*******************************************************************************************
52.30/52.77	
52.30/52.77	Init Location: 0
52.30/52.77	Graph 0:
52.30/52.77	Transitions:
52.30/52.77	Variables:
52.30/52.77	
52.30/52.77	Graph 1:
52.30/52.77	Transitions:
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	<l4, l4, arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	
52.30/52.77	Graph 2:
52.30/52.77	Transitions:
52.30/52.77	<l3, l3, true, {arg2 -> undef6, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg2
52.30/52.77	
52.30/52.77	Precedence: 
52.30/52.77	Graph 0
52.30/52.77	
52.30/52.77	Graph 1
52.30/52.77	<l0, l2, arg1 = 0 /\ arg2 = undef2, {all remain the same}>
52.30/52.77	
52.30/52.77	Graph 2
52.30/52.77	<l2, l3, 50 <= arg1 /\ arg1 <= 99, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	Map Locations to Subgraph:
52.30/52.77	( 0 , 0 )
52.30/52.77	( 2 , 1 )
52.30/52.77	( 3 , 2 )
52.30/52.77	( 4 , 1 )
52.30/52.77	
52.30/52.77	*******************************************************************************************
52.30/52.77	********************************    CHECKING ASSERTIONS    ********************************
52.30/52.77	*******************************************************************************************
52.30/52.77	
52.30/52.77	Proving termination of subgraph 0
52.30/52.77	Proving termination of subgraph 1
52.30/52.77	Checking unfeasibility...
52.30/52.77	Time used: 0.329316
52.30/52.77	
52.30/52.77	Checking conditional termination of SCC {l2, l4}...
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.004180s
52.30/52.77	Ranking function: 49 - arg1
52.30/52.77	New Graphs: 
52.30/52.77	Transitions:
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	<l4, l4, arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking conditional termination of SCC {l2, l4}...
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.001047s
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.004814s
52.30/52.77	Trying to remove transition: <l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011443s
52.30/52.77	Time used: 0.011265
52.30/52.77	Trying to remove transition: <l4, l4, arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021892s
52.30/52.77	Time used: 0.021255
52.30/52.77	Trying to remove transition: <l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008259s
52.30/52.77	Time used: 0.007179
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.072534s
52.30/52.77	Time used: 0.071993
52.30/52.77	
52.30/52.77	LOG: SAT solveNonLinear - Elapsed time: 0.072534s
52.30/52.77	Cost: 0; Total time: 0.071993
52.30/52.77	Termination implied by a set of invariant(s):
52.30/52.77	Invariant at l4: arg1 <= 9
52.30/52.77	[ Invariant Graph ]
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l4, arg1 <= 9 /\ arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l2, 15 <= arg2 /\ arg1 <= 9, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	[ Termination Graph ]
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l4, arg1 <= 9 /\ arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l2, 15 <= arg2 /\ arg1 <= 9, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	Ranking function: 9 - arg1
52.30/52.77	New Graphs: 
52.30/52.77	Transitions:
52.30/52.77	<l4, l4, arg1 <= 9 /\ arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking conditional termination of SCC {l4}...
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.000782s
52.30/52.77	Ranking function: 14 - arg2
52.30/52.77	New Graphs: 
52.30/52.77	INVARIANTS: 
52.30/52.77	4: arg1 <= 9 , 
52.30/52.77	Quasi-INVARIANTS to narrow Graph: 
52.30/52.77	4: 
52.30/52.77	Proving termination of subgraph 2
52.30/52.77	Checking unfeasibility...
52.30/52.77	Time used: 0.00138
52.30/52.77	
52.30/52.77	Checking conditional termination of SCC {l3}...
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.000494s
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.001164s
52.30/52.77	Trying to remove transition: <l3, l3, true, {arg2 -> undef6, rest remain the same}>
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002781s
52.30/52.77	Time used: 0.002676
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003750s
52.30/52.77	Time used: 0.003582
52.30/52.77	Solving with 2 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004407s
52.30/52.77	Time used: 4.00354
52.30/52.77	Solving with 3 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.038335s
52.30/52.77	Time used: 1.00063
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007335s
52.30/52.77	Time used: 0.004219
52.30/52.77	Termination failed. Trying to show unreachability...
52.30/52.77	Proving unreachability of entry: <l2, l3, 50 <= arg1 /\ arg1 <= 99, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL check - Post:1 <= 0 - Process 1
52.30/52.77	* Exit transition: <l2, l3, 50 <= arg1 /\ arg1 <= 99, {arg2 -> undef8, rest remain the same}>
52.30/52.77	* Postcondition  : 1 <= 0
52.30/52.77	Postcodition moved up: 1 <= 0
52.30/52.77	
52.30/52.77	LOG: Try proving POST
52.30/52.77	Postcondition: 1 <= 0
52.30/52.77	
52.30/52.77	LOG: CALL check - Post:1 <= 0 - Process 2
52.30/52.77	* Exit transition: <l0, l2, arg1 = 0 /\ arg2 = undef2, {all remain the same}>
52.30/52.77	* Postcondition  : 1 <= 0
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.000540s
52.30/52.77	> Postcondition is not implied!
52.30/52.77	
52.30/52.77	LOG: RETURN check - Elapsed time: 0.000623s
52.30/52.77	
52.30/52.77	LOG: NarrowEntry size 1
52.30/52.77	Narrowing transition: 
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: Narrow transition size 1
52.30/52.77	Narrowing transition: 
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: Narrow transition size 1
52.30/52.77	Narrowing transition: 
52.30/52.77	<l4, l4, arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: Narrow transition size 1
52.30/52.77	Narrowing transition: 
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: Narrow transition size 1
52.30/52.77	ENTRIES:
52.30/52.77	<l0, l2, 0 <= 0 /\ arg1 = 0 /\ arg2 = undef2, {all remain the same}>
52.30/52.77	END ENTRIES:
52.30/52.77	GRAPH:
52.30/52.77	<l2, l2, 0 <= 0 /\ 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	<l2, l4, 0 <= 0 /\ arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	<l4, l4, 0 <= 0 /\ arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	<l4, l2, 0 <= 0 /\ 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	END GRAPH:
52.30/52.77	EXIT: <l2, l3, 50 <= arg1 /\ arg1 <= 99, {arg2 -> undef8, rest remain the same}>
52.30/52.77	POST: 1 <= 0
52.30/52.77	
52.30/52.77	
52.30/52.77	LOG: Try proving POST
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.665441s
52.30/52.77	Time used: 0.665298
52.30/52.77	Solving with 2 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005709s
52.30/52.77	Time used: 4.00083
52.30/52.77	Solving with 3 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.021180s
52.30/52.77	Time used: 1.0014
52.30/52.77	
52.30/52.77	LOG: Postcondition is not implied - no solution
52.30/52.77	> Postcondition is not implied!
52.30/52.77	
52.30/52.77	LOG: RETURN check - Elapsed time: 5.710716s
52.30/52.77	Cannot prove unreachability
52.30/52.77	
52.30/52.77	Proving non-termination of subgraph 2
52.30/52.77	Transitions:
52.30/52.77	<l3, l3, true, {arg2 -> undef6, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg2
52.30/52.77	
52.30/52.77	Checking conditional non-termination of SCC {l3}...
52.30/52.77	> No exit transition to close.
52.30/52.77	Calling reachability with...
52.30/52.77	Transition: <l3, end, true, {all remain the same}>
52.30/52.77	Conditions: 
52.30/52.77	OPEN EXITS: 
52.30/52.77	<l3, end, true, {all remain the same}>
52.30/52.77	
52.30/52.77	--- Reachability graph ---
52.30/52.77	> Graph without transitions.
52.30/52.77	
52.30/52.77	Calling reachability with...
52.30/52.77	Transition: <l2, l3, 50 <= arg1 /\ arg1 <= 99, {arg2 -> undef8, rest remain the same}>
52.30/52.77	Conditions: 
52.30/52.77	OPEN EXITS: 
52.30/52.77	<l2, l3, 50 <= arg1 /\ arg1 <= 99, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	--- Reachability graph ---
52.30/52.77	> Graph without transitions.
52.30/52.77	
52.30/52.77	Calling reachability with...
52.30/52.77	Transition: <l0, l2, arg1 = 0 /\ arg2 = undef2, {all remain the same}>
52.30/52.77	Conditions: 50 <= arg1, arg1 <= 99, 
52.30/52.77	OPEN EXITS: 
52.30/52.77	
52.30/52.77	> Conditions are not feasible after transitions.
52.30/52.77	--- Reachability graph ---
52.30/52.77	Transitions:
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking edge-closing of SCC {l2}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 100 <= arg1, {all remain the same}>
52.30/52.77	<l2, end, arg1 <= 9, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031253s
52.30/52.77	Time used: 0.031004
52.30/52.77	Improving Solution with cost 1 ...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetNextSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020411s
52.30/52.77	Time used: 0.020404
52.30/52.77	
52.30/52.77	LOG: SAT solveNonLinear - Elapsed time: 0.051664s
52.30/52.77	Cost: 1; Total time: 0.051408
52.30/52.77	Minimizing number of undef constraints...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinear - Elapsed time: 0.008302s
52.30/52.77	Number of undef constraints reduced!
52.30/52.77	
52.30/52.77	Edge-closing implied by a set of quasi-invariant(s):
52.30/52.77	Quasi-invariant at l2: arg1 <= 50
52.30/52.77	
52.30/52.77	Strengthening and disabling EXIT transitions...
52.30/52.77	EXIT TRANSITIONS TO BE CLOSED:
52.30/52.77	Closed exits from l2: 1
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, end, arg1 <= 9, {all remain the same}>
52.30/52.77	EXIT TRANSITIONS TO KEEP OPEN:
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, l3, arg1 = 50, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	
52.30/52.77	Checking edge-closing of SCC {l2}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, arg1 <= 9, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006917s
52.30/52.77	Time used: 0.006816
52.30/52.77	Solving with 2 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.006959s
52.30/52.77	Time used: 5.00219
52.30/52.77	Solving with 3 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.019665s
52.30/52.77	Time used: 5.00302
52.30/52.77	> No quasi-invariants that block all exits have been found.
52.30/52.77	--- Reachability graph ---
52.30/52.77	Transitions:
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 100 <= arg1, {all remain the same}>
52.30/52.77	<l2, end, 10 <= arg1 /\ arg1 <= 49, {all remain the same}>
52.30/52.77	<l4, end, arg2 <= 14, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060260s
52.30/52.77	Time used: 0.059924
52.30/52.77	Improving Solution with cost 3 ...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetNextSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046337s
52.30/52.77	Time used: 0.046247
52.30/52.77	
52.30/52.77	LOG: SAT solveNonLinear - Elapsed time: 0.106597s
52.30/52.77	Cost: 3; Total time: 0.106171
52.30/52.77	Minimizing number of undef constraints...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinear - Elapsed time: 0.011591s
52.30/52.77	Number of undef constraints reduced!
52.30/52.77	
52.30/52.77	Edge-closing implied by a set of quasi-invariant(s):
52.30/52.77	Quasi-invariant at l2: arg1 <= 50
52.30/52.77	Quasi-invariant at l4: arg1 + arg2 <= 15
52.30/52.77	
52.30/52.77	Strengthening and disabling EXIT transitions...
52.30/52.77	EXIT TRANSITIONS TO BE CLOSED:
52.30/52.77	Closed exits from l2: 1
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, end, 10 <= arg1 /\ arg1 <= 49, {all remain the same}>
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l4, end, arg2 <= 14 /\ arg1 + arg2 <= 15, {all remain the same}>
52.30/52.77	EXIT TRANSITIONS TO KEEP OPEN:
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, l3, arg1 = 50, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l2, 15 <= arg2 /\ arg1 + arg2 <= 15, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 10 <= arg1 /\ arg1 <= 49, {all remain the same}>
52.30/52.77	<l4, end, arg2 <= 14 /\ arg1 + arg2 <= 15, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037932s
52.30/52.77	Time used: 0.037741
52.30/52.77	Solving with 2 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.009693s
52.30/52.77	Time used: 5.00089
52.30/52.77	Solving with 3 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.015318s
52.30/52.77	Time used: 5.00119
52.30/52.77	> No quasi-invariants that block all exits have been found.
52.30/52.77	--- Reachability graph ---
52.30/52.77	Transitions:
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 100 <= arg1, {all remain the same}>
52.30/52.77	<l4, end, arg2 <= 14, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.085895s
52.30/52.77	Time used: 0.085509
52.30/52.77	Improving Solution with cost 1 ...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetNextSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.127413s
52.30/52.77	Time used: 0.127211
52.30/52.77	
52.30/52.77	LOG: SAT solveNonLinear - Elapsed time: 0.213308s
52.30/52.77	Cost: 1; Total time: 0.21272
52.30/52.77	Minimizing number of undef constraints...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinear - Elapsed time: 0.018078s
52.30/52.77	Number of undef constraints reduced!
52.30/52.77	
52.30/52.77	Edge-closing implied by a set of quasi-invariant(s):
52.30/52.77	Quasi-invariant at l2: arg1 <= 50
52.30/52.77	Quasi-invariant at l4: arg1 <= 9
52.30/52.77	
52.30/52.77	Strengthening and disabling EXIT transitions...
52.30/52.77	EXIT TRANSITIONS TO BE CLOSED:
52.30/52.77	Closed exits from l2: 1
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l4, end, arg1 <= 9 /\ arg2 <= 14, {all remain the same}>
52.30/52.77	EXIT TRANSITIONS TO KEEP OPEN:
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, l3, arg1 = 50, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l2, 15 <= arg2 /\ arg1 <= 9, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l4, end, arg1 <= 9 /\ arg2 <= 14, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025916s
52.30/52.77	Time used: 0.025814
52.30/52.77	Solving with 2 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.006078s
52.30/52.77	Time used: 5.001
52.30/52.77	Solving with 3 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.019357s
52.30/52.77	Time used: 5.00159
52.30/52.77	> No quasi-invariants that block all exits have been found.
52.30/52.77	--- Reachability graph ---
52.30/52.77	Transitions:
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	<l4, l4, arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 100 <= arg1, {all remain the same}>
52.30/52.77	<l2, end, 10 <= arg1 /\ arg1 <= 49, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078207s
52.30/52.77	Time used: 0.077774
52.30/52.77	Improving Solution with cost 1 ...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetNextSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044608s
52.30/52.77	Time used: 0.04453
52.30/52.77	
52.30/52.77	LOG: SAT solveNonLinear - Elapsed time: 0.122815s
52.30/52.77	Cost: 1; Total time: 0.122304
52.30/52.77	Minimizing number of undef constraints...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinear - Elapsed time: 0.013507s
52.30/52.77	Number of undef constraints reduced!
52.30/52.77	
52.30/52.77	Edge-closing implied by a set of quasi-invariant(s):
52.30/52.77	Quasi-invariant at l2: arg1 <= 50
52.30/52.77	Quasi-invariant at l4: arg1 <= 14
52.30/52.77	
52.30/52.77	Strengthening and disabling EXIT transitions...
52.30/52.77	EXIT TRANSITIONS TO BE CLOSED:
52.30/52.77	Closed exits from l2: 1
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, end, 10 <= arg1 /\ arg1 <= 49, {all remain the same}>
52.30/52.77	EXIT TRANSITIONS TO KEEP OPEN:
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, l3, arg1 = 50, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l2, 15 <= arg2 /\ arg1 <= 14, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l4, arg1 <= 14 /\ arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 10 <= arg1 /\ arg1 <= 49, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032920s
52.30/52.77	Time used: 0.032733
52.30/52.77	Solving with 2 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.008338s
52.30/52.77	Time used: 5.00198
52.30/52.77	Solving with 3 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.016306s
52.30/52.77	Time used: 5.00117
52.30/52.77	> No quasi-invariants that block all exits have been found.
52.30/52.77	--- Reachability graph ---
52.30/52.77	Transitions:
52.30/52.77	<l4, l2, 15 <= arg2, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	<l4, l4, arg2 <= 14, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking edge-closing of SCC {l2, l4}...
52.30/52.77	EXIT TRANSITIONS (TO CLOSE):
52.30/52.77	<l2, end, 100 <= arg1, {all remain the same}>
52.30/52.77	
52.30/52.77	Solving with 1 template(s).
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinearGetFirstSolution
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.094667s
52.30/52.77	Time used: 0.094465
52.30/52.77	
52.30/52.77	LOG: SAT solveNonLinear - Elapsed time: 0.094667s
52.30/52.77	Cost: 0; Total time: 0.094465
52.30/52.77	Minimizing number of undef constraints...
52.30/52.77	
52.30/52.77	LOG: CALL solveNonLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveNonLinear - Elapsed time: 0.011076s
52.30/52.77	Number of undef constraints reduced!
52.30/52.77	
52.30/52.77	Edge-closing implied by a set of quasi-invariant(s):
52.30/52.77	Quasi-invariant at l2: arg1 <= 50
52.30/52.77	Quasi-invariant at l4: arg1 <= 15
52.30/52.77	
52.30/52.77	Strengthening and disabling EXIT transitions...
52.30/52.77	EXIT TRANSITIONS TO BE CLOSED:
52.30/52.77	Closed exits from l2: 1
52.30/52.77	EXIT TRANSITIONS TO KEEP OPEN:
52.30/52.77	Strengthening exit transition (result): 
52.30/52.77	<l2, l3, arg1 = 50, {arg2 -> undef8, rest remain the same}>
52.30/52.77	
52.30/52.77	Strengthening and disabling transitions...
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l2, 15 <= arg2 /\ arg1 <= 15, {arg1 -> 1 + arg1, arg2 -> undef14, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l4, l4, arg2 <= 14 /\ arg1 <= 15, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l4, arg1 <= 9, {arg2 -> 0, rest remain the same}>
52.30/52.77	
52.30/52.77	LOG: CALL solverLinear in Graph for feasibility
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear in Graph for feasibility
52.30/52.77	Strengthening transition (result): 
52.30/52.77	<l2, l2, 10 <= arg1 /\ arg1 <= 49, {arg1 -> 1 + arg1, arg2 -> undef4, rest remain the same}>
52.30/52.77	
52.30/52.77	Checking conditional termination of SCC {l2, l4}...
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.002740s
52.30/52.77	Ranking function: 49 - arg1
52.30/52.77	New Graphs: 
52.30/52.77	Transitions:
52.30/52.77	<l4, l4, arg2 <= 14 /\ arg1 <= 15, {arg2 -> 1 + arg2, rest remain the same}>
52.30/52.77	Variables:
52.30/52.77	arg1, arg2
52.30/52.77	Checking conditional termination of SCC {l4}...
52.30/52.77	
52.30/52.77	LOG: CALL solveLinear
52.30/52.77	
52.30/52.77	LOG: RETURN solveLinear - Elapsed time: 0.001342s
52.30/52.77	Ranking function: 14 - arg2
52.30/52.77	New Graphs: 
52.30/52.77	Calling reachability with...
52.30/52.77	Transition: <l0, l2, arg1 = 0 /\ arg2 = undef2, {all remain the same}>
52.30/52.77	Conditions: arg1 <= 50, 
52.30/52.77	OPEN EXITS: 
52.30/52.77	<l0, l2, arg1 = 0 /\ arg2 = undef2, {all remain the same}>
52.30/52.77	
52.30/52.77	> Conditions are reachable!
52.30/52.77	
52.30/52.77	Program does NOT terminate
52.30/52.77	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
52.30/52.77	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
52.30/52.77	EOF