0.00/0.19	YES
0.00/0.19	
0.00/0.19	Solver Timeout: 4
0.00/0.19	Global Timeout: 300
0.00/0.19	No parsing errors!
0.00/0.19	Init Location: 0
0.00/0.19	Transitions:
0.00/0.19	<l0, l9, true>
0.00/0.19	<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + undef7), x1^0 -> (1 + undef8)}>
0.00/0.19	<l3, l5, (undef14 = (0 + x1^0)) /\ (undef15 = undef15), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> undef14, oldX2^0 -> undef15, x0^0 -> (0 + undef14), x1^0 -> (0 + undef15)}>
0.00/0.19	<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef19) <= (0 + undef20)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
0.00/0.19	<l4, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((1 + undef26) <= (0 + undef25)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.19	<l6, l4, (undef31 = (0 + x0^0)), par{oldX0^0 -> undef31, oldX1^0 -> (0 + x1^0), x0^0 -> (0 + undef31), x1^0 -> 0}>
0.00/0.19	<l5, l6, (undef37 = (0 + x0^0)) /\ (undef39 = undef39), par{oldX0^0 -> undef37, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, x0^0 -> (0 + undef37), x1^0 -> (0 + undef39)}>
0.00/0.19	<l7, l8, (undef45 = undef45) /\ (undef46 = undef46), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, oldX3^0 -> undef46, x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
0.00/0.19	<l7, l8, true>
0.00/0.19	<l7, l2, true>
0.00/0.19	<l7, l1, true>
0.00/0.19	<l7, l3, true>
0.00/0.19	<l7, l4, true>
0.00/0.19	<l7, l6, true>
0.00/0.19	<l7, l5, true>
0.00/0.19	<l9, l7, true>
0.00/0.19	
0.00/0.19	Fresh variables:
0.00/0.19	undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 
0.00/0.19	
0.00/0.19	Undef variables:
0.00/0.19	undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 
0.00/0.19	
0.00/0.19	Abstraction variables:
0.00/0.19	
0.00/0.19	Exit nodes:
0.00/0.19	
0.00/0.19	Accepting locations:
0.00/0.19	
0.00/0.19	Asserts:
0.00/0.19	
0.00/0.19	Preprocessed LLVMGraph
0.00/0.19	Init Location: 0
0.00/0.19	Transitions:
0.00/0.19	<l0, l8, (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
0.00/0.19	<l0, l8, true>
0.00/0.19	<l0, l2, true>
0.00/0.19	<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l0, l3, true>
0.00/0.19	<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l0, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((1 + undef26) <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.19	<l0, l2, (undef31 = (0 + x0^0)) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l0, l3, (undef31 = (0 + x0^0)) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + 0)) /\ ((1 + undef26) <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.19	<l0, l2, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l0, l3, (undef37 = (0 + x0^0)) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + 0)) /\ ((1 + undef26) <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.19	<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + undef7))) /\ (undef20 = (0 + (1 + undef8))) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef25 = (0 + (0 + undef7))) /\ (undef26 = (0 + (1 + undef8))) /\ ((1 + undef26) <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.19	<l3, l2, (undef14 = (0 + x1^0)) /\ (undef15 = undef15) /\ (undef37 = (0 + (0 + undef14))) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef19 = (0 + (0 + undef31))) /\ (undef20 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.19	<l3, l3, (undef14 = (0 + x1^0)) /\ (undef15 = undef15) /\ (undef37 = (0 + (0 + undef14))) /\ (undef39 = undef39) /\ (undef31 = (0 + (0 + undef37))) /\ (undef25 = (0 + (0 + undef31))) /\ (undef26 = (0 + 0)) /\ ((1 + undef26) <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
0.00/0.19	
0.00/0.19	Fresh variables:
0.00/0.19	undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 
0.00/0.19	
0.00/0.19	Undef variables:
0.00/0.19	undef3, undef4, undef7, undef8, undef14, undef15, undef19, undef20, undef25, undef26, undef31, undef37, undef39, undef45, undef46, 
0.00/0.19	
0.00/0.19	Abstraction variables:
0.00/0.19	
0.00/0.19	Exit nodes:
0.00/0.19	
0.00/0.19	Accepting locations:
0.00/0.19	
0.00/0.19	Asserts:
0.00/0.19	
0.00/0.19	*************************************************************
0.00/0.19	*******************************************************************************************
0.00/0.19	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.19	*******************************************************************************************
0.00/0.19	
0.00/0.19	Init Location: 0
0.00/0.19	Graph 0:
0.00/0.19	Transitions:
0.00/0.19	Variables:
0.00/0.19	
0.00/0.19	Graph 1:
0.00/0.19	Transitions:
0.00/0.19	<l3, l3, 1 + undef26 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	<l3, l3, 1 + undef26 <= undef25 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef26 = 0 /\ undef31 = undef37, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	Variables:
0.00/0.19	x0^0, x1^0
0.00/0.19	
0.00/0.19	Graph 2:
0.00/0.19	Transitions:
0.00/0.19	Variables:
0.00/0.19	
0.00/0.19	Graph 3:
0.00/0.19	Transitions:
0.00/0.19	Variables:
0.00/0.19	
0.00/0.19	Precedence: 
0.00/0.19	Graph 0
0.00/0.19	
0.00/0.19	Graph 1
0.00/0.19	<l0, l3, true, {all remain the same}>
0.00/0.19	<l0, l3, 1 + undef26 <= undef25 /\ x0^0 = undef25 /\ x1^0 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	<l0, l3, 1 + undef26 <= undef25 /\ x0^0 = undef31 /\ undef25 = undef31 /\ undef26 = 0, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	<l0, l3, 1 + undef26 <= undef25 /\ x0^0 = undef37 /\ undef25 = undef31 /\ undef26 = 0 /\ undef31 = undef37, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	
0.00/0.19	Graph 2
0.00/0.19	<l0, l2, true, {all remain the same}>
0.00/0.19	<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.19	<l0, l2, undef19 <= undef20 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.19	<l0, l2, undef19 <= undef20 /\ x0^0 = undef31 /\ undef19 = undef31 /\ undef20 = 0, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.19	<l0, l2, undef19 <= undef20 /\ x0^0 = undef37 /\ undef19 = undef31 /\ undef20 = 0 /\ undef31 = undef37, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.19	<l3, l2, undef19 <= undef20 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef19 /\ 1 + undef8 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.19	<l3, l2, undef19 <= undef20 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef19 = undef31 /\ undef20 = 0 /\ undef31 = undef37, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.19	
0.00/0.19	Graph 3
0.00/0.19	<l0, l8, true, {x0^0 -> undef45, x1^0 -> undef46, rest remain the same}>
0.00/0.19	<l0, l8, true, {all remain the same}>
0.00/0.19	
0.00/0.19	Map Locations to Subgraph:
0.00/0.19	( 0 , 0 )
0.00/0.19	( 2 , 2 )
0.00/0.19	( 3 , 1 )
0.00/0.19	( 8 , 3 )
0.00/0.19	
0.00/0.19	*******************************************************************************************
0.00/0.19	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.19	*******************************************************************************************
0.00/0.19	
0.00/0.19	Proving termination of subgraph 0
0.00/0.19	Proving termination of subgraph 1
0.00/0.19	Checking unfeasibility...
0.00/0.19	Time used: 0.004832
0.00/0.19	
0.00/0.19	Checking conditional termination of SCC {l3}...
0.00/0.19	
0.00/0.19	LOG: CALL solveLinear
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear - Elapsed time: 0.001608s
0.00/0.19	
0.00/0.19	LOG: CALL solveLinear
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear - Elapsed time: 0.013250s
0.00/0.19	Trying to remove transition: <l3, l3, 1 + undef26 <= undef25 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef26 = 0 /\ undef31 = undef37, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	Solving with 1 template(s).
0.00/0.19	
0.00/0.19	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.19	
0.00/0.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012627s
0.00/0.19	Time used: 0.011943
0.00/0.19	Trying to remove transition: <l3, l3, 1 + undef26 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	Solving with 1 template(s).
0.00/0.19	
0.00/0.19	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.19	
0.00/0.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011252s
0.00/0.19	Time used: 0.010602
0.00/0.19	Solving with 1 template(s).
0.00/0.19	
0.00/0.19	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.19	
0.00/0.19	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022546s
0.00/0.19	Time used: 0.021619
0.00/0.19	Improving Solution with cost 1 ...
0.00/0.19	
0.00/0.19	LOG: CALL solveNonLinearGetNextSolution
0.00/0.19	
0.00/0.19	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.054891s
0.00/0.19	Time used: 0.054879
0.00/0.19	
0.00/0.19	LOG: SAT solveNonLinear - Elapsed time: 0.077437s
0.00/0.19	Cost: 1; Total time: 0.076498
0.00/0.19	Failed at location 3: 1 + x1^0 <= x0^0
0.00/0.19	Before Improving: 
0.00/0.19	Quasi-invariant at l3: 1 + x1^0 <= x0^0
0.00/0.19	Optimizing invariants...
0.00/0.19	
0.00/0.19	LOG: CALL solveLinear
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear - Elapsed time: 0.008674s
0.00/0.19	Remaining time after improvement: 0.995714
0.00/0.19	Termination implied by a set of quasi-invariant(s):
0.00/0.19	Quasi-invariant at l3: 1 + x1^0 <= x0^0
0.00/0.19	[ Invariant Graph ]
0.00/0.19	Strengthening and disabling transitions...
0.00/0.19	
0.00/0.19	LOG: CALL solverLinear in Graph for feasibility
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.19	Strengthening transition (result): 
0.00/0.19	<l3, l3, 1 + x1^0 <= x0^0 /\ 1 + undef26 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	
0.00/0.19	LOG: CALL solverLinear in Graph for feasibility
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.19	Strengthening transition (result): 
0.00/0.19	<l3, l3, 1 + x1^0 <= x0^0 /\ 1 + undef26 <= undef25 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef26 = 0 /\ undef31 = undef37, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	[ Termination Graph ]
0.00/0.19	Strengthening and disabling transitions...
0.00/0.19	
0.00/0.19	LOG: CALL solverLinear in Graph for feasibility
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.19	Strengthening transition (result): 
0.00/0.19	<l3, l3, 1 + x1^0 <= x0^0 /\ 1 + undef26 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	
0.00/0.19	LOG: CALL solverLinear in Graph for feasibility
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.19	Strengthening transition (result): 
0.00/0.19	<l3, l3, 1 + x1^0 <= x0^0 /\ 1 + undef26 <= undef25 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef26 = 0 /\ undef31 = undef37, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	Ranking function: x0^0
0.00/0.19	New Graphs: 
0.00/0.19	Transitions:
0.00/0.19	<l3, l3, 1 + x1^0 <= x0^0 /\ 1 + undef26 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	Variables:
0.00/0.19	x0^0, x1^0
0.00/0.19	Checking conditional termination of SCC {l3}...
0.00/0.19	
0.00/0.19	LOG: CALL solveLinear
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear - Elapsed time: 0.001217s
0.00/0.19	Ranking function: -1 + x0^0 - x1^0
0.00/0.19	New Graphs: 
0.00/0.19	Calling Safety with literal 1 + x1^0 <= x0^0 and entry <l0, l3, true, {all remain the same}>
0.00/0.19	
0.00/0.19	LOG: CALL check - Post:1 + x1^0 <= x0^0 - Process 1
0.00/0.19	* Exit transition: <l0, l3, true, {all remain the same}>
0.00/0.19	* Postcondition  : 1 + x1^0 <= x0^0
0.00/0.19	
0.00/0.19	LOG: CALL solveLinear
0.00/0.19	
0.00/0.19	LOG: RETURN solveLinear - Elapsed time: 0.000458s
0.00/0.19	> Postcondition is not implied!
0.00/0.19	
0.00/0.19	LOG: RETURN check - Elapsed time: 0.000542s
0.00/0.19	INVARIANTS: 
0.00/0.19	3: 
0.00/0.19	Quasi-INVARIANTS to narrow Graph: 
0.00/0.19	3: 1 + x1^0 <= x0^0 , 
0.00/0.19	It's unfeasible. Removing transition: 
0.00/0.19	<l3, l3, 1 + undef26 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	It's unfeasible. Removing transition: 
0.00/0.19	<l3, l3, 1 + undef26 <= undef25 /\ x1^0 = undef14 /\ undef14 = undef37 /\ undef25 = undef31 /\ undef26 = 0 /\ undef31 = undef37, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
0.00/0.19	invGraph after Narrowing: 
0.00/0.19	Transitions:
0.00/0.19	Variables:
0.00/0.19	x0^0, x1^0
0.00/0.19	Analyzing SCC {l3}...
0.00/0.19	No cycles found.
0.00/0.19	
0.00/0.19	Proving termination of subgraph 2
0.00/0.19	Analyzing SCC {l2}...
0.00/0.19	No cycles found.
0.00/0.19	
0.00/0.19	Proving termination of subgraph 3
0.00/0.19	Analyzing SCC {l8}...
0.00/0.19	No cycles found.
0.00/0.19	
0.00/0.19	Program Terminates
0.00/0.19	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.19	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.19	EOF